Robust Point Sets Matching by Fusing Feature and Spatial Information Using Nonuniform Gaussian Mixture Models

IEEE Transactions on Image Processing

Volumn 24, Issue 11, 2015, Pages 3754-3767

  Tao, Wenbing ^a   Sun, Kun ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Gaussian mixture model; mismatches rejection; Non uniform; point sets matching; variable weights

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); GAUSSIAN DISTRIBUTION; GEOMETRY; OBJECT RECOGNITION; STATISTICS;

GAUSSIAN MIXTURE MODEL; MISMATCHES REJECTION; NON-UNIFORM; POINT SET; VARIABLE WEIGHT;

IMAGE MATCHING;

EID: 84938305349     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2015.2449559     Document Type: Article

References (55)

1. M. Lhuillier and L. Quan, "A quasi-dense approach to surface reconstruction from uncalibrated images," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 3, pp. 418-433, Mar. 2005.
2. C. Strecha, T. Tuytelaars, and L. Van Gool, "Dense matching of multiple wide-baseline views," in Proc. 9th IEEE Int. Conf. Comput. Vis., Oct. 2003, pp. 1194-1201.
3. Y. Furukawa and J. Ponce, "Accurate, dense, and robust multiview stereopsis," IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 8, pp. 1362-1376, Aug. 2010.
4. K. Kolev, T. Brox, and D. Cremers, "Fast joint estimation of silhouettes and dense 3D geometry from multiple images," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 3, pp. 493-505, Mar. 2012.
5. S. Belongie, J. Malik, and J. Puzicha, "Shape matching and object recognition using shape contexts," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 4, pp. 509-522, Apr. 2002.
6. C. Liu, J. Yuen, and A. Torralba, "Sift flow: Dense correspondence across scenes and its applications," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 5, pp. 978-994, May 2011.
7. J. Kim, C. Liu, F. Sha, and K. Grauman, "Deformable spatial pyramid matching for fast dense correspondences," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2013, pp. 2307-2314.
8. C. Barnes, E. Shechtman, D. B. Goldman, and A. Finkelstein, "The generalized patchmatch correspondence algorithm," in Proc. 11th Eur. Conf. Comput. Vis., 2010, pp. 29-43.
9. H. Liu and S. Yan, "Common visual pattern discovery via spatially coherent correspondences," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2010, pp. 1609-1616.
10. L. Itti, C. Koch, and E. Niebur, "A model of saliency-based visual attention for rapid scene analysis," IEEE Trans. Pattern Anal. Mach. Intell., vol. 20, no. 11, pp. 1254-1259, Nov. 1998.
11. C. Harris and M. Stephens, "A combined corner and edge detector," in Proc. 4th Alvey Vis. Conf., 1998, pp. 147-151.
12. D. G. Lowe, "Distinctive image features from scale-invariant keypoints," Int. J. Comput. Vis., vol. 60, no. 2, pp. 91-110, 2004.
13. D. C. Hauagge and N. Snavely, "Image matching using local symmetry features," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2012, pp. 206-213.
14. H. Chui and A. Rangarajan, "A feature registration framework using mixture models," in Proc. IEEE Workshop Math. Methods Biomed. Image Anal., Jun. 2000, pp. 190-197.
15. H. Chui and A. Rangarajan, "A new point matching algorithm for non-rigid registration," Comput. Vis. Image Understand., vol. 89, pp. 114-141, Feb. 2003.
16. A. Myronenko, X. Song, and M. Á. Carreira-Perpiñán, "Non-rigid point set registration: Coherent point drift," in Proc. Adv. Neural Inf. Process. Syst., 2006, pp. 1009-1016.
17. A. Myronenko and X. Song, "Point set registration: Coherent point drift," IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 12, pp. 2262-2275, Dec. 2010.
18. W. Tao and K. Sun, "Asymmetrical gauss mixture models for point sets matching," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2014, pp. 1598-1605.
19. M. A. Fischler and R. C. Bolles, "Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography," Commun. ACM, vol. 24, no. 6, pp. 381-395, 1981.
20. T. Tuytelaars and L. Van Gool, "Matching widely separated views based on affine invariant regions," Int. J. Comput. Vis., vol. 59, no. 1, pp. 61-85, 2004.
21. J. Zhao, J. Ma, J. Tian, J. Ma, and D. Zhang, "A robust method for vector field learning with application to mismatch removing," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2011, pp. 2977-2984.
22. H. Liu and S. Yan, "Robust graph mode seeking by graph shift," in Proc. 27th ICML, 2010, pp. 671-678.
23. X. Li and Z. Hu, "Rejecting mismatches by correspondence function," Int. J. Comput. Vis., vol. 89, no. 1, pp. 1-17, 2010.
24. Q.-H. Tran, T.-J. Chin, G. Carneiro, M. S. Brown, and D. Suter, "In defence of RANSAC for outlier rejection in deformable registration," in Proc. 12th Eur. Conf. Comput. Vis., 2012, pp. 274-287.
25. D. Pizarro and A. Bartoli, "Feature-based deformable surface detection with self-occlusion reasoning," Int. J. Comput. Vis., vol. 97, no. 1, pp. 54-70, 2012.
26. T. S. Caetano, J. J. McAuley, L. Cheng, Q. V. Le, and A. J. Smola, "Learning graph matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 6, pp. 1048-1058, Jun. 2009.
27. T. Cour, P. Srinivasan, and J. Shi, "Balanced graph matching," in Proc. Adv. Neural Inf. Process. Syst., 2006, pp. 313-320.
28. M. Leordeanu and M. Hebert, "A spectral technique for correspondence problems using pairwise constraints," in Proc. 10th IEEE Int. Conf. Comput. Vis., Oct. 2005, pp. 1482-1489.
29. L. Torresani, V. Kolmogorov, and C. Rother, "Feature correspondence via graph matching: Models and global optimization," in Proc. 10th Eur. Conf. Comput. Vis., 2008, pp. 596-609.
30. M. Cho and K. M. Lee, "Progressive graph matching: Making a move of graphs via probabilistic voting," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2012, pp. 398-405.
31. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ, USA: Prentice-Hall, 1982.
32. E. Delponte, F. Isgrò, F. Odone, and A. Verri, "SVD-matching using SIFT features," Graph. Models, vol. 68, nos. 5-6, pp. 415-431, 2006.
33. G. L. Scott and H. C. Longuet-Higgins, "An algorithm for associating the features of two images," Proc. Roy. Soc. London B, Biol. Sci., vol. 244, no. 1309, pp. 21-26, 1991.
34. L. S. Shapiro and J. M. Brady, "Feature-based correspondence: An eigenvector approach," Image Vis. Comput., vol. 10, no. 5, pp. 283-288, 1992.
35. S. Umeyama, "An eigendecomposition approach to weighted graph matching problems," IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 5, pp. 695-703, Sep. 1988.
36. H. F. Wang and E. R. Hancock, "Correspondence matching using kernel principal components analysis and label consistency constraints," Pattern Recognit., vol. 39, no. 6, pp. 1012-1025, 2006.
37. A. C. Berg and J. Malik, "Shape matching and object recognition," Ph.D. dissertation, Dept. Comput. Sci. Division, Univ. California, Berkeley, Berkeley, CA, USA, 2005.
38. S. Gold and A. Rangarajan, "A graduated assignment algorithm for graph matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 18, no. 4, pp. 377-388, Apr. 1996.
39. M. Torki and A. Elgammal, "One-shot multi-set non-rigid featurespatial matching," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2010, pp. 3058-3065.
40. M. Torki and A. Elgammal, "Putting local features on a manifold," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2010, pp. 1743-1750.
41. R. Hamid, D. DeCoste, and C.-J. Lin, "Dense non-rigid point-matching using random projections," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2013, pp. 2914-2921.
42. A. W. Fitzgibbon, "Robust registration of 2D and 3D point sets," Image Vis. Comput., vol. 21, no. 2, pp. 1145-1153, 2003.
43. P. J. Besl and N. D. McKay, "A method for registration of 3D shapes," IEEE Trans. Pattern Anal. Mach. Intell., vol. 14, no. 2, pp. 239-256, Feb. 1992.
44. S. Rusinkiewicz and M. Levoy, "Efficient variants of the ICP algorithm," in Proc. 3rd Int. Conf. 3D Digit. Imag. Modeling, 2001, pp. 145-152.
45. B. Jian and B. C. Vemuri, "A robust algorithm for point set registration using mixture of Gaussians," in Proc. 10th IEEE Int. Conf. Comput. Vis., Oct. 2005, pp. 1246-1251.
46. B. Jian and B. C. Vemuri, "Robust point set registration using Gaussian mixture models," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 8, pp. 1633-1645, Aug. 2011.
47. S. Gold, C. P. Lu, A. Rangarajan, S. Pappu, and E. Mjolsness, "New algorithms for 2D and 3D point matching: Pose estimation and correspondence," in Proc. Adv. Neural Inf. Process. Syst., 1994, pp. 957-964.
48. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Statist. Soc. B, vol. 39, no. 1, pp. 1-38, 1977.
49. R. M. Neal and G. E. Hinton, "A view of the EM algorithm that justifies incremental, sparse, and other variants," in Learning in Graphical Models. Boston, MA, USA: Kluwer, 1998, pp. 355-368.
50. K. P. Murphy, Machine Learning: A Probabilistic Perspective. Cambridge, MA, USA: MIT Press, 2012.
51. A. L. Yuille and N. M. Grzywacz, "A mathematical analysis of the motion coherence theory," Int. J. Comput. Vis., vol. 3, no. 2, pp. 155-175, 1989.
52. A. Vedaldi and B. Fulkerson. (2008). VLFeat: An Open and Portable Library of Computer Vision Algorithms. [Online]. Available: http://www.vlfeat.org/
53. K. Mikolajczyk and C. Schmid, "A performance evaluation of local descriptors," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 10, pp. 1615-1630, Oct. 2005.
54. K. Lebeda, J. Matas, and O. Chum, "Fixing the locally optimized RANSAC," in Proc. Brit. Mach. Vis. Conf., 2012, pp. 95.1-95.11.
55. J. Heinly, E. Dunn, and J.-M. Frahm, "Comparative evaluation of binary features," in Proc. 12th Eur. Conf. Comput. Vis., 2012, pp. 759-773.