Skip to Main content Skip to Navigation
Conference papers

Efficient neighbourhood computing for discrete rigid transformation graph search

Abstract : 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.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01067537
Contributor : Yukiko Kenmochi <>
Submitted on : Tuesday, September 23, 2014 - 4:10:39 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:07 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

809

Files downloads

408