This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Adaptive Relaxation Labeling
March 1984 (vol. 6 no. 3)
pp. 369-372
H. M. Kalayeh, Object Recognition Systems, Inc., Princeton, NJ 08540.
D. A. Landgrebe, Engineering Experiment Station, Purdue University, West Lafayette, IN 47906.
Current implementation of probabilistic relaxation labeling (PRL) is based on stationary compatibility coefficients (SCC's). Such labeling frequently diverges from an achieved minimum labeling error. In this correspondence it is shown that by having nonstationary compatibility coefficients (NSCC's) the PRL stabilizes about the minimum error which is obtained during the early iterations. Also, a noniterative labeling algorithm which uses NSCC and has a performance similar to that of the modified PRL is suggested.
Citation:
H. M. Kalayeh, D. A. Landgrebe, "Adaptive Relaxation Labeling," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 3, pp. 369-372, March 1984, doi:10.1109/TPAMI.1984.4767530
Usage of this product signifies your acceptance of the Terms of Use.