This Article 
 Bibliographic References 
 Add to: 
A Simplex-Like Algorithm for the Relaxation Labeling Process
December 1989 (vol. 11 no. 12)
pp. 1316-1321

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.

[1] R. Hummel and S. Zucker, "On the foundations of relaxation labeling processes,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, p. 267, 1983.
[2] D. Kinderlehrer and G. Stampacchia,An Introduction to Variational Inequalities and Their Applications. New York: Academic, 1980.
[3] A. Rosenfeld, R. Hummel, and S. Zucker, "Scene labeling by relaxation operations,"IEEE Trans. Syst., Man, Cybern., vol. SMC-6, p. 420, 1976.
[4] D. Waltz, "Generating semantic descriptions from drawings of scenes with shadows," MAC-AI-TR-271, Mass. Inst. Technol., Cambridge, 1972.

Index Terms:
simplex-like algorithm; relaxation labeling process; fast convergence property; one-more-step theorem; variational inequality; consistent-labeling search space; linear programming; convergence of numerical methods; linear programming; pattern recognition; relaxation theory
X. Zhuang, R.M. Haralick, H. Joo, "A Simplex-Like Algorithm for the Relaxation Labeling Process," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 12, pp. 1316-1321, Dec. 1989, doi:10.1109/34.41370
Usage of this product signifies your acceptance of the Terms of Use.