Rotations in 2D and 3D discrete spaces

This thesis presents a study on rotation in 2 dimensional and 3 dimensional discrete spaces. In computer science, using floating numbers is problematic due to computation errors. Thus we chose during this thesis to work only in discrete space. In the field of computer vision, the rotation is a transformation required for many applications. Using discretized Euclidean rotation gives bad results. Then, it is necessary to develop new rotation methods adapted to the discrete spaces. We mainly studied the hinge angles that represent the discontinuity of the rotation in the discrete space. Indeed, it is possible to perform two rotations of the same digital image with two angles that are slightly different and obtain the same result. This is captured by hinge angles. Using these angles allow us to describe a discrete rotation that gives the same results than the discretized Euclidean rotation without using floating numbers. They also allow describing an incremental rotation that performs all possible rotations of a given digital image. Using hinge angles can also be extended to the rotations in 3 dimensional discrete spaces. The extension requires the multi-grids that are rotation planes containing three sets of parallel lines. These parallel lines represent the discontinuities of the rotation in 3D discrete space. Thus they are useful to describe the hinge angles in rotation planes. Multi-grids allow obtaining the same results in 3D discrete rotations than the results obtained in 2D discrete rotations. This thesis presents a study on rotation in 2 dimensional and 3 dimensional discrete spaces. In computer science, using floating numbers is problematic due to computation errors. Thus we chose during this thesis to work only in discrete space. In the field of computer vision, the rotation is a transformation required for many applications. Using discretized Euclidean rotation gives bad results. Then, it is necessary to develop new rotation methods adapted to the discrete spaces. We mainly studied the hinge angles that represent the discontinuity of the rotation in the discrete space. Indeed, it is possible to perform two rotations of the same digital image with two angles that are slightly different and obtain the same result. This is captured by hinge angles. Using these angles allow us to describe a discrete rotation that gives the same results than the discretized Euclidean rotation without using floating numbers. They also allow describing an incremental rotation that performs all possible rotations of a given digital image. Using hinge angles can also be extended to the rotations in 3 dimensional discrete spaces. The extension requires the multi-grids that are rotation planes containing three sets of parallel lines. These parallel lines represent the discontinuities of the rotation in 3D discrete space. Thus they are useful to describe the hinge angles in rotation planes. Multi-grids allow obtaining the same results in 3D discrete rotations than the results obtained in 2D discrete rotations

[1]  Son Pham Digital circles with non-lattice point centers , 2005, The Visual Computer.

[2]  Eric Rémila,et al.  Incremental and Transitive Discrete Rotations , 2006, IWCIA.

[3]  Eric Andres Cercles discrets et rotations discrètes , 1992 .

[4]  M. Henon,et al.  Good Rotations , 1998 .

[5]  Heinrich Niemann,et al.  Using Quaternions for Parametrizing 3-D Rotations in Unconstrained Nonlinear Optimization , 2001, VMV.

[6]  Jack Bresenham,et al.  A linear algorithm for incremental digital display of circular arcs , 1977, CACM.

[7]  Gad M. Landau,et al.  Two-dimensional pattern matching with rotations , 2004, Theor. Comput. Sci..

[8]  Eric Schmutz,et al.  Rational points on the unit sphere , 2008 .

[9]  Tommaso Toffoli,et al.  Three-Dimensional Rotations by Three Shears , 1997, CVGIP Graph. Model. Image Process..

[10]  Alan W. Paeth,et al.  A fast algorithm for general raster rotation , 1986 .

[11]  W. S. Anglin Using Pythagorean triangles to approximate angles , 1988 .

[12]  E. J. Eckert The Group of Primitive Pythagorean Triangles , 1984 .

[13]  Eric Andres,et al.  New methods in oblique slice generation , 1996, Medical Imaging.

[14]  Valentin E. Brimkov Scaling of Plane Figures That Assures Faithful Digitization , 2008, IWCIA.

[15]  Atsushi Imiya,et al.  On Combinatorial Properties Of Discrete Planar Surfaces , 2000 .

[16]  P. Arpaia,et al.  Matrix generation of Pythagorean $n$-tuples , 1990 .

[17]  Jonathan M. Borwein,et al.  Measurement of a Circle , 2000 .

[18]  Kristin J. Dana,et al.  Real-time scene stabilization and mosaic construction , 1994, Proceedings of 1994 IEEE Workshop on Applications of Computer Vision.

[19]  Laurent Fuchs,et al.  An Algorithm to Decompose n-Dimensional Rotations into Planar Rotations , 2010, CompIMAGE.

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

[21]  K. Voss Discrete Images, Objects, and Functions in Zn , 1993 .

[22]  Jack E. Volder The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

[23]  R. Ansorge Abhandlungen aus dem mathematischen seminar der Universität Hamburg , 1977 .

[24]  Jovisa D. Zunic,et al.  The Number of N-Point Digital Discs , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  E. T. An Introduction to the Theory of Numbers , 1946, Nature.

[26]  F. Lindemann Ueber die Zahl π.*) , 1882 .

[27]  Richard I. Hartley,et al.  Global Optimization through Rotation Space Search , 2009, International Journal of Computer Vision.

[28]  Bertrand Nouvel,et al.  Rotations discrètes et automates cellulaires , 2006 .

[29]  Arie E. Kaufman,et al.  3D Volume Rotation Using Shear Transformations , 2000, Graph. Model..

[30]  Gaëlle Largeteau-Skapin,et al.  Generalized Perpendicular Bisector and Circumcenter , 2010, CompIMAGE.