Issue No. 12 - December (1989 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.41370
<p>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.</p>
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
R. Haralick, H. Joo and X. Zhuang, "A Simplex-Like Algorithm for the Relaxation Labeling Process," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 1316-1321, 1989.