结合Voronoi划分HMRF模型的模糊ISODATA图像分割

为了解决传统模糊聚类图像分割方法对噪声敏感及无法自动准确确定聚类数的问题,提出结合Voronoi划分HMRF模型的模糊ISODATA图像分割方法。利用Voronoi划分将图像域划分为若干子区域,以划分子区域为基本单元定义基于隐马尔科夫随机场(HMRF)模型的模糊聚类目标函数,以解决噪声敏感问题;通过迭代自组织数据分析技术算法(ISODATA)中聚类分裂、合并技术改变聚类数,以实现聚类数的自动确定。对模拟、合成图像和真实图像分割结果的定性和定量分析表明:提出算法不仅可以有效克服噪声和像素异常值对分割结果的影响,而且还能自动准确确定聚类数,实现高精度的自动变类图像分割。      

基于EM参数“软”估计的SAR图像分割

借助EM算法和模糊理论,提出了一种基于参数"软"估计和Markov随机场的SAR图像无监督分割方法。首先利用多维空间的EM算法估计随机场的模型参数,并根据随机场模型参数分别计算观测数据的条件概率和标记图像的先验概率,继而根据最大后验概率准则将图像分成具有相似统计特性的同质区域,重复以上步骤直至收敛。通过与传统的参数"硬"估计分割算法的实验比较,该算法能更好保持图像边缘细节,区域连通性更好。     

基于自适应EM算法的光学图像海域分割

提出了一种针对光学遥感图像海域分割的自适应期望最大算法(Expectation Maximization,EM)。传统EM算法需要给出高斯混合模型的个数,文中所做的改进使其具有自适应确定高斯模型个数的能力,由此可以降低由于个数选择的不合理带来的错误分割的风险。将该方法应用低分辨率复杂背景遥感图像的海域分割,取得了较理想结果。     

基于独立混合模型的EM算法参数初始化实现方法

隐马尔科夫树( Hidden Markov Tree, HMT )的状态不能被观测到,只能观测到另一个与状态有联系的量,通过观测量估计HMT模型参数是一个不完全数据参数估计问题。期望最大化( Expectation Maximization, EM )算法是一种求参数极大似然估计的迭代算法,可以用于解决不完全数据参数估计问题,因此被广泛应用于HMT模型的参数估计中。当初始参数偏离真实参数较大时,EM算法迭代次数多,收敛速度慢,通过一个计算量不大的参数初始化处理,能够有效减少EM算法的迭代次数,加快收敛速度。本文提出了一种基于独立混合模型的参数初始化方法,详细介绍了该方法的实现过程,通过采用独立混合模型进行参数初始化,使得EM算法的迭代次数明显减少,收敛速度大大提高。最后,计算机仿真验证了该方法的可行性和有效性。      

基于Voronoi几何划分和层次化建模的纹理影像分割

将基于像素MRF分割方法拓展到基于地物目标几何约束的区域MRF分割,提出了一种基于区域和统计的纹理影像分割方法,其基本思想是利用Voronoi划分技术将影像域划分为若干子区域。在此基础上,采用二值高斯马尔科夫随机场（BGMRF, bivariate gaussian markov random field）模型,静态随机场模型和Potts模型从邻域、区域及全局层次描述影像的纹理结构,并将该纹理结构模型纳入贝叶斯框架;依据贝叶斯定理构建纹理影像分割模型;利用metropolis-hastings (M-H)算法进行模型参数估计,并依据最大后验概率（MAP, maximum a posterior）准则进行优化,从而完成纹理影像分割。为了验证所提出方法的正确性,分别对合成纹理影像,真实纹理影像及遥感影像进行了分割实验,定性和定量的测试结果验证了提出方法的有效性、可靠性和准确性。     

一种快速有效的SAR图像起伏地形分割算法

根据合成孔径雷达(SAR)成像机理和图像特征,针对SAR图像中的起伏地形,提出了一种基于有向多尺度模型分割算法。该方法利用了SAR图像不同方向不同尺度间的统计相依性,而且考虑了SAR图像的空间信息。由于是基于有向多尺度模型少量的特征数据,利用最大期望(EM)算法可以快速估计参数,同时利用数学形态学算法进行分割修正,实现了高精度的SAR图像起伏地形的快速分割。实测SAR图像分割实验结果证明,对比其他分割算法,该方法对起伏地形的分割效果更为精确。     

基于FGM-MRF模型的图像分割

利用Ward聚类将图像进行初始分割,其结果作为基于空间邻域信息马尔可夫随机场(MRF)模型对图像再次分割的初值,图像分割的先验概率采用Ising模型,通过有限高斯混合模型(FGM)描述图像像素灰度的条件概率分布,利用期望-最大(EM)算法估计条件概率分布模型参数,用迭代条件模式(ICM)局部优化方法,获得最大后验概率(MAP)准则下的图像分割结果.通过与其他相关算法分割结果相比较,这种算法能够明显改善分割效果.     

基于EM算法的GO分布参数最大似然估计

G0分布是目前合成孔径雷达(Synthetic Aperture Radar,SAR)图像数据建模的一个重要模型,建模能力强、实用性好,受到了广泛的关注.G0分布的应用离不开准确有效的参数估计,而由于G0分布表达式复杂,统计意义上最优的最大似然估计法一直没能用在G0分布上.本文首先给出了一种新的方式来推导得出G0分布,在此基础上,采用最大期望(Expectation Maximization,EM)算法为G0分布给出一种有效的最大似然参数估计方法.文中的方法与现有的G0分布参数估计方法通过实验进行了比较,实验结果充分证明了所提方法的有效性.     

基于区域限制的EM和图割的非监督彩色图像分割方法

提出一种基于区域限制的EM(Expectation Maximization)和图割的非监督彩色图像分割方法,以解决自动确定分割类数问题.首先,生成图像的超像素,提取图像的CIE Lab颜色特征和多尺度四元数Gabor滤波特征;为了高效自动地确定分割类数,同时避免因直接使用超像素造成的奇异值问题,对每一个超像素采样并使用采样像素表示超像素;然后采用高斯混合模型对采样像素集合进行建模,使用加入区域限制的分量EM自动获取模型组件数及参数,最后使用图割结合高斯混合模型对图像进行优化,获取最终分割结果.实验结果表明,该方法在分割效率和分割质量上均得到较大提升.     

基于EM算法的G0分布参数最大似然估计

 G0分布是目前合成孔径雷达(Synthetic Aperture Radar,SAR)图像数据建模的一个重要模型,建模能力强、实用性好,受到了广泛的关注.G0分布的应用离不开准确有效的参数估计,而由于G0分布表达式复杂,统计意义上最优的最大似然估计法一直没能用在G0分布上.本文首先给出了一种新的方式来推导得出G0分布,在此基础上,采用最大期望(Expectation Maximization,EM)算法为G0分布给出一种有效的最大似然参数估计方法.文中的方法与现有的G0分布参数估计方法通过实验进行了比较,实验结果充分证明了所提方法的有效性.     

The EM/MPM algorithm for segmentation of textured images: analysisand further experimental results

In this paper we present new results relative to the "expectation-maximization/maximization of the posterior marginals" (EM/MPM) algorithm for simultaneous parameter estimation and segmentation of textured images. The EM/MPM algorithm uses a Markov random field model for the pixel class labels and alternately approximates the MPM estimate of the pixel class labels and estimates parameters of the observed image model. The goal of the EM/MPM algorithm is to minimize the expected value of the number of misclassified pixels. We present new theoretical results in this paper which show that the algorithm can be expected to achieve this goal, to the extent that the EM estimates of the model parameters are close to the true values of the model parameters. We also present new experimental results demonstrating the performance of the EM/MPM algorithm.     

3D EM/MPM Image Segmentation Using an FPGA Embedded Design Implementation

This paper presents a Field Programmable Gate Array (FPGA) based embedded system which is used to achieve high speed segmentation of 3D images. Segmentation is performed using Expectation-Maximization (EM) with Maximization of Posterior Marginals (MPM) Bayesian algorithm. This algorithm segments the 3D image using neighboring pixels based on a Markov Random Field (MRF) model. In this system, the embedded processor controls a custom circuit which performs the MPM and portions of the EM algorithm. The embedded processor completes the EM algorithm and also controls image data transmission between host computer and on-board memory. The whole system has been implemented on Xilinx Virtex 6 FPGA and achieved over 100 times processing improvement compared to standard desktop computer. Three new techniques were the key to achieve this speed: Pipelined computational cores, sixteen parallel data paths and a novel memory interface for maximizing the external memory bandwidth.

     

Segmentation of textured images using a multiresolution Gaussianautoregressive model

We present a new algorithm for segmentation of textured images using a multiresolution Bayesian approach. The new algorithm uses a multiresolution Gaussian autoregressive (MGAR) model for the pyramid representation of the observed image, and assumes a multiscale Markov random field model for the class label pyramid. The models used in this paper incorporate correlations between different levels of both the observed image pyramid and the class label pyramid. The criterion used for segmentation is the minimization of the expected value of the number of misclassified nodes in the multiresolution lattice. The estimate which satisfies this criterion is referred to as the "multiresolution maximization of the posterior marginals" (MMPM) estimate, and is a natural extension of the single-resolution "maximization of the posterior marginals" (MPM) estimate. Previous multiresolution segmentation techniques have been based on the maximum a posterior (MAP) estimation criterion, which has been shown to be less appropriate for segmentation than the MPM criterion. It is assumed that the number of distinct textures in the observed image is known. The parameters of the MGAR model-the means, prediction coefficients, and prediction error variances of the different textures-are unknown. A modified version of the expectation-maximization (EM) algorithm is used to estimate these parameters. The parameters of the Gibbs distribution for the label pyramid are assumed to be known. Experimental results demonstrating the performance of the algorithm are presented.     

EM image segmentation algorithm based on an inhomogeneous hidden MRF model

This paper introduces a Bayesian image segmentation algorithm that considers the label scale variability of images. An inhomogeneous hidden Markov random field is adopted in this algorithm to model the label scale variability as prior probabilities. An EM algorithm is developed to estimate parameters of the prior probabilities and likelihood probabilities. The image segmentation is established by using a MAP estimator. Different images are tested to verify the algorithm and comparisons with other segmentation algorithms are carried out. The segmentation results show the proposed algorithm has better performance than others.     

一种结合位置信息的混合模型图像分割方法

提出了一种新的受位置约束的混合模型图像分割方法。该方法在独立混合模型的基础上,采用空间滤波方法对像素所属分量的后验概率进行修正,在混合模型中隐含地加入了像素的空间位置信息。这种结合位置信息的方法为混合模型的分量选择提供了一种有效的实现方式。与其它的受位置限制的混合模型相比,该方法没有引入额外的模型参数,并且无需采用模型选择准则,可以实现自动的混合分量个数的选择。     

Expectation–maximization algorithm with total variation regularization for vector-valued image segmentation

We integrate the total variation (TV) minimization into the expectation–maximization (EM) algorithm to perform the task of image segmentation for general vector-valued images. We first propose a unified variational method to bring together the EM and the TV regularization and to take advantages from both approaches. The idea is based on operator interchange and constraint optimization. In the second part of the paper we propose a simple two-phase approach by splitting the above functional into two steps. In the first phase, a typical EM method can classify pixels into different classes based on the similarity in their measurements. However, since no local geometric information of the image has yet been incorporated into the process, such classification in practice gives unsatisfactory segmentation results. In the second phase, the TV-step obtains the segmentation of the image by applying a TV regularization directly to the clustering result from EM.     

基于GLCM和EM算法的纹理图像分割

基于纹理图像的特征,提出了基于灰度共生矩阵（GLCM）和快速极大似然估计（EM）算法相结合的纹理图像分割新算法,为了获得较好的纹理图像分割结果该算法采用灰度共生矩阵的三个常用特征并在四个方向上求平均,从而克服了方向的影响。采用欧式距离度量函数求得两特征向量的距离。通过用改进EM算法对距离矩阵进行聚类,得到纹理图像的初始分割结果,最后用形态学的方法实现对纹理图像边界的精确定位。     

Performance evaluation of finite normal mixture model-based image segmentation techniques

Finite normal mixture (FNM) model-based image segmentation techniques adopt the following detection-estimation-classification paradigm: (1) detect the number of image regions by using theoretical information criteria; (2) estimate model parameters by using expectation-maximization (EM)/classification-maximization (CM) algorithms; and (3) classify pixels into regions by using various classifiers. This paper presents a theoretical framework to evaluate the performance of this class of image segmentation techniques. For the detection performance, probabilities of over-detection and under-detection of the number of image regions are defined, and the associated formulae in terms of model parameters and image quality are derived. For the estimation performance, both EM and CM algorithms are showed to produce asymptotically unbiased ML estimates of model parameters in the case of no-overlap. Cramer-Rao bounds of variances of these estimates are derived. For the classification performance, misclassification probability for the Bayesian classifier is defined, and a simple formula based on parameter estimates and classified data is derived to evaluate segmentation errors. This evaluation method provides both theoretically approachable accuracy limits of the techniques and practically achievable performance of the given images. Theoretical and experimental results are in good agreement and indicate that, for images of moderate quality, the detection operation is robust, the parameter estimates are accurate, and the segmentation errors are small.