A computer-aided detection system for clustered microcalcifications.

OBJECTIVE: The aim of this paper is to describe a novel system for computer-aided detection of clusters of microcalcifications on digital mammograms. METHODS AND MATERIAL: Mammograms are first segmented by means of a tree-structured Markov random field algorithm that extracts the elementary homogeneous regions of interest. An analysis of such regions is then performed by means of a two-stage, coarse-to-fine classification based on both heuristic rules and classifier combination. In this phase, we avoid taking a decision on the single microcalcifications and forward it to the successive phase of clustering realized through a sequential approach. RESULTS: The system has been tested on a publicly available database of mammograms and compared with previous approaches. The obtained results show that the system is very effective, especially in terms of sensitivity. CONCLUSIONS: The proposed approach exhibits some remarkable advantages both in segmentation and classification phases. The segmentation phase employs an image model that reduces the computational burden, preserving the small details in the image through an adaptive local estimation of all model parameters. The classification stage combines the results of the classifiers focused on the single microcalcification and the cluster as a whole. Such an approach makes a detection system particularly effective and robust with respect to the large variations exhibited by the clusters of microcalcifications.

A tree-structured Markov random field model for Bayesian image segmentation.

We present a new image segmentation algorithm based on a tree-structured binary MRF model. The image is recursively segmented in smaller and smaller regions until a stopping condition, local to each region, is met. Each elementary binary segmentation is obtained as the solution of a MAP estimation problem, with the region prior modeled as an MRF. Since only binary fields are used, and thanks to the tree structure, the algorithm is quite fast, and allows one to address the cluster validation problem in a seamless way. In addition, all field parameters are estimated locally, allowing for some spatial adaptivity. To improve segmentation accuracy, a split-and-merge procedure is also developed and a spatially adaptive MRF model is used. Numerical experiments on multispectral images show that the proposed algorithm is much faster than a similar reference algorithm based on "flat" MRF models, and its performance, in terms of segmentation accuracy and map smoothness, is comparable or even superior.