The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Structural matching by discrete relaxation
Open accessAbstract
This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we focus on the issue of how relational inexactness may be quantified. We illustrate that several popular relational distance measures can be recovered as specific limiting cases of the Bayesian consistency measure. The second aspect of our comparison concerns the way in which structural inexactness is controlled. We investigate three different realizations of the matching process which draw on contrasting control models. The main conclusion of our study is that the active process of graph-editing outperforms the alternatives in terms of its ability to effectively control a large population of contaminating clutter.
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
An introduction to simulated evolutionary optimization
Fogel, D. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265956 · Cited by 1,503
Scene Labeling by Relaxation Operations
Rosenfeld, A., Hummel, R. A., & Zucker, S. W. (1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309519 · Cited by 1,399
A 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
A distance measure between attributed relational graphs for pattern recognition
Sanfeliu, A., & Fu, K.-S. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313167 · Cited by 999
Structural Descriptions and Inexact Matching
Shapiro, L. G., & Haralick, R. M. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767144 · Cited by 544
Structural matching in computer vision using probabilistic relaxation
Christmas, W. J., Kittler, J., & Petrou, M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400565 · Cited by 495
Parallel and deterministic algorithms from MRFs: surface reconstruction
Geiger, D., & Girosi, F. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.134040 · Cited by 447
Genetic algorithms and tabu search: Hybrids for optimization
Glover, F., Kelly, J. P., & Laguna, M. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0023-m · Cited by 306
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
Wong, A. K. C., & You, M. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767707 · Cited by 291
3-D shape recovery using distributed aspect matching
Dickinson, S. J., Pentland, A. P., & Rosenfeld, A. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121788 · Cited by 249
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Glover, F. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90211-9 · Cited by 218
CAD-based computer vision: from CAD models to relational graphs
Flynn, P. J., & Jain, A. K. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.67642 · Cited by 160
3-D object recognition using bipartite matching embedded in discrete relaxation
Kim, W.-Y., & Kak, A. C. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.75511 · Cited by 123
Structure of metastable states in the Hopfield model
Gardner, E. (1986) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/19/16/017 · Cited by 118
Pattern recognition by graph matching using the Potts MFT neural networks
Suganthan, P. N., Teoh, E. K., & Mital, D. P. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00166-j · Cited by 78
Constrained Nets for Graph Matching and Other Quadratic Assignment Problems
Simić, P. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.268 · Cited by 70
A Bayesian interpretation for the Hopfield network
Hancock, E. R., & Kittler, J. (2002) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1993.298580 · Cited by 13
Self-citationDeterministic search strategies for relational graph matching
Williams, M., Wilson, R. C., & Hancock, E. R. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62909-2_85 · Cited by 4
Self-citation
Cited by
Content-based image retrieval at the end of the early years
Smeulders, A. W. M., Worring, M., Santini, S., Gupta, A., & Jain, R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.895972 · Cited by 6,056
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
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 survey of graph edit distance
Gao, X., Xiao, B., Tao, D., & Li, X. (2010) · Pattern Analysis and Applications · doi:10.1007/s10044-008-0141-y · Cited by 704
Zhang, L., & Koch, R. (2013) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2013.05.006 · Cited by 536
Metadata
- Authors
- Wilson, R. C., & Hancock, E. R.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1997-06
- Volume
- 19
- Issue
- 6
- Pages
- 634-648
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2098109165
- Cited by
- 311
- References
- 19
- FWCI
- 21.84
- Type
- journal article
- Language
- en
- Open access
- green
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.