ML Anthology

Relational Matching with Dynamic Graph Structures

Richard C. Wilson, Edwin R. Hancock
ICCV 1995 pp. 450-456
doi:10.1109/ICCV.1995.466905 /iccv/1995/wilson1995iccv-relational/

Abstract

The paper describes a novel approach to relational matching problems in machine vision. Rather than matching static scene descriptions, the approach adopts an active representation of the data to be matched. This representation is iteratively reconfigured to increase its degree of topological congruency with the model relational structure in a reconstructive matching process. The active reconfiguration of relational structures is controlled by a MAP update process. The final restored graph representation is optimal in the sense that it has maximum a posteriori probability with respect to the available attributes for the objects under match. The benefits of the technique are demonstrated experimentally on the matching of cluttered synthetic aperture radar data to a model in the form of a digital map. The operational limits of the method are established in a simulation study. >

ICCV Semantic Scholar

Cite

Text

Wilson and Hancock. "Relational Matching with Dynamic Graph Structures." IEEE/CVF International Conference on Computer Vision, 1995. doi:10.1109/ICCV.1995.466905

Markdown

[Wilson and Hancock. "Relational Matching with Dynamic Graph Structures." IEEE/CVF International Conference on Computer Vision, 1995.](https://mlanthology.org/iccv/1995/wilson1995iccv-relational/) doi:10.1109/ICCV.1995.466905

BibTeX

@inproceedings{wilson1995iccv-relational,
  title     = {{Relational Matching with Dynamic Graph Structures}},
  author    = {Wilson, Richard C. and Hancock, Edwin R.},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {1995},
  pages     = {450-456},
  doi       = {10.1109/ICCV.1995.466905},
  url       = {https://mlanthology.org/iccv/1995/wilson1995iccv-relational/}
}