Dense Non-rigid Point-Matching Using Random Projections
暂无分享,去创建一个
[1] Pietro Perona,et al. One-shot learning of object categories , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[3] Cordelia Schmid,et al. A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4] H. Opower. Multiple view geometry in computer vision , 2002 .
[5] S. Ullman. Aligning pictorial descriptions: An approach to object recognition , 1989, Cognition.
[6] 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.
[7] Alexander J. Smola,et al. Learning Graph Matching , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[8] Ahmed M. Elgammal,et al. Putting local features on a manifold , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[9] Michael Brady,et al. Feature-based correspondence: an eigenvector approach , 1992, Image Vis. Comput..
[10] Santosh S. Vempala,et al. The Random Projection Method , 2005, DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
[11] Jean Ponce,et al. A Tensor-Based Algorithm for High-Order Graph Matching , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[13] Ahmed M. Elgammal,et al. One-shot multi-set non-rigid feature-spatial matching , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[14] Antonio Torralba,et al. SIFT Flow: Dense Correspondence across Different Scenes , 2008, ECCV.
[15] Josef Stoer,et al. Numerische Mathematik 1 , 1989 .
[16] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[17] Francesca Odone,et al. SVD-matching using SIFT features , 2006, Graph. Model..
[18] G LoweDavid,et al. Distinctive Image Features from Scale-Invariant Keypoints , 2004 .
[19] Gene H. Golub,et al. Singular value decomposition and least squares solutions , 1970, Milestones in Matrix Computation.
[20] Xilin Shen,et al. Analysis of Event-Related fMRI Data Using Diffusion Maps , 2005, IPMI.
[21] Vladimir Kolmogorov,et al. Feature Correspondence Via Graph Matching: Models and Global Optimization , 2008, ECCV.
[22] David G. Lowe,et al. Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[23] Jianbo Shi,et al. Balanced Graph Matching , 2006, NIPS.
[24] Jean Ponce,et al. A graph-matching kernel for object categorization , 2011, 2011 International Conference on Computer Vision.
[25] F. Glover. Maximum matching in a convex bipartite graph , 1967 .
[26] Shinji Umeyama,et al. An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..
[27] George Bebis,et al. Face recognition experiments with random projection , 2005, SPIE Defense + Commercial Sensing.
[28] Garrison W. Cottrell,et al. Non-Linear Dimensionality Reduction , 1992, NIPS.
[29] Mikhail Belkin,et al. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.
[30] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[31] H. C. Longuet-Higgins,et al. An algorithm for associating the features of two images , 1991, Proceedings of the Royal Society of London. Series B: Biological Sciences.
[32] Daniel Rueckert,et al. Nonrigid registration using free-form deformations: application to breast MR images , 1999, IEEE Transactions on Medical Imaging.