Change search
ReferencesLink to record
Permanent link

Direct link
Object recognition as many-to-many feature matching
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.
Show others and affiliations
2006 (English)In: International Journal of Computer Vision, ISSN 0920-5691, E-ISSN 1573-1405, Vol. 69, no 2, 203-222 p.Article in journal (Refereed) Published
Abstract [en]

Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation errors, articulation, scale difference, and within-class deformation can yield image and model features which don't match one-to-one but rather many-to-many. Adopting a graph-based representation of a set of features, we present a matching algorithm that establishes many-to-many correspondences between the nodes of two noisy, vertex-labeled weighted graphs. Our approach reduces the problem of many-to-many matching of weighted graphs to that of many-to-many matching of weighted point sets in a normed vector space. This is accomplished by embedding the initial weighted graphs into a normed vector space with low distortion using a novel embedding technique based on a spherical encoding of graph structure. Many-to-many vector correspondences established by the Earth Mover's Distance framework are mapped back into many-to-many correspondences between graph nodes. Empirical evaluation of the algorithm on an extensive set of recognition trials, including a comparison with two competing graph matching approaches, demonstrates both the robustness and efficacy of the overall approach.

Place, publisher, year, edition, pages
2006. Vol. 69, no 2, 203-222 p.
Keyword [en]
graph matching. graph embedding, Earth Mover's Distance (EMD), object recognition, earth movers distance, algorithm, graphs
URN: urn:nbn:se:kth:diva-15856DOI: 10.1007/s11263-006-6993-yISI: 000239162400003ScopusID: 2-s2.0-33744551438OAI: diva2:333898
QC 20100525Available from: 2010-08-05 Created: 2010-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Bretzner, Lars
By organisation
Numerical Analysis and Computer Science, NADA
In the same journal
International Journal of Computer Vision

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 50 hits
ReferencesLink to record
Permanent link

Direct link