[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Optimizing the CAD Process for Detecting Mammographic Lesions by a New Generation Algorithm Using Linear Classifiers and a Gradient Based Approach

  • Conference paper
Digital Mammography (IWDM 2008)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5116))

Included in the following conference series:

Abstract

This study evaluates the performance of a new generation algorithm designed to both increase detection sensitivity of cancers and to markedly reduce the false mark rate. In the advanced algorithm, several improvements were implemented. The algorithm for the initial detection of potential mass candidates was upgraded to ignore dense areas that do not represent masses. For the initial detection of potential clusters candidates, the advanced algorithm considers interdependence between various stages of the parametric clusterization process and implements automatic performance optimization. Moreover, the advanced algorithm includes a one-step global classification model, which assigns a score to each candidate lesion, instead of sequential multi-step filtration at various steps of the algorithm. Both the advanced and the previous algorithm were run on 83 malignant cases, with proven pathology, and on 523 normal screening cases that were consecutively culled from 4 clinical sites. The overall sensitivity of the advanced algorithm was 86%, compared to a sensitivity of 84% for the previous one. The false mark (FM) rate per case, decreased from 3.20 for the previous algorithm, to 1.39 for the advanced one. The advanced algorithm reduced both mass FMs and cluster FMs. In conclusion, the new algorithm outperforms the old one with a slight increase in sensitivity and with a substantial reduction in false mark rate for both masses and clusters.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kim, S.J., Moon, W.K., Cho, N., Cha, J.H., Kim, S.M., Im, J.G.: Computer-aided detection in full-field digital mammography: sensitivity and reproducibility in serial examinations. Radiology 246, 71–80 (2008)

    Article  Google Scholar 

  2. Toussaint, G.: Computational geometric problems in pattern recognition. In: Kittler, J., Fu, K.S., Pau, L.F. (eds.) Pattern recognition theory and applications, Dordrecht, pp. 73–91. The Netherlands, Reidel (1982)

    Google Scholar 

  3. Kim, S.J., Moon, W.K., Cho, N., Cha, J.H., Kim, S.M., Im, J.: Computer-aided detection in digital mammography: comparison of craniocaudal, mediolateral oblique, and mediolateral views. Radiology 241, 695–701 (2006)

    Article  Google Scholar 

  4. Yang, S.K., Moon, W.K., Cho, N., et al.: Screening Mammography-detected Cancers: Sensitivity of a Computer-aided Detection System Applied to Full-Field Digital Mammograms. Radiology 244, 104–111 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Elizabeth A. Krupinski

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bamberger, P., Leichter, I., Merlet, N., Ratner, E., Fung, G., Lederman, R. (2008). Optimizing the CAD Process for Detecting Mammographic Lesions by a New Generation Algorithm Using Linear Classifiers and a Gradient Based Approach. In: Krupinski, E.A. (eds) Digital Mammography. IWDM 2008. Lecture Notes in Computer Science, vol 5116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70538-3_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70538-3_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70537-6

  • Online ISBN: 978-3-540-70538-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics