The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Structural matching in computer vision using probabilistic relaxation
Abstract
In this paper, we develop the theory of probabilistic relaxation for matching features extracted from 2D images, derive as limiting cases the various heuristic formulae used by researchers in matching problems, and state the conditions under which they apply, We successfully apply our theory to the problem of matching and recognizing aerial road network images based on road network models and to the problem of edge matching in a stereo pair. For this purpose, each line network is represented by an attributed relational graph where each node is a straight line segment characterized by certain attributes and related with every other node via a set of binary relations.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
Ballard, D. H., & Brown, C. M. (1982) · Cited by 5,303
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Blake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
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
The Representation and Matching of Pictorial Structures
Fischler, M. A., & Elschlager, R. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223602 · Cited by 1,322
Three-dimensional object recognition
Besl, P. J., & Jain, R. C. (1985) · ACM Computing Surveys · doi:10.1145/4078.4081 · Cited by 971
On the Foundations of Relaxation Labeling Processes
Hummel, R. A., & Zucker, S. W. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767390 · Cited by 885
The Representation, Recognition, and Locating of 3-D Objects
Faugeras, O. D., & Hebert, M. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500302 · Cited by 795
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 Saliency: The Detection Of Globally Salient Structures using A Locally Connected Network
Sha'asua, A., & Ullman, S. (2005) · [1988 Proceedings] Second International Conference on Computer Vision · doi:10.1109/ccv.1988.590008 · Cited by 539
Structural indexing: efficient 3-D object recognition
Stein, F., & Medioni, G. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121785 · Cited by 488
Localizing Overlapping Parts by Searching the Interpretation Tree
Grimson, W. E. L., & Lozano-Perez, T. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767935 · Cited by 458
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
Analog "neuronal" networks in early vision.
Koch, C., Marroquin, J., & Yuille, A. (1986) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.83.12.4263 · Cited by 278
Shape Matching Using Relaxation Techniques
Davis, L. S. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766876 · Cited by 264
Signal matching through scale space
Witkin, A., Terzopoulos, D., & Kass, M. (1987) · International Journal of Computer Vision · doi:10.1007/bf00123162 · Cited by 228
A New Probabilistic Relaxation Scheme
Peleg, S. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4767035 · Cited by 185
Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach
Faugeras, O. D., & Berthod, M. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767127 · Cited by 181
Model-Based Image Matching Using Location
Baird, H. S. (1985) · Medical Entomology and Zoology · Cited by 171
Representation and Shape Matching of 3-D Objects
Bhanu, B. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767527 · Cited by 157
Edge-labeling using dictionary-based relaxation
Hancock, E. R., & Kittler, J. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.44403 · Cited by 133
Self-citationRelaxation and constrained optimization by local processes
Ullman, S. (1979) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(79)90045-5 · Cited by 123
Matching: Invariant to translations, rotations and scale changes
Li, S. Z. (1992) · Pattern Recognition · doi:10.1016/0031-3203(92)90075-t · Cited by 114
Three-dimensional object recognition
Flynn, P. J., & Jain, A. K. (1994) · Academic Press, Inc. eBooks · Cited by 72
Philosophical Foundations of Probability Theory
Weatherford, R. C. (2022) · Routledge eBooks · doi:10.4324/9781003306993 · Cited by 57
Probabilistic relaxation for matching problems in computer vision
Kittler, J., Christmas, W. J., & Petrou, M. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1993.378148 · Cited by 56
Self-citationGraph Optimal Monomorphism Algorithms
Ghahraman, D. E., Wong, A. K. C., & Au, T. (1980) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1980.4308468 · Cited by 54
Automatic registration of aerial photographs and digitized maps
Li, S. Z., Kittler, J., & Petrou, M. (1993) · Optical Engineering · doi:10.1117/12.134184 · Cited by 6
Self-citation
Cited by
A survey of medical image registration
Maintz, J. B. A., & Viergever, M. A. (1998) · Medical Image Analysis · doi:10.1016/s1361-8415(01)80026-8 · Cited by 3,327
A (sub)graph isomorphism algorithm for matching large graphs
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.75 · Cited by 1,477
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 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 graph distance metric based on the maximal common subgraph
Bunke, H., & Shearer, K. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00179-7 · Cited by 754
Metadata
- Authors
- Christmas, W. J., Kittler, J., & Petrou, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995
- Volume
- 17
- Issue
- 8
- Pages
- 749-764
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2136761100
- Cited by
- 495
- References
- 31
- FWCI
- 19.23
- 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.