Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29838

Select areas to restrict search in scientific publication database:
Dimension Free Rigid Point Set Registration in Linear Time
This paper proposes a rigid point set matching algorithm in arbitrary dimensions based on the idea of symmetric covariant function. A group of functions of the points in the set are formulated using rigid invariants. Each of these functions computes a pair of correspondence from the given point set. Then the computed correspondences are used to recover the unknown rigid transform parameters. Each computed point can be geometrically interpreted as the weighted mean center of the point set. The algorithm is compact, fast, and dimension free without any optimization process. It either computes the desired transform for noiseless data in linear time, or fails quickly in exceptional cases. Experimental results for synthetic data and 2D/3D real data are provided, which demonstrate potential applications of the algorithm to a wide range of problems.
Digital Object Identifier (DOI):


[1] G. Scott and C. Lonquiet-Higgins, “An algorithm for associating the features of two images,” Proc. of Royal Society of London, vol. 255, pp. 21–26, 1991.
[2] P. Besl and N. McKay, “A method for registration of 3d shapes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239–266, 1992.
[3] V. Golyanik, B. Taetz, and D. Stricker, “Joint pre-alignment and robust rigid point set registration,” in 2016 IEEE International Conference on Image Processing (ICIP), Sept 2016, pp. 4503–4507.
[4] J. Ma, J. Zhao, and A. L. Yuille, “Non-rigid point set registration by preserving global and local structures,” IEEE Transactions on Image Processing, vol. 25, no. 1, pp. 53–64, Jan 2016.
[5] S. N. Shahed, Y.-T. Chi, J. Ho, and M.-H. Yang, “Higher dimensional affine registration and vision applications,” IEEE Transactions on Pattern Recognition and Machine Intelligence, vol. 33, no. 7, pp. 1324–133, 2011.
[6] M. Carcassoni and E. Hancock, “Spectral correspondence for point pattern matching,” Pattern Recognition, vol. 36, pp. 193–204, 2003.
[7] L. Shapiro and J. Brady, “Feature-based correspondence-an eigenvector approach,” Image Vision Comput., vol. 10, pp. 283–288, 1992.
[8] J. Ho, M.-H. Yang, A. Ranganrajan, and B. Vemuri, “A new affine registration algorithm for 2d point sets,” Workshop on Applications of Computer Vision (WACV), vol. 12, no. 1, pp. 234–778, Apr. 2007.
[9] J. Ho and M.-H. Yang, “On affine registration of planar point sets using complex numbers,” Computer Vision and Image Understanding, vol. 115, no. 1, pp. 234–778, Jan. 2011.
[10] J. Qu, L. Gong, and L. Yang, “A 3d point matching algorithm for affine registration,” International Journal of Computer Assisted Radiology and Surgery, vol. 6, no. 2, pp. 229–236, Mar 2011. (Online). Available:
[11] Z. Wang and H. Xiao, “Dimension-free affine shape matching through subspace invariance,” in Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, june 2009, pp. 2482 –2487.
[12] B. Horn, “Closed-form solution of absolute orientation using unit quaternions,” Journal of the Optical Society of America A: Optics, Image Science, and Vision, vol. 4, no. 4, pp. 629–642, 1987.
[13] L. Greengard and J. Strain, “The fast gauss transform,” SIAM Journal on Scientific and Statistical Computing, vol. 12, no. 1, pp. 79–94, 1991. (Online). Available:
[14] C. Yang, R. Duraiswami, and N. A. Gumerov, “Improved fast gauss transform and efficient kernel density estimation,” Proceedings Ninth IEEE International Conference on Computer Vision, vol. C, no. 9987944, pp. 664–671 vol.1, 2003. (Online). Available:
[15] “Image archive of computational vision at caltech,”
[16] Stanford Computer Graphics Laboratory, “The stanford 3d scanning repository,”
Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007