The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2014 vol.36)
pp: 479-492
Soonyong Park , Future IT R&D Center, Samsung Adv. Inst. of Technol., Yongin, South Korea
Sung-Kee Park , Center for Bionics, Korea Inst. of Sci. & Technol., Seoul, South Korea
Martial Hebert , Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA
ABSTRACT
This paper presents a fast and efficient computational approach to higher order spectral graph matching. Exploiting the redundancy in a tensor representing the affinity between feature points, we approximate the affinity tensor with the linear combination of Kronecker products between bases and index tensors. The bases and index tensors are highly compressed representations of the approximated affinity tensor, requiring much smaller memory than in previous methods, which store the full affinity tensor. We compute the principal eigenvector of the approximated affinity tensor using the small bases and index tensors without explicitly storing the approximated tensor. To compensate for the loss of matching accuracy by the approximation, we also adopt and incorporate a marginalization scheme that maps a higher order tensor to matrix as well as a one-to-one mapping constraint into the eigenvector computation process. The experimental results show that the proposed method is faster and requires smaller memory than the existing methods with little or no loss of accuracy.
INDEX TERMS
Tensile stress, Approximation methods, Indexes, Sparse matrices, Vectors, Redundancy, Pattern matching,approximation algorithm, Higher order graph matching, spectral relaxation
CITATION
Soonyong Park, Sung-Kee Park, Martial Hebert, "Fast and Scalable Approximate Spectral Matching for Higher Order Graph Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.36, no. 3, pp. 479-492, March 2014, doi:10.1109/TPAMI.2013.157
REFERENCES
[1] M. Brown and D.G. Lowe, "Recognising Panoramas," Proc. IEEE Int'l Conf. Computer Vision (ICCV), pp. 1218-1227, 2003.
[2] M. Leordeanu, M. Hebert, and R. Sukthankar, "Beyond Local Appearance: Category Recognition from Pairwise Interactions of Simple Features," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2007.
[3] R.C. Veltkamp and M. Tanase, "Content-Based Image Retrieval Systems: A Survey," technical report, Utrecht Univ., 2000.
[4] G.J. Brostow, J. Shotton, J. Fauqueur, and R. Cipolla, "Segmentation and Recognition Using Structure from Motion Point Clouds," Proc. European Conf. Computer Vision (ECCV), pp. 44-57, 2008.
[5] E.E. Hemayed, "A Survey of Camera Self-Calibration," Proc. IEEE Conf. Advanced Video and Signal Based Surveillance, pp. 351-357, 2003.
[6] H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
[7] G. Fielding and M. Kam, "Weighted Matchings for Dense Stereo Correspondence," Pattern Recognition, vol. 33, no. 9, pp. 1511-1524, 2000.
[8] A.C. Berg, T.L. Berg, and J. Malik, "Shape Matching and Object Recognition Using Low Distortion Correspondences," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 26-33, 2005.
[9] M. Leordeanu and M. Hebert, "A Spectral Technique for Correspondence Problems Using Pairwise Constraints," Proc. IEEE Int'l Conf. Computer Vision (ICCV), pp. 1482-1489, 2005.
[10] T. Cour, P. Srinivasan, and J. Shi, "Balanced Graph Matching," Proc. Advances in Neural Information Processing Systems (NIPS), pp. 313-320, 2006.
[11] R. Zass and A. Shashua, "Probabilistic Graph and Hypergraph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2008.
[12] M. Chertok and Y. Keller, "Efficient High Order Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, no. 12, pp. 2205-2215, Dec. 2010.
[13] O. Duchenne, F. Bach, I.-S. Kweon, and J. Ponce, "A Tensor-Based Algorithm for High-Order Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 33, no. 12, pp. 2383-2395, Dec. 2011.
[14] J. Lee, M. Cho, and K.M. Lee, "Hyper-Graph Matching via Reweighted Random Walks," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 1633-1640, 2011.
[15] R. Sinkhorn, "A Relationship between Arbitrary Positive Matrices and Doubly Stochastic Matrices," Annals Math. Statistics, vol. 35, no. 2, pp. 876-879, 1964.
[16] U Kang, M. Hebert, and S. Park, "Fast and Scalable Approximate Spectral Graph Matching for Correspondence Problems," Information Sciences, vol. 220, no. 20, pp. 306-318, 2013.
[17] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[18] K. Mikolajczyk and C. Schmid, "A Performance Evaluation of Local Descriptors," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1615-1630, Oct. 2005.
[19] G.L. Scott and H.C. Longuet-Higgins, "An Algorithm for Associating the Features of Two Images," Biological Sciences, vol. 244, no. 1309, pp. 21-26, 1991.
[20] A. Albarelli, S.R. Bulo, A. Torsello, and M. Pelillo, "Matching as a Non-Cooperative Game," Proc. IEEE Int'l Conf. Computer Vision (ICCV), pp. 1319-1326, 2009.
[21] S. Gold and A. Rangarajan, "A Graduated Assignment Algorithm for Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, Apr. 1996.
[22] J. Maciel and J. Costeira, "A Global Solution to Sparse Correspondence Problems," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 187-199, Feb. 2003.
[23] M. Cho, J. Lee, and K.M. Lee, "Reweighted Random Walks for Graph Matching," Proc. European Conf. Computer Vision (ECCV), pp. 492-505, 2010.
[24] M. Cho and K.M. Lee, "Progressive Graph Matching: Making a Move of Graphs via Probabilistic Voting," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 398-405, 2012.
[25] F. Zhou and F. De la Torre, "Factorized Graph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 127-134, 2012.
[26] E. Kofidis, Phillip, and A. Regalia, "On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors," SIAM J. Matrix Analysis and Applications, vol. 23, pp. 863-884, 2002.
[27] C.D. Martin, "Higher-Order Kronecker Products and Tensor Decompositions," PhD thesis, Cornell Univ., Aug. 2005.
[28] G.H. Golub and C.F.V. Loan, Matrix Computations. Johns Hopkins Univ. Press, 1996.
[29] J.V. Lieven De Lathauwer, B. De Moor, "On the Best Rank-1 and Rank-(r1,r2,...,rn) Approximation of Higher-Order Tensors," SIAM J. Matrix Analysis and Applications, vol. 21, no. 4, pp. 1324-1342, 2000.
[30] J. Krüger and R. Westermann, "Linear Algebra Operators for GPU Implementation of Numerical Algorithms," ACM Trans. Graphics, vol. 22, pp. 908-916, 2003.
[31] K. Lange, Numerical Analysis for Statisticians. Springer, 1999.
[32] R.A. Horn and C.R. Johnson, Matrix Analysis. Cambridge Univ. Press, 1985.
[33] T.G. Kolda, "A Counterexample to the Possibility of an Extension of the Eckart-Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition," SIAM J. Matrix Analysis and Applications, vol. 24, pp. 762-767, 2003.
[34] J.L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, 1975.
[35] D.G. Lowe, "Distinctive Image Features from Scale-Invariant Keypoints," Int'l J. Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
[36] A.M. Leroy and P.J. Rousseeuw, Robust Regression and Outlier Detection. Wiley, 2003.
[37] J. Matas, O. Chum, U. Martin, and T. Pajdla, "Robust Wide Baseline Stereo from Maximally Stable Extremal Regions," Proc. British Machine Vision Conf. (BMVC), pp. 384-393, 2002.
55 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool