A novel segmentation method for convex lesions based on dynamic programming with local intra-class variance

  • Authors:
  • Mali Yu;Qiliang Huang;Renchao Jin;Enmin Song;Hong Liu;Chih-Cheng Hung

  • Affiliations:
  • Huazhong University of Science and Technology, Wuhan, China;Second People's Hospital of Nanning, Nanning, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;State University, Georgia

  • Venue:
  • Proceedings of the 27th Annual ACM Symposium on Applied Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lesion segmentation plays an important role in medical image processing and analysis. There exist several successful dynamic programming (DP) based segmentation methods for general images. In those methods, the gradient is used as an important factor in the cost function to attract the contours to the boundaries. Since medical images have their characteristics such as low contrast, blurred edges and high noises, the gradient operator cannot work well enough to achieve a satisfactory performance for boundary detection. We define the local intra-class variance and combine it with the dynamic programming method to replace the traditional gradient operation. Experiments on synthetic and X-ray images are carried out and the results are compared with Canny and fast multilevel fuzzy edge detection (FMFED) algorithms. It is demonstrated that the proposed method performs better on medical images with low contrast, blurred edges and high noises. In addition, 483 regions of interest of mammograms randomly extracted from DDSM of the University of South Florida are used to compare our proposed method with the plane-fitting and dynamic programming method (PFDP), and the normalized cut segmentation method (Ncut). The results demonstrate that our method is more accurate and robust than PFDP and Ncut.