Image retrieval using canonical cyclic string representation of polygons
2006 IEEE International Conference on Image Processing, ICIP 2006, Atlanta, GA, Amerika Birleşik Devletleri, 8 - 11 Ekim 2006, ss.1493-1496, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1109/icip.2006.312565
- Basıldığı Şehir: Atlanta, GA
- Basıldığı Ülke: Amerika Birleşik Devletleri
- Sayfa Sayıları: ss.1493-1496
- Anahtar Kelimeler: image coding, image databases, image matching, image representations, image shape analysis, string matching, correlation
- İstanbul Medipol Üniversitesi Adresli: Evet
Özet
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.