Fetching the paper…
Reading the bibliography…
We propose a fast approximate algorithm for large graph matching.
J. Von Neumann, Functional Operators , vol. II. Princeton University Press, 1950
1950
Earlier work this paper cites.
H.W. Kuhn, ”The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly , vol. 2, nos. 1/2, pp. 83-97, 1955
1955
Earlier work this paper cites.
R. Sinkhorn, ”A Relationship between Arbitrary Positive Matrices and Doubly Stochastic Matrices,” Annals Math. and Statistics , vol. 35, pp. 876-879, 1964
1964
Earlier work this paper cites.
E.H, Zarantonello, ”Projections on Convex Sets in Hilbert Space and Spectral Theory,” Contributions to Nonlinear Functional Analysis , pp. 237-424, Academic Press, New York, 1971
1971
Earlier work this paper cites.
M.A. Fischler and R.A. Elschlager, ”The Representation and Matching of Pictorial Structures,” IEEE Trans. Computers vol. 22 no. 1, Jan. 1973
1973
Earlier work this paper cites.
J.R. Ullman, ”An Algorithm for Subgraph Isomorphism,” J. ACM, vol. 23, no. 1, pp. 31-42, Jan. 1976
1976
Earlier work this paper cites.
A. Rosenfeld, R.A. Hummel, and S.W. Zucker, ”Scene Labeling by Relaxation Operations,” IEEE Trans. Systems, Man, and Cybernetics , vol. 6, no. 6, pp. 420-433, 1976
1976
Earlier work this paper cites.
W.H. Tsai and K.S. Fu, ”Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis,” IEEE Trans. Systems, Man, and Cybernetics , vol. 9, no. 12 pp. 757-768, Dec. 1979
1979
Earlier work this paper cites.
B.D. McKay, ”Practical Graph Isomorphism,” Congressus Numerantium , vol. 30, pp. 45-87, 1981
1981
Earlier work this paper cites.
L.G. Shapiro and R.M. Haralick, ”Structural Descriptions and Inexact Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 3, no. 5 pp. 504-519, Sept. 1981
1981
Earlier work this paper cites.
D.C. Youla and H. Webb, ”Image Restoration by the Method of Convex Projections: Part 1 - Theory,” IEEE Trans. Medical Imaging , vol. 1, no. 2, Oct. 1982
1982
Earlier work this paper cites.
R.A. Hummel and S.W. Zucker, ”On The Foundations of Relaxation Labeling Procesesses,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 5, no. 3, pp. 267-286, 1983
1983
Earlier work this paper cites.
P.H. Calamai, ”Projected Gradient Methods for Linearly Constrained Problems,” Mathematical Programming , vol. 39, no. 1, Oct. 1987
1987
Earlier work this paper cites.
S. Umeyama, ”An Eigendecomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 10, no. 5, pp. 695-703, Sept. 1988
1988
Earlier work this paper cites.
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. 522-525, May 1993
1993
Cited alongside, same era.
A. Filatov, A. Gitis, and I. Kil, ”Graph-Based Handwritten Digit String Recognition,” Proc. Third Int’l Conf. Document Analysis and Recognition , pp. 845-848, 1995
1995
Cited alongside, same era.
W.J. Christmas, J. Kittler, and M. Petrou, ”Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 17, no. 8, pp. 749-764, Aug. 1995
1995
Cited alongside, same era.
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
1996
Cited alongside, same era.
D. Conte, P. Foggia, C. Sansone, and M. Vento, ”Thirty Years of Graph Matching in Pattern Recognition,” Int’l J. of Pattern Recognition and Aritificial Intelligence , vol. 18, no. 3, pp. 265-298, 2004
2004
Later among the works it cites.
L.P. Cordella, P. Foggia, C. Sansone, and M. Vento, ”A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 26, no. 10, pp. 1367-1372, Oct. 2004
2004
Later among the works it cites.
B.J. van Wyk and M.A. van Wyk, ”A POCS-Based Graph Matching Algorithm,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 26, no. 11, Nov. 2004
2004
Later among the works it cites.
2004
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Bunke and B.T. Messmer, ”Recent Advances in Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 11, pp. 169-203, 1997
1997
Cited alongside, same era.
L. Wiskott, J.M. Fellous, N. Krüer, and C. von der Malsburg, ”Face Recognition by Elastic Bunch Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 19, no. 7, pp. 775-779, July 1997
1997
Cited alongside, same era.
R.E. Burkard, E. Cela, P.M. Pardalos, and L.S. Pitsoulis, ”The Quadratic assignment problem,” Handbook of Combinatorial Optimization , 1998
1998
Cited alongside, same era.
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. Knowledge-Based Intelligent Information Eng. Systems , pp. 284-287, 1999
1999
Cited alongside, same era.
K. Siddiqi, A. Shokoufandeh, S.J. Dickinson, and S.W. Zucker, ”Shock Graphs and Shape Matching,” Int’l J. Computer Vision , vol. 35, no. 1, pp. 13-32, 1999
1999
Cited alongside, same era.
B. Huet and E.R. Hancock, ”Shape Recognition From Large Image Libraries by Inexact Graph Matching,” Pattern Recognition Letters , vol. 20, no. 11-13, pp. 1259-1269, Nov. 1999
1999
Cited alongside, same era.
A. Rangarajan, A. Yuille, and E. Mjolsness, ”Convergence Properties of the Sofassign Quadratic Assignment Algorithm,” Neural Computation , vol. 11, pp. 1455-1474, 1999
1999
Cited alongside, same era.
S. Berretti, A.D. Bimbo, and E. Vicario, ”Efficient Matching and Indexing of Graph Models in Content-Based Retrieval,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 23, no. 10, pp. 1089-1105, Oct. 2001
2001
Cited alongside, same era.
A.C. Berg, T.L. Berg, and J. Malik, ”Shape Matching and Object Recognition Using Low Distortion Correspondences,” IEEE Int’l Conf. Computer Vision and Pattern Recognition , vol. 1, pp. 26-33, 2005
2005
Later among the works it cites.
M. Leordeanu and M. Hebert, ”A Spectral Technique for Correspondence Problems Using Pairwise Constraints,” Proc. Int’l Conf. Computer Vision , 2005
2005
Later among the works it cites.
Y. Zheng and D. Doermann, ”Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 28, no. 4, pp. 643-649, April 2006
2006
Later among the works it cites.
T. Cour, P. Srinivasan, and J. Shi, ”Balanced Graph Matching,” Proc. Advances in Neural Information Processing Systems , pp. 313-320, 2006
2006
Later among the works it cites.
R. Zass and A. Shashua, ”Doubly Stochastic Normalization for Spectral Clustering,” Proc. Advances in Neural Information Processing Systems , 2007
2007
Later among the works it cites.
L. Torresani, V. Kolmogorov, and C. Rother, ”Feature Correspondence via Graph Matching: Models and Global Optimization,” Proc. European Conf. on Computer Vision , pp. 596-609, 2008
2008
Later among the works it cites.
R. Zass and A. Shashua, ”Probabilistic Graph and Hypergraph Matching,” IEEE Int’l Conf. on Computer Vision and Pattern Recognition , pp. 1-8, 2008
2008
Later among the works it cites.
M. Leordeanu, M. Hebert, and R. Sukthankar, ”An Integer Projected Fixed Point Method for Graph Matching and MAP Inference,” Proc. Advances in Neural Information Processing Systems , pp. 1114-1122, 2009
2009
Later among the works it cites.
M. Zaslavskiy, F. Bach, and J.P. Vert, ”A Path Following Algorithm for the Graph Matching Problem,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 31, no. 12, pp. 2227-2242, Dec. 2009
2009
Later among the works it cites.
M. Cho, J. Lee, and K.M. Lee, ”Reweighted Random Walks for Graph Matching,” Proc. European Conf. on Computer Vision , pp. 492-505, 2010
2010
Later among the works it cites.