Computing upper and lower bounds of rotation angles from digital images
Rotations in the discrete plane are important for many applications such as image matching or construction of mosaic images. We suppose that a digital image A A is transformed to another digital image B B by a rotation. In the discrete plane, there are many angles giving the rotation from A A to B B , which we call admissible rotation angles from A A to B B . For such a set of admissible rotation angles, there exist two angles that achieve the lower and the upper bounds. To find those lower and upper bounds, we use hinge angles as used in Nouvel and Rmila [Incremental and transitive discrete rotations, in: R. Reulke, U. Eckardt, B. Flash, U. Knauer, K. Polthier (Eds.), Combinatorial Image Analysis, Lecture Notes in Computer Science, vol. 4040, Springer, Berlin, 2006, pp. 199213]. A sequence of hinge angles is a set of particular angles determined by a digital image in the sense that any angle between two consecutive hinge angles gives the identical rotation of the digital image. We propose a method for obtaining the lower and the upper bounds of admissible rotation angles using hinge angles from a given Euclidean angle or from a pair of corresponding digital images.
rotation admissible rotation angles hinge angles discrete rotation discrete geometry pythagorean angles