
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Mikhail Zaslavskiy, Francis Bach, JeanPhilippe Vert, "A Path Following Algorithm for the Graph Matching Problem," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 22272242, December, 2009.  
BibTex  x  
@article{ 10.1109/TPAMI.2008.245, author = {Mikhail Zaslavskiy and Francis Bach and JeanPhilippe Vert}, title = {A Path Following Algorithm for the Graph Matching Problem}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {31}, number = {12}, issn = {01628828}, year = {2009}, pages = {22272242}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2008.245}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  A Path Following Algorithm for the Graph Matching Problem IS  12 SN  01628828 SP2227 EP2242 EPD  22272242 A1  Mikhail Zaslavskiy, A1  Francis Bach, A1  JeanPhilippe Vert, PY  2009 KW  Graph algorithms KW  graph matching KW  convex programming KW  gradient methods KW  machine learning KW  classification KW  image processing. VL  31 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] R.S.T. Lee and J.N.K. Liu, “An Oscillatory Elastic Graph Matching Model for Recognition of Offline Handwritten Chinese Characters,” Proc. Third Int'l Conf. KnowledgeBased Intelligent Information Eng. Systems, pp. 284287, 1999.
[2] A. Filatov, A. Gitis, and I. Kil, “GraphBased Handwritten Digit String Recognition,” Proc. Third Int'l Conf. Document Analysis and Recognition, pp. 845848, 1995.
[3] 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. 10121025, June 2006.
[4] B. Luo and E.R. Hancock, “Alignment and Correspondence Using Singular Value Decomposition,” Lecture Notes in Computer Science, vol. 1876, pp. 226235, Springer, 2000.
[5] M. Carcassoni and E.R. Hancock, “Spectral Correspondence for Point Pattern Matching,” Pattern Recognition, vol. 36, pp. 193204, 2002.
[6] C. Schellewald and C. Schnor, “Probabilistic Subgraph Matching Based on Convex Relaxation,” Lecture Notes in Computer Science, vol. 3757, pp. 171186, Springer, 2005.
[7] R. Singh, J. Xu, and B. Berger, “Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology,” Proc. 11th Int'l Conf. Research in Computational Molecular Biology, 2007.
[8] Y. Wang, F. Makedon, J. Ford, and H. Huang, “A Bipartite Graph Matching Framework for Finding Correspondences between Structural Elements in Two Proteins,” Proc. IEEE 26th Ann. Int'l Conf. Eng. in Medicine and Biology Society, pp. 29722975, 2004.
[9] W.R. Taylor, “Protein Structure Comparison Using Bipartite Graph Matching and Its Application to Protein Structure Classification,” Molecular and Cellular Proteomics, vol. 1, no. 4, pp. 334339, 2002.
[10] D.C. Schmidt and L.E. Druffel, “A Fast Backtracking Algorithm for Test Directed Graphs for Isomorphism,” J. ACM, vol. 23, no. 3, pp. 433445, 1976.
[11] J.R. Ullmann, “An Algorithm for Subgraph Isomorphism,” J. ACM, vol. 23, no. 1, pp. 3142, 1976.
[12] L.P. Cordella, P. Foggia, C. Sansone, and M. Vento, “Performance Evaluation of the vf Graph Matching Algorithm,” Proc. 10th Int'l Conf. Image Analysis and Processing, vol. 2, pp. 10381041, 1991.
[13] S. Umeyama, “An Eigendecomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695703, Sept. 1988.
[14] L.S. Shapiro and J.M. Brady, “FeatureBased Correspondence,” Image and Vision Computing, vol. 10, pp. 283288, 1992.
[15] T. Caelli and S. Kosinov, “An Eigenspace Projection Clustering Method for Inexact Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 4, pp. 515519, Apr. 2004.
[16] H. Almohamad and S. Duffuaa, “A Linear Programming Approach for the Weighted Graph Matching Problem,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 5, pp. 522525, May 1993.
[17] S. Gold and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377388, Apr. 1996.
[18] D. Cremers, T. Kohlberger, and C. Schnor, “Evaluation of Convex Optimization Techniques for the Weighted GraphMatching Problem in Computer Vision,” Proc. 23rd DAGMSymp. Pattern Recognition, vol. 2191, 2001.
[19] 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. 509522, Apr. 2002.
[20] K. Brein, M. Remm, and E. Sonnhammer, “Inparanoid: A Comprehensive Database of Eukaryotic Orthologs,” Nucleic Acids Research, vol. 33, 2005.
[21] M.R. Garey and D.S. Johnson, Computer and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman, 1979.
[22] J.M. Borwein and A.S. Lewis, Convex Analysis and Nonlinear Optimization. SpringerVerlag, 2000.
[23] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2003.
[24] L.F. McGinnis, “Implementation and Testing of a PrimalDual Algorithm for the Assignment Problem,” Operations Research, vol. 31, no. 2, pp. 277291, 1983.
[25] 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, pp. 265298, 2004.
[26] G.H. Golub and C.F.V. Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1996.
[27] L.F. McGinnis, “Implementation and Testing of a PrimalDual Algorithm for the Assignment Problem,” Operations Research, vol. 31, pp. 277291, 1983.
[28] H. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research, vol. 2, pp. 8397, 1955.
[29] M. Frank and P. Wolfe, “An Algorithm for Quadratic Programming,” Naval Research Logistics Quarterly, vol. 3, pp. 95110, 1956.
[30] F.R.K. Chung, Spectral Graph Theory. Am. Math. Soc., 1997.
[31] R. Rockafeller, Convex Analysis. Princeton Univ. Press, 1970.
[32] K.M. Anstreicher and N.W. Brixius, “A New Bound for the Quadratic Assignment Problem Based on Convex Quadratic Programming,” Math. Programming, vol. 89, no. 3, pp. 341357, 2001.
[33] A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.
[34] E. Allgower and K. Georg, Numerical Continuation Methods. Springer, 1990.
[35] J. Milnor, Topology from the Differentiable Viewpoint. Univ. Press of Virginia, 1969.
[36] D. Bertsekas, Nonlinear Programming. Athena Scientific, 1999.
[37] M.E.J. Newman, S.H. Strogatz, and D.J. Watts, “Random Graphs with Arbitrary Degree Distributions and Their Applications,” Physical Rev., vol. 64, 2001.
[38] E. Cela, “Quadratic Assignment Problem Library,” www.opt. math.tugraz.ac.atqaplib/, 2007.
[39] T. Walter, J.C. Klein, P. Massin, and A. Erignay, “Detection of the Median Axis of Vessels in Retinal Images,” European J. Ophthalmology, vol. 13, no. 2, 2003.
[40] F. Bookstein, “Principal Warps: ThinPlate Splines and the Decomposition of Deformations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 6, pp. 567585, June 1989.
[41] T. Saito, H. Yamada, and K. Yamamoto, “On the Data Base etl9b of Handprinted Characters in jis Chinese Characters and Its Analysis,” IEICE Trans., vol. 68, no. 4, pp. 757764, 1985.