Combinatorial Properties of 2D Discrete Rigid Transformations under Pixel-Invariance Constraints
Rigid transformations are useful in a wide range of digital image processing applications. In this context, they are generally considered as continuous processes, followed by discretization of the results. In recent works, rigid transformations on ℤ2 have been formulated as a fully discrete process. Following this paradigm, we investigate – from a combinatorial point of view – the effects of pixel-invariance constraints on such transformations. In particular we describe the impact of these constraints on both the combinatorial structure of the transformation space and the algorithm leading to its generation.
KeywordsCombinatorial structure Discrete rigid transformation Pixel– invariance constraints
Unable to display preview. Download preview PDF.
- 1.Amintoosi, M., Fathy, M., Mozayani, N.: A fast image registration approach based on SIFT key-points applied to super-resolution. Imaging Science Journal (2011)Google Scholar
- 5.Ngo, P., Kenmochi, Y., Passat, N., Talbot, H.: Combinatorial structure of rigid transformations in 2D digital images. Technical Report, HAL 00643734 (2012)Google Scholar
- 7.Thibault, Y.: Rotations in 2D and 3D discrete spaces. PhD thesis, University Paris-Est (2010)Google Scholar