Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/7004
Title: Many-to-Many Matching in l(1) Norm
Authors: Demirci, Muhammed Fatih
Keywords: [No Keywords]
Issue Date: 2008
Publisher: IEEE
Source: IEEE 16th Signal Processing and Communications Applications Conference -- APR 20-22, 2008 -- Aydin, TURKEY
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, isomorphically in the geometric space under the l(1) norm. Empirical evaluation of the algorithm on an extensive set of recognition trails, including a comparison with the previous approach, demonstrates the efficacy of the overall framework.
URI: https://hdl.handle.net/20.500.11851/7004
ISBN: 978-1-4244-1998-2
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)

32
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


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