Fast and Scalable Approximate Spectral Matching for Higher Order Graph Matching
暂无分享,去创建一个
[1] Phillip A. Regalia,et al. On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors , 2001, SIAM J. Matrix Anal. Appl..
[2] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[3] Elsayed E. Hemayed,et al. A survey of camera self-calibration , 2003, Proceedings of the IEEE Conference on Advanced Video and Signal Based Surveillance, 2003..
[4] Jean Ponce,et al. A Tensor-Based Algorithm for High-Order Graph Matching , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] João Paulo Costeira,et al. A Global Solution to Sparse Correspondence Problems , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[6] Rüdiger Westermann,et al. Linear algebra operators for GPU implementation of numerical algorithms , 2003, SIGGRAPH Courses.
[7] Minsu Cho,et al. Hyper-graph matching via reweighted random walks , 2011, CVPR 2011.
[8] Joos Vandewalle,et al. On the Best Rank-1 and Rank-(R1 , R2, ... , RN) Approximation of Higher-Order Tensors , 2000, SIAM J. Matrix Anal. Appl..
[9] 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.
[10] Cordelia Schmid,et al. A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Roberto Cipolla,et al. Segmentation and Recognition Using Structure from Motion Point Clouds , 2008, ECCV.
[12] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[13] Andrea Torsello,et al. Matching as a non-cooperative game , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[14] Martial Hebert,et al. Fast and scalable approximate spectral graph matching for correspondence problems , 2013, Inf. Sci..
[15] Minsu Cho,et al. Reweighted Random Walks for Graph Matching , 2010, ECCV.
[16] Fernando De la Torre,et al. Factorized Graph Matching , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[17] Richard Sinkhorn. A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .
[18] Remco C. Veltkamp,et al. Content-based image retrieval systems: A survey , 2000 .
[19] Moshe Kam,et al. Weighted matchings for dense stereo correspondence , 2000, Pattern Recognit..
[20] Minsu Cho,et al. Progressive graph matching: Making a move of graphs via probabilistic voting , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[21] 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.
[22] Harold W. Kuhn,et al. The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.
[23] G LoweDavid,et al. Distinctive Image Features from Scale-Invariant Keypoints , 2004 .
[24] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[25] Jianbo Shi,et al. Balanced Graph Matching , 2006, NIPS.
[26] 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.
[27] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[28] Peter J. Rousseeuw,et al. Robust regression and outlier detection , 1987 .
[29] Jiri Matas,et al. Robust wide-baseline stereo from maximally stable extremal regions , 2004, Image Vis. Comput..
[30] Amnon Shashua,et al. Probabilistic graph and hypergraph matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[31] 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).
[32] Matthew A. Brown,et al. Recognising panoramas , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[33] Yosi Keller,et al. Efficient High Order Matching , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[34] Kenneth Lange,et al. Numerical analysis for statisticians , 1999 .
[35] Jiri Matas,et al. Robust wide-baseline stereo from maximally stable extremal regions , 2004, Image Vis. Comput..
[36] M. SIAMJ.. A COUNTEREXAMPLE TO THE POSSIBILITY OF AN EXTENSION OF THE ECKART – YOUNG LOW-RANK APPROXIMATION THEOREM FOR THE ORTHOGONAL RANK TENSOR DECOMPOSITION , 2003 .
[37] Steven Gold,et al. A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..