• DocumentCode
    814355
  • Title

    Labelling 2-D geometric primitives using probabilistic relaxation: reducing the computational requirements

  • Author

    Christmas, W.J. ; Kittler, J. ; Petrou, M.

  • Author_Institution
    Dept. of Electron. & Electr. Eng., Surrey Univ., Guildford, UK
  • Volume
    32
  • Issue
    4
  • fYear
    1996
  • fDate
    2/15/1996 12:00:00 AM
  • Firstpage
    312
  • Lastpage
    314
  • Abstract
    In previous work, an algorithm for matching geometric features was developed. Although the method worked well, it was demanding in computational resources when applied to large problems. The authors now present methods for reducing the computational requirements, without significantly affecting the reliability of the algorithm
  • Keywords
    computational geometry; image matching; probability; relaxation theory; 2D geometric primitives; algorithm; computation; labelling; matching; probabilistic relaxation;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19960278
  • Filename
    490939