Optimal reconstructive tau-openings for disjoint and statistically modeled nondisjoint grains

被引:12
作者
Dougherty, ER
CuciureanZapan, C
机构
[1] Texas A&M Univ, College Station, United States
关键词
mathematical morphology; opening; optimal filter; granulometry; random set;
D O I
10.1016/S0165-1684(96)00149-1
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
When a binary granular image is sieved by a reconstructive tau-opening, some grains are entirely removed while the remaining grains are fully passed. If desired grains are viewed as composing the signal and undesired grains are viewed as noise (or clutter), then the reconstructive tau-opening acts as a filter and a basic task is to find an optimal filter. The present paper proceeds parametrically by optimally selecting a tau-opening from a Euclidean granulometry {Psi(t)}. The optimal value of t results in minimization of the expected area of the symmetric difference between the pure signal and the output of the reconstructed tau-opening applied to the noisy signal. There is no demand of similarity between filter and image generators. The general theory does not require grains to be nonintersecting. When there is grain intersection, overlapping is statistically modeled in a manner compatible with the assumption that the binary image has resulted from thresholding an image of touching or partially overlapping blobs. The watershed is postulated as a canonical segmentation procedure and filtering is performed relative to the segmented image. Error minimization is more difficult when there is grain intersection because the random geometry of the segmented grains must be described as a function of input geometry, the intersection model, and the effect of the segmentation. (C) 1997 Elsevier Science B.V.
引用
收藏
页码:45 / 58
页数:14
相关论文
共 17 条
[1]  
[Anonymous], RANDOM SETS INTEGRAL
[2]   ESTIMATION OF OPTIMAL MORPHOLOGICAL TAU-OPENING PARAMETERS BASED ON INDEPENDENT OBSERVATION OF SIGNAL AND NOISE PATTERN SPECTRA [J].
DOUGHERTY, ER ;
HARALICK, RM ;
CHEN, YD ;
AGERSKOV, C ;
JACOBI, U ;
SLOTH, PH .
SIGNAL PROCESSING, 1992, 29 (03) :265-281
[3]  
DOUGHERTY ER, 1992, COMPUT VISION GRAPH, V55
[4]  
DOUGHERTY ER, 1993, OPT ENG, V32
[5]  
GIARDINA C, 1988, MORPHOLOGICAL METHOD
[6]  
HARALICK RM, 1995, COMPUT VISION GRAPH, V57
[7]  
Heijmans HJAM., 1994, MORPHOLOGICAL IMAGE
[8]  
LOCE RP, 1992, OPT ENG, V31
[9]  
LOCE RP, 1992, VISUAL COMMUN IMAGE, V3
[10]  
MEYER F, 1990, VISUAL COMMUN IMAGE, V1