Hierarchical Matching Using Combinatorial Pyramid Framework - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Hierarchical Matching Using Combinatorial Pyramid Framework

Résumé

A string matching approach is proposed to find a region correspondance between two images. Regions and their spatial relationships are represented by two combinatorial pyramids encoding two segmentation hierarchies. Our matching algorithm is decomposed in two steps: We first require that the features of the two matched regions be similar. This threshold on the similarity of the regions to be matched is used as a pruning step. We secondly require that at least one cut may be determined in each hierarchy such that the cyclic sequence of neighbors of the two matched regions have similar features. This distance is based on a cicular string matching algorithm which uses both the orientability of the plane and the hierarchical encoding of the two regions to reduce the computational cost of the matching and enforce its robustness.
Fichier principal
Vignette du fichier
ICISP-2008.pdf (1.71 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00820636 , version 1 (06-05-2013)

Identifiants

Citer

Luc Brun, Jean Hugues Pruvot. Hierarchical Matching Using Combinatorial Pyramid Framework. ICISP 2008, 2008, Cherbourg, France. pp.346-355, ⟨10.1007/978-3-540-69905-7_40⟩. ⟨hal-00820636⟩
74 Consultations
170 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More