Combinatorial properties of 2D discrete rigid transformations under pixel-invariance constraints

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

Cited literature [9 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00790693
Contributor : Yukiko Kenmochi <>
Submitted on : Thursday, February 15, 2018 - 11:54:18 AM
Last modification on : Thursday, July 19, 2018 - 3:34:01 PM
Long-term archiving on : Monday, May 7, 2018 - 1:04:52 PM

File

Ngo_IWCIA_2012.pdf
Files produced by the author(s)

Identifiers

Citation

Phuc Ngo, Yukiko Kenmochi, Nicolas Passat, Hugues Talbot. Combinatorial properties of 2D discrete rigid transformations under pixel-invariance constraints. International Workshop on Combinatorial Image Analysis (IWCIA), 2012, Austin, United States. pp.234-248, ⟨10.1007/978-3-642-34732-0_18⟩. ⟨hal-00790693⟩

Share

Metrics

Record views

577

Files downloads

120