Fetching the paper…
Reading the bibliography…
We consider the general setting for partial matching of two or multiple graphs, in the sense that not necessarily all the nodes in one graph can find their correspondences in another graph and vice versa.
H. W. Kuhn, “The hungarian method for the assignment problem,” in Export. Naval Research Logistics Quarterly , 1955, pp. 83–97
1955
Earlier work this paper cites.
S. Gold and A. Rangarajan, “A graduated assignment algorithm for graph matching,” IEEE TPAMI , vol. 18, pp. 377–388, 1996
1996
Earlier work this paper cites.
C. Bregler, A. Hertzmann, and H. Biermann, “Recovering non-rigid 3d shape from image streams,” in CVPR , vol. 2, 2000, pp. 690–696
2000
Earlier work this paper cites.
D. Shen and C. D. Hammer, “Hierarchical attribute matching mechanism for elastic registration,” TMI , 2002
2002
Earlier work this paper cites.
A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” in NeurIPS , 2002, pp. 849–856
2002
Earlier work this paper cites.
G. Griffin, A. Holub, and P. Perona, “Caltech-256 object category dataset,” California Institute of Technology, Tech. Rep., 2007
2007
Earlier work this paper cites.
M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, and A. Zisserman, “The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results,” http://www.pascal-network.org/challenges/VOC/voc2007/workshop/index.html
2007
Earlier work this paper cites.
L. D. Bourdev and J. Malik, “Poselets: Body part detectors trained using 3d human pose annotations,” ICCV , pp. 1365–1372, 2009
2009
Earlier work this paper cites.
M. Cho, J. Lee, and K. M. Lee, “Reweighted random walks for graph matching,” in ECCV , 2010, pp. 492–505
2010
Earlier work this paper cites.
M. Everingham, L. Gool, C. K. Williams, J. Winn, and A. Zisserman, “The pascal visual object classes (voc) challenge,” IJCV , vol. 88, no. 2, p. 303–338, Jun. 2010
2010
Earlier work this paper cites.
S. Baker, D. Scharstein, J. Lewis, S. Roth, M. J. Black, and R. Szeliski, “A database and evaluation methodology for optical flow,” IJCV , vol. 92, no. 1, pp. 1–31, 2011
2011
Earlier work this paper cites.
J. Lee, M. Cho, and K. M. Lee, “Hyper-graph matching via reweighted random walks,” in CVPR , 2011, pp. 1633–1640
2011
Earlier work this paper cites.
R. P. Adams and R. S. Zemel, “Ranking via sinkhorn propagation,” arXiv:1106.1925 , 2011
2011
Earlier work this paper cites.
Y. Tian, J. Yan, H. Zhang, Y. Zhang, X. Yang, and H. Zha, “On the convergence of graph matching: Graduated assignment revisited,” in ECCV , 2012
2012
Earlier work this paper cites.
D. Pachauri, R. Kondor, and V. Singh, “Solving the multi-way matching problem by permutation synchronization,” in NeurIPS , 2013, pp. 1860–1868
2013
Earlier work this paper cites.
Q.-X. Huang and L. Guibas, “Consistent shape maps via semidefinite programming,” in Computer Graphics Forum , vol. 32, no. 5. Wiley Online Library, 2013, pp. 177–186
2013
Earlier work this paper cites.
M. Cho, A. Karteek, and J. Ponce, “Learning graphs to match,” ICCV , pp. 25–32, 2013
2013
Earlier work this paper cites.
D. Sun, S. Roth, and M. J. Black, “A quantitative analysis of current practices in optical flow estimation and the principles behind them,” IJCV , vol. 106, no. 2, pp. 115–137, 2014
2014
Earlier work this paper cites.
Y. Chen, L. Guibas, and Q. Huang, “Near-optimal joint object matching via convex relaxation,” in ICML , 2014, pp. 100–108
2014
Earlier work this paper cites.
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” in ICLR , 2014
2014
Earlier work this paper cites.
J. Yan, J. Wang, H. Zha, X. Yang, and S. Chu, “Consistency-driven alternating optimization for multigraph matching: A unified approach,” IEEE TIP , vol. 24, no. 3, pp. 994–1009, 2015
2015
Earlier work this paper cites.
X. Zhou, M. Zhu, and K. Daniilidis, “Multi-image matching via fast alternating minimization,” in ICCV , 2015, pp. 4032–4040
2015
Cited alongside, same era.
J. Yan, M. Cho, H. Zha, X. Yang, and S. M. Chu, “Multi-graph matching via affinity optimization with graduated consistency regularization,” IEEE TPAMI , vol. 38, no. 6, pp. 1228–1242, 2015
2015
Cited alongside, same era.
J. Yan, C. Zhang, H. Zha, W. Liu, X. Yang, and S. Chu, “Discrete hyper-graph matching,” in CVPR , 2015
2015
Cited alongside, same era.
H. Nam and B. Han, “Learning multi-domain convolutional neural networks for visual tracking,” in CVPR , 2016, pp. 4293–4302
2016
Cited alongside, same era.
W. Luo, A. G. Schwing, and R. Urtasun, “Efficient deep learning for stereo matching,” in CVPR , 2016, pp. 5695–5703
2016
Cited alongside, same era.
R. Wang, J. Yan, and X. Yang, “Learning combinatorial embedding networks for deep graph matching,” in ICCV , 2019, pp. 3056–3065
2019
Later among the works it cites.
P. Swoboda, A. Mokarian, C. Theobalt, F. Bernard et al. , “A convex relaxation for multi-graph matching,” in CVPR , 2019, pp. 11 156–11 165
2019
Later among the works it cites.
Z. Zhang and W. S. Lee, “Deep graphical feature learning for the feature matching problem,” in ICCV , 2019, pp. 5087–5096
2019
Later among the works it cites.
M. V. Pogančić, A. Paulus, V. Musil, G. Martius, and M. Rolinek, “Differentiation of blackbox combinatorial solvers,” in ICLR , 2019
2019
Later among the works it cites.
U. Iqbal, A. Milan, and J. Gall, “Posetrack: Joint multi-person pose estimation and tracking,” in CVPR , 2017, pp. 2011–2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Yan, X.-C. Yin, W. Lin, C. Deng, H. Zha, and X. Yang, “A short survey of recent advances in graph matching,” in ICMR , 2016
2016
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in CVPR , 2016, pp. 770–778
2016
Cited alongside, same era.
F. Zhou and F. Torre, “Factorized graph matching,” IEEE TPAMI , 2016
2016
Cited alongside, same era.
2017
Cited alongside, same era.
Z. Cao, T. Simon, S.-E. Wei, and Y. Sheikh, “Realtime multi-person 2d pose estimation using part affinity fields,” in CVPR , 2017, pp. 7291–7299
2017
Cited alongside, same era.
N. Dym, H. Maron, and Y. Lipman, “Ds++ a flexible, scalable and provably tight relaxation for matching problems,” ACM Transactions on Graphics (TOG) , vol. 36, no. 6, pp. 1–14, 2017
2017
Cited alongside, same era.
P. Swoboda, C. Rother, H. Abu Alhaija, D. Kainmuller, and B. Savchynskyy, “A study of lagrangean decompositions and dual ascent solvers for graph matching,” in CVPR , 2017, pp. 1607–1616
2017
Cited alongside, same era.
J. Yan, S. Yang, and E. Hancock, “Learning graph matching and related combinatorial optimization problems,” in IJCAI , 2020
2020
Later among the works it cites.
T. Wang, H. Liu, Y. Li, Y. Jin, X. Hou, and H. Ling, “Learning combinatorial solver for graph matching,” in CVPR , 2020, pp. 7568–7577
2020
Later among the works it cites.
M. Rolínek, P. Swoboda, D. Zietlow, A. Paulus, V. Musil, and G. Martius, “Deep graph matching via blackbox differentiation of combinatorial solvers,” in ECCV , 2020, pp. 407–424
2020
Later among the works it cites.
T. Wang, Z. Jiang, and J. Yan, “Clustering-aware multiple graph matching via decayed pairwise matching composition,” AAAI , 2020
2020
Later among the works it cites.
R. Wang, J. Yan, and X. Yang, “Graduated assignment for joint multi-graph matching and clustering with application to unsupervised graph matching network learning.” in NeurIPS , 2020
2020
Later among the works it cites.
R. Wang, J. Yan, and X. Yang, “Combinatorial learning of robust deep graph matching: an embedding based approach,” IEEE TPAMI , 2020
2020
Later among the works it cites.
T. Yu, R. Wang, J. Yan, and B. Li, “Learning deep graph matching with channel-independent embedding and hungarian attention,” in ICLR , 2020
2020
Later among the works it cites.
M. Rolínek, P. Swoboda, D. Zietlow, A. Paulus, V. Musil, and G. Martius, “Deep graph matching via blackbox differentiation of combinatorial solvers,” in ECCV , 2020, pp. 407–424
2020
Later among the works it cites.
2020
Later among the works it cites.
F. Wang, N. Xue, J.-G. Yu, and G.-S. Xia, “Zero-assignment constraint for graph matching with outliers,” in CVPR , 2020, pp. 3033–3042
2020
Later among the works it cites.
Z. Chen, Z. Xie, J. Yan, Y. Zheng, and X. Yang, “Layered neighborhood expansion for incremental multiple graph matching,” in ECCV , 2020
2020
Later among the works it cites.
Z. Jiang, T. Wang, and J. Yan, “Unifying offline and online multi-graph matching via finding shortest paths on supergraph,” IEEE TPAMI , vol. 43, no. 10, pp. 3648–3663, 2021
2021
Later among the works it cites.
R. Wang, J. Yan, and X. Yang, “Neural graph matching network: Learning lawler’s quadratic assignment problem with extension to hypergraph and multiple-graph matching,” IEEE TPAMI , 2021
2021
Later among the works it cites.
T. Yu, R. Wang, J. Yan, and B. Li, “Deep latent graph matching,” in ICML , 2021, pp. 12 187–12 197
2021
Later among the works it cites.
Y. Bai, D. Xu, Y. Sun, and W. Wang, “Glsearch: Maximum common subgraph detection via learning to search,” in ICML , 2021, pp. 588–598
2021
Later among the works it cites.