Abstract
Point set registration is to determine correspondences between two different point sets, then recover the spatial transformation between them. Many current methods, become extremely slow as the cardinality of the point set increases; making them impractical for large point sets. In this paper, we propose a bi-stage method called bi-GMM-TPS, based on Gaussian Mixture Models and Thin-Plate Splines (GMM-TPS). The first stage deals with global deformation. The two point sets are grouped into clusters independently using K-means clustering. The cluster centers of the two sets are then registered using a GMM based method. The point sets are subsequently aligned based on the transformation obtained from cluster center registration. At the second stage, the GMM based registration method is again applied, to fine tune the alignment between the two clusters to address local deformation. Experiments were conducted on eight publicly available datasets, including large point clouds. Comparative experimental results demonstrate that the proposed method, is much faster than state-of-the-art methods GMM-TPS and QPCCP (Quadratic Programming based Cluster Correspondence Projection); especially on large non-rigid point sets, such as the swiss roll, bunny and USF face datasets, and challenging datasets with topological ambiguity such as the banana dataset. Although the Coherent Point Drift (CPD) method has comparable computational speed, it is less robust than bi-GMM-TPS. Especially for large point sets, under conditions where the number of clusters is not extreme, a complexity analysis shows that bi-GMM-TPS is more efficient than GMM-TPS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, New York (2006)
Bookstein, F.L.: Principal warps: thin-plate splines and the decomposition of deformations. IEEE Trans. Pattern Anal. Mach. Intell. 11(6), 567–585 (1989)
Caetano, T.S., Caelli, T., Schuurmans, D., Barone, D.A.C.: Graphical models and point pattern matching. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1646–1663 (2004)
Chui, H.L.: Non-rigid Point Matching: Algorithm, Extensions and Applications. Yale University, New Heaven (2001)
Chui, H.L., Rangarajan, A.: A new point matching algorithm for non-rigid registration. J. Comput. Vis. Image Underst. 89(3), 114–141 (2003)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265–298 (2004)
Granger, S., Pennec, X.: Multi-scale EM-ICP: a fast and robust approach for surface registration. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part IV. LNCS, vol. 2353, pp. 418–432. Springer, Heidelberg (2002)
Jian, B., Vemuri, B.C.: A robust algorithm for point set registration using mixture of gaussians. In: 10th IEEE International Conference on Computer Vision (ICCV05), pp. 1246–1251 (2005)
Jian, B., Vemuri, B.C.: Robust point set registration using gaussian mixture models. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1633–1645 (2011)
Joshi, A., Lee, C.-H.: On the problem of correspondence in range data and some inelastic uses for elastic nets. IEEE Trans. Neural Netw. 6(3), 716–726 (1995)
Lian, W., Zhang, L., Liang, Y., Pan, Q.: A quadratic programming based cluster correspondence projection algorithm for fast point matching. Comput. Vis. Image Underst. 114, 322–333 (2010)
Liu, Y.: Automatic registration of overlapping 3D point clouds using closest points. Image Vis. Comput. 24(7), 762–781 (2006)
Luo, B., Hancock, E.R.: A unified framework for alignment and correspondence. Comput. Vis. Image Underst. 92(1), 26–55 (2003)
Myronenko, A., Song, X.: Point set registration: coherent point drift. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2262–2275 (2010)
Myronenko, A., Song, X., Carreira-Perpinan, M.A.: Non-rigid point set registration: coherent point drift. In: Schölkopf, B., Platt, J., Hoffman, T. (eds.) Advances in Neural Information Processing Systems (NIPS), vol. 19, pp. 1009–1016. The MIT Press, Cambridge (2007)
Starck, J., Hilton, A.: Correspondence labelling for wide-timeframe free-form surface matching. In: 11th International Conference on Computer Vision (ICCV07), pp. 1–8 (2007)
Tsin, Y., Kanade, T.: A correlation-based approach to robust point set registration. In: Pajdla, T., Matas, J.G. (eds.) ECCV 2004. LNCS, vol. 3023, pp. 558–569. Springer, Heidelberg (2004)
Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23(4), 550–560 (1997)
Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293–306 (1985)
Xu, H., Liu, J., Smith, C.D.: Robust and efficient point registration based on clusters and generalized radial basis functions (C-GRBF). In: IEEE International Conference on Image Processing, pp. 1669–1672 (2012)
Deng, Y., Rangarajan, A., Eisenschenk, S., Vemuri, B.C.: A Riemannian framework for matching point clouds represented by the Schrdinger distance transform. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2014)
Lian, W., Zhang, L.: Robust point matching revisited: a concave optimization approach. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part II. LNCS, vol. 7573, pp. 259–272. Springer, Heidelberg (2012)
Lian, W., Zhang, L.: Point matching in the presence of outliers in both point sets: a concave optimization approach. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2014)
Blanz, V., Vetter, T.: Face recognition based on fitting a 3d morphable model. IEEE Trans. Pattern Anal. Mach. Intell. 25(9), 1063–1074 (2003)
Acknowledgement
This work is supported by Postgraduate Research Grant Scheme of Universiti Sains Malaysia (1001-PKOMP-846050) and National Natural Science Foundation of China (61473111).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, J., Zaman, M., Liao, I.Y., Belaton, B. (2015). Bi-Stage Large Point Set Registration Using Gaussian Mixture Models. In: Cremers, D., Reid, I., Saito, H., Yang, MH. (eds) Computer Vision -- ACCV 2014. ACCV 2014. Lecture Notes in Computer Science(), vol 9007. Springer, Cham. https://doi.org/10.1007/978-3-319-16814-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-16814-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16813-5
Online ISBN: 978-3-319-16814-2
eBook Packages: Computer ScienceComputer Science (R0)