• DocumentCode
    749946
  • Title

    A simplex-like algorithm for the relaxation labeling process

  • Author

    Zhuang, Xinhua ; Haralick, Robert M. ; Joo, Hyonam

  • Author_Institution
    Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA
  • Volume
    11
  • Issue
    12
  • fYear
    1989
  • fDate
    12/1/1989 12:00:00 AM
  • Firstpage
    1316
  • Lastpage
    1321
  • Abstract
    A simplex-like algorithm is developed for the relaxation labeling process. The algorithm is simple and has a fast convergence property which is summarized as a one-more-step theorem. The algorithm is based on fully exploiting the linearity of the variational inequality and the linear convexity of the consistent-labeling search space in a manner similar to the operation of the simplex algorithm in linear programming
  • Keywords
    convergence of numerical methods; linear programming; pattern recognition; relaxation theory; consistent-labeling search space; fast convergence property; linear programming; one-more-step theorem; relaxation labeling process; simplex-like algorithm; variational inequality; Convergence; Labeling; Linear programming; Linearity;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/34.41370
  • Filename
    41370