Computing upper and lower bounds of rotation angles from digital images - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Année : 2009

Computing upper and lower bounds of rotation angles from digital images

Résumé

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 is transformed to another digital image B by a rotation. In the discrete plane, there are many angles giving the rotation from A to B, which we called admissible rotation angles from A to 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 Remila, 2006]. 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.
Fichier principal
Vignette du fichier
Thibault08Computing.pdf (650.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00622416 , version 1 (18-02-2013)

Identifiants

Citer

Yohan Thibault, Yukiko Kenmochi, Akihiro Sugimoto. Computing upper and lower bounds of rotation angles from digital images. Pattern Recognition, 2009, 42 (8), pp.1708-1717. ⟨10.1016/j.patcog.2008.12.027⟩. ⟨hal-00622416⟩
103 Consultations
655 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More