Skip to main content

Advertisement

Log in

Level Set Contouring for Breast Tumor in Sonography

  • Published:
Journal of Digital Imaging Aims and scope Submit manuscript

The echogenicity, echotexture, shape, and contour of a lesion are revealed to be effective sonographic features for physicians to identify a tumor as either benign or malignant. Automatic contouring for breast tumors in sonography may assist physicians without relevant experience, in making correct diagnoses. This study develops an efficient method for automatically detecting contours of breast tumors in sonography. First, a sophisticated preprocessing filter reduces the noise, but preserves the shape and contrast of the breast tumor. An adaptive initial contouring method is then performed to obtain an approximate circular contour of the tumor. Finally, the deformation-based level set segmentation automatically extracts the precise contours of breast tumors from ultrasound (US) images. The proposed contouring method evaluates US images from 118 patients with breast tumors. The contouring results, obtained with computer simulation, reveal that the proposed method always identifies similar contours to those obtained with manual sketching. The proposed method provides robust and fast automatic contouring for breast US images. The potential role of this approach might save much of the time required to sketch a precise contour with very high stability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig 1
Fig 2
Fig 3
Fig 4
Fig 5
Fig 6
Fig 7
Fig 8
Fig 9

Similar content being viewed by others

References

  1. ACS: Breast cancer facts and figures 2003–2004. American Cancer Society, 2005

  2. Y Zheng JF Greenleaf JJ Gisvold (1997) ArticleTitleReduction of breast biopsies with a modified self-organizing map IEEE Trans Neural Netw 8 IssueID6 1386–1396 Occurrence Handle10.1109/72.641462 Occurrence Handle18255741 Occurrence Handle1:STN:280:DC%2BD1c%2FpvVertw%3D%3D

    Article  PubMed  CAS  Google Scholar 

  3. VP Jackson LW Bassett (1998) ArticleTitleBreast sonography Breast Dis 10 IssueID3-4 55–66 Occurrence Handle15687564 Occurrence Handle1:STN:280:DC%2BD2M%2FlvVWisA%3D%3D

    PubMed  CAS  Google Scholar 

  4. G Rahbar et al. (1999) ArticleTitleBenign versus malignant solid breast masses: US differentiation Radiology 213 IssueID3 889–894 Occurrence Handle10580971 Occurrence Handle1:STN:280:DC%2BD3c%2Fls1Ontg%3D%3D

    PubMed  CAS  Google Scholar 

  5. P Skaane K Engedal (1998) ArticleTitleAnalysis of sonographic features in the differentiation of fibroadenoma and invasive ductal carcinoma AJR Am J Roentgenol 170 IssueID1 109–114 Occurrence Handle9423610 Occurrence Handle1:STN:280:DyaK1c%2FosFKlug%3D%3D

    PubMed  CAS  Google Scholar 

  6. CM Chen et al. (2003) ArticleTitleBreast lesions on sonograms: computer-aided diagnosis with nearly setting-independent features and artificial neural networks Radiology 226 IssueID2 504–514 Occurrence Handle12563146 Occurrence Handle10.1148/radiol.2262011843

    Article  PubMed  Google Scholar 

  7. G York Y Kim (1999) ArticleTitleUltrasound processing and computing: Review and future directions Annu Rev Biomed Eng 1 559–588 Occurrence Handle11701500 Occurrence Handle10.1146/annurev.bioeng.1.1.559 Occurrence Handle1:CAS:528:DyaK1MXnvFyitb4%3D

    Article  PubMed  CAS  Google Scholar 

  8. RM McElhaney (1983) ArticleTitleAlgorithms for graphics and image processing Proc IEEE 71 IssueID9 1116–1117 Occurrence Handle10.1109/PROC.1983.12734

    Article  Google Scholar 

  9. HM Ladak et al. (2000) ArticleTitleProstate boundary segmentation from 2D ultrasound images Med Phys 27 IssueID8 1777–1788 Occurrence Handle10984224 Occurrence Handle10.1118/1.1286722 Occurrence Handle1:STN:280:DC%2BD3M%2FptVylsw%3D%3D

    Article  PubMed  CAS  Google Scholar 

  10. K Horsch et al. (2001) ArticleTitleAutomatic segmentation of breast lesions on ultrasound Med Phys 28 IssueID8 1652–1659 Occurrence Handle11548934 Occurrence Handle10.1118/1.1386426 Occurrence Handle1:STN:280:DC%2BD3MvpvFejtw%3D%3D

    Article  PubMed  CAS  Google Scholar 

  11. HM Overhoff et al. (2002) ArticleTitleVisualization of anatomical structures of epigastric organs by use of automatically segmented 3-D ultrasound image volumes-first results Biomed Tech (Berl) 47 IssueIDSuppl 1 Pt 2 633–635 Occurrence Handle10.1515/bmte.2002.47.s1b.633

    Article  Google Scholar 

  12. YL Huang DR Chen (2004) ArticleTitleWatershed segmentation for breast tumor in 2-D sonography Ultrasound Med Biol 30 IssueID5 625–632 Occurrence Handle15183228 Occurrence Handle10.1016/j.ultrasmedbio.2003.12.001 Occurrence Handle1:CAS:528:DC%2BD28XhvFClt74%3D

    Article  PubMed  CAS  Google Scholar 

  13. V Grau et al. (2004) ArticleTitleImproved watershed transform for medical image segmentation using prior information IEEE Trans Med Imag 23 IssueID4 447–458 Occurrence Handle10.1109/TMI.2004.824224 Occurrence Handle1:STN:280:DC%2BD2c7ovVWitg%3D%3D

    Article  CAS  Google Scholar 

  14. RJ O’Callaghan DR Bull (2005) ArticleTitleCombined morphological-spectral unsupervised image segmentation IEEE Trans Image Process 14 IssueID1 49–62 Occurrence Handle15646872 Occurrence Handle10.1109/TIP.2004.838695

    Article  PubMed  Google Scholar 

  15. S Lobregt MA Viergever (1995) ArticleTitleA discrete dynamic contour model IEEE Trans Med Imag 14 IssueID1 12–24 Occurrence Handle10.1109/42.370398 Occurrence Handle1:STN:280:DC%2BD1c%2FmtlKnuw%3D%3D

    Article  CAS  Google Scholar 

  16. Kass M, Witkin A, Terzopoulos D: Snakes-active contour models. Int J Comput Vis 321–331, 1987

  17. LD Cohen I Cohen (1993) ArticleTitleFinite-element methods for active contour models and balloons for 2-D and 3-D images IEEE Trans Pattern Anal Mach Intell 15 IssueID11 1131–1147 Occurrence Handle10.1109/34.244675

    Article  Google Scholar 

  18. S Osher J Sethian (1988) ArticleTitleFronts propagating with curvature dependent speed: Algorithms based on Hamilton–Jacobi formulations J Comput Phys 79 12–49 Occurrence Handle10.1016/0021-9991(88)90002-2

    Article  Google Scholar 

  19. MJ Black et al. (1998) ArticleTitleRobust anisotropic diffusion IEEE Trans Image Process 7 IssueID3 421–432 Occurrence Handle10.1109/83.661192 Occurrence Handle18276262 Occurrence Handle1:STN:280:DC%2BD1c7hslKlsQ%3D%3D

    Article  PubMed  CAS  Google Scholar 

  20. P Perona J Malik (1990) ArticleTitleScale-space and edge detection using anisotropic diffusion IEEE Trans Pattern Anal Mach Intell 12 IssueID7 629–639 Occurrence Handle10.1109/34.56205

    Article  Google Scholar 

  21. Whitaker RT, Xinwei X: Variable-conductance, level-set curvature for image denoising. 2001

  22. N Otsu (1979) ArticleTitleThreshold selection method from gray-level histograms IEEE Trans Syst Man Cybern 9 IssueID1 62–66 Occurrence Handle10.1109/TSMC.1979.4310076

    Article  Google Scholar 

  23. YL Huang et al. (2005) ArticleTitleImage retrieval with principal component analysis for breast cancer diagnosis on various ultrasonic systems Ultrasound Obstet Gynecol 26 IssueID5 558–566 Occurrence Handle16086435 Occurrence Handle10.1002/uog.1951

    Article  PubMed  Google Scholar 

  24. RF Chang et al. (2000) ArticleTitleComputer-aided diagnosis for surgical office-based breast ultrasound Arch Surg 135 IssueID6 696–699 Occurrence Handle10843366 Occurrence Handle10.1001/archsurg.135.6.696 Occurrence Handle1:STN:280:DC%2BD3czgtVemsA%3D%3D

    Article  PubMed  CAS  Google Scholar 

  25. DR Chen et al. (2000) ArticleTitleTexture analysis of breast tumors on sonograms Semin Ultrasound CT MR 21 IssueID4 308–316 Occurrence Handle11014253 Occurrence Handle10.1016/S0887-2171(00)90025-8 Occurrence Handle1:STN:280:DC%2BD3cvmt1ajsA%3D%3D

    Article  PubMed  CAS  Google Scholar 

  26. DR Chen RF Chang YL Huang (1999) ArticleTitleComputer-aided diagnosis applied to US of solid breast nodules by using neural networks Radiology 213 IssueID2 407–412 Occurrence Handle10551220 Occurrence Handle1:STN:280:DC%2BD3c%2FhvV2itQ%3D%3D

    PubMed  CAS  Google Scholar 

  27. P Anbeek et al. (2004) ArticleTitleProbabilistic segmentation of white matter lesions in MR imaging NeuroImage 21 IssueID3 1037–1044 Occurrence Handle15006671 Occurrence Handle10.1016/j.neuroimage.2003.10.012

    Article  PubMed  Google Scholar 

  28. CM Chen HH Lu (2000) ArticleTitleAn adaptive snake model for ultrasound image segmentation: Modified trimmed mean filter, ramp integration and adaptive weighting parameters Ultrason Imag 22 IssueID4 214–236 Occurrence Handle1:STN:280:DC%2BD3M3nsFOlug%3D%3D

    CAS  Google Scholar 

  29. JE Cates AE Lefohn RT Whitaker (2004) ArticleTitleGIST: An interactive, GPU-based level set segmentation tool for 3D medical images Med Image Anal 8 IssueID3 217–231 Occurrence Handle15450217 Occurrence Handle10.1016/j.media.2004.06.022

    Article  PubMed  Google Scholar 

Download references

Acknowledgement

The authors would like to thank the National Science Council of the Republic of China (Taiwan) for financially supporting this research under Contract No. NSC94-2213-E- 029-016.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yu-Len Huang.

Appendices

Appendix 1

Let I(x, y) denote an input image. The MCDE equation is given as

$$ f_{t} = {\left| {\nabla f} \right|}\nabla \cdot c{\left( {{\left| {\nabla f} \right|}} \right)}\frac{{\nabla f}} {{{\left| {\nabla f} \right|}}}, $$
(4)

where f = f(x,y,t) and \( f{\left( {x,y,0} \right)} = I{\left( {x,y} \right)} \). Progressively smoothed versions of the image are obtained by choosing progressively greater values of t from the solution. The conductance function c(·) is monotonically decreasing and \( c{\left( {{\left| {\nabla f} \right|}} \right)} = {k^{2} } \mathord{\left/ {\vphantom {{k^{2} } {{\left( {k^{2} + {\left| {\nabla f} \right|}^{2} } \right)}}}} \right. \kern-\nulldelimiterspace} {{\left( {k^{2} + {\left| {\nabla f} \right|}^{2} } \right)}} \), where k is a constant parameter used to determine the contrast of edges.

Appendix 2

The basic concept of level set approach is to express a closed curve as a set of 2-dimension planar curve function ΓΓ(t), which consists of the zero level set point at time t.18 Let Γ(t = 0) be a closed initial planar curve; instead of propagating the curve directly, it embeds the curve as the zero level set of a higher order function ϕ called the level set function. The function ϕ is defined by

$$ \phi {\left( {x,t = 0} \right)} = \pm d, $$
(5)

where x is a point in Euclidean plane R 2 and d is the distance from x to the initial contour Γ(0). The sign is chosen if the point x is outside (+) or inside (−) the initial contour. Thus, the initial function ϕ(x,t = 0) has the property of

$$ \Gamma {\left( 0 \right)} = {\left( {x\left| {\phi {\left( {x,t = 0} \right)} = 0} \right.} \right)}. $$
(6)

The objective is to produce an equation for the evolving function ϕ(x,t), which contains the embedded motion of Γ(t) as the level set {ϕ = 0}. Because the evolving function ϕ is always zero on the propagating hypersurface, no matter how much time t is, ϕ(x(t),t) is zero. Now, Γ(t) can be expressed as ϕ(x,t) = 0, by the chain rule, the equation can be expressed as

$$ \frac{{\partial \phi }} {{\partial t}} + \nabla \phi {\left( {x{\left( t \right)},t} \right)} \cdot x\prime {\left( t \right)} = 0. $$
(7)

Suppose F is a speed function in direction of normal vector in planar curve, then \( x\prime {\left( t \right)} \cdot \frac{{\nabla \phi }} {{{\left| {\nabla \phi } \right|}}} = F, \) where \( {\left| {\nabla \phi } \right|} \) represents the absolute gradient value of level set function. Thus, the level set evolution equation can be defined as

$$ \frac{{\partial \phi }} {{\partial t}} + F{\left| {\nabla \phi } \right|} = 0, $$
(8)

with a given value of the initial function ϕ(x,t = 0). The speed function F at any one point is based solely on the input intensity u 0 at that point:29

$$ F = - {\left( {\alpha D{\left( {u_{0} } \right)} + {\left( {1 - \alpha } \right)}\nabla \cdot \frac{{\nabla \phi }} {{{\left| {\nabla \phi } \right|}}}} \right)} $$
(9)

and

$$ D{\left( {u_{0} } \right)} = \frac{{{\left( {U - L} \right)}}} {2} - {\left( {u_{0} - \frac{{{\left( {U + L} \right)}}} {2}} \right)}, $$
(10)

where α is a free curvature parameter that controls the degree of smoothness, and U and L denote the adaptive maximal and minimal intensities in the identified ROI subimage, respectively. Figure 10 shows the surface propagation of an initial curve and the accompany movement of the level set function ϕ.

Fig 10
figure 10

Level set curve propagation: (a) the initial curve and the corresponding surface, (b) the curve and the corresponding surface at time t.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, YL., Jiang, YR., Chen, DR. et al. Level Set Contouring for Breast Tumor in Sonography. J Digit Imaging 20, 238–247 (2007). https://doi.org/10.1007/s10278-006-1041-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10278-006-1041-6

Key words

Navigation