Selecting canonical views for view-based 3-D object recognition
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Gene H. Golub,et al. Matrix computations , 1983 .
[3] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.
[4] Kim-Chuan Toh,et al. SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .
[5] Michel X. Goemans,et al. Semideenite Programming in Combinatorial Optimization , 1999 .
[6] Sanjeev Mahajan,et al. Derandomizing Approximation Algorithms Based on Semidefinite Programming , 1999, SIAM J. Comput..
[7] Jitendra Malik,et al. Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..
[8] B. Kimia,et al. 3D object recognition using shape similiarity-based aspect graph , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[9] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[10] M. Fatih Demirci,et al. Many-to-many graph matching via metric embedding , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..
[11] J. Koenderink,et al. The internal representation of solid shape with respect to vision , 1979, Biological Cybernetics.
[12] Ali Shokoufandeh,et al. Shock Graphs and Shape Matching , 1998, International Journal of Computer Vision.
[13] Ali Shokoufandeh,et al. Approximation of canonical sets and their applications to 2D view simplification , 2004, CVPR 2004.