An analysis of errors in graph-based keypoint matching and proposed solutions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8695 LNCS, Issue PART 7, 2014, Pages 138-153

  Collins, Toby ^a   Mesejo, Pablo ^a   Bartoli, Adrien ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERRORS; GRAPHIC METHODS; PIPELINES; STEREO IMAGE PROCESSING;

CANDIDATE SELECTION; GRAPH CONSTRAINTS; KEY POINT MATCHING; KEY-POINT DETECTORS; KEYPOINT DETECTION; MATCHING SYSTEM; MOTION DISCONTINUITIES; STEREO MATCHING;

IMAGE MATCHING;

EID: 84906344818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-10584-0_10     Document Type: Conference Paper

References (37)

1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of Graph Matching in Pattern Recognition. Int. J. Pattern Recogn., 265-298 (2004)
2. Leordeanu, M., Hebert, M., Sukthankar, R.: An integer projected fixed point method for graph matching and MAP inference. In: Neural Information Processing Systems (NIPS), pp. 1114-1122 (2009)
3. Cho, M., Lee, J., Lee, K.M.: Reweighted Random Walks for Graph Matching. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 492-505. Springer, Heidelberg (2010)
4. Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE T. Pattern Anal. 31, 1048-1058 (2009)
5. Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised learning for graph matching. Int. J. Comput. Vision 96, 28-45 (2012)
6. Torresani, L., Kolmogorov, V., Rother, C.: Feature Correspondence Via Graph Matching: Models and Global Optimization. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part II. LNCS, vol. 5303, pp. 596-609. Springer, Heidelberg (2008)
7. Faugeras, O., Hotz, B., Mathieu, H., Viville, T., Zhang, Z., Fua, P., Thron, E., Robotvis, P.: Real time correlation-based stereo: Algorithm, implementations and applications (1996)
8. Kowdle, A., Gallagher, A., Chen, T.: Combiningmonocular geometric cues with traditional stereo cues for consumer camera stereo. In: Fusiello, A., Murino, V., Cucchiara, R. (eds.) ECCV 2012 Ws/Demos, Part II. LNCS, vol. 7584, pp. 103-113. Springer, Heidelberg (2012)
9. Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10, 695-703 (1988)
10. Cho, M., Alahari, K., Ponce, J.: Learning graphs to match. In: International Conference on Computer Vision (ICCV) (2013)
11. Zhou, F., la Torre, F.D.: Deformable graph matching. In: Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2922-2929 (2013)
12. Zaslavskiy, M., Bach, F., Vert, J.-P.: A path following algorithm for graph matching. In: Elmoataz, A., Lezoray, O., Nouboud, F., Mammass, D. (eds.) ICISP 2008 2008. LNCS, vol. 5099, pp. 329-337. Springer, Heidelberg (2008)
13. Chertok, M., Keller, Y.: Efficient high order matching. IEEE Trans. Pattern Anal. Mach. Intell. 32, 2205-2215 (2010)
14. Duchenne, O., Bach, F., Kweon, I.S., Ponce, J.: A tensor-based algorithm for high-order graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 33, 2383-2395 (2011)
15. Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: International Conference on Computer Vision (ICCV), pp. 1482-1489 (2005)
16. Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18, 377-388 (1996)
17. Scott, G.L., Longuet-Higgins, H.C.: An Algorithm for Associating the Features of Two Images. Royal Society of London Proceedings Series B 244, 21-26 (1991)
18. Hamid, R., DeCoste, D., Lin, C.J.: Dense non-rigid point-matching using random projections. In: CVPR, pp. 2914-2921. IEEE (2013)
19. Albarelli, A., Rodolà, E., Torsello, A.: Imposing semi-local geometric constraints for accurate correspondences selection in structure from motion: A game-theoretic perspective. Int. J. Comput. Vision 97, 36-53 (2012)
20. Pilet, J., Lepetit, V., Fua, P.: Fast non-rigid surface detection, registration and realistic augmentation. Int. J. Comput. Vision 76, 109-122 (2008)
21. Pizarro, D., Bartoli, A.: Feature-Based Deformable Surface Detection with Self-Occlusion Reasoning. Int. J. Comput. Vision 97, 54-70 (2012)
22. Tran, Q.-H., Chin, T.-J., Carneiro, G., Brown, M.S., Suter, D.: In defence of RANSAC for outlier rejection in deformable registration. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part IV. LNCS, vol. 7575, pp. 274-287. Springer, Heidelberg (2012)
23. Chui, H., Rangarajan, A.: A new point matching algorithm for non-rigid registration. Comput. Vis. Image Underst. 89, 114-141 (2003)
24. Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision 60, 91-110 (2004)
25. Bay, H., Ess, A., Tuytelaars, T., Van Gool, L.: Speeded-up robust features (SURF). Comput. Vis. Image Underst. 110, 346-359 (2008)
26. Mikolajczyk, K., Schmid, C.: Scale & affine invariant interest point detectors. Int. J. Comput. Vision 60, 63-86 (2004)
27. Morel, J.M., Yu, G.: ASIFT: A New Framework for Fully Affine Invariant Image Comparison. SIAM J. Imaging Sci. 2, 438-469 (2009)
28. Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2014)
29. Torresani, L., Hertzmann, A., Bregler, C.: Nonrigid structure-from- motion: Estimating shape and motion with hierarchical priors. IEEE Trans. Pattern Anal. Mach. Intell. 30(5), 878-892 (2008)
30. Vedaldi, A., Fulkerson, B.: VLFeat: An open and portable library of computer vision algorithms (2008), http://www.vlfeat.org/
31. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1222-1239 (2001)
32. Rother, C., Kolmogorov, V., Lempitsky, V.S., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1-8 (2007)
33. Hammer, P., Hansen, P., Simeone, B.: Roof duality, complementation and persistency in quadratic optimization. Mathematical Programming 28, 121-155 (1984)
34. Salzmann, M., Hartley, R., Fua, P.: Convex optimization for deformable surface 3-d tracking. In: International Conference on Computer Vision (ICCV), pp. 1-8 (2007)
35. Strecha, C., Bronstein, A.M., Bronstein, M.M., Fua, P.: LDAHash: Improved matching with smaller descriptors. In: EPFL-REPORT-152487 (2010)
36. Salzmann, M., Urtasun, R., Fua, P.: Local deformation models for monocular 3d shape recovery. In: Conference on Computer Vision and Pattern Recognition (CVPR) (2008)
37. Bartoli, A.: Maximizing the predictivity of smooth deformable image warps through cross-validation. Journal of Mathematical Imaging and Vision 31(2-3), 133-145 (2008)