Tight Relaxation of Quadratic Matching

Computer Graphics Forum

Volumn 34, Issue 5, 2015, Pages 115-128

  Kezurer, Itay ^a   Kovalsky, Shahar Z ^a   Basri, Ronen ^a   Lipman, Yaron ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; RELAXATION PROCESSES; STOCHASTIC SYSTEMS;

COMBINATORIAL MATCHING; EXPERIMENTAL EVALUATION; GLOBAL CONSISTENCY; GLOBAL OPTIMUM SOLUTIONS; POINT CORRESPONDENCE; QUADRATIC ASSIGNMENT; SEMI-DEFINITE PROGRAM (SDP); SUBOPTIMAL SOLUTION;

OPTIMIZATION;

EID: 84946737480     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/cgf.12701     Document Type: Conference Paper

References (32)

1. Andersen E.D.; Andersen K.D.;: The MOSEK interior point optimization for linear programming: an implementation of the homogeneous algorithm. Kluwer Academic Publishers, 1999, pp. 197-232. 11
2. Aflalo Y.; Bronstein A.; Kimmel R.;: Graph matching: relax or not? arXiv preprint arXiv:1401.7623 (2014). 2, 3, 4, 6
3. Bronstein A.M.; Bronstein M.M.; Kimmel R.;: Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching. Proceedings of the National Academy of Sciences of the United States of America 103, 5 (2006), 1168-1172. 1, 2, 3
4. Bronstein A.M.; Bronstein M.M.; Kimmel R.; Mahmoudi M.; Sapiro G.;: A gromov-hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching. International Journal of Computer Vision 89, 2-;3 (2010), 266-286. 2
5. Berg A.C.; Berg T.L.; Malik J.;: Shape matching and object recognition using low distortion correspondences. In Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on (2005), vol. 1, IEEE, pp. 26-33. 1, 2, 3
6. Boyer D.M.; Lipman Y.; St. Clair E.; Puente J.; Patel B.A.; Funkhouser T.; Jernvall J.; Daubechies I.;: Algorithms to automatically quantify the geometric similarity of anatomical surfaces. Proceedings of the National Academy of Sciences 108, 45 (2011), 18221-18226. 9, 10, 11
7. Boyd S.; Vandenberghe L.;: Convex Optimization. Cambridge University Press, 2004. 4, 13
8. Duchenne O.; Bach F.; Kweon I.-S.; Ponce J.;: A tensor-based algorithm for high-order graph matching. Pattern Analysis and Machine Intelligence, IEEE Transactions on 33, 12 (2011), 2383-2395. 2
9. Dulmage A.; Mendelsohn N.;: The convex hull of sub-permutation matrices. In Proc. Amer. Math. Soc (1958), vol. 9, pp. 253-254. 3
10. Feng W.; Huang J.; Ju T.; Bao H.;: Feature correspondences using morse smale complex. The Visual Computer 29, 1 (2013), 53-67. 2, 3
11. Funkhouser T.; Shilane P.;: Partial matching of 3d shapes with priority-driven search. In Proceedings of the Fourth Eurographics Symposium on Geometry Processing (Airela-Ville, Switzerland, Switzerland, 2006), SGP '06, Eurographics Association, pp. 131-142. 1, 2
12. Giorgi D.; Biasotti S.; Paraboschi L.;: Shape retrieval contest 2007: Watertight models track, 2007. 2, 7, 9
13. Huang Q.-X.; Guibas L.;: Consistent shape maps via semidefinite programming. Computer Graphics Forum 32, 5 (2013), 177-186. 2, 5, 8
14. Horn R.A.; Johnson C.R.;: Matrix Analysis. Cambridge University Press, 1990. 7
15. Huang Q.; Wang F.; Guibas L.;: Functional map networks for analyzing and exploring large shape collections. ACM Trans. Graph. 33, 4 (July 2014), 36:1-36:11. 2, 5
16. Kim V.G.; Lipman Y.; Chen X.; Funkhouser T.;: Möbius transformations for global intrinsic symmetry analysis. In Computer Graphics Forum (2010), vol. 29, Wiley Online Library, pp. 1689-1700. 7
17. Kim V.G.; Lipman Y.; Funkhouser T.;: Blended intrinsic maps. In ACM Transactions on Graphics (TOG) (2011), vol. 30, ACM, p. 79. 8
18. Kim V.G.; Li W.; Mitra N.J.; DiVerdi S.; Funkhouser T.;: Exploring Collections of 3D Models using Fuzzy Correspondences. Transactions on Graphics (Proc. of SIGGRAPH) 31, 4 (2012). 2, 5
19. Kim V.G.; Li W.; Mitra N.J.; Chaudhuri S.; DiVerdi S.; Funkhouser T.;: Learning Part-based Templates from Large Collections of 3D Shapes. Transactions on Graphics (Proc. of SIGGRAPH) 32, 4 (2013). 9
20. Keuchel J.; Schnorr C.; Schellewald C.; Cremers D.;: Binary partitioning, perceptual grouping, and restoration with semidefinite programming. Pattern Analysis and Machine Intelligence, IEEE Transactions on 25, 11 (2003), 1364-1379. 6
21. Löfberg J.;: Yalmip: A toolbox for modeling and optimization in MATLAB. In Proceedings of the CACSD Conference (Taipei, Taiwan, 2004). 11
22. Loiola E.M.; de Abreu N. M. M.; Boaventura-Netto P.O.; Hahn P.; Querido T.;: A survey for the quadratic assignment problem. European Journal of Operational Research 176, 2 (2007), 657-690. 2, 11
23. Leordeanu M.; Hebert M.;: A spectral technique for correspondence problems using pairwise constraints. In Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on (2005), vol. 2, IEEE, pp. 1482-1489. 2, 3, 4
24. Lévy B.; Petitjean S.; Ray N.; Maillot J.;: Least squares conformal maps for automatic texture atlas generation. ACM Trans. Graph. 21, 3 (July 2002), 362-371. 10
25. Memoli F.;: On the use of gromov-hausdorff distances for shape comparison. In Eurographics symposium on point-based graphics (2007), The Eurographics Association, pp. 81-90. 2
26. Nguyen A.; Ben-Chen M.; Welnicka K.; Ye Y.; Guibas L.;: An optimization approach to improving collections of shape maps. Computer Graphics Forum 30, 5 (2011), 1481-1491. 2, 5
27. Nadler B.; Lafon S.; Coifman R.R.; Kevrekidis I.G.;: Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. arXiv preprint math/0506090 (2005). 11
28. O'Donoghue B.; Chu E.; Parikh N.; Boyd S.;: Operator splitting for conic optimization via homogeneous self-dual embedding. arXiv preprint arXiv:1312.3039 (2013). 11
29. Shao T.; Li W.; Zhou K.; Xu W.; Guo B.; Mitra N.J.;: Interpreting concept sketches. ACM Transactions on Graphics (TOG) 32, 4 (2013), 56. 2
30. Singer A.; Wu H.-T.;: Vector diffusion maps and the connection laplacian. Communications on Pure and Applied Mathematics 65, 8 (2012), 1067-1144. 2, 5
31. van Kaick O.; Zhang H.; Hamarneh G.; Cohen-Or D.;: A survey on shape correspondence. Computer Graphics Forum 30, 6 (2011), 1681-1707. 2
32. Zhao Q.; Karisch S.E.; Rendl F.; Wolkowicz H.;: Semidefinite programming relaxations for the quadratic assignment problem. Journal of Combinatorial Optimization 2, 1 (1998), 71-109. 2, 11