Efficient neighbourhood computing for discrete rigid transformation graph search - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Efficient neighbourhood computing for discrete rigid transformation graph search

Résumé

Rigid transformations are involved in a wide variety of image processing applications, including image registration. In this context, we recently proposed to deal with the associated optimization problem from a purely discrete point of view, using the notion of discrete rigid transformation (DRT) graph. In particular, a local search scheme within the DRT graph to compute a locally optimal solution without any numerical approximation was formerly proposed. In this article, we extend this study, with the purpose to reduce the algorithmic complexity of the proposed optimization scheme. To this end, we propose a novel algorithmic framework for just-in-time computation of sub-graphs of interest within the DRT graph. Experimental results illustrate the potential usefulness of our approach for image registration.
Fichier principal
Vignette du fichier
Kenmochi14Efficient.pdf (1.64 Mo) Télécharger le fichier
Kenmochi DGCI 2014 Slides.pdf (2.38 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01067537 , version 1 (23-09-2014)

Identifiants

Citer

Yukiko Kenmochi, Phuc Ngo, Hugues Talbot, Nicolas Passat. Efficient neighbourhood computing for discrete rigid transformation graph search. Discrete Geometry for Computer Imagery (DGCI), 2014, Sienne, Italy. pp.99-110, ⟨10.1007/978-3-319-09955-2_9⟩. ⟨hal-01067537⟩
467 Consultations
166 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More