Simultaneous vector-valued image segmentation and intensity nonuniformity correction using variational level set combined with Markov random field modeling

Object quantification requires an image segmentation to make measurements about size, material composition and morphology of the object. In vector-valued or multispectral images, each image channel has its signal characteristics and provides special information that may improve the results of image segmentation method. This paper presents a region-based active contour model for vector-valued image segmentation with a variational level set formulation. In this model, the local image intensities are characterized using Gaussian distributions with different means and variances. Furthermore, by utilizing Markov random field, the spatial correlation between neighboring pixels and voxels is modeled. With incorporation of intensity nonuniformity model, our method is able to deal with brain tissue segmentation from multispectral magnetic resonance (MR) images. Our experiments on synthetic images and multispectral cerebral MR images with different noise and bias level show the advantages of the proposed method.     

基于Wasserstein距离的局部能量分割模型

 提出了一种基于Wasserstein距离和图像局部区域直方图信息的非参数活动轮廓分割模型.用该距离对图像中不同区域的直方图进行比较,提高了相似性衡量的准确性;引入高斯内核函数来获取图像局部区域直方图信息,并将信息嵌入模型指导轮廓演化,以克服由于亮度不均造成的图像分割困难;通过水平集规范项提高计算精度并避免水平集演化的重新初始化.实验结果表明,本模型能够对亮度不均的无序特征图像进行有效准确的分割.     

Minimization of region-scalable fitting energy for image segmentation

Intensity inhomogeneities often occur in real-world images and may cause considerable difficulties in image segmentation. In order to overcome the difficulties caused by intensity inhomogeneities, we propose a region-based active contour model that draws upon intensity information in local regions at a controllable scale. A data fitting energy is defined in terms of a contour and two fitting functions that locally approximate the image intensities on the two sides of the contour. This energy is then incorporated into a variational level set formulation with a level set regularization term, from which a curve evolution equation is derived for energy minimization. Due to a kernel function in the data fitting term, intensity information in local regions is extracted to guide the motion of the contour, which thereby enables our model to cope with intensity inhomogeneity. In addition, the regularity of the level set function is intrinsically preserved by the level set regularization term to ensure accurate computation and avoids expensive reinitialization of the evolving level set function. Experimental results for synthetic and real images show desirable performances of our method.     

Brain MR image segmentation based on local Gaussian mixture model and nonlocal spatial regularization

Brain Magnetic Resonance (MR) images often suffer from the inhomogeneous intensities caused by the bias field and heavy noise. The most widely used image segmentation algorithms, which typically rely on the homogeneity of image intensities in different regions, often fail to provide accurate segmentation results due to the existence of bias field and heavy noise. This paper proposes a novel variational approach for brain image segmentation with simultaneous bias correction. We define an energy functional with a local data fitting term and a nonlocal spatial regularization term. The local data fitting term is based on the idea of local Gaussian mixture model (LGMM), which locally models the distribution of each tissue by a linear combination of Gaussian function. By the LGMM, the bias field function in an additive form is embedded to the energy functional, which is helpful for eliminating the influence of the intensity inhomogeneity. For reducing the influence of noise and getting a smooth segmentation, the nonlocal spatial regularization is drawn upon, which is good at preserving fine structures in brain images. Experiments performed on simulated as well as real MR brain data and comparisons with other related methods are given to demonstrate the effectiveness of the proposed method.     

Image-pair-based deblurring with spatially varying norms and noisy image updating

This paper presents a deblurring method that effectively restores fine textures and details, such as a tree’s leaves or regular patterns, and suppresses noises in flat regions using consecutively captured blurry and noisy images. To accomplish this, we used a method that combines noisy image updating with one iteration and fast deconvolution with spatially varying norms in a modified alternating minimization scheme. The captured noisy image is first denoised with a nonlocal means (NL-means) denoising method, and then fused with a deconvolved version of the captured blurred image on the frequency domain, to provide an initially restored image with less noise. Through a feedback loop, the captured noisy image is directly substituted with the initially restored image for one more NL-means denoising, which results in an upgraded noisy image with clearer outlines and less noise. Next, an alpha map that stores spatially varying norm values, which indicate local gradient priors in a maximum-a-posterior (MAP) estimation, is created based on texture likelihoods found by applying a texture detector to the initially restored image. The alpha map is used in a modified alternating minimization scheme with the pair of upgraded noisy images and a corresponding point spread function (PSF) to improve texture representation and suppress noises and ringing artifacts. Our results show that the proposed method effectively restores details and textures and alleviates noises in flat regions.     

Active contours driven by weighted region-scalable fitting energy based on local entropy

In this paper, we present a scheme of improvement on the region-scalable fitting (RSF) model proposed by Li et al. (Minimization of region-scalable fitting energy for image segmentation, IEEE Transactions on Image Processing 17(10) (2008) 1940-1949) in terms of robustness to initialization and noise. First, the Gaussian kernel for the RSF energy is replaced with a “mollifying” kernel with compact support. Second, the RSF energy is redefined as a weighted energy integral, where the weight is local entropy deriving from a grey level distribution of image. The total energy functional is then incorporated into a variational level set formulation with two extra internal energy terms. The new RSF model not only handles better intensity inhomogeneity, but also allows for more flexible initialization and more robustness to noise compared to the original RSF model.     

Spatially adapted total variation model to remove multiplicative noise

Multiplicative noise removal based on total variation (TV) regularization has been widely researched in image science. In this paper, inspired by the spatially adapted methods for denoising Gaussian noise, we develop a variational model, which combines the TV regularizer with local constraints. It is also related to a TV model with spatially adapted regularization parameters. The automated selection of the regularization parameters is based on the local statistical characteristics of some random variable. The corresponding subproblem can be efficiently solved by the augmented Lagrangian method. Numerical examples demonstrate that the proposed algorithm is able to preserve small image details, whereas the noise in the homogeneous regions is sufficiently removed. As a consequence, our method yields better denoised results than those of the current state-of-the-art methods with respect to the signal-to-noise-ratio values.     

Image segmentation based on multi-region multi-scale local binary fitting and Kullback–Leibler divergence

The inhomogeneity of intensity and the noise of image are the two major obstacles to accurate image segmentation by region-based level set models. To provide a more general solution to these challenges and address the difficulty of image segmentation methods to handle an arbitrary number of regions, we propose a region-based multi-phase level set method, which is based on the multi-scale local binary fitting (MLBF) and the Kullback–Leibler (KL) divergence, called KL–MMLBF. We first apply the multi-scale theory and multi-phase level set framework to the local binary fitting model to build the multi-region multi-scale local binary fitting (MMLBF). Then the energy term measured by KL divergence between regions to be segmented is incorporated into the energy function of MMLBF. KL–MMLBF utilizes the between-cluster distance and the adaptive kernel function selection strategy to formulate the energy function. Being more robust to the initial location of the contour than the classical segmentation models, KL–MMLBF can deal with blurry boundaries and noise problems. The results of experiments on synthetic and medical images have shown that KL–MMLBF can improve the effectiveness of segmentation while ensuring the accuracy by accelerating this minimization of this energy function and the model has achieved better segmentation results in terms of both accuracy and efficiency to analyze the multi-region image.     

Improving image segmentation by using energy function based on mixture of Gaussian pre-processing

In this paper, by proposing a two-stage segmentation method based on active contour model, we improve the procedure of former image segmentation methods. The first stage of our method is computing weights, means and variances of image by utilizing Mixture of Gaussian distribution which parameters are obtained from EM-algorithm. Once they are obtained, in the second stage, by incorporating level set method for minimizing energy function, the segmentation is achieved. We use an adaptive direction function to make the curve evolution robust against the curves initial position and a nonlinear adaptive velocity to speed up the process of curve evolution and also a probability-weighted edge and region indicator function to implement a robust segmentation for objects with weak boundaries. The paper consists of minimizing a functional containing a penalty term in an attempt to maintain the signed distance property in the entire domain and an external energy term such that it achieves a minimum when the zero level set of the function is located at desired position.     

Local maximum likelihood segmentation of echocardiographic images with Rayleigh distribution

In order to interpret ultrasound images, it is important to understand their formation and the properties that affect them, especially speckle noise. This image texture, or speckle, is a correlated and multiplicative noise that inherently occurs in all types of coherent imaging systems. Indeed, its statistics depend on the density and on the type of scatterers in the tissues. This paper presents a new method for echocardiographic images segmentation in a variational level set framework. A partial differential equation-based flow is designed locally in order to achieve a maximum likelihood segmentation of the region of interest. A Rayleigh probability distribution is considered to model the local B-mode ultrasound images intensities. In order to confront more the speckle noise and local changes of intensity, the proposed local region term is combined with a local phase-based geodesic active contours term. Comparison results on natural and simulated images show that the proposed model is robust to attenuations and captures well the low-contrast boundaries.     

Image denoising by averaging of piecewise constant simulations of image partitions.

This paper investigates the problem of image denoising when the image is corrupted by additive white Gaussian noise. We herein propose a spatial adaptive denoising method which is based on an averaging process performed on a set of Markov Chain Monte-Carlo simulations of region partition maps constrained to be spatially piecewise uniform (i.e., constant in grey level value sense) for each estimated constant-value regions. For the estimation of these region partition maps, we have adopted the unsupervised Markovian framework in which parameters are automatically estimated in the least square sense. This sequential averaging allows to obtain, under our image model, an approximation of the image to be recovered in the minimal mean square sense error. The experiments reported in this paper demonstrate that the discussed method performs competitively and sometimes better than the best existing state-of-the-art wavelet-based denoising methods in benchmark tests.     

Variational denoising of partly textured images

The Rudin–Osher–Fatemi model is a widely used variational denoising algorithm which favors piecewise constant solutions. Although edge sharpness and location are well preserved, some local features such as textures and small details are often diminished with noise simultaneously. This paper aims to better preserve these local features using a similar variational framework. We introduce a texture detecting function according to the derivatives of the noisy textured image. Then this function is used to construct a spatially adaptive fidelity term, which adjusts the denoising extent in terms of the local features. Numerical results show that our method is superior to the Rudin–Osher–Fatemi model in both signal-to-noise ratio and visual quality. Moreover, part of our results are also compared with other state-of-the-art methods including a variational method and a non local means filter. The comparison shows that our method is competitive with these two methods in restoration quality but is much faster.     

Variational denoising of partly textured images by spatially varying constraints.

Denoising algorithms based on gradient dependent regularizers, such as nonlinear diffusion processes and total variation denoising, modify images towards piecewise constant functions. Although edge sharpness and location is well preserved, important information, encoded in image features like textures or certain details, is often compromised in the process of denoising. We propose a mechanism that better preserves fine scale features in such denoising processes. A basic pyramidal structure-texture decomposition of images is presented and analyzed. A first level of this pyramid is used to isolate the noise and the relevant texture components in order to compute spatially varying constraints based on local variance measures. A variational formulation with a spatially varying fidelity term controls the extent of denoising over image regions. Our results show visual improvement as well as an increase in the signal-to-noise ratio over scalar fidelity term processes. This type of processing can be used for a variety of tasks in partial differential equation-based image processing and computer vision, and is stable and meaningful from a mathematical viewpoint.     

Bayesian pixel classification using spatially variant finitemixtures and the generalized EM algorithm

A spatially variant finite mixture model is proposed for pixel labeling and image segmentation. For the case of spatially varying mixtures of Gaussian density functions with unknown means and variances, an expectation-maximization (EM) algorithm is derived for maximum likelihood estimation of the pixel labels and the parameters of the mixture densities, An a priori density function is formulated for the spatially variant mixture weights. A generalized EM algorithm for maximum a posteriori estimation of the pixel labels based upon these prior densities is derived. This algorithm incorporates a variation of gradient projection in the maximization step and the resulting algorithm takes the form of grouped coordinate ascent. Gaussian densities have been used for simplicity, but the algorithm can easily be modified to incorporate other appropriate models for the mixture model component densities. The accuracy of the algorithm is quantitatively evaluated through Monte Carlo simulation, and its performance is qualitatively assessed via experimental images from computerized tomography (CT) and magnetic resonance imaging (MRI).     

基于C-V模型的红外图像自动分割方法研究

为解决红外图像分割中背景噪声及边界轮廓的影响,引入了基于曲线演化理论、水平集方法和M-S分割函数的C-V模型。通过将图像表达为分段常量函数来建立适当的能量函数模型,引入水平集的表示方法,在整个图像域中依据最小化分割寻找全局极小值,可令活动轮廓最终到达目标边缘。由MATLAB实现的仿真结果表明采用C-V模型对红外图像进行自动分割不受边界轮廓线连续性限制,对初始轮廓线位置不敏感,对图像噪声具有很强的鲁棒性,对均匀灰度目标分割效果良好。     

基于局部子区域的活动轮廓图像分割方法

这里的方法旨在解决复杂多纹理图像中的目标分割问题。沿袭局部化思路,进一步提出基于局部子区域的方法,介绍了该方法下能量函数的设计方法,并与全局统一能量模型方法和局部能量方法进行了实验对比。实验表明,该方法在继承一般局部区域方法的分割能力的同时,较好的解决了复杂多纹理图像的目标分割问题,能较好的分割多纹理形成的物体边界,成功扩展了基于区域的活动轮廓的分割方法对图像的适应能力。     

Reconstruction from projections under time-frequency constraints

Low-pass filtering computed tomography (CT) images to reduce noise may smooth or modify image features which are very important to the physician. Image features are often more easily identified and processed in the time-frequency plane. The authors use time-frequency distributions for spatially varying filtering of noisy CT images, constraining time-frequency representation coefficients of the projection data or of the reconstructed image to be zero in certain regions of the time-frequency plane. The authors consider two different applications: 1) filtering the projection data and then performing image reconstruction; and 2) filtering the reconstructed image directly. Criteria minimized, subject to constraints, may be either a deterministic minimum weighted perturbation of the given projection data or a stochastic minimum mean-square error in colored Gaussian noise. Results show improvement over processing the image with a linear spatially invariant filter.     

Fuzzy local Gaussian mixture model for brain MR image segmentation

Accurate brain tissue segmentation from magnetic resonance (MR) images is an essential step in quantitative brain image analysis. However, due to the existence of noise and intensity inhomogeneity in brain MR images, many segmentation algorithms suffer from limited accuracy. In this paper, we assume that the local image data within each voxel's neighborhood satisfy the Gaussian mixture model (GMM), and thus propose the fuzzy local GMM (FLGMM) algorithm for automated brain MR image segmentation. This algorithm estimates the segmentation result that maximizes the posterior probability by minimizing an objective energy function, in which a truncated Gaussian kernel function is used to impose the spatial constraint and fuzzy memberships are employed to balance the contribution of each GMM. We compared our algorithm to state-of-the-art segmentation approaches in both synthetic and clinical data. Our results show that the proposed algorithm can largely overcome the difficulties raised by noise, low contrast, and bias field, and substantially improve the accuracy of brain MR image segmentation.     

Estimating Gaussian Markov random field parameters in anonstationary framework: application to remote sensing imaging

In this paper, we tackle the problem of estimating textural parameters. We do not consider the problem of texture synthesis, but the problem of extracting textural features for tasks such as image segmentation. We take into account nonstationarities occurring in the local mean. We focus on Gaussian Markov random fields for which two estimation methods are proposed, and applied in a nonstationary framework. The first one consists of extracting conditional probabilities and performing a least square approximation. This method is applied to a nonstationary framework, dealing with the piecewise constant local mean. This framework is adapted to practical tasks when discriminating several textures on a single image. The blurring effect affecting edges between two different textures is thus reduced. The second proposed method is based on renormalization theory. Statistics involved only concern variances of Gaussian laws, leading to Cramer-Rao estimators. This method is thus especially robust with respect to the size of sampling. Moreover, nonstationarities of the local mean do not affect results. We then demonstrate that the estimated parameters allow texture discrimination for remote sensing data. The first proposed estimation method is applied to extract urban areas from SPOT images. Since discontinuities of the local mean are taken into account, we obtain an accurate urban areas delineation. Finally, we apply the renormalization based on method to segment ice in polar regions from AVHRR data.     

二维直线型最小误差阈值分割法

一维最小误差阈值法假设了目标和背景的灰度分布服从混合正态分布。考虑到噪声等因素对图像质量的影响,该文在二维灰度直方图上,基于二维混合正态分布假设,给出二维直线型最小误差阈值法的表达式。为了提高算法的运行速度,也给出了快速递推算法。实验表明,二维直线型最小误差阈值法是一个有效的图像分割算法,能够更好地适应目标和背景方差相差较大的含噪图像分割问题。