Conference proceeding
Many-to-Many Matching under the l(1) Norm
IMAGE ANALYSIS AND PROCESSING - ICIAP 2009, PROCEEDINGS, Vol.5716, pp.787-796
Lecture Notes in Computer Science
01 Jan 2009
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.
Metrics
2 Record Views
Details
- Title
- Many-to-Many Matching under the l(1) Norm
- Creators
- M. Fatih Demirci - AnkaraYusuf Osmanlioglu - Ankara
- Contributors
- P Foggia (Editor)C Sansone (Editor)M Vento (Editor)
- Publication Details
- IMAGE ANALYSIS AND PROCESSING - ICIAP 2009, PROCEEDINGS, Vol.5716, pp.787-796
- Series
- Lecture Notes in Computer Science
- Publisher
- Springer Nature
- Number of pages
- 10
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Computer Science (Computing)
- Identifiers
- 991021869110904721
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web of Science research areas
- Computer Science, Artificial Intelligence
- Computer Science, Theory & Methods