Combining low-, high-level and empirical domain knowledge for automated segmentation of ultrasonic breast lesions

被引:216
作者
Madabhushi, A
Metaxas, DN
机构
[1] Univ Penn, Dept Bioengn, Philadelphia, PA 19104 USA
[2] Rutgers State Univ, Dept Biomed Engn, Piscataway, NJ 08854 USA
[3] Rutgers State Univ, Dept Comp Sci, Piscataway, NJ 08854 USA
关键词
automatic segmentation; boundary; breast; deformable model; directional gradient; intensity; medical; seed point; texture; tumor; ultrasound;
D O I
10.1109/TMI.2002.808364
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Breast cancer is the most frequently diagnosed malignancy and the second leading cause of mortality in women [45]-[48]. In the last decade, ultrasound along with digital mammography has come to be regarded as the gold standard for breast cancer diagnosis [9], [10], [40]. Automatically detecting tumors and extracting lesion boundaries in ultrasound images is difficult due to their specular nature and the variance in shape and appearance of sonographic lesions. Past work on automated ultrasonic breast lesion segmentation has not addressed important issues such as shadowing artifacts or dealing with similar tumor like structures in the sonogram. Algorithms that claim to automatically classify ultrasonic breast lesions, rely on manual delineation of the tumor boundaries. In this paper, we present a novel technique to automatically find lesion margins in ultrasound images, by combining intensity and texture with empirical domain specific knowledge along with directional gradient and a deformable shape-based model. The images are first filtered to remove speckle noise and then contrast enhanced to emphasize the tumor regions. For the first time, a mathematical formulation of the empirical rules used by radiologists in detecting ultrasonic breast lesions, popularly known as the "Stavros Criteria" is presented in this paper. We have applied this formulation to automatically determine a seed point within the image. Probabilistic classification of image pixels based on intensity and texture is followed by region growing using the automatically determined seed point to obtain an initial segmentation of the lesion. Boundary points are found on the directional gradient of the image. Outliers are removed by a process of recursive refinement. These boundary points are then supplied as an initial estimate to a deformable model. Incorporating empirical domain specific knowledge along with low and high-level knowledge makes it possible to avoid shadowing artifacts and lowers the chance of confusing similar tumor like structures for the lesion. The system was validated on a database of breast sonograms for 42 patients. The average mean boundary error between manual and automated segmentation was 6.6 pixels and the normalized true positive area overlap vas 75.1 %. The algorithm was found to be robust to 1) variations in system parameters, 2) number of training samples used, and 3) the position of the seed point within the tumor. Running time for segmenting a single sonogram was 18 s on a 1.8-GHz Pentium machine.
引用
收藏
页码:155 / 169
页数:15
相关论文
共 54 条
[11]  
COLLARIS RJ, 1997, P IEEE ENG MED BIOL, V2, P907
[12]   Active appearance models [J].
Cootes, TF ;
Edwards, GJ ;
Taylor, CJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (06) :681-685
[13]   Analysis of mammographic microcalcifications using gray-level image structure features [J].
Dhawan, AP ;
Chitre, Y ;
KaiserBonasso, C ;
Moskowitz, M .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 1996, 15 (03) :246-259
[14]   Segmentation and interpretation of MR brain images: An improved active shape model [J].
Duta, N ;
Sonka, M .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 1998, 17 (06) :1049-1062
[15]  
GIGER M, 2000, COMPUT MED, P39
[16]   Computerized analysis of lesions in US images of the breast [J].
Giger, ML ;
Al-Hallaq, H ;
Huo, ZM ;
Moran, C ;
Wolverton, DE ;
Chan, CW ;
Zhong, WM .
ACADEMIC RADIOLOGY, 1999, 6 (11) :665-674
[17]  
GONZALES R, 1999, DIGITAL IMAGE PROCES, P41
[18]  
Guliato D, 1998, P ANN INT IEEE EMBS, V20, P1002, DOI 10.1109/IEMBS.1998.745618
[19]  
GUO D, 1999, P IEEE BMES EMBS C, V2, P1052
[20]  
Haber E, 1998, LECT NOTES COMPUT SC, V1496, P177, DOI 10.1007/BFb0056200