Please use this identifier to cite or link to this item:
Title: Many-to-Many Matching under the l 1 Norm
Authors: Demirci, Muhammed Fatih
Osmanlıoğlu, Yusuf
Keywords: graph embedding
Earth Mover's Distance
graph matching
object recognition
Issue Date: 2009
Publisher: Springer-Verlag Berlin
Source: 15th International Conference on Image Analysis and Processing (ICIAP 2009) -- SEP 08-11, 2009 -- Vietri sul Mare, ITALY
Series/Report no.: Lecture Notes in Computer Science
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 comparison with the previous approach, demonstrates the efficacy of the overall framework.
ISBN: 978-3-642-04145-7
ISSN: 0302-9743
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

checked on Dec 26, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.