Combinatorial structure of rigid transformations in 2D digital images

Rigid transformations are involved in a wide range of digital image processing applications. When applied on discrete images, rigid transformations are usually performed in their associated continuous space, requiring a subsequent digitization of the result. In this article, we propose to study rigid transformations of digital images as fully discrete processes. In particular, we investigate a combinatorial structure modelling the whole space of digital rigid transformations on arbitrary subset of Z^2 of size NxN. We describe this combinatorial structure, which presents a space complexity O(N^9) and we propose an algorithm enabling to construct it in linear time with respect to its 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.

[1]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[2]  P. Flajolet,et al.  Continued Fractions, Comparison Algorithms, and Fine Structure Constants , 2000 .

[3]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[4]  N. Ayache,et al.  Landmark-based registration using features identified through differential geometry , 2000 .

[5]  Gad M. Landau,et al.  Efficient pattern matching with scaling , 1990, SODA '90.

[6]  Maciej Liskiewicz,et al.  On the Complexity of Affine Image Matching , 2007, STACS.

[7]  Tobias Bjerregaard,et al.  A survey of research and practices of Network-on-chip , 2006, CSUR.

[8]  Kenneth H. Rosen ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS Third Edition , 2008 .

[9]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[10]  Vladimir A. Kovalevsky,et al.  Finite topology as applied to image analysis , 1989, Comput. Vis. Graph. Image Process..

[11]  Mukarram Ahmad,et al.  Continued fractions , 2019, Quadratic Number Theory.

[12]  Micha Sharir,et al.  Recent Developments in the Theory of Arrangements of Surfaces , 1999, FSTTCS.

[13]  Leonidas J. Guibas,et al.  Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms , 1988, ICALP.

[14]  Christian Hundt Affine image matching is uniform TC 0 -complete , 2010 .

[15]  Yohan Thibault,et al.  Rotations in 2D and 3D discrete spaces , 2010 .

[16]  Amihood Amir,et al.  Faster two-dimensional pattern matching with rotations , 2006, Theor. Comput. Sci..

[17]  Christian Rosenke Affine Image Matching Is Uniform TC0-Complete , 2010, CPM.

[18]  Jan Flusser,et al.  Image registration methods: a survey , 2003, Image Vis. Comput..

[19]  Jean-Michel Morel,et al.  A Review of Image Denoising Algorithms, with a New One , 2005, Multiscale Model. Simul..

[20]  Maciej Liskiewicz,et al.  Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations , 2008, MFCS.

[21]  John Hershberger,et al.  Sweeping arrangements of curves , 1989, SCG '89.

[22]  Esko Ukkonen,et al.  Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[23]  E. V. Podsypanin Length of the period of a quadratic irrational , 1982 .

[24]  Moshe Lewenstein,et al.  Real Two Dimensional Scaled Matching , 2007, Algorithmica.

[25]  Maciej Liskiewicz,et al.  A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation , 2009, Theor. Comput. Sci..

[26]  Eric Andres,et al.  The Quasi-Shear Rotation , 1996, DGCI.

[27]  David Coeurjolly,et al.  Quasi-Affine Transformation in 3-D: Theory and Algorithms , 2009, IWCIA.

[29]  Leonidas J. Guibas,et al.  Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms , 2018, Theor. Comput. Sci..