We consider the estimation of linear transformations aligning a known binary shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the two images and then compute the transformation parameters from these landmarks. Here we propose a unified framework where the exact transformation is obtained as the solution of either a polynomial or a linear system of equations without establishing correspondences. The advantages of the proposed solutions are that they are fast, easy to implement, have linear time complexity, work without landmark correspondences and are independent of the magnitude of transformation.

JF - International Conference on Image Analysis and Recognition (ICIAR) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Aveiro, Portugal SN - 978-3-642-31294-6 N1 - UT: 000323558000033 JO - LNCS ER -