Abstract
In this paper, 2D affine registration problem was studied. First, combining with the procedure of traditional iterative closest point method, the registration problem was modeled as an optimization problem on Lie group \(GL(2,{\mathfrak{R}})\). To assure the registration non-degenerate, some reasonable constraints were introduced into the model by Iwasawa decomposition. Then, a series of quadratic programming were used to approximate the registration problem and a novel affine registration algorithm was proposed. At last, several illustration and comparison experiments were presented to demonstrate the performance and efficiency of the proposed algorithm. Particularly, a way of selecting a good initial registration based on ICA method to achieve the global minimum was suggested.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker A (2003) Matrix groups: an introduction to Lie group theory. Springer, New York
Barber CB, Dobkin DP, Huhdanpaa H (1996) The quickhull algorithm for convex hulls. ACM Trans Math Softw 22(4):469–483
Besl PJ, McKay ND (1992) A mehtod for registration of 3-D shapes. IEEE Trans Pattern Anal Mach Intell 14(2):239–256
Chen Y, Medioni G (1991) Object modeling by registration of multiple range image. Proc IEEE Int Conf Robot Autom 3:2724–2729
Droske M, Rumpf M (2004) A variational approach to nonrigid morphological image registration. SIAM J Appl Math 64(2):668–687
Du SY, Zheng NN, Meng GF, Yuan ZJ (2008) Affine registration of point sets using ICP and ICA. IEEE Signal Process Lett 15:689–692
Feldmar J, Ayache N (1996) Rigid, affine and locally affine registration of free-form surfaces. Int J Comput Vis 18(2):99–119
Grenander U, Miller MI, Srivastava A (1998) Hilbert-Schmidt lower bounds for estimators on matrix Lie groups for ATR. IEEE Trans Pattern Anal Mach Intell 20(8):790–802
Ho J, Yang MH, Rangarajan A, Vemuri B (2007) A new affine registration algorithm for matching 2D point sets. In: IEEE workshop on applications of computer vision
Chui H, Rangarajan A (2003) A new point matching algorithm for non-rigid registration. Comput Vis Image Unders 89:114–141
Helgason S (2001) Differential geometry, Lie groups and symmetric space. Academic Press, New York
Holden M (2008) A review of geometric transformations for nonrigid body registration. IEEE Trans Medical Imaging 27(1):111–128
Kanatani K (1990) Group-theoretical methods in imaging understanding. Springer, New York
Lee TW (1998) Independent component analysis: theory and applications. Kluwer, Boston
Ma Y (2000) A differential geometric approach to computer vision and its applications in control. PhD thesis, University of California, Berkeley
Ma Y, Kosecka J, Sastry SS (2000) Linear differential algorithm for motion recovery: a geometric approach. Int J Comput Vis 36(1):71–89
Ma Y, Kosecka J, Sastry SS (2004) A differential geometric approach to multiple view geometry in space of constant curvature. Int J Comput Vis 58(1):37–53
Paragios N, Rousson M, Ramesh V (2003) Non-rigid registration using distance functions. Comput Vis Image Unders 89:142–165
Yang GH, Stewart CV, Sofka M, Tsai CL (2007) Registration of challenging image pairs: initialization, estimation, and decision. IEEE Trans Pattern Anal Mach Intell 29(11):1973–1989
Ying SH, Peng JG, Du SY, Qiao H (2009) Lie group framework for the iterative closest point algorithm in n-D data registration. Int J Partten Recognit Artif Intell 23(6):1201–1220
Ying SH, Peng JG, Du SY, Qiao H (2009) A scale stretch method based on ICP for 3D data registration. IEEE Trans Autom Sci Eng 6(3):559–565
Zha HB, Ikuta M, Hasegawa T (2000) Registration of range images with different scanning resolutions. In: IEEE international conference on systems, man, and cybernetics, pp 1495–1500
Zhang Z (1994) Iterative point matching of free-from curves and surfaces. Int J Comput Vis 13(2):119–152
Zheng NN, You QB, Meng GF, Zhu JH, Du SY, Liu JY (2008) 50 years of image processing and pattern recognition in China. IEEE Intell Syst 23(6):33–41
Acknowledgments
The authors would like to thank the editor and the anonymous reviewers for their helpful comments and suggestions. The research is supported by NSFC (61005002), Shanghai Leading Academic Discipline Project (S30104) and the Excellent Young Teachers Program of Shanghai (B.37-0101-08-008).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ying, S., Peng, Y. & Wen, Z. Iwasawa decomposition: a new approach to 2D affine registration problem. Pattern Anal Applic 14, 127–137 (2011). https://doi.org/10.1007/s10044-010-0193-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10044-010-0193-7