Abstract

A cost-sensitive extension of AdaBoost based on Markov random field (MRF) priors was developed to train an ensemble segmentation process which can avoid irregular shape, isolated points and holes, leading to lower error rate. The method was applied to breast tumor segmentation in ultrasonic images. A cost function was introduced into the AdaBoost algorithm that penalizes dissimilar adjacent labels in MRF regularization. The extended AdaBoost algorithm generates a series of weak segmentation processes by sequentially selecting a process whose error rate weighted by the cost is minimum. The method was tested by generation of an ensemble segmentation process for breast tumors in ultrasonic images. This was followed by a active contour to refine the extracted tumor boundary. The segmentation performance was evaluated by tenfold cross validation test, where 300 carcinomas, 50 fibroadenomas, and 50 cysts were used. The experimental results revealed that the error rate of the proposed ensemble segmentation was two-thirds the error rate of the segmentation trained by AdaBoost without MRF. By combining the ensemble segmentation with a geodesic active contour, the average Jaccard index between the extracted tumors and the manually segmented true regions was 93.41%, significantly higher than the conventional segmentation process. A cost-sensitive extension of AdaBoost based on MRF priors provides an efficient and accurate means for the segmentation of tumors in breast ultrasound images.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.