The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - Jan. (2013 vol.35)
pp: 18-27
A. Egozi , Dept. of Electr. Eng., Ben Gurion Univ., Beer-Sheva, Israel
Y. Keller , Fac. of Eng., Bar Ilan Univ., Ramat-Gan, Israel
H. Guterman , Dept. of Electr. Eng., Ben Gurion Univ., Beer-Sheva, Israel
ABSTRACT
Spectral Matching (SM) is a computationally efficient approach to approximate the solution of pairwise matching problems that are np-hard. In this paper, we present a probabilistic interpretation of spectral matching schemes and derive a novel Probabilistic Matching (PM) scheme that is shown to outperform previous approaches. We show that spectral matching can be interpreted as a Maximum Likelihood (ML) estimate of the assignment probabilities and that the Graduated Assignment (GA) algorithm can be cast as a Maximum a Posteriori (MAP) estimator. Based on this analysis, we derive a ranking scheme for spectral matchings based on their reliability, and propose a novel iterative probabilistic matching algorithm that relaxes some of the implicit assumptions used in prior works. We experimentally show our approaches to outperform previous schemes when applied to exhaustive synthetic tests as well as the analysis of real image sequences.
INDEX TERMS
Probabilistic logic, Vectors, Entropy, Reliability, Maximum likelihood estimation, Kernel, Convergence,point matching, Graphs, spectral matching, probabilistic matching
CITATION
A. Egozi, Y. Keller, H. Guterman, "A Probabilistic Approach to Spectral Graph Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.35, no. 1, pp. 18-27, Jan. 2013, doi:10.1109/TPAMI.2012.51
REFERENCES
[1] 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.
[2] 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.
[3] Y. Boykov and V. Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124-1137, Sept. 2004.
[4] T. Caetano, J. McAuley, L. Cheng, Q. Le, and A. Smola, "Learning Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 6, pp. 1048-1058, June 2009.
[5] 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.
[6] M. Chertok and Y. Keller, "Spectral Symmetry Analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, no. 7, pp. 1227-1238, July 2010.
[7] 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.
[8] T. Cour and J. Shi, "Solving Markov Random Fields with Spectral Relaxation," J. Machine Learning Research—Proc. Track, vol. 2, pp. 75-82, 2007.
[9] 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.
[10] A.D. Cross and E.R. Hancock, "Graph Matching with a Dual-Step EM Algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 11, pp. 1236-1253, Nov. 1998.
[11] S. Dasgupta, C.H. Papadimitriou, and U. Vazirani, Algorithms. McGraw-Hill, Inc., 2008.
[12] O. Duchenne, F. Bach, I. Kweon, and J. Ponce, "A Tensor-Based Algorithm for High-Order Graph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, June 2009.
[13] A. Egozi, Y. Keller, and H. Guterman, "Improving Shape Retrieval by Spectral Matching and Meta Similarity," IEEE Trans. Image Processing, vol. 19, no. 5, pp. 1319-1327, May 2010.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 1990.
[15] 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.
[16] S. Gold, A. Rangarajan, C.-P. Lu, S. Pappu, and E. Mjolsness, "New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence," Pattern Recognition, vol. 31, no. 8, pp. 1019-1031, 1998.
[17] G.H. Golub and C.F. van Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1996.
[18] 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.
[19] R.A. Hummel and S.W. Zucker, "On the Foundations of Relaxation Labeling Processes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 3, pp. 267-287, May 1983.
[20] R. Johnson, "On a Theorem Stated by Eckart and Young," Psychometrika, vol. 28, no. 3, pp. 259-263, Sept. 1963.
[21] M. Leordeanu and M. Hebert, "A Spectral Technique for Correspondence Problems Using Pairwise Constraints," Proc. 10thIEEE Int'l Conf. Computer Vision, vol. 2, pp. 1482-1489, Oct. 2005.
[22] D. Lowe, "Distinctive Image Features from Scale-Invariant Keypoints," Int'l J. Computer Vision, vol. 20, pp. 91-110, 2003.
[23] B. Luo and E. Hancock, "Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1120-1136, Oct. 2001.
[24] E. Mjolsness, "Bayesian Inference on Visual Grammars by Neural Nets that Optimize," Report YALEU/DCS/TR- 854, May 1991.
[25] J. Munkres, "Algorithms for the Assignment and Transportation Problems," J. SIAM, vol. 5, no. 1, pp. 32-38, 1957.
[26] G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization. John Wiley and Sons, 1988.
[27] A. Raj and R. Zabih, "A Graph Cut Algorithm for Generalized Image Deconvolution," Proc. 10th IEEE Int'l Conf. Computer Vision, pp. 1048-1054, 2005.
[28] A. Rangarajan and E. Mjolsness, "A Lagrangian Relaxation Network for Graph Matching," IEEE Trans. Neural Networks, vol. 7, no. 6, pp. 1365-1381, Nov. 1996.
[29] A. Rangarajan, A. Yuille, and E. Mjolsness, "Convergence Properties of the Softassign Quadratic Assignment Algorithm," Neural Computation, vol. 11, no. 6, pp. 1455-1474, 1999.
[30] C. Rother, V. Kolmogorov, and A. Blake, "'Grabcut' Interactive Foreground Extraction Using Iterated Graph Cuts," Proc. ACM Siggraph '04, pp. 309-314, 2004.
[31] G. Scott and H. Longuet-Higgins, "An Algorithm for Associating the Features of Two Images," Royal Soc., vol. B-244, pp. 21-26, 1991.
[32] R. Sinkhorn and P. Knopp, "Concerning Nonnegative Matrices and Doubly Stochastic Matrices," Pacific J. Math., vol. 21, no. 2, pp. 343-348, 1967.
[33] 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.
[34] B. van Wyk and M. van Wyk, "A POCS-Based Graph Matching Algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 11, pp. 1526-1530, Nov. 2004.
[35] H.F. Wang and E.R. Hancock, "Correspondence Matching Using Kernel Principal Components Analysis and Label Consistency Constraints," Pattern Recognition, vol. 39, no. 6, pp. 1012-1025, 2006.
[36] A.L. Yuille and A. Rangarajan, "The Concave-Convex Procedure," Neural Computation, vol. 15, no. 4, pp. 915-936, 2003.
[37] R. Zass and A. Shashua, "Probabilistic Graph and Hypergraph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 1-8, June 2008.
46 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool