A method for finding curves in digital images with speckle noise is described. The solution method differs from standard linear convolutions followed by thresholds in that it explicitly allows curvature in the features. Maximum a posteriori (MAP) estimation is used, together with statistical models for the speckle noise and for the curve-generation process, to find the most probable estimate of the feature, given the image data. The estimation process is first described in general terms. Then, incorporation of the specific neighborhood system and a multiplicative noise model for speckle allows derivation of the solution, using dynamic programming, of the estimation problem. The detection of curvilinear features is considered separately. The detection results allow the determination of the minimal size of detectable feature. Finally, the estimation of linear features, followed by a detection step, is shown for computer-simulated images and for a SAR image of sea ice.
[1]
David B. Cooper,et al.
Implementation, Interpretation, and Analysis of a Suboptimal Boundary Finding Algorithm
,
1982,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2]
N. Nahi,et al.
Estimation-detection of object boundaries in noisy images
,
1978
.
[3]
Alan C. Bovik,et al.
On detecting edges in speckle imagery
,
1988,
IEEE Trans. Acoust. Speech Signal Process..
[4]
A. Lopes,et al.
A statistical and geometrical edge detector for SAR images
,
1988
.
[5]
Ugo Montanari,et al.
On the optimal detection of curves in noisy pictures
,
1971,
CACM.
[6]
David B. Cooper,et al.
Maximum Likelihood Estimation of Markov-Process Blob Boundaries in Noisy Images
,
1979,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7]
H. Elliott,et al.
Aspects of dynamic programming in signal and image processing
,
1981
.