Topological representation for matching coloured surfaces

This paper discusses the problem of trying to distinguish multi-coloured objects which share similar colours. It introduces the colour region adjacency graph (CRAG) which describes the arrangement of colours on an object's surface followed by a graph matching procedure to recognise like and unlike objects. The paper also shows how the CRAG representation can be used to locate a model in a test image.

[1]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[2]  T. Ellis,et al.  Spectral adaptation with uncertainty using matching , 1995 .

[3]  Tim Ellis,et al.  Tracking using colour information , 1994 .

[4]  Hideo Ogawa.  Labeled point pattern matching by Delaunay triangulation and maximal cliques , 1986, Pattern Recognit..

[5]  Jiri Matas,et al.  On representation and matching of multi-coloured objects , 1995, Proceedings of IEEE International Conference on Computer Vision.

[6]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[7]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..