Discrete rigid transformation graph search for 2D image registration

Abstract : Rigid image registration is an essential image processing task, with a large body of applications. This problem is usually formulated in the continuous domain, most often in an optimization framework. This strategy is suitable whenever the estimated transformation is associated with interpolation. In the case of purely discrete applications, e.g., for template-based segmentation or classification, it is however preferable to avoid digitizing the result again after transformation. In this article, we deal with this point of view in the 2D case. Based on a fully discrete framework, we explicitly explore the parameter space of rigid transformations. This exploration leads to a local search scheme that can be involved in combinatorial optimization strategies.
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00866285
Contributor : Phuc Ngo <>
Submitted on : Monday, September 30, 2013 - 11:33:41 AM
Last modification on : Thursday, February 7, 2019 - 2:20:17 PM
Long-term archiving on : Tuesday, December 31, 2013 - 4:22:24 AM

File

Ngo13Discrete.pdf
Files produced by the author(s)

Identifiers

Citation

Phuc Ngo, Akihiro Sugimoto, Yukiko Kenmochi, Nicolas Passat, Hugues Talbot. Discrete rigid transformation graph search for 2D image registration. PSIVT Workshops, 2013, Guanajuato, Mexico. pp.228-239, ⟨10.1007/978-3-642-53926-8_21⟩. ⟨hal-00866285⟩

Share

Metrics

Record views

465

Files downloads

375