Many-to-many matching under the l1 norm
15th International Conference on Image Analysis and Processing - ICIAP 2009, Proceedings, Vietri sul Mare, İtalya, 8 - 11 Eylül 2009, cilt.5716 LNCS, ss.787-796, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Cilt numarası: 5716 LNCS
- Doi Numarası: 10.1007/978-3-642-04146-4_84
- Basıldığı Şehir: Vietri sul Mare
- Basıldığı Ülke: İtalya
- Sayfa Sayıları: ss.787-796
- Anahtar Kelimeler: Earth Mover's Distance, Graph embedding, Graph matching, Object recognition
- Ankara Yıldırım Beyazıt Üniversitesi Adresli: Hayır
Özet
The problem of object recognition can be formulated as matching feature sets of different objects. Segmentation errors and scale difference result in many-to-many matching of feature sets, rather than one-to-one. This paper extends a previous algorithm on many-to-many graph matching. The proposed work represents graphs, which correspond to objects, isometrically in the geometric space under the l 1 norm. Empirical evaluation of the algorithm on a set of recognition trails, including a comparison with the previous approach, demonstrates the efficacy of the overall framework. © 2009 Springer Berlin Heidelberg.