Abstract

We propose a modification of Wells et al. technique for bias field estimation and segmentation of magnetic resonance (MR) images. We show that replacing the class other, which includes all tissue not modeled explicitly by Gaussians with small variance, by a uniform probability density, and amending the expectation-maximization (EM) algorithm appropriately, gives significantly better results. We next consider the estimation and filtering of high-frequency information in MR images, comprising noise, intertissue boundaries, and within tissue microstructures. We conclude that post-filtering is preferable to the prefiltering that has been proposed previously. We observe that the performance of any segmentation algorithm, in particular that of Wells et al. (and our refinements of it) is affected substantially by the number and selection of the tissue classes that are modeled explicitly, the corresponding defining parameters and, critically, the spatial distribution of tissues in the image. We present an initial exploration to choose automatically the number of classes and the associated parameters that give the best output. This requires us to define what is meant by "best output" and for this we propose the application of minimum entropy. The methods developed have been implemented and are illustrated throughout on simulated and real data (brain and breast MR).

Keywords

Computer scienceEntropy (arrow of time)Image segmentationSegmentationAlgorithmArtificial intelligenceNoise (video)Pattern recognition (psychology)MaximizationImage (mathematics)MathematicsMathematical optimization

Affiliated Institutions

Related Publications

Publication Info

Year
1997
Type
article
Volume
16
Issue
3
Pages
238-251
Citations
326
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

326
OpenAlex

Cite This

R. Guillemaud, Michael Brady (1997). Estimating the bias field of MR images. IEEE Transactions on Medical Imaging , 16 (3) , 238-251. https://doi.org/10.1109/42.585758

Identifiers

DOI
10.1109/42.585758