Many-to-many matching under the l1 norm


Demirci M. F. , OsmanlIoǧlu Y.

15th International Conference on Image Analysis and Processing - ICIAP 2009, Proceedings, Vietri sul Mare, Italy, 8 - 11 September 2009, vol.5716 LNCS, pp.787-796 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 5716 LNCS
  • Doi Number: 10.1007/978-3-642-04146-4_84
  • City: Vietri sul Mare
  • Country: Italy
  • Page Numbers: pp.787-796
  • Keywords: Earth Mover's Distance, Graph embedding, Graph matching, Object recognition

Abstract

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.