A Simplex-Like Algorithm for the Relaxation Labeling Process

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by X. Zhuang Articles by R.M. Haralick Articles by H. Joo

December 1989 (vol. 11 no. 12)

pp. 1316-1321

	ASCII Text	x
	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, December, 1989.

	BibTex	x
	@article{ 10.1109/34.41370, author = {X. Zhuang and R.M. Haralick and H. Joo}, title = {A Simplex-Like Algorithm for the Relaxation Labeling Process}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {11}, number = {12}, issn = {0162-8828}, year = {1989}, pages = {1316-1321}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.41370}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - A Simplex-Like Algorithm for the Relaxation Labeling Process IS - 12 SN - 0162-8828 SP1316 EP1321 EPD - 1316-1321 A1 - X. Zhuang, A1 - R.M. Haralick, A1 - H. Joo, PY - 1989 KW - 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 VL - 11 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER -

X. Zhuang

R.M. Haralick

H. Joo

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.41370

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] 1316R. 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

Citation:

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.