CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1996 vol.18 Issue No.04 - April
Issue No.04 - April (1996 vol.18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.491624
<p><b>Abstract</b>—This paper presents a new scheme for probabilistic relaxation labeling that consists of an update function and a dictionary construction method. The nonlinear update function is derived from Markov Random Field theory and Bayes' formula. The method combines evidence from neighboring label assignments and eliminates label ambiguity efficiently. This result is important for a variety of image processing tasks, such as image restoration, edge enhancement, edge detection, pixel classification, and image segmentation.</p><p>We successfully applied this method to edge detection. The relaxation step of the proposed edge-detection algorithm greatly reduces noise effects, gets better edge localization such as line ends and corners, and plays a crucial role in refining edge outputs. The experiments show that our algorithm converges quickly and is robust in noisy environments.</p>
Probabilistic relaxation, dictionary scheme, MRF, edge detection.
Weian Deng, S. Sitharama Iyengar, "A New Probabilistic Relaxation Scheme and Its Application to Edge Detection", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.18, no. 4, pp. 432-437, April 1996, doi:10.1109/34.491624