融入邻域作用的高斯混合分割模型及简化求解

目的 基于高斯混合模型（GMM）的图像分割方法易受噪声影响,为此采用马尔可夫随机场（MRF）将像素邻域关系引入GMM,提高算法抗噪性。针对融入邻域作用的高斯混合分割模型结构复杂、参数估计困难,难以获得全局最优分割解等问题,提出一种融入邻域作用的高斯混合分割模型及其简化求解方法。方法 首先,构建融入邻域作用的GMM。为了提高GMM的抗噪性,采用MRF建模混合模型权重系数的先验分布。然后,利用贝叶斯理论建立图像分割模型,即品质函数;由于品质函数中参数较多（包括权重系数,均值,协方差）、函数结构复杂,导致参数求解困难。因此,将品质函数中的均值和协方差定义为权重系数的函数,由此简化模型结构并方便其求解;虽然品质函数中仅包含参数权重系数,但结构比较复杂,难以求得参数的解析式。最后,采用非线性共轭梯度法（CGM）求解参数,该方法仅需利用品质函数值和参数梯度值,降低了参数求解的复杂性,并且收敛快,可以得到全局最优解。结果 为了有效而准确地验证提出的分割方法,分别采用本文算法和对比算法对合成图像和高分辨率遥感图像进行分割实验,并定性和定量地评价和分析了实验结果。实验结果表明本文方法的有效抗噪性,并得到很好的分割结果。从参数估计结果可以看出,本文算法有效简化了模型参数,并获得全局最优解。结论 提出一种融入邻域作用的高斯混合分割模型及其简化求解方法,实验结果表明,本文算法提高了算法的抗噪性,有效地简化了模型参数,并得到全局最优参数解。本文算法对具有噪声的高分辨率遥感影像广泛适用。     

基于模糊马尔可夫场的脑部MR图像分割算法

在传统马尔可夫场模型的基础上,建立了模糊马尔可夫场模型。通过对模型的分析得出图像像素对不同类的隶属度计算公式,提出了一种高效、无监督的图像分割算法,从而实现了对脑部MR图像的精确分割。通过对模拟脑部MR图像和临床脑部MR图像分割实验,表明新算法比传统的基于马尔可夫场的图像分割算法和模糊C-均值等图像分割算法有更精确的图像分割能力。     

Variational EM method for blur estimation using the spike-and-slab image prior

Most state-of-the-art blind image deconvolution methods rely on the Bayesian paradigm to model the deblurring problem and estimate both the blur kernel and latent image. It is customary to model the image in the filter space, where it is supposed to be sparse, and utilize convenient priors to account for this sparsity. In this paper, we propose the use of the spike-and-slab prior together with an efficient variational Expectation Maximization (EM) inference scheme to estimate the blur in the image. The spike-and-slab prior, which constitutes the gold standard in sparse machine learning, selectively shrinks irrelevant variables while mildly regularizing the relevant ones. The proposed variational Expectation Maximization algorithm is more efficient than usual Markov Chain Monte Carlo (MCMC) inference and, also, proves to be more accurate than the standard mean-field variational approximation. Additionally, all the prior model parameters are estimated by the proposed scheme. After blur estimation, a non-blind restoration method is used to obtain the actual estimation of the sharp image. We investigate the behavior of the prior in the experimental section together with a series of experiments with synthetically generated and real blurred images that validate the method's performance in comparison with state-of-the-art blind deconvolution techniques.     

多主体框架下结合最大期望值和遗传算法的SAR图像分割

目的 SAR图像中固有的相干斑噪声增加了图像分割的困难.为此,提出一种分布式SAR图像分割算法.方法 首先假设图像中同质区域内像素满足同一独立的Gamma分布,依此建立SAR图像模型;为了刻画SAR图像中像素的类属性,建立标号场的MRF(Markov Random Field)模型;在Bayesian理论框架下建立图像分割模型;在多主体系统(MAS)框架下,结合MRF模型和遗传算法(GA)模拟分割模型.MAS结构由分割主体和协调主体组成,其中分割主体利用最大期望值( EM)算法估计MRF模型参数,从而实现全局分割;协调主体利用GA实现全局最优.结果 为了验证提出方法的有效性,分别对模拟和RADARSAT-I/II SAR图像进行实验,并与EM和RJMCMC算法比较.本文算法的用户精度、产品精度、总精度及kappa系数均高于EM算法.定性和定量分析结果验证了本文算法的鲁棒性和有效性.结论 实验结果表明提出的分布式MAS框架下SAR图像分割方法,能够提高分割精度.该方法适用于中高分辨率单极化的SAR图像,且具有很好的抗噪性.     

EM procedures using mean field-like approximations for Markov model-based image segmentation

Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments.     

A probabilistic approach for foreground and shadow segmentation in monocular image sequences

This paper presents a novel method of foreground and shadow segmentation in monocular indoor image sequences. The models of background, edge information, and shadow are set up and adaptively updated. A Bayesian network is proposed to describe the relationships among the segmentation label, background, intensity, and edge information. A maximum a posteriori—Markov random field estimation is used to boost the spatial connectivity of segmented regions.     

改进的PMD距离图像超分辨率重建算法

PMD(photonic mixer device)相机是一款基于TOF(time-of-flight)技术的3维成像系统,在获得2维灰度图像的基础上,能够同时捕捉距离图像和幅度图像。但它的主要缺点是分辨率低,并存在较大的随机噪声。针对此问题,结合PMD相机幅度信息和双边滤波器的特点,提出一种改进的非连续自适应马尔科夫随机场(DAMRF)模型的超分辨率重建方法,该模型引入调制信号幅度A的平方作为可信度,将其作为权值对传统DAMRF模型中能量函数的距离项进行自适应加权,从而增加距离图像每个像素点在平滑过程中的权值。该方法不仅提高了距离图像的空间分辨率,又能有效地对距离图像进行滤波去噪,同时也增强了距离图像的边缘信息,较好地保持了图像边缘的连续性。实验结果表明,该方法的重建结果优于传统DAMRF模型的超分辨率方法,获得重建图像的信噪比(SNR)和均方根误差(RMSE)都有较好的改善,重建图像的视觉效果也得到一定的提高。     

离散ADMM方法下像素与对象基元协同优化的遥感影像无监督语义分割

语义分割是遥感影像分析中的重要技术之一。现有的方法（如基于深度卷积神经网络的方法等）虽然在语义分割中取得了显著进展,但往往需要大量训练数据。基于图模型的马尔可夫随机场模型（Markov random field model,MRF）提出了一种不依赖训练数据的无监督语义分割思路,可以有效地刻画地物空间关系,并对地物空间分布的统计规律进行建模。但现有的MRF模型方法通常建立在基于像素或对象的单一粒度基元上,难以充分利用影像信息,语义分割效果不佳。针对上述问题,引入交替方向乘子法 （alternative direction method of multiplier,ADMM）并将其离散化,提出了一种像素与对象基元协同的MRF模型无监督语义分割方法（MRF-ADMM）。首先构建像素基元和对象基元两个概率图,其中像素基元概率图用于刻画影像的细节信息,保持语义分割的边界;对象基元概率图用于描述较大范围的空间关系,以应对遥感影像地物内部的高异质性,使分割结果中地物内部具有良好的区域完整性。在模型求解过程中,针对像素和对象基元的特点,提出了一种离散化的ADMM方法,并将其用于两种基元类别标记的传递与更新,实现像素基元细节信息和对象基元区域信息的协同优化。高分二号和航拍影像等不同数据库不同类型遥感影像的语义分割实验结果表明,相较于现有的MRF模型,提出的MRF-ADMM方法能有效地协同不同粒度基元的优点,优化语义分割结果。     

Unsupervised image segmentation using a simple MRF model with a new implementation scheme

A simple Markov random field model with a new implementation scheme is proposed for unsupervised image segmentation based on image features. The traditional two-component MRF model for segmentation requires training data to estimate necessary model parameters and is thus unsuitable for unsupervised segmentation. The new implementation scheme solves this problem by introducing a function-based weighting parameter between the two components. Using this method, the simple MRF model is able to automatically estimate model parameters and produce accurate unsupervised segmentation results. Experiments demonstrate that the proposed algorithm is able to segment various types of images (gray scale, color, texture) and achieves an improvement over the traditional method.     

空间约束层次加权Gamma混合模型的SAR图像分割

目的 合成孔径雷达（SAR）图像中像素强度统计分布呈现出复杂的特性,而传统混合模型难以建模非对称、重尾或多峰等特性的分布。为了准确建模SAR图像统计分布并得到高精度分割结果,本文提出一种利用空间约束层次加权Gamma混合模型（HWGaMM）的SAR图像分割算法。方法 采用Gamma分布的加权和定义混合组份;考虑到同质区域内像素强度的差异性和异质区域间像素强度的相似性,采用混合组份加权和定义HWGaMM结构。采用马尔可夫随机场（MRF）建模像素空间位置关系,利用中心像素及其邻域像素的后验概率定义混合权重以将像素邻域关系引入HWGaMM,构建空间约束HWGaMM,以降低SAR图像内固有斑点噪声的影响。提出算法结合M-H（Metropolis-Hastings）和期望最大化算法（EM）求解模型参数,以实现快速SAR图像分割。该求解方法避免了M-H算法效率低的缺陷,同时克服了EM算法难以求解Gamma分布中形状参数的问题。结果 采用3种传统混合模型分割算法作为对比算法进行分割实验。拟合直方图结果表明本文算法具有准确建模复杂统计分布的能力。在分割精度上,本文算法比基于高斯混合模型（GMM）、Gamma分布和Gamma混合模型（GaMM）分割算法分别提高33%,29%和9%。在分割时间上,本文算法虽然比GMM算法多64 s,但与基于Gamma分布和GaMM算法相比较分别快600 s和420 s。因此,本文算法比传统M-H算法的分割效率有很大的提高。结论 提出一种空间约束HWGaMM的SAR图像分割算法,实验结果表明提出的HWGaMM算法具有准确建模复杂统计分布的能力,且具有较高的精度和效率。     

Bayesian parameter inference for individual-based models using a Particle Markov Chain Monte Carlo method

Parameter estimation for agent-based and individual-based models (ABMs/IBMs) is often performed by manual tuning and model uncertainty assessment is often ignored. Bayesian inference can jointly address these issues. However, due to high computational requirements of these models and technical difficulties in applying Bayesian inference to stochastic models, the exploration of its application to ABMs/IBMs has just started. We demonstrate the feasibility of Bayesian inference for ABMs/IBMs with a Particle Markov Chain Monte Carlo (PMCMC) algorithm developed for state-space models. The algorithm profits from the model's hidden Markov structure by jointly estimating system states and the marginal likelihood of the parameters using time-series observations. The PMCMC algorithm performed well when tested on a simple predator-prey IBM using artificial observation data. Hence, it offers the possibility for Bayesian inference for ABMs/IBMs. This can yield additional insights into model behaviour and uncertainty and extend the usefulness of ABMs/IBMs in ecological and environmental research.     

An alternate method for using a visual discrimination model (VDM) to optimize soft-copy display image quality

Researchers have developed visual discrimination models (VDMs) that can predict a human observer's ability to detect a target object superposed on an image. These models incorporate sophisticated knowledge of the properties of the human visual system. In the predictive approach, termed conventional VDM usage, two input images with and without a target are analyzed by an algorithm that calculates a just-noticeable-difference (JND) index, which is a taken as a measure of the detectability of the target. A new method of using the VDM is described, termed channelized VDM, which involves finding the linear combination of the VDM-generated channels (which are not used in conventional VDM analysis) that has optimal classification ability between normal and abnormal images. The classification ability can be measured using receiver operating characteristic (ROC) or two alternative forced choice (2AFC) experiments, and in special cases they can also be predicted by signal detection theory (SDT) based model-observer methods. In this study simulated background and nodule containing regions were used to validate the new method. It was found that the channelized VDM predictions were in excellent qualitative agreement with human-observer validated SDT predictions. Either VDM method (conventional or channelized) has potential applicability to soft-copy display optimization. An advantage of any VDM-based approach is that complex effects, such as visual masking, are automatically accounted for, which effects are usually not included in SDT-based methods.