Robust feature point matching with sparse model

IEEE Transactions on Image Processing

Volumn 23, Issue 12, 2014, Pages 5175-5186

  Jiang, Bo ^a   Tang, Jin ^a   Luo, Bin ^a   Lin, Liang ^b  

^a ANHUI UNIVERSITY   (China)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Feature point matching; integer quadratic programming; nonnegative matrix factorization

Indexed keywords

FEATURE POINT MATCHING; NONNEGATIVE MATRIX FACTORIZATION; SPARSE MODELING;

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

References (43)

1. O. Choi and I. S. Kweon, "Robust feature point matching by preserving local geometric consistency," Comput. Vis. Image Understand., vol. 113, no. 6, pp. 726-742, Jun. 2009.
2. A. Egozi, Y. Keller, and H. Guterman, "Improving shape retrieval by spectral matching and meta similarity," IEEE Trans. Image Process., vol. 19, no. 5, pp. 1319-1327, May 2010.
3. L. Liang, L. Yongyi, P. Yan, and C. Xiaowu, "Integrating graph partitioning and matching for trajectory analysis in video surveillance," IEEE Trans. Image Process., vol. 21, no. 12, pp. 4844-4857, Dec. 2012.
4. D. H. Kim, I. D. Yun, and S. U. Lee, "Attributed relational graph matching based on the nested assignment structure," Pattern Recognit., vol. 43, no. 3, pp. 914-928, Mar. 2010.
5. D. Conte, P. Foggia, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition," Int. J. Pattern Recognit. Artif. Intell., vol. 18, no. 3, pp. 265-298, May 2004.
6. 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.
7. 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.
8. M. Zaslavskiy, F. Bach, and J.-P. Vert, "A path following algorithm for the graph matching problem," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 12, pp. 2227-2242, Dec. 2009.
9. 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.
10. J. Maciel and J. P. Costeira, "A global solution to sparse correspondence problems," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 2, pp. 187-199, Feb. 2003.
11. F. Zhou and F. De la Torre, "Factorized graph matching," in Proc. IEEE Conf. CVPR, Jun. 2012, pp. 127-134.
12. B. J. van Wyk and M. A. van Wyk, "A POCS-based graph matching algorithm," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 11, pp. 1526-1530, Nov. 2004.
13. M. Cho, J. Lee, and K. M. Lee, "Reweighted random walks for graph matching," in Proc. 11th ECCV, 2010, pp. 492-505.
14. R. Zass and A. Shashua, "Probabilistic graph and hypergraph matching," in Proc. IEEE Conf. CVPR, Jun. 2008, pp. 1-8.
15. O. Enqvist, K. Josephon, and F. Kahl, "Optimal correspondences from pairwise constraints," in Proc. IEEE 12th Int. Conf. Comput. Vis., Sep./Oct. 2009, pp. 1295-1302.
16. T. Cour, P. Srinivasan, and J. Shi, "Balanced graph matching," in Proc. Neural Inf. Process. Syst., 2006, pp. 313-320.
17. M. Leordeanu, M. Hebert, and R. Sukthankar, "An integer projected fixed point method for graph matching and MAP inference," in Proc. Neural Inf. Process. Syst., 2009, pp. 1114-1122.
18. J. J. MuAuley and T. S. Caetano, "Fast matching of large point sets under occlusions," Pattern Recognit., vol. 45, no. 1, pp. 563-569, Jan. 2012.
19. T. S. Caetano, T. Caelli, D. Schuurmans, and D. A. C. Barone, "Graphical models and point pattern matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 10, pp. 1646-1663, Oct. 2006.
20. D. Chris, T. Li, and M. I. Jordan, "Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding," in Proc. 8th IEEE Int. Conf. Data Mining, Dec. 2008, pp. 183-192.
21. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
22. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra, "Efficient projections onto the l1-ball for learning in high dimensions," in Proc. 25th Int. Conf. Mach. Learn., 2008, pp. 272-279.
23. D. Luo, D. Chris, and H. Huang, "Parallelization with multiplicative algorithms for big data mining," in Proc. IEEE Int. Conf. Data Mining, Dec. 2012, pp. 489-498.
24. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Statist. Soc. Ser. B, vol. 58, no. 1, pp. 267-288, 1994.
25. D. Cai, X. F. He, J. W. Han, and T. S. Huang, "Graph regularized nonnegative matrix factorization for data representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 8, pp. 1548-1560, Aug. 2011.
26. D. D. Lee and H. S. Seung, "Algorithms for nonnegative matrix factorization," in Proc. Adv. Neural Inf. Process. Syst., 2000, pp. 556-562.
27. F. Sha, L. K. Saul, and D. D. Lee, "Multiplicative updates for nonnegative quadratic programming in support vector machines," in Proc. Adv. Neural Inf. Process. Syst., 2003, pp. 1041-1048.
28. D. Chris, T. Li, and M. I. Jordan, "Convex and semi-nonnegative matrix factorization," IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 1, pp. 45-55, Jan. 2010.
29. B. Jiang, J. Tang, and B. Luo, "Graph matching with nonnegative sparse model," in Graph-Based Representations in Pattern Recognition. Berlin, Germany: Springer-Verlag, 2013, pp. 41-50.
30. B. Luo, R. C. Wilson, and E. R. Hancock, "Spectral embedding of graphs," Pattern Recognit., vol. 36, no. 10, pp. 2213-2230, 2003.
31. E. Vincent and R. Laganiere, "Matching feature points in stereo pairs: A comparative study of some matching strategies," Mach. Graph. Vis., vol. 10, no. 3, pp. 237-259, 2001.
32. D. G. Lowe, "Object recognition from local scale-invariant features," in Proc. 7th IEEE Int. Conf. Comput. Vis., Sep. 1999, pp. 1150-1157.
33. E. S. Ng and N. G. Kingsbury, "Matching of interest point groups with pairwise spatial constraints," in Proc. 17th IEEE Int. Conf. Image Process., Sep. 2010, pp. 2693-2696.
34. M. Leordeanu and M. Hebert, "Efficient MAP approximation for dense energy functions," in Proc. 23rd Int. Conf. Mach. Learn., 2006, pp. 545-552.
35. L. Baratchart, M. Berthod, and L. Pottier, "Optimization of positive generalized polynomials under l p constraints," J. Convex Anal., vol. 5, no. 2, pp. 353-379, 1998.
36. L. E. Baum and G. R. Sell, "Growth transformations for functions on manifold," Pacific J. Math., vol. 27, no. 2, pp. 211-227, 1968.
37. S. R. Bulò and M. Pelillo, "A game-theoretic approach to hypergraph clustering," IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 6, pp. 1312-1327, Jun. 2013.
38. P. Marcello, "Replicator equations, maximal cliques, and graph isomorphism," Neural Comput., vol. 11, no. 8, pp. 1933-1955, 1999.
39. E. Rodola, A. M. Bronstein, A. Albarelli, F. Bergamasco, and A. Torsello, "A game-theoretic approach to deformable shape matching," in Proc. IEEE Conf. CVPR, Jun. 2012, pp. 182-189.
40. A. Albarelli, S. R. Bulò, A. Torsello, and M. Pelilo, "Matching as a non-cooperative game," in Proc. IEEE Int. Conf. Comput. Vis., Sep./Oct. 2009, pp. 1319-1326.
41. A. Albarelli, E. Rodola, and A. Torsello, "Imposing semi-local geometric constraints for accurate correspondences selection in structure from motion: A game-theoretic perspective," Int. J. Comput. Vis., vol. 97, no. 1, pp. 36-53, 2012.
42. C. Ding and X. He, "K-means clustering via principal component analysis," in Proc. Int. Conf. Mach. Learn., 2004, pp. 225-232.
43. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Proc. Adv. Neural Inf. Process. Syst., 2001, pp. 849-856.