By Topic

Color matching by using tuple matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Balthasar, D. ; Inst. fur Computervisualistik, Univ. Koblenz-Landau, Koblenz, Germany

We present a new matching method called tuple matching (TM), which is an algorithm for matching image 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 contrast to histogram intersection (HI) (Swain, M.J. and Ballard, D.H, 1991) 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 contrast to earth mover's distance (EMD) (Rubner, L.J.G.Y. and Tomasi, C., 1998), similarity between signatures is not calculated by using a solution of the transportation problem. Thus the performance of TM is better than EMD.

Published in:

Image Analysis and Processing, 2003.Proceedings. 12th International Conference on

Date of Conference:

17-19 Sept. 2003