Discrete Relaxation for Matching Relational Structures

Abstract

Local constraint analysis ('discrete relaxation') is used to reduce ambiguity in matching pairs of relational structures. It is found empirically that if the set of possible local properties is sufficiently large, this generally results in unambiguous identifications after only a few iterations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1978
Accession Number
ADA071601

Entities

People

  • Les Kitchen

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Ambiguity
  • Applied Computer Science
  • Artificial Intelligence
  • Computer Programs
  • Computer Science
  • Computer Vision
  • Computers
  • Identification
  • Image Processing
  • Image Recognition
  • Information Processing
  • Iterations
  • Pattern Recognition
  • Recognition
  • Universities

Fields of Study

  • Economics
  • Physics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Database Systems and Applications
  • Quantum spin resonance or Electron Paramagnetic Resonance spectroscopy.