The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2010 vol.32)
pp: 2205-2215
Michael Chertok , Bar-Ilan University, Ramat Gan
Yosi Keller , Bar-Ilan University, Ramat Gan
ABSTRACT
We present a computational approach to high-order matching of data sets in {{\hbox{\rlap{I}\kern 2.0pt{\hbox{R}}}}}^{d}. Those are matchings based on data affinity measures that score the matching of more than two pairs of points at a time. High-order affinities are represented by tensors and the matching is then given by a rank-one approximation of the affinity tensor and a corresponding discretization. Our approach is rigorously justified by extending Zass and Shashua's hypergraph matching [CHECK END OF SENTENCE] to high-order spectral matching. This paves the way for a computationally efficient dual-marginalization spectral matching scheme. We also show that, based on the spectral properties of random matrices, affinity tensors can be randomly sparsified while retaining the matching accuracy. Our contributions are experimentally validated by applying them to synthetic as well as real data sets.
INDEX TERMS
High-order assignment, probabilistic matching, spectral relaxation.
CITATION
Michael Chertok, Yosi Keller, "Efficient High Order Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.32, no. 12, pp. 2205-2215, December 2010, doi:10.1109/TPAMI.2010.51
REFERENCES
[1] D. Achlioptas and F. Mcsherry, "Fast Computation of Low-Rank Matrix Approximations," J. ACM, vol. 54, no. 2, p. 9, 2007.
[2] S. Agarwal, K. Branson, and S. Belongie, "Higher Order Learning with Graphs," Proc. Int'l Conf. Machine Learning, pp. 17-24, 2006.
[3] S. Agarwal, J. Lim, L. Zelnik-Manor, P. Perona, D. Kriegman, and S. Belongie, "Beyond Pairwise Clustering," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 838-845, 2005.
[4] B.W. Bader and T.G. Kolda, "Matlab Tensor Toolbox Version 2.2," Jan. 2007.
[5] S. Belongie, J. Malik, and J. Puzicha, "Shape Matching and Object Recognition Using Shape Contexts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, Apr. 2002.
[6] 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, vol. 1, pp. 26-33, June 2005.
[7] K.C. Chang, K. Pearson, and T. Zhang, "Perron-Frobenius Theorem for Nonnegative Tensors," Comm. Math. Sciences, vol. 6, no. 2, pp. 507-520, Dec. 2008.
[8] F. Chung, "Spectral Graph Theory," CBMS-AMS, no. 92, Am. Math. Soc., May 1997.
[9] D. Conte, P. Foggia, C. Sansone, and M. Vento, "Thirty Years of Graph Matching in Pattern Recognition," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 265-298, 2004.
[10] T. Cour, P. Srinivasan, and J. Shi, "Balanced Graph Matching," Advances in Neural Information Processing Systems 19, B. Schölkopf, J. Platt, and T. Hoffman, eds., pp. 313-320, MIT Press, 2007.
[11] O. Duchenne, F. Bach, I. Kweon, and J.J. Ponce, "A Tensor-Based Algorithm for High-Order Graph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition , pp. 1980-1987, June 2009.
[12] A. Egozi, Y. Keller, and H. Guterman, "A Probabilistic Approach to Spectral Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, to appear.
[13] 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.
[14] G.H. Golub and C.F. van Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1996.
[15] V.M. Govindu, "A Tensor Decomposition for Geometric Grouping and Segmentation," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 1150-1157, 2005.
[16] J.H. Hays, M. Leordeanu, A.A. Efros, and Y. Liu, "Discovering Texture Regularity via Higher-Order Matching" Proc. Ninth European Conf. Computer Vision, pp. 522-535, May 2006.
[17] E. Kofidis and P.A. Regalia, "On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors," SIAM J. Matrix Analysis and Applications, vol. 23, no. 3, pp. 863-884, 2001.
[18] 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, no. 3, pp. 762-767, Jan. 2003.
[19] T.G. Kolda and B.W. Bader, "Tensor Decompositions and Applications," SIAM Rev., vol. 51, no. 3, Sept. 2009.
[20] L.D. Lathauwer, B.D. Moor, and J. Vandewalle, "A Multilinear Singular Value Decomposition," SIAM J. Matrix Analysis and Applications, vol. 21, no. 4, pp. 1253-1278, 2000.
[21] L.D. Lathauwer, B.D. Moor, and J. Vandewalle, "On the Best Rank-1 and Rank-(${\rm r1,r2},\ldots,{\rm rn}$ ) Approximation of Higher-Order Tensors," SIAM J. Matrix Analysis and Applications, vol. 21, no. 4, pp. 1324-1342, 2000.
[22] M. Leordeanu and M. Hebert, "A Spectral Technique for Correspondence Problems Using Pairwise Constraints," Proc. IEEE Int'l Conf. of Computer Vision, vol. 2, pp. 1482-1489, Oct. 2005.
[23] E. Liberty, F. Woolfe, P.-G. Martinsson, V. Rokhlin, and M. Tygert, "Randomized Algorithms for the Low-Rank Approximation of Matrices," Proc. Nat'l Academy of Sciences USA, pp. 20167-20172, Dec. 2007.
[24] L.-H. Lim, "Singular Values and Eigenvalues of Tensors: A Variational Approach," Proc. First IEEE Int'l Workshop Computational Advances in Multi-Sensor Adaptive Processing, pp. 129-132, Dec. 2005.
[25] C.K. Liu, A. Hertzmann, and Z. Popović, "Learning Physics-Based Motion Style with Nonlinear Inverse Optimization," ACM Trans. Graphics, vol. 24, no. 3, pp. 1071-1081, Aug. 2005.
[26] D. Lowe, "Distinctive Image Features from Scale Invariant Keypoints," Int'l J. Computer Vision, vol. 20, pp. 91-110, 2003.
[27] J.A. Maciel and J.A.P. Costeira, "A Global Solution to Sparse Correspondence Problems," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 187-199, Feb. 2003.
[28] 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.
[29] K. Mikolajczyk, T. Tuytelaars, C. Schmid, A. Zisserman, J. Matas, F. Schaffalitzky, T. Kadir, and L. Van Gool, "A Comparison of Affine Region Detectors," Int'l J. Computer Vision, vol. 65, nos. 1/2, pp. 43-72, 2005.
[30] H. Mirzaalian, G. Hamarneh, and T. Lee, "A Graph-Based Approach to Skin Mole Matching Incorporating Template-Normalized Coordinates," Proc. IEEE Conf. Computer Vision and Pattern Recognition , pp. 2152-2159, June 2009.
[31] J. Munkres, "Algorithms for the Assignment and Transportation Problems," J. SIAM, vol. 5, no. 1, pp. 32-38, 1957.
[32] J. Philbin and A. Zisserman, "The Oxford Buildings Data Set," http://www.robots.ox.ac.uk/vgg/data/oxbuildings index.html, 2009.
[33] C. Pierre, G. Golub, L.-H. Lim, and B. Mourrain, "Symmetric Tensors and Symmetric Tensor Rank," SIAM J. Matrix Analysis and Applications, vol. 30, no. 3, pp. 1254-1279, 2008.
[34] T. Sarlos, "Improved Approximation Algorithms for Large Matrices via Random Projections," Proc. 47th Ann. IEEE Symp. Foundations of Computer Science, pp. 143-152, 2006.
[35] G. Scott and H.L. Higgins, "An Algorithm for Associating the Features of Two Images," Proc. Royal Soc. London, vol. B-244, pp. 21-26, 1991.
[36] A. Shashua, R. Zass, and T. Hazan, "Multi-Way Clustering Using Super-Symmetric Non-Negative Tensor Factorization," Proc. European Conf. Computer Vision, A. Leonardis, H. Bischof, and A. Pinz, eds., pp. 595-608, 2006.
[37] J. Shi and J. Malik, "Normalized Cuts and Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[38] L. Torresani, V. Kolmogorov, and C. Rother, "Feature Correspondence via Graph Matching: Models and Global Optimization," Proc. 10th European Conf. Computer Vision, pp. 596-609, 2008.
[39] A. Vedaldi and B. Fulkerson, "VLFeat: An Open and Portable Library of Computer Vision Algorithms," http:/www.vlfeat. org/, 2008.
[40] R. Zass and A. Shashua, "Probabilistic Graph and Hypergraph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 1-8, June 2008.
[41] D. Zhou, J. Huang, and B. Schölkopf, "Learning with Hypergraphs: Clustering, Classification, and Embedding," Advances in Neural Information Processing Systems 19, B. Schölkopf, J. Platt, and T. Hoffman, eds., pp. 1601-1608, MIT Press, 2007.
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool