DocumentCode :
804230
Title :
On achievable accuracy in edge localization
Author :
Kakarala, Ramakrishna ; Hero, Alfred O.
Author_Institution :
Dept. of Math., California Univ., Irvine, CA, USA
Volume :
14
Issue :
7
fYear :
1992
fDate :
7/1/1992 12:00:00 AM
Firstpage :
777
Lastpage :
781
Abstract :
Edge localization occurs when an edge detector determines the location of an edge in an image. The authors use statistical parameter estimation techniques to derive bounds on achievable accuracy in edge localization. These bounds, known as the Cramer-Rao bounds, reveal the effect on localization of factors such as signal-to-noise ratio (SNR), extent of edge observed, scale of smoothing filter, and a priori uncertainty about edge intensity. By using continuous values for both image coordinates and intensity, the authors focus on the effect of these factors prior to sampling and quantization. They also analyze the Canny algorithm and show that for high SNR, its mean squared error is only a factor of two higher than the lower limit established by the Cramer-Rao bound. Although this is very good, the authors show that for high SNR, the maximum-likelihood estimator, which is also derived, virtually achieves the lower bound
Keywords :
filtering and prediction theory; parameter estimation; pattern recognition; picture processing; statistical analysis; Canny algorithm; Cramer-Rao bounds; S/N ratio; achievable accuracy; edge localization; image coordinates; image intensity; maximum-likelihood estimator; pattern recognition; picture processing; quantization; sampling; smoothing filter; statistical parameter estimation; Algorithm design and analysis; Detectors; Filters; Image edge detection; Image sampling; Parameter estimation; Quantization; Signal to noise ratio; Smoothing methods; Uncertainty;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/34.142913
Filename :
142913
Link To Document :
بازگشت