Unsupervised Learning for Graph Matching
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Graph matching is an essential problem in computer vision that has been successfully applied to 2D and 3D feature matching and object recognition. Despite its importance, little has been published on learning the parameters that control graph matching, even though learning has been shown to be vital for improving the matching rate. In this paper we show how to perform parameter learning in an unsupervised fashion, that is when no correct correspondences between graphs are given during training. Our experiments reveal that unsupervised learning compares favorably to the supervised case, both in terms of efficiency and quality, while avoiding the tedious manual labeling of ground truth correspondences. We verify experimentally that our learning method can improve the performance of several state-of-the art graph matching algorithms. We also show that a similar method can be successfully applied to parameter learning for graphical models and demonstrate its effectiveness empirically.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shape matching and object recognition using shape contexts
Belongie, S., Malik, J., & Puzicha, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.993558 · Cited by 6,306
An algorithm for quadratic programming
Frank, M., & Wolfe, P. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030109 · Cited by 3,030 · cited 1×
“It is also related to the Frank-Wolfe method (FW) (Frank and Wolfe 1956), a classical optimization algorithm from 1956 most often used in operations research.”
MethodA graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090 · cited 2×
“2006) (SMAC), graduated assignment (Gold and Rangarajan 1996) (GA), probabilistic graph matching (Zass and Shashua 2008) (PM) and our Integer Projected Fixed Point Algorithm (Leordeanu et al.”
MethodLearning CRFs Using Graph Cuts
Szummer, M., Kohli, P., & Hoiem, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_43 · Cited by 243 · cited 1×
“algorithm, which is related to Szummer et al. (2008) and”
Cited by
Image Matching from Handcrafted to Deep Features: A Survey
Ma, J., Jiang, X., Fan, A., Jiang, J., & Yan, J. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01359-2 · Cited by 990
Zhang, L., & Koch, R. (2013) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2013.05.006 · Cited by 536
A review of multimodal image matching: Methods and applications
Jiang, X., Ma, J., Xiao, G., Shao, Z., & Guo, X. (2021) · Information Fusion · doi:10.1016/j.inffus.2021.02.012 · Cited by 532
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
FOGGIA, P., PERCANNELLA, G., & VENTO, M. (2014) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001414500013 · Cited by 337
Zhou, F., & De la Torre, F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247667 · Cited by 272
Metadata
- Authors
- Leordeanu, M., Sukthankar, R., & Hebert, M.
- Venue
- International Journal of Computer Vision
- Published
- 2011-04-14
- Volume
- 96
- Issue
- 1
- Pages
- 28-45
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W2152953631
- Cited by
- 201
- References
- 4
- FWCI
- 10.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.