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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Color matching by using tuple matching


    Contributors:


    Publication date :

    2003-01-01


    Size :

    3409430 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Color Matching by Using Tuple Matching

    Balthasar, D. / IEEE | British Library Conference Proceedings | 2003


    Color Pattern Matching

    Kwon, Kye‐Si ;Ready, Steven | Wiley | 2014


    DEADFRONT CONFIGURED FOR COLOR MATCHING

    LESUFFLEUR ANTOINE D / OUYANG XU / SUN YAWEI | European Patent Office | 2021

    Free access

    DEADFRONT CONFIGURED FOR COLOR MATCHING

    LESUFFLEUR ANTOINE D / OUYANG XU / SUN YAWEI | European Patent Office | 2020

    Free access

    DEADFRONT CONFIGURED FOR COLOR MATCHING

    LESUFFLEUR ANTOINE DANIEL / OUYANG XU / SUN YAWEI | European Patent Office | 2021

    Free access