The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Probabilistic graph and hypergraph matching
Abstract
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph where the complex relations are represented by hyper-edges. A match between the feature sets is then modeled as a hypergraph matching problem. We derive the hyper-graph matching problem in a probabilistic setting represented by a convex optimization. First, we formalize a soft matching criterion that emerges from a probabilistic interpretation of the problem input and output, as opposed to previous methods that treat soft matching as a mere relaxation of the hard matching problem. Second, the model induces an algebraic relation between the hyper-edge weight matrix and the desired vertex-to-vertex probabilistic matching. Third, the model explains some of the graph matching normalization proposed in the past on a heuristic basis such as doubly stochastic normalizations of the edge weights. A key benefit of the model is that the global optimum of the matching criteria can be found via an iterative successive projection algorithm. The algorithm reduces to the well known Sinkhorn [15] row/column matrix normalization procedure in the special case when the two graphs have the same number of vertices and a complete matching is desired. Another benefit of our model is the straight-forward scalability from graphs to hyper-graphs.
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
Burkard, R., Dell'Amico, M., & Martello, S. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717754 · Cited by 1,394
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
CONTE, D., FOGGIA, P., SANSONE, C., & VENTO, M. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003228 · Cited by 1,370
A spectral technique for correspondence problems using pairwise constraints
Leordeanu, M., & Hebert, M. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.20 · Cited by 1,222
Concerning nonnegative matrices and doubly stochastic matrices
Sinkhorn, R., & Knopp, P. (1967) · Pacific Journal of Mathematics · doi:10.2140/pjm.1967.21.343 · Cited by 887
Cour, T., Srinivasan, P., & Shi, J. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0044 · Cited by 443
A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
Boyle, J. P., & Dykstra, R. L. (1986) · Lecture Notes in Statistics · doi:10.1007/978-1-4613-9940-7_3 · Cited by 415
Probabilistic Subgraph Matching Based on Convex Relaxation
Schellewald, C., & Schnörr, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11585978_12 · Cited by 162
Softmax to Softassign: neural network algorithms for combinatorial optimization
Gold, S., & Rangarajan, A. (1996) · Cited by 85
A POCS-based graph matching algorithm
van Wyk, B. J., & van Wyk, M. A. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.95 · Cited by 73
Softmax to Softassign: neural network algorithms for combinatorial optimization
GoldSteven, & RangarajanAnand (1996) · doi:10.5555/235912.235919 · Cited by 70
Cited by
Deformable medical image registration: a survey
Sotiras, A., Davatzikos, C., & Paragios, N. (2013) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2265603 · Cited by 1,587
“Zass and Shashua in [291] proposed a similar formulation, while using a different optimization method.”
MethodImage 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
3-D Object Retrieval and Recognition With Hypergraph Analysis
Gao, Y., Wang, M., Tao, D., Ji, R., & Dai, Q. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2199502 · Cited by 633
A Survey on Shape Correspondence
van Kaick, O., Zhang, H., Hamarneh, G., & Cohen‐Or, D. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01884.x · Cited by 606
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
Yu, J., Rui, Y., & Tao, D. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2311377 · Cited by 550
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
Reweighted Random Walks for Graph Matching
Cho, M., Lee, J., & Lee, K. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_36 · Cited by 455
Visual-Textual Joint Relevance Learning for Tag-Based Social Image Search
Gao, Y., Wang, M., Zha, Z.-J., Shen, J., Li, X., & Wu, X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2202676 · Cited by 438
Adaptive Hypergraph Learning and its Application in Image Classification
Yu, J., Tao, D., & Wang, M. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2190083 · Cited by 405
A Tensor-Based Algorithm for High-Order Graph Matching
Duchenne, O., Bach, F., Kweon, I.-S., & Ponce, J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.110 · Cited by 358
Image retrieval via probabilistic hypergraph ranking
Huang, Y., Liu, Q., Zhang, S., & Metaxas, D. N. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540012 · Cited by 293
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
High-Order Distance-Based Multiview Stochastic Learning in Image Classification
Yu, J., Rui, Y., Tang, Y. Y., & Tao, D. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2307862 · Cited by 260
Metadata
- Authors
- Zass, R., & Shashua, A.
- Venue
- 2008 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2138910149
- Cited by
- 369
- References
- 11
- FWCI
- 13.09
- Type
- conference paper
- 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.