A Simplex-Like Algorithm for the Relaxation Labeling Process

Authors:
X. Zhuang;R. M. Haralick;H. Joo
Affiliations:
-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1989

Citing 1
Cited 3

Generating Semantic Descriptions From Drawings of Scenes With Shadows

Generating Semantic Descriptions From Drawings of Scenes With Shadows

The Dynamics of Nonlinear Relaxation Labeling Processes

Journal of Mathematical Imaging and Vision
On the Foundations of Probabilistic Relaxationwith Product Support

Journal of Mathematical Imaging and Vision
Learning Compatibility Coefficients for Relaxation Labeling Processes

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.14

Visualization

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.