Efficient shape retrieval under partial matching
2010 20th International Conference on Pattern Recognition, ICPR 2010, İstanbul, Türkiye, 23 - 26 Ağustos 2010, ss.3057-3060, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1109/icpr.2010.749
- Basıldığı Şehir: İstanbul
- Basıldığı Ülke: Türkiye
- Sayfa Sayıları: ss.3057-3060
- Ankara Yıldırım Beyazıt Üniversitesi Adresli: Hayır
Özet
Indexing into large database systems is essential for a number of applications. This paper presents a new indexing structure, which overcomes an important restric-tion of a previous indexing technique using a recently developed theorem from the domain of matrix analysis. Specifically, given a set of distance values computed by distance function, which do not necessarily satisfy the triangle inequality, this paper shows that computing its nearest distance values that obey the properties of a metric enables us to overcome the limitations of the previous indexing algorithm. We demonstrate the proposed framework in the context of a recognition task. © 2010 IEEE.