Fast and scalable approximate spectral graph matching for correspondence problems
暂无分享,去创建一个
[1] Martial Hebert,et al. Preliminary Development of a Line Feature-Based Object Recognition System for Textureless Indoor Objects , 2007 .
[2] Zhengyou Zhang,et al. Iterative point matching for registration of free-form curves and surfaces , 1994, International Journal of Computer Vision.
[3] Steven Gold,et al. A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..
[4] Lance R. Williams,et al. Segmentation of Multiple Salient Closed Contours from Real Images , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Martial Hebert,et al. Beyond Local Appearance: Category Recognition from Pairwise Interactions of Simple Features , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[7] Paul J. Besl,et al. A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Minsu Cho,et al. Reweighted Random Walks for Graph Matching , 2010, ECCV.
[9] Richard Sinkhorn. A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .
[10] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[11] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[12] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[13] Jean Ponce,et al. A tensor-based algorithm for high-order graph matching , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[14] Matthew A. Brown,et al. Recognising panoramas , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[15] John F. Canny,et al. A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] G. Stewart,et al. Matrix Perturbation Theory , 1990 .
[17] Michael I. Jordan,et al. Link Analysis, Eigenvectors and Stability , 2001, IJCAI.
[18] Amnon Shashua,et al. Probabilistic graph and hypergraph matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[19] Jitendra Malik,et al. Shape matching and object recognition using low distortion correspondences , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[20] Minsu Cho,et al. Hyper-graph matching via reweighted random walks , 2011, CVPR 2011.
[21] Martial Hebert,et al. A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[22] James J. Little,et al. Vision-based global localization and mapping for mobile robots , 2005, IEEE Transactions on Robotics.
[23] Mignon Park,et al. Vision-based global localization for mobile robots with hybrid maps of objects and spatial layouts , 2009, Inf. Sci..
[24] João Paulo Costeira,et al. A Global Solution to Sparse Correspondence Problems , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[25] Jitendra Malik,et al. Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.
[26] Sung-Kee Park,et al. Spectral scan matching and its application to global localization for mobile robots , 2010, 2010 IEEE International Conference on Robotics and Automation.
[27] Gene H. Golub,et al. Matrix computations , 1983 .
[28] Kenneth Lange,et al. Numerical analysis for statisticians , 1999 .
[29] Carlo Tomasi,et al. Good features to track , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.
[30] Jianbo Shi,et al. Balanced Graph Matching , 2006, NIPS.
[31] Andrew Zisserman,et al. Wide baseline stereo matching , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).
[32] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.