|
| 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
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1984.4767530, author = {H. M. Kalayeh and D. A. Landgrebe}, title = {Adaptive Relaxation Labeling}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {6}, number = {3}, issn = {0162-8828}, year = {1984}, pages = {369-372}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1984.4767530}, 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 - Adaptive Relaxation Labeling IS - 3 SN - 0162-8828 SP369 EP372 EPD - 369-372 A1 - H. M. Kalayeh, A1 - D. A. Landgrebe, PY - 1984 VL - 6 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
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.