Scale-Invariant Proximity Graph for Fast Probabilistic Object Recognition - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Scale-Invariant Proximity Graph for Fast Probabilistic Object Recognition

(1) , (2) , , (1)
1
2

Abstract

A pseudo-hierarchical graph matching procedure dedicated to object recognition is presented in this paper. From a single model image, a graph is built by extracting invariant local features and linking them according to a so-called proximity rule. The resulting graph presents several interesting properties including invariance to scale, robustness to various distortions and empirical linearity of the number of edges with respect to the number of nodes. The matching process is made hierarchical in order to increase both speed and detection performances. It relies on progressively incorporating the smaller model features as the hierarchy level increases. As a result, even a matching between graphs containing thousands of nodes is very fast (a few milliseconds). Experiments demonstrates that the method outperforms state-of-the-art specific object detectors in terms of precision-recall measures and detection time.

Dates and versions

hal-01381493 , version 1 (14-10-2016)

Identifiers

Cite

Jérôme Revaud, Guillaume Lavoué, Yasuo Ariki, Atilla Baskurt. Scale-Invariant Proximity Graph for Fast Probabilistic Object Recognition. Conference on Image and Video Retrieval (CIVR), Jul 2010, Xi'an, China. pp.414-421, ⟨10.1145/1816041.1816102⟩. ⟨hal-01381493⟩
83 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More