Combinatorial structure of rigid transformations in 2D digital images - Archive ouverte HAL Access content directly
Journal Articles Computer Vision and Image Understanding Year : 2013

Combinatorial structure of rigid transformations in 2D digital images

Abstract

Rigid transformations are involved in a wide range of digital image processing applications. When applied on such discrete images, rigid transformations are however usually performed in their associated continuous space, then requiring a subsequent digitization of the result. In this article, we propose to study rigid transformations of digital images as a fully discrete process. In particular, we investigate a combinatorial structure modelling the whole space of digital rigid transformations on any subset of Z^2 of size N*N. We describe this combinatorial structure, which presents a space complexity O(N^9) and we propose an algorithm enabling to build it in linear time with respect to this space complexity. This algorithm, which handles real (i.e. non-rational) values related to the continuous transformations associated to the discrete ones, is however defined in a fully discrete form, leading to exact computation.
Fichier principal
Vignette du fichier
HAL_drt_modified.pdf (865.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00643734 , version 1 (22-11-2011)
hal-00643734 , version 2 (12-04-2012)
hal-00643734 , version 3 (18-02-2013)

Identifiers

Cite

Phuc Ngo, Yukiko Kenmochi, Nicolas Passat, Hugues Talbot. Combinatorial structure of rigid transformations in 2D digital images. Computer Vision and Image Understanding, 2013, 117 (4), pp.393-408. ⟨10.1016/j.cviu.2012.08.014⟩. ⟨hal-00643734v3⟩
495 View
315 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More