A modified fuzzy C-means algorithm for bias field estimation and segmentation of MRI data

An Adaptive Calibration Framework for mVEP-Based Brain-Computer Interface

Electroencephalogram signals and the states of subjects are nonstationary. To track changing states effectively, an adaptive calibration framework is proposed for the brain-computer interface (BCI) with the motion-onset visual evoked potential (mVEP) as the control signal. The core of this framework is to update the training set adaptively for classifier training. The updating procedure consists of two operations, that is, adding new samples to the training set and removing old samples from the training set. In the proposed framework, a support vector machine (SVM) and fuzzy C-mean clustering (fCM) are combined to select the reliable samples for the training set from the blocks close to the current blocks to be classified. Because of the complementary information provided by SVM and fCM, they can guarantee the reliability of information fed into classifier training. The removing procedure will aim to remove those old samples recorded a relatively long time before current new blocks. These two operations could yield a new training set, which could be used to calibrate the classifier to track the changing state of the subjects. Experimental results demonstrate that the adaptive calibration framework is effective and efficient and it could improve the performance of online BCI systems.

Brain extraction in partial volumes T2*@7T by using a quasi-anatomic segmentation with bias field correction

BACKGROUND

Poor brain extraction in Magnetic Resonance Imaging (MRI) has negative consequences in several types of brain post-extraction such as tissue segmentation and related statistical measures or pattern recognition algorithms. Current state of the art algorithms for brain extraction work on weighted T1 and T2, being not adequate for non-whole brain images such as the case of T2*FLASH@7T partial volumes.

NEW METHOD

This paper proposes two new methods that work directly in T2*FLASH@7T partial volumes. The first is an improvement of the semi-automatic threshold-with-morphology approach adapted to incomplete volumes. The second method uses an improved version of a current implementation of the fuzzy c-means algorithm with bias correction for brain segmentation.

RESULTS

Under high inhomogeneity conditions the performance of the first method degrades, requiring user intervention which is unacceptable. The second method performed well for all volumes, being entirely automatic.

COMPARISON WITH EXISTING METHODS

State of the art algorithms for brain extraction are mainly semi-automatic, requiring a correct initialization by the user and knowledge of the software. These methods can't deal with partial volumes and/or need information from atlas which is not available in T2*FLASH@7T. Also, combined volumes suffer from manipulations such as re-sampling which deteriorates significantly voxel intensity structures making segmentation tasks difficult. The proposed method can overcome all these difficulties, reaching good results for brain extraction using only T2*FLASH@7T volumes.

CONCLUSIONS

The development of this work will lead to an improvement of automatic brain lesions segmentation in T2*FLASH@7T volumes, becoming more important when lesions such as cortical Multiple-Sclerosis need to be detected.

Rodent Abdominal Adipose Tissue Imaging by MR

Rodents including rats and mice are important models to study obesity, diabetes, and metabolic syndrome in a preclinical setting. Translational and longitudinal imaging of these rodents permit investigation of metabolic diseases and identification of imaging biomarkers suitable for clinical translation. Here we describe the imaging protocols for achieving quantitative abdominal imaging in small animals followed by segmentation and quantification of fat volumes.

Towards a Systematic Combination of Dimension Reduction and Clustering in Visual Analytics

Dimension reduction algorithms and clustering algorithms are both frequently used techniques in visual analytics. Both families of algorithms assist analysts in performing related tasks regarding the similarity of observations and finding groups in datasets. Though initially used independently, recent works have incorporated algorithms from each family into the same visualization systems. However, these algorithmic combinations are often ad hoc or disconnected, working independently and in parallel rather than integrating some degree of interdependence. A number of design decisions must be addressed when employing dimension reduction and clustering algorithms concurrently in a visualization system, including the selection of each algorithm, the order in which they are processed, and how to present and interact with the resulting projection. This paper contributes an overview of combining dimension reduction and clustering into a visualization system, discussing the challenges inherent in developing a visualization system that makes use of both families of algorithms.

A Hard C-Means Clustering Algorithm Incorporating Membership KL Divergence and Local Data Information for Noisy Image Segmentation

In this paper, the standard hard C-means (HCM) clustering approach to image segmentation is modified by incorporating weighted membership Kullback–Leibler (KL) divergence and local data information into the HCM objective function. The membership KL divergence, used for fuzzification, measures the proximity between each cluster membership function of a pixel and the locally-smoothed value of the membership in the pixel vicinity. The fuzzification weight is a function of the pixel to cluster-centers distances. The used pixel to a cluster-center distance is composed of the original pixel data distance plus a fraction of the distance generated from the locally-smoothed pixel data. It is shown that the obtained membership function of a pixel is proportional to the locally-smoothed membership function of this pixel multiplied by an exponentially distributed function of the minus pixel distance relative to the minimum distance provided by the nearest cluster-center to the pixel. Therefore, since incorporating the locally-smoothed membership and data information in addition to the relative distance, which is more tolerant to additive noise than the absolute distance, the proposed algorithm has a threefold noise-handling process. The presented algorithm, named local data and membership KL divergence based fuzzy C-means (LDMKLFCM), is tested by synthetic and real-world noisy images and its results are compared with those of several FCM-based clustering algorithms.

Robust generative asymmetric GMM for brain MR image segmentation

BACKGROUND AND OBJECTIVES

Accurate segmentation of brain tissues from magnetic resonance (MR) images based on the unsupervised statistical models such as Gaussian mixture model (GMM) has been widely studied during last decades. However, most GMM based segmentation methods suffer from limited accuracy due to the influences of noise and intensity inhomogeneity in brain MR images. To further improve the accuracy for brain MR image segmentation, this paper presents a Robust Generative Asymmetric GMM (RGAGMM) for simultaneous brain MR image segmentation and intensity inhomogeneity correction.

METHOD

First, we develop an asymmetric distribution to fit the data shapes, and thus construct a spatial constrained asymmetric model. Then, we incorporate two pseudo-likelihood quantities and bias field estimation into the model's log-likelihood, aiming to exploit the neighboring priors of within-cluster and between-cluster and to alleviate the impact of intensity inhomogeneity, respectively. Finally, an expectation maximization algorithm is derived to iteratively maximize the approximation of the data log-likelihood function to overcome the intensity inhomogeneity in the image and segment the brain MR images simultaneously.

RESULTS

To demonstrate the performances of the proposed algorithm, we first applied the proposed algorithm to a synthetic brain MR image to show the intermediate illustrations and the estimated distribution of the proposed algorithm. The next group of experiments is carried out in clinical 3T-weighted brain MR images which contain quite serious intensity inhomogeneity and noise. Then we quantitatively compare our algorithm to state-of-the-art segmentation approaches by using Dice coefficient (DC) on benchmark images obtained from IBSR and BrainWeb with different level of noise and intensity inhomogeneity. The comparison results on various brain MR images demonstrate the superior performances of the proposed algorithm in dealing with the noise and intensity inhomogeneity.

CONCLUSION

In this paper, the RGAGMM algorithm is proposed which can simply and efficiently incorporate spatial constraints into an EM framework to simultaneously segment brain MR images and estimate the intensity inhomogeneity. The proposed algorithm is flexible to fit the data shapes, and can simultaneously overcome the influence of noise and intensity inhomogeneity, and hence is capable of improving over 5% segmentation accuracy comparing with several state-of-the-art algorithms.

Shuffled magnetization-prepared multicontrast rapid gradient-echo imaging

PURPOSE

To develop a novel acquisition and reconstruction method for magnetization-prepared 3-dimensional multicontrast rapid gradient-echo imaging, using Hankel matrix completion in combination with compressed sensing and parallel imaging.

METHODS

A random k-space shuffling strategy was implemented in simulation and in vivo human experiments at 7 T for 3-dimensional inversion recovery, T₂ /diffusion preparation, and magnetization transfer imaging. We combined compressed sensing, based on total variation and spatial-temporal low-rank regularizations, and parallel imaging with pixel-wise Hankel matrix completion, allowing the reconstruction of tens of multicontrast 3-dimensional images from 3- or 6-min scans.

RESULTS

The simulation result showed that the proposed method can reconstruct signal-recovery curves in each voxel and was robust for typical in vivo signal-to-noise ratio with 16-times acceleration. In vivo studies achieved 4 to 24 times accelerations for inversion recovery, T₂ /diffusion preparation, and magnetization transfer imaging. Furthermore, the contrast was improved by resolving pixel-wise signal-recovery curves after magnetization preparation.

CONCLUSIONS

The proposed method can improve acquisition efficiencies for magnetization-prepared MRI and tens of multicontrast 3-dimensional images could be recovered from a single scan. Furthermore, it was robust against noise, applicable for recovering multi-exponential signals, and did not require any previous knowledge of model parameters. Magn Reson Med 79:62-70, 2018. © 2017 International Society for Magnetic Resonance in Medicine.

A segmentation of brain MRI images utilizing intensity and contextual information by Markov random field

BACKGROUND AND OBJECTIVE

Image segmentation is a preliminary and fundamental step in computer aided magnetic resonance imaging (MRI) images analysis. But the performance of most current image segmentation methods is easily depreciated by noise in MRI images. A precise and anti-noise segmentation of MRI images is desired in modern medical image diagnosis.

METHODS

This paper presents a segmentation of MRI images which combines fuzzy clustering and Markov random field (MRF). In order to utilize gray level information sufficiently and alleviate noise disturbance, fuzzy clustering is carried out on the original image and the coarse scale image of multi-scale decomposition. The spatial constraints between neighboring pixels are modeled by a defined potential function in the MRF to reduce the effect of noise and increase the integrity of segmented regions. Spatial constraints and the gray level information refined by Fuzzy C-Means (FCM) algorithm are integrated by maximum a posteriori Markov random field (MAP-MRF). In the proposed method, the fuzzy clustering membership obtained from the original image and the coarse scale image is integrated into the single-site clique potential functions by MAP-MRF. The defined potential functions and the distance weight are introduced to model the neighborhood constraint with MRF.

RESULTS

The experiments are carried out on noised synthetic images, simulated brain MR images and real MR images. The experimental results show that the proposed method has strong robustness and satisfying performance. Meanwhile the method is compared with FCM, FGFCM and FLICM algorithms visually and statistically in the experiments. In the comparison, the proposed method has achieved the best results. In the statistical comparison, the proposed method has an average similarity index of 36.8%, 33.7%, 2.75% increase against FCM, FGFCM and FLICM.

CONCLUSIONS

This paper proposes a MRI segmentation method combining fuzzy clustering and Markov random field. The method is tested in the noised image databases and comparison experiments, which shows that it is a precise and robust MRI segmentation method.

Improvement of the Image Sub-Segmentation for Identification and Differentiation of Atypical Regions

A new sub-segmentation method has been proposed in 2009 which, in digital images, help us to identify the typical pixels, as well as the less representative pixels or atypical of each segmented region. This method is based on the Possibilistic Fuzzy c-Means (PFCM) clustering algorithm, as it integrates absolute and relative memberships. Now, the segmentation problem is related to isolate each one of the objects present in an image. However, and considering only one segmented object or region represented by gray levels as its only feature, the totality of pixels is divided in two basic groups, the group of pixels representing the object, and the others that do not represent it. In the former group, there is a sub-group of pixels near the most representative element of the object, the prototype, and identified here as the typical pixels, and a sub-group corresponding to the less representative pixels of the object, which are the atypical pixels, and generally located at the borders of the pixels representing the object. Besides, the sub-group of atypical pixels presents greater tones (brighter or towards the white color) or smaller tones (darker or towards black color). So, the sub-segmentation method offers the capability to identify the sub-region of atypical pixels, although without performing a differentiation between the brighter and the darker ones. Hence, the proposal of this work contributes to the problem of image segmentation with the improvement on the detection of the atypical sub-regions, and clearly recognizing between both kind of atypical pixels, because in many cases only the brighter or the darker atypical pixels are the ones that represent the object of interest in an image, depending on the problem to be solved. In this study, two real cases are used to show the contribution of this proposal; the first case serves to demonstrate the pores detection in soil images represented by the darker atypical pixels, and the second one to demonstrate the detection of microcalcifications in mammograms, represented in this case by the brighter atypical pixels.

Segmentation of multicolor fluorescence in situ hybridization images using an improved fuzzy C-means clustering algorithm by incorporating both spatial and spectral information

Multicolor fluorescence in situ hybridization (M-FISH) is a multichannel imaging technique for rapid detection of chromosomal abnormalities. It is a critical and challenging step to segment chromosomes from M-FISH images toward better chromosome classification. Recently, several fuzzy C-means (FCM) clustering-based methods have been proposed for M-FISH image segmentation or classification, e.g., adaptive fuzzy C-means (AFCM) and improved AFCM (IAFCM), but most of these methods used only one channel imaging information with limited accuracy. To improve the segmentation for better accuracy and more robustness, we proposed an FCM clustering-based method, denoted by spatial- and spectral-FCM. Our method has the following advantages: (1) it is able to exploit information from neighboring pixels (spatial information) to reduce the noise and (2) it can incorporate pixel information across different channels simultaneously (spectral information) into the model. We evaluated the performance of our method by comparing with other FCM-based methods in terms of both accuracy and false-positive detection rate on synthetic, hybrid, and real images. The comparisons on 36 M-FISH images have shown that our proposed method results in higher segmentation accuracy ([Formula: see text]) and a lower false-positive ratio ([Formula: see text]) than conventional FCM (accuracy: [Formula: see text], and false-positive ratio: [Formula: see text]) and the IAFCM (accuracy: [Formula: see text] and false-positive ratio: [Formula: see text]) methods by incorporating both spatial and spectral information from M-FISH images.

Developments in Landsat Land Cover Classification Methods: A Review

Land cover classification of Landsat images is one of the most important applications developed from Earth observation satellites. The last four decades were marked by different developments in land cover classification methods of Landsat images. This paper reviews the developments in land cover classification methods for Landsat images from the 1970s to date and highlights key ways to optimize analysis of Landsat images in order to attain the desired results. This review suggests that the development of land cover classification methods grew alongside the launches of a new series of Landsat sensors and advancements in computer science. Most classification methods were initially developed in the 1970s and 1980s; however, many advancements in specific classifiers and algorithms have occurred in the last decade. The first methods of land cover classification to be applied to Landsat images were visual analyses in the early 1970s, followed by unsupervised and supervised pixel-based classification methods using maximum likelihood, K-means and Iterative Self-Organizing Data Analysis Technique (ISODAT) classifiers. After 1980, other methods such as sub-pixel, knowledge-based, contextual-based, object-based image analysis (OBIA) and hybrid approaches became common in land cover classification. Attaining the best classification results with Landsat images demands particular attention to the specifications of each classification method such as selecting the right training samples, choosing the appropriate segmentation scale for OBIA, pre-processing calibration, choosing the right classifier and using suitable Landsat images. All these classification methods applied on Landsat images have strengths and limitations. Most studies have reported the superior performance of OBIA on different landscapes such as agricultural areas, forests, urban settlements and wetlands; however, OBIA has challenges such as selecting the optimal segmentation scale, which can result in over or under segmentation, and the low spatial resolution of Landsat images. Other classification methods have the potential to produce accurate classification results when appropriate procedures are followed. More research is needed on the application of hybrid classifiers as they are considered more complex methods for land cover classification.

A Metaheuristically Tuned Interval Type 2 Fuzzy System to Reduce Segmentation Uncertainty in Brain MRI Images

Precise segmentation of magnetic resonance image (MRI) seems challenging because of the complex structure of the brain, non-uniform field in images, and noise. As a result, decision-making is associated with uncertainty. Fuzzy based approaches have been developed to overcome this problem, though most of them use fuzzy type 1 method, and sometimes contain a pre-processing step. This paper "modified type 2 fuzzy system" (MT2FS) declares a state-of-the-art method to segment MRI images using interval fuzzy type-2. Furthermore, Genetic algorithm has been employed to specify the best values for mean and variance of upper and lower membership functions. This strategy will determine discrimination boundaries for different brain tissues to be less independent from the training set. Finally, the result of fuzzy rules is extracted by using Dempster-Shafer rule combination method. Simulation results demonstrate a satisfactory output on both simulated and real MRI images in comparison with previously conducted research works without the need for a pre-processing stage.

Brain MR image segmentation based on an improved active contour model

It is often a difficult task to accurately segment brain magnetic resonance (MR) images with intensity in-homogeneity and noise. This paper introduces a novel level set method for simultaneous brain MR image segmentation and intensity inhomogeneity correction. To reduce the effect of noise, novel anisotropic spatial information, which can preserve more details of edges and corners, is proposed by incorporating the inner relationships among the neighbor pixels. Then the proposed energy function uses the multivariate Student's t-distribution to fit the distribution of the intensities of each tissue. Furthermore, the proposed model utilizes Hidden Markov random fields to model the spatial correlation between neigh-boring pixels/voxels. The means of the multivariate Student's t-distribution can be adaptively estimated by multiplying a bias field to reduce the effect of intensity inhomogeneity. In the end, we reconstructed the energy function to be convex and calculated it by using the Split Bregman method, which allows our framework for random initialization, thereby allowing fully automated applications. Our method can obtain the final result in less than 1 second for 2D image with size 256 × 256 and less than 300 seconds for 3D image with size 256 × 256 × 171. The proposed method was compared to other state-of-the-art segmentation methods using both synthetic and clinical brain MR images and increased the accuracies of the results more than 3%.

Fuzzy Similarity Measure Based Spectral Clustering Framework for Noisy Image Segmentation

In recent times, graph based spectral clustering algorithms have received immense attention in many areas like, data mining, object recognition, image analysis and processing. The commonly used similarity measure in the clustering algorithms is the Gaussian kernel function which uses sensitive scaling parameter and when applied to the segmentation of noise contaminated images leads to unsatisfactory performance because of neglecting the spatial pixel information. The present work introduces a novel framework for spectral clustering which embodied local spatial information and fuzzy based similarity measure to tackle the above mentioned issues. In our approach, firstly we filter the noise components from original image by using the spatial and gray–level information. The similarity matrix is then constructed by employing a similarity measure which takes into account the fuzzy c-partition matrix and vectors of the cluster centers obtained by fuzzy c-means clustering algorithm. In the last step, spectral clustering technique is realized on derived similarity matrix to obtain the desired segmentation result. Experimental results on segmentation of synthetic and Berkeley benchmark images with noise demonstrates the effectiveness and robustness of the proposed method, giving it an edge over the clustering based segmentation method reported in the literature.

An adaptive Fuzzy C-means method utilizing neighboring information for breast tumor segmentation in ultrasound images

PURPOSE

Ultrasound (US) imaging has been widely used in breast tumor diagnosis and treatment intervention. Automatic delineation of the tumor is a crucial first step, especially for the computer-aided diagnosis (CAD) and US-guided breast procedure. However, the intrinsic properties of US images such as low contrast and blurry boundaries pose challenges to the automatic segmentation of the breast tumor. Therefore, the purpose of this study is to propose a segmentation algorithm that can contour the breast tumor in US images.

METHODS

To utilize the neighbor information of each pixel, a Hausdorff distance based fuzzy c-means (FCM) method was adopted. The size of the neighbor region was adaptively updated by comparing the mutual information between them. The objective function of the clustering process was updated by a combination of Euclid distance and the adaptively calculated Hausdorff distance. Segmentation results were evaluated by comparing with three experts' manual segmentations. The results were also compared with a kernel-induced distance based FCM with spatial constraints, the method without adaptive region selection, and conventional FCM.

RESULTS

Results from segmenting 30 patient images showed the adaptive method had a value of sensitivity, specificity, Jaccard similarity, and Dice coefficient of 93.60 ± 5.33%, 97.83 ± 2.17%, 86.38 ± 5.80%, and 92.58 ± 3.68%, respectively. The region-based metrics of average symmetric surface distance (ASSD), root mean square symmetric distance (RMSD), and maximum symmetric surface distance (MSSD) were 0.03 ± 0.04 mm, 0.04 ± 0.03 mm, and 1.18 ± 1.01 mm, respectively. All the metrics except sensitivity were better than that of the non-adaptive algorithm and the conventional FCM. Only three region-based metrics were better than that of the kernel-induced distance based FCM with spatial constraints.

CONCLUSION

Inclusion of the pixel neighbor information adaptively in segmenting US images improved the segmentation performance. The results demonstrate the potential application of the method in breast tumor CAD and other US-guided procedures.

A non-iterative multi-scale approach for intensity inhomogeneity correction in MRI

Intensity inhomogeneity is the prime obstacle for MR image processing like automatic segmentation, registration etc. This complication has strong dependence on the associated acquisition hardware and patient anatomy which recommends retrospective correction. In this paper, a new method is developed for correcting the intensity inhomogeneity using a non-iterative multi-scale approach that doesn't necessitate segmentation and any prior knowledge on the scanner or subject. The proposed algorithm extracts bias field at different scales using a Log-Gabor filter bank followed by smoothing operation. Later, they are combined to fit a third degree polynomial to estimate the bias field. Finally, the corrected image is estimated by performing pixel-wise division of original image and bias field. The performance of the same was tested on BrainWeb simulated data, HCP dataset and is found to provide better performance than the state-of-the-art method, N4. A good agreement between the extracted and ground truth bias field is observed through correlation coefficient on different MR modality images that include T1w, T2w and PD. Significant reduction in coefficient variation and coefficient of joint variation ratios in real data indicate an improved inter-class separation and reduced intra-class intensity variations across white and grey matter tissue regions.

Spatial Evidential Clustering With Adaptive Distance Metric for Tumor Segmentation in FDG-PET Images

While the accurate delineation of tumor volumes in FDG-positron emission tomography (PET) is a vital task for diverse objectives in clinical oncology, noise and blur due to the imaging system make it a challenging work. In this paper, we propose to address the imprecision and noise inherent in PET using Dempster-Shafer theory, a powerful tool for modeling and reasoning with uncertain and/or imprecise information. Based on Dempster-Shafer theory, a novel evidential clustering algorithm is proposed and tailored for the tumor segmentation task in three-dimensional. For accurate clustering of PET voxels, each voxel is described not only by the single intensity value but also complementarily by textural features extracted from a patch surrounding the voxel. Considering that there are a large amount of textures without consensus regarding the most informative ones, and some of the extracted features are even unreliable due to the low-quality PET images, a specific procedure is included in the proposed clustering algorithm to adapt distance metric for properly representing the clustering distortions and the similarities between neighboring voxels. This integrated metric adaptation procedure will realize a low-dimensional transformation from the original space, and will limit the influence of unreliable inputs via feature selection. A Dempster-Shafer-theory-based spatial regularization is also proposed and included in the clustering algorithm, so as to effectively quantify the local homogeneity. The proposed method has been compared with other methods on the real-patient FDG-PET images, showing good performance.

A New Variational Method for Bias Correction and Its Applications to Rodent Brain Extraction

Brain extraction is an important preprocessing step for further analysis of brain MR images. Significant intensity inhomogeneity can be observed in rodent brain images due to the high-field MRI technique. Unlike most existing brain extraction methods that require bias corrected MRI, we present a high-order and L₀ regularized variational model for bias correction and brain extraction. The model is composed of a data fitting term, a piecewise constant regularization and a smooth regularization, which is constructed on a 3-D formulation for medical images with anisotropic voxel sizes. We propose an efficient multi-resolution algorithm for fast computation. At each resolution layer, we solve an alternating direction scheme, all subproblems of which have the closed-form solutions. The method is tested on three T2 weighted acquisition configurations comprising a total of 50 rodent brain volumes, which are with the acquisition field strengths of 4.7 Tesla, 9.4 Tesla and 17.6 Tesla, respectively. On one hand, we compare the results of bias correction with N3 and N4 in terms of the coefficient of variations on 20 different tissues of rodent brain. On the other hand, the results of brain extraction are compared against manually segmented gold standards, BET, BSE and 3-D PCNN based on a number of metrics. With the high accuracy and efficiency, our proposed method can facilitate automatic processing of large-scale brain studies.

Finite-element modeling of compression and gravity on a population of breast phantoms for multimodality imaging simulation

PURPOSE

The authors are developing a series of computational breast phantoms based on breast CT data for imaging research. In this work, the authors develop a program that will allow a user to alter the phantoms to simulate the effect of gravity and compression of the breast (craniocaudal or mediolateral oblique) making the phantoms applicable to multimodality imaging.

METHODS

This application utilizes a template finite-element (FE) breast model that can be applied to their presegmented voxelized breast phantoms. The FE model is automatically fit to the geometry of a given breast phantom, and the material properties of each element are set based on the segmented voxels contained within the element. The loading and boundary conditions, which include gravity, are then assigned based on a user-defined position and compression. The effect of applying these loads to the breast is computed using a multistage contact analysis in FEBio, a freely available and well-validated FE software package specifically designed for biomedical applications. The resulting deformation of the breast is then applied to a boundary mesh representation of the phantom that can be used for simulating medical images. An efficient script performs the above actions seamlessly. The user only needs to specify which voxelized breast phantom to use, the compressed thickness, and orientation of the breast.

RESULTS

The authors utilized their FE application to simulate compressed states of the breast indicative of mammography and tomosynthesis. Gravity and compression were simulated on example phantoms and used to generate mammograms in the craniocaudal or mediolateral oblique views. The simulated mammograms show a high degree of realism illustrating the utility of the FE method in simulating imaging data of repositioned and compressed breasts.

CONCLUSIONS

The breast phantoms and the compression software can become a useful resource to the breast imaging research community. These phantoms can then be used to evaluate and compare imaging modalities that involve different positioning and compression of the breast.

A computerized volumetric segmentation method applicable to multi-centre MRI data to support computer-aided breast tissue analysis, density assessment and lesion localization

Density assessment and lesion localization in breast MRI require accurate segmentation of breast tissues. A fast, computerized algorithm for volumetric breast segmentation, suitable for multi-centre data, has been developed, employing 3D bias-corrected fuzzy c-means clustering and morphological operations. The full breast extent is determined on T1-weighted images without prior information concerning breast anatomy. Left and right breasts are identified separately using automatic detection of the midsternum. Statistical analysis of breast volumes from eighty-two women scanned in a UK multi-centre study of MRI screening shows that the segmentation algorithm performs well when compared with manually corrected segmentation, with high relative overlap (RO), high true-positive volume fraction (TPVF) and low false-positive volume fraction (FPVF), and has an overall performance of RO 0.94 ± 0.05, TPVF 0.97 ± 0.03 and FPVF 0.04 ± 0.06, respectively (training: 0.93 ± 0.05, 0.97 ± 0.03 and 0.04 ± 0.06; test: 0.94 ± 0.05, 0.98 ± 0.02 and 0.05 ± 0.07).

Tissue segmentation: a crucial tool for quantitative MRI and visualization of anatomical structures

Automatic or semi-automatic segmentation of tissue types or organs is well established for X-ray-based computed tomography, with its fixed grey-scale and tissue classes with well-established ranges of Hounsfield units. MRI is much more powerful with regard to soft tissue contrast and quantitative assessment of tissue properties (e.g., perfusion, diffusion, fat content), but the principle of signal generation and recording in MRI leads to inherent problems if simple threshold based segmentation procedures are applied. In this editorial in the special issue of MAGMA on tissue segmentation, a number of relevant methodical, scientific, and clinical aspects of reliable tissue segmentation using data recording by MRI are reported and discussed.

Infrared Ship Target Segmentation Based on Spatial Information Improved FCM

Segmentation of infrared (IR) ship images is always a challenging task, because of the intensity inhomogeneity and noise. The fuzzy C-means (FCM) clustering is a classical method widely used in image segmentation. However, it has some shortcomings, like not considering the spatial information or being sensitive to noise. In this paper, an improved FCM method based on the spatial information is proposed for IR ship target segmentation. The improvements include two parts: 1) adding the nonlocal spatial information based on the ship target and 2) using the spatial shape information of the contour of the ship target to refine the local spatial constraint by Markov random field. In addition, the results of K -means are used to initialize the improved FCM method. Experimental results show that the improved method is effective and performs better than the existing methods, including the existing FCM methods, for segmentation of the IR ship images.

Noise-Compensated, Bias-Corrected Diffusion Weighted Endorectal Magnetic Resonance Imaging via a Stochastically Fully-Connected Joint Conditional Random Field Model

Diffusion weighted magnetic resonance imaging (DW-MR) is a powerful tool in imaging-based prostate cancer screening and detection. Endorectal coils are commonly used in DW-MR imaging to improve the signal-to-noise ratio (SNR) of the acquisition, at the expense of significant intensity inhomogeneities (bias field) that worsens as we move away from the endorectal coil. The presence of bias field can have a significant negative impact on the accuracy of different image analysis tasks, as well as prostate tumor localization, thus leading to increased inter- and intra-observer variability. Retrospective bias correction approaches are introduced as a more efficient way of bias correction compared to the prospective methods such that they correct for both of the scanner and anatomy-related bias fields in MR imaging. Previously proposed retrospective bias field correction methods suffer from undesired noise amplification that can reduce the quality of bias-corrected DW-MR image. Here, we propose a unified data reconstruction approach that enables joint compensation of bias field as well as data noise in DW-MR imaging. The proposed noise-compensated, bias-corrected (NCBC) data reconstruction method takes advantage of a novel stochastically fully connected joint conditional random field (SFC-JCRF) model to mitigate the effects of data noise and bias field in the reconstructed MR data. The proposed NCBC reconstruction method was tested on synthetic DW-MR data, physical DW-phantom as well as real DW-MR data all acquired using endorectal MR coil. Both qualitative and quantitative analysis illustrated that the proposed NCBC method can achieve improved image quality when compared to other tested bias correction methods. As such, the proposed NCBC method may have potential as a useful retrospective approach for improving the consistency of image interpretations.

A coarse-to-fine scheme for groupwise registration of multisensor images

Ensemble registration is concerned with a group of images that need to be registered simultaneously. It is challenging but important for many image analysis tasks such as vehicle detection and medical image fusion. To solve this problem effectively, a novel coarse-to-fine scheme for groupwise image registration is proposed. First, in the coarse registration step, unregistered images are divided into reference image set and float image set. The images of the two sets are registered based on segmented region matching. The coarse registration results are used as an initial solution for the next step. Then, in the fine registration step, a Gaussian mixture model with a local template is used to model the joint intensity of coarse-registered images. Meanwhile, a minimum message length criterion-based method is employed to determine the unknown number of mixing components. Based on this mixture model, a maximum likelihood framework is used to register a group of images. To evaluate the performance of the proposed approach, some representative groupwise registration approaches are compared on different image data sets. The experimental results show that the proposed approach has improved performance compared to conventional approaches.