Color matching by using tuple matching

In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like color, shape, and texture we focus on signatures that are generated from color histograms by using Graph Theoretical Clustering (GT-Clustering) in this paper. In contrast to Histogram Intersection [10] (HI) or similar approaches TM defines a similarity measurement with a many to many mapping between tuples in an arbitrary neighborhood in spite of using a one to one mapping between bins as defined by HI. As a result TM is more robust than HI when the illumination is changing. In opposite to Earth Mover’s Distance [11] (EMD) similarity between signatures is not calculated by using a solution of the transportation problem. Thus the performance of TM is better than EMD.

• Type: Conference
• Year: 2003
• Where: ICIAP
• Authors: Dirk Balthasar
• Keywords: Graph Theoretical Clustering, ICIAP 2003, Image Processing, Signatures, Similar Approaches Tm