A simplex-like algorithm for the relaxation labeling process

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 th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence Jg. 11; H. 12; S. 1316 - 1321
Hauptverfasser: Zhuang, X., Haralick, R.M., Joo, H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Los Alamitos, CA IEEE 01.12.1989
IEEE Computer Society
Schlagworte:
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Convergence
Exact sciences and technology
Labeling
Linear programming
Linearity
Pattern recognition. Digital image processing. Computational geometry
Relaxation
Variational inequality
Scene analysis
Simplex method
Consistency
Labelling
Linear programming
Algorithm
Convergence
ISSN:0162-8828
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0162-8828
DOI:10.1109/34.41370