Image retrieval using canonical cyclic string representation of polygons

Soysal Ö. M., GÜNTÜRK B. K., Matthews II K. L.

2006 IEEE International Conference on Image Processing, ICIP 2006, Atlanta, GA, United States Of America, 8 - 11 October 2006, pp.1493-1496 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/icip.2006.312565
  • City: Atlanta, GA
  • Country: United States Of America
  • Page Numbers: pp.1493-1496
  • Keywords: image coding, image databases, image matching, image representations, image shape analysis, string matching, correlation
  • Istanbul Medipol University Affiliated: Yes


In image retrieval applications one of the boundary-dependent approaches is matching contours with their polygonal representation. We introduce (1) a new polygonal shape representation, (2) an efficient algorithm to compute a unique representation of a polygon to handle orientation and (3) a matching method that is invariant to rigid and affine transformation. In the method, polygons are represented by a sequence of distance vectors ordered in a predefined cyclic way. Each vector is composed of two primitives which are radial distance from the centroid to a vertex and the following edge distance in a specified direction. Matching of polygons is achieved by bitwise comparison of their string code. The algorithm has a computational complexity of O(n log n), hence it has advantage for practical use. ©2006 IEEE.