双窗口特征的SAR图像丛林区域MRF分割算法

针对固定窗口灰度共生矩阵纹理特征对合成孔径雷达(SAR)图像丛林区域分割存在的局限性,讨论了丛林区域纹理特征值的聚类特性,分析计算窗口大小对分割的影响。基于马尔科夫随机场(MRF)分割方法对SAR图像噪声抑制能力,提出一种基于小窗口纹理特征分割作为初始标记计算初始吉布斯分布,大窗口纹理特征作为样本估计高斯分布的MRF分割方法。该方法经实验验证,能够改善分割噪声和边缘模糊的问题,很好地对SAR丛林区域进行分割。     

多尺度曲波分解下的可变类SAR图像分割

为了实现SAR图像的可变类分割,本文提出了一种基于区域的多尺度可变类分割方法。首先,利用曲波变换对SAR图像进行多尺度分解,获取多尺度曲波系数;然后按尺度由粗-细次序,利用曲波逆变换对各尺度曲波系数进行重构,获取各尺度分解图像,进而获得多尺度分解图像。在此基础上,利用规则划分技术划分图像域;然后利用Gamma分布及马尔科夫随机场（Markov Random Field, MRF）模型建立基于区域的特征场模型及标号场模型;假设图像类别数为随机变量,并服从Poisson分布;并在贝叶斯理论框架下建立基于区域的多尺度可变类分割模型。最后,利用可逆变马尔可夫链蒙特卡罗（Reversible Jump Markov Chain Monte Carlo, RJMCMC）算法以实现该模型求解;在求解过程中,按尺度由粗-细次序,将当前尺度分割解作为下一低尺度分割的初始解,以细尺度的分割解作为最终分割结果。利用提出方法对模拟及真实SAR图像进行可变类分割实验,通过其实验结果验证提出方法的可行性及有效性。      

基于区域的MRF模型用于SAR图像分割

本文提出了一种建立在流域算法过分割结果区域图上的马尔可夫随机场模型的SAR图像分割算法.由于将马尔可夫场随机场(MRF)模型建立在预分割的基础上,极大减少了计算复杂度,并利用SAR图像的分布模型建立多层MRF模型,采用模拟退火优化得到MAP估计的分割结果.实验证明较传统的基于像素的马尔可夫随机场分割算法,该方法极大提高了运算速度,并能取得较为满意的分割结果.     

基于区域MRF和贝叶斯置信传播的SAR图像分割

 本文通过定义新的势函数,将贝叶斯置信传播算法和区域MRF模型有效结合,提出了一种SAR图像分割算法.考虑到SAR图像丰富的纹理信息,该算法对分水岭分割后的过分割区域提取纹理特征,在得到的区域邻接图上构建MRF模型,并加入区域灰度均值和方差作为区域特征,利用FCM聚类的初分割结果定义区域的关联势函数,并将区域特征引入到置信传播算法中,定义了新的交互势函数.该算法充分利用了SAR图像空间的背景信息,所定义的新的交互势函数能在促进分割结果区域一致性的同时较好保护边缘.实验结果表明,相对于其他MRF模型分割算法,本文算法能取得更好的分割效果.     

基于改进Markov随机场的高分辨率SAR图像建筑物分割算法

提出了一种基于改进Markov随机场模型的高分辨率SAR(Synthetic Aperture Radar,合成孔径雷达)图像建筑物分割算法.针对高分辨率SAR图像信噪比低和建筑物复杂纹理特性的特点,采用多尺度Markov随机场模型的最大似然准则方法获取图像的初始分割,并在传统Markov邻域能量模型基础之上提出一种新的基于Gabor纹理相似度的邻域势函数模型,采用ICM(Iterative Conditional Model,迭代条件模型)算法进行建筑物分割.多组实际高分辨率SAR图像的实验结果表明,与传统MRF算法等方法相比,本文方法具有更高的分割正确率,同时建筑物边界更为清晰平滑,分割效果较好.     

融合局部和非局部信息的自适应贝叶斯分割方法

传统基于马尔可夫随机场(MRF)的贝叶斯分割方法由于只考虑邻域像素点的先验影响,无法有效抑制相干斑噪声;边缘区域分割效果欠佳,因为先验模型假定邻域中每个像素对中心像素的影响相同。因而,该文提出一种融合局部和非局部信息的自适应贝叶斯分割方法。针对SAR图像中的相干斑噪声模型,引入基于比率概率的相似性测度,用非局部相似像素块指导当前像素点的分割;并且采用变分系数(Coefficient of Variation, CV)方法获取边缘区域图像模板,在边缘区域自适应地调整定义的结构指数以及搜索窗尺寸,从而改善分割过度平滑与结构保持的矛盾;在实验分析中,利用新方法对部分图像进行了分割实验,并与传统方法作了比较。改进方法的分割结果形状更为准确,不但抑制了相干斑噪声,还有效保持了细节特征,具有显著优势。     

特征符号随机场-Gibbs模型及其在纹理分割中的应用

本文提出了特征符号随机场的概念，定义了新的特征符号随机场－Ｇｉｂｂｓ模型，并讨论了它在纹理分割中的应用，与传统马尔柯夫随机场模型方法相比，由于包容了更多，更细致的图象信息，本文的方法能够得到更精确的分割结果，同时，新模型仍然有比较简单的模型形式，模型估计方法简单，利于在线运用，与传统特征聚类分割方法（如多通道持征聚类分割方法）相比，本文不要求得到相对纹理区域具有稳定性的特征，并利用Ｇｉｂｂｓ模型来     

特征符号随机场—Gibbs模型及其在纹理分割中的应用

本文提出了特征符号随机场的概念，定义了新的特征符号随机场－Ｇｉｂｂｓ模型，并讨论了它在纹理分割中的应用，与传统马尔柯夫随机场模型方法相比，由于包容了更多，更细致的图象信息，本文的方法能够得到更精确的分割结果，同时，新模型仍然有比较简单的模型形式，模型估计方法简单，利于在线运用，与传统特征聚类分割方法（如多通道持征聚类分割方法）相比，本文不要求得到相对纹理区域具有稳定性的特征，并利用Ｇｉｂｂｓ模型来     

一种基于非均匀马尔可夫随机场的图像分割方法

提出了一种新的基于非均匀马尔可夫随机场(MRF)的图像分割算法。基于非均匀马尔可夫随机场的图像分割的关键是对MRF中耦合系数的估计。本文结合四叉树分解提出了一种新的非均匀MRF的耦合系数估计方法。先对图像用传统的MRF分割方法进行预分割,再在预分割的基础上用边缘检测算子检验出预分割图像中的边缘,再利用图像的边缘信息对图像进行四叉树分解,把图像分成不同大小的子块。再根据每个子块的大小,估计出非均匀MRF的耦合系数。实验表明,将本文方法估计出来的耦合系数应用到分割算法中去,能明显改善图像分割的效果,而且具有更好的自适应性。     

马尔可夫随机场在SAR图像处理中的应用

马尔可夫随机场（MRF）可以很好地描述空间连续性，选择适当的邻域系统，能对图像的结构特征建模。利用以能量函数表示的联合概率分布，可以使用优化算法进行参数估计。高斯MRF能够准确、简洁地表示图像的纹理，而且具有线性特性，计算方便。本文回顾了在SAR图像处理中使用的MRF模型，详细说明了其中2种在图像复原及分割中的应用。     

基于隐马尔可夫高斯随机场模型的模糊聚类高分辨率遥感影像分割算法

本文利用隐马尔可夫随机场和高斯模型分别建立标号场和特征场的邻域关系,提出了基于隐马尔可夫高斯随机场模型的模糊聚类分割算法。该算法用隐马尔可夫随机场模型定义先验概率,并将该先验概率作为尺度控制因子引入到KL（Kullback-Lerbler）信息中,在目标函数的定义中,KL信息作为规则化项,其系数表示算法的模糊程度。在基于高斯模型的后验概率中,像素相关性被定义在空间和谱间,并用该概率的负对数值表征像素点到聚类中心的非相似性测度。通过对合成遥感影像和高分辨率遥感影像进行分割实验,证明了算法的有效性和普适性。     

Double Gaussian mixture model for image segmentation with spatial relationships

In this paper, we present a finite mixture model based on a Gaussian distribution for image segmentation. There are four advantages to the proposed model. First, compared with the standard Gaussian mixture model (GMM), the proposed model effectively incorporates spatially relationships between the pixels using a Markov random field (MRF). Second, the proposed model is similar to GMM, but has a simple representation and is easier to implement than some existing models based on MRF. Third, the contextual mixing proportion of the proposed model is explicitly modelled as a probabilistic vector and can be obtained directly during the inference process. Finally, the expectation maximization algorithm and gradient descent approach are used to maximize the log-likelihood function and infer the unknown parameters of the proposed model. The performance of the proposed model at image segmentation is compared with some state-of-the-art models on various synthetic noisy grayscale images and real-world color images.     

Segmentation of Gabor-filtered textures using deterministicrelaxation

A supervised texture segmentation scheme is proposed in this article. The texture features are extracted by filtering the given image using a filter bank consisting of a number of Gabor filters with different frequencies, resolutions, and orientations. The segmentation model consists of feature formation, partition, and competition processes. In the feature formation process, the texture features from the Gabor filter bank are modeled as a Gaussian distribution. The image partition is represented as a noncausal Markov random field (MRF) by means of the partition process. The competition process constrains the overall system to have a single label for each pixel. Using these three random processes, the a posteriori probability of each pixel label is expressed as a Gibbs distribution. The corresponding Gibbs energy function is implemented as a set of constraints on each pixel by using a neural network model based on Hopfield network. A deterministic relaxation strategy is used to evolve the minimum energy state of the network, corresponding to a maximum a posteriori (MAP) probability. This results in an optimal segmentation of the textured image. The performance of the scheme is demonstrated on a variety of images including images from remote sensing.     

Adaptive segmentation of textured images by using the coupled Markov random field model.

Although simple and efficient, traditional feature-based texture segmentation methods usually suffer from the intrinsical less inaccuracy, which is mainly caused by the oversimplified assumption that each textured subimage used to estimate a feature is homogeneous. To solve this problem, an adaptive segmentation algorithm based on the coupled Markov random field (CMRF) model is proposed in this paper. The CMRF model has two mutually dependent components: one models the observed image to estimate features, and the other models the labeling to achieve segmentation. When calculating the feature of each pixel, the homogeneity of the subimage is ensured by using only the pixels currently labeled as the same pattern. With the acquired features, the labeling is obtained through solving a maximum a posteriori problem. In our adaptive approach, the feature set and the labeling are mutually dependent on each other, and therefore are alternately optimized by using a simulated annealing scheme. With the gradual improvement of features' accuracy, the labeling is able to locate the exact boundary of each texture pattern adaptively. The proposed algorithm is compared with a simple MRF model based method in segmentation of Brodatz texture mosaics and real scene images. The satisfying experimental results demonstrate that the proposed approach can differentiate textured images more accurately.     

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.     

基于图像分解的稀疏正则化多区域图像分割方法

针对图像具有不同特征的成分,提出一种基于图像分解的多区域图像分割模型和算法.首先将图像分解项引入到图像分割模型中,递减了纹理和噪声对分割的影响;其次使用稀疏正则化方法保持分割区域的边缘几何结构;最后基于增广Lagrange乘子法,给出一种由扩散流引导的小波迭代阈值图像分割算法.一系列实验结果表明,提出的方法抗干扰能力强,对噪声具有更好的鲁棒性.提出的方法不仅能够分割结构图像,并且能够分割较复杂的纹理图像.     

Remote sensing image segmentation based on spatially constrained Gaussian mixture model with unknown class number

In view of the traditional Gaussian mixture model (GMM),it was difficult to obtain the number of classes and sensitive to the noise.A remote sensing image segmentation method based on spatially constrained GMM with unknown number of classes was proposed.First,in the built GMM,prior probability that represented the membership between a pixel and one class was modeled as a Markov random field (MRF).In order to improve the sensitivity of noise,the smoothing factor was defined by combining the a posterior probability and the prior probability of neighboring pixels.For estimating the number of classes and the parameters of model,the reversible jump Markov chain Monte Carlo (RJMCMC) and maximum likelihood (ML) estimation were employed,respectively.Finally,by minimizing the smoothing factor the final segmentation was obtained.In order to verify the proposed segmentation method,the synthetic and real panchromatic images were tested.The experimental results show that the proposed method is feasible and effective.     

A Markov random field model-based approach to unsupervised texturesegmentation using local and global spatial statistics

Many studies have proven that statistical model-based texture segmentation algorithms yield good results provided that the model parameters and the number of regions be known a priori. In this correspondence, we present an unsupervised texture segmentation method that does not require knowledge about the different texture regions, their parameters, or the number of available texture classes. The proposed algorithm relies on the analysis of local and global second and higher order spatial statistics of the original images. The segmentation map is modeled using an augmented-state Markov random field, including an outlier class that enables dynamic creation of new regions during the optimization process. A Bayesian estimate of this map is computed using a deterministic relaxation algorithm. Results on real-world textured images are presented.     

基于MRF模型的可靠的图像分割

本文提出一种可靠的图象分割算法。基于实际图象是分割图像叠加了不规则噪声的假设,用ＭＦＲ模型描述分割图象的先验分布,用被污染的高斯分布描述待分割的图像。采用Ｂａｙｅｓ方法,根据分割图像的后验分布所对应的ＭＲＦ模型的条件概率,用ＩＣＭ局部优化方法,获得ＭＡＰ准则下的图像分割结果。该算法与Ｌａｋｓｈｍａｎａｎ等提出的算法相比,具有更好的可靠性,实验结果是令人满意的。     

基于视觉感知和MARMA-MRF模型的SAR图像分割

模拟人类视觉感知机制,提出了一种基于多尺度 自回归滑动平均(MARMA,multiscale auto-regressive and moving average model)模型 和Markov随机场(MRF,markov random field)的合成孔径雷达(SAR)图像分割新方法。首先 ,分析人类视觉感知系统的工作机制 和特点,利用SAR的成像机理,构建了SAR图像的金字塔结构和MARMA模型, 以此模拟视觉过程中的空间尺度和朝向感知机制;然后,通过不同尺度上的MRF模型和改 进的模拟退火(SA)算法实现更有效的多尺度分割策略。实验结果表明,本文提出的方法在SA R图像分割任务中有非常良好的表现。