Consistent shape maps via semidefinite programming

Computer Graphics Forum

Volumn 32, Issue 5, 2013, Pages 177-186

  Huang, Qi Xing ^a   Guibas, Leonidas ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSISTENCY CONSTRAINTS; LOW-RANK MATRIX RECOVERIES; OPTIMALITY CONDITIONS; POSITIVE SEMIDEFINITE; POSITIVE SEMIDEFINITE MATRICES; SEMI-DEFINITE PROGRAM (SDP); SEMI-DEFINITE PROGRAMMING; THEORETICAL GUARANTEES;

COMPUTER GRAPHICS;

EID: 84882751060     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/cgf.12184     Document Type: Article

References (23)

1. Anguelov D., Srinivasan P., Roller D., Thrun S., Rodgers J., Davis J.,: Scape: shape completion and animation of people. In ACM SIGGRAPH 2005 Papers (2005), SIGGRAPH '05, pp. 408-416. 2, 8.
2. Bronstein A., Bronstein M., Kimmel R.,: Numerical Geometry of Non-Rigid Shapes, 1 ed. Springer Publishing Company, Incorporated, 2008. 2, 8.
3. Boyd S., Parikh N., Chu E., Peleato B., Eckstein I.,: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1 (Ian. 2011), 1-122. 5.
4. Candès E. J., Li X., Ma Y., Wright J.,: Robust principal component analysis? J. ACM 58, 3 (June 2011), 11:1-11:37. 2,5,6.
5. Candès E. J., Recht B.,: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 6 (Dec. 2009). 717-772. 2, 5, 6.
6. Candes E. J., Tao T.,: Decoding by linear programming. Trans. Inf. Theor. 51, 12 (Dec. 2005), 4203-4215. 1. (Pubitemid 41800353)
7. Ding X., Jiang T.,: Spectral distributions of adjacency and laplacian matrices of random graphs. Annals of Applied Probability 20(6) (2010), 2086-2117. 6.
8. Fiedler M.,: Algebraic Connectivity of Graphs. Czechoslovak Mathematical Journal 23 (1973), 298-305. 6.
9. GIORGI D., BIASDTTI S., PARABOSCHI L.,: Shrec: shape retreval contex: Watertight models track, 2007. 2.
10. Huang Q.-X., Flöry S., Gelfand N., Hofer M., Pottmann H.,: Reassembling fractured objects by geometric matching. ACM Trans. Graph. 25, 3 (2006), 569-578. 2. (Pubitemid 44481016)
11. Huber D.,: Automatic Three-dimensional Modeling from Reality. PhD thesis, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, December 2002. 2.
12. Huang Q.-X., Zhang G.-X., Gao L., Hu S.-M., Butscher A., Guibas L.,: An optimization approach for extracting and encoding consistent maps in a shape collection. ACM Trans. Graph. 31, 6 (Nov. 2012), 167:1-167:11. 1, 2, 8, 9.
13. Kim V. G., Lipman Y., Funkhouser T.,: Blended intrinsic maps. ACM Trans. Graph. 30, 4 (Aug. 2011), 79:1-79:12. 2, 8.
14. Kim V. G., Li W., Mitra N., DiVerdi S., Funkhouser L.,: Exploring collections of 3d models using fuzzy correspondences. In ACM SIGGRAPH 2012 papers (2012), SIGGRAPH '12. 1, 2, 8, 9.
15. Lipman Y., Funkhouser T.,: Mobius voting for surface correspondence. ACM Trans. Graph. 28, 3 (July 2009), 72:1-72:12. 2.
16. Nguyen A., Ben-Chen M., Welnicka K., Ye Y., Guibas L.,: An optimization approach to improving collections of shape maps. In Eurographics Symposium on Geometry Processing (SGP) (2011), pp. 1481-1491. 1, 2, 3, 8, 9.
17. Ovsianikov M., Ben-Chen M., Solomon L., Butscher A., Guibas L.,: Functional maps: a flexible representation of maps between shapes. ACM Trans. Graph. 31, 4 (July 2012), 30:1-30:11. 10.
18. Osada R., Funkhouser L., Chazelle B., Dobkin D.,: Shape distributions. ACM Tram. Graph. 21 (October 2002), 807-832. 8.
19. Schrijver A.,: Theory of linear and integer programming. John Wiley & Sons, Inc., New York, NY, USA, 1986. 5.
20. Sun I., Ovsianikov M., Guibas L.,: A concise and provably informative multi-scale signature based on heat diffusion. In SGP (2009), pp. 1383-1392. 3.
21. Wen Z., Goldfarb D., Yin W.,: Alternating direction augmented lagrangian methods for semidefinite programming. Math. Prog. Comput. 2, 3-4 (2010), 203- 230. 5.
22. Wang L., Singer A.,: Exact and stable recovery of rotations for robust synchronization. CoRR abs/1211.2441 (2012). 2.
23. Zach C., Klopschitz M., Pollefeys M.,: Disambiguating visual relations using loop constraints. In CVPR (2010), pp. 1426-1433. 2.