基于多分辨率马尔可夫随机场运动目标分割

提出一种基于三维时空小波变换和马尔可夫随机场(MarkovRandomField)模型的多分辨率运动目标分割算法。该算法利用三维时空小波变换对图像序列进行分解得到多分辨率的图像序列,并在此基础上建立多分辨率的马尔可夫随机场模型,构造相应的能量函数。通过条件迭代模型优化算法(IteratedConditionalModes)求解能量函数的最优解,得出标记场,提取出运动目标。实验结果证明,该算法能够很好地消除了单一分辨率的MRF运动检测结果中"空洞"现象,对运动目标分割具有很好的分割效果。     

基于多分辨率马尔可夫随机场运动目标分割

提出一种基于三维时空小波变换和马尔可夫随机场(Markov Random Field)模型的多分辨率运动目标分割算法.该算法利用三维时空小波变换对图像序列进行分解得到多分辨率的图像序列,并在此基础上建立多分辨率的马尔可夫随机场模型,构造相应的能量函数.通过条件迭代模型优化算法(Iterated Conditional Modes)求解能量函数的最优解,得出标记场,提取出运动目标.实验结果证明,该算法能够很好地消除了单一分辨率的MRF运动检测结果中"空洞"现象,对运动目标分割具有很好的分割效果.     

面向智能视频监控中的运动目标检测方法研究

运动目标检测是实现智能视频监控的基础,针对当前运动目标检测方法在复杂场景中适应性差的问题,提出了一种结合时空马尔可夫随机场模型和高斯混合模型的运动目标检测方法。在训练时空马尔可夫随机场模型时,采用高斯混合模型的参数更新算法计算邻域图像分割区域的均值和方差,并通过时空邻域标记场设置势函数。通过与传统目标检测方法的仿真比较,验证了该方法的优越性。结果表明,与传统的目标检测方法相比,该方法在复杂场景下具有更高的检测精度,能够更清晰地分割前景中的运动目标。     

一种基于小波变换的马尔可夫随机场的视频对象分割

马尔可夫随机场（Markov Random Field,MRF）理论已经被广泛地应用于视频图像的分割。提出一种基于小波变换的马尔可夫随机场模型的视频对象分割算法。该算法利用小波变换将图像序列分解到小波域,并在此基础上建立马尔可夫随机场模型,构造相应的能量函数。通过迭代求解能量函数的最优解,得出标记场,提取出运动对象。仿真结果表明,该算法能够有效地抑制噪声,提高构成对象边界像素的数量,快速有效地提取出视频对象。     

多尺度双边滤波及其在图像分割中的应用

噪声图像分割前需要先进行平滑预处理,双边滤波用于图像平滑的滤波效果取决于参数的选取．为降低参数选取的难度,本文提出一种多尺度双边滤波算法来综合不同尺度下双边滤波的平滑效果．先将多尺度双边滤波算法用于噪声图像的平滑预处理,能够在去除噪声的同时较好地保留边缘;再用间断自适应高斯马尔可夫随机场模型进行图像分割．对多个图像进行图像分割的实验结果证明了所提算法的有效性．     

采用多组单应约束和马尔可夫随机场的运动目标检测算法

针对现有动态背景下目标检测算法的局限性,提出一种基于多组单应约束和马尔可夫随机场的运动目标检测算法.该算法以视频序列多帧跟踪的运动轨迹为基础,通过轨迹分离和像素标记2个阶段实现运动目标的检测:在轨迹分离阶段,利用多组单应约束对视频序列的背景运动进行建模,并基于该约束通过累积确认的策略实现背景轨迹和前景轨迹的准确分离;在像素标记阶段,以超像素为节点建立时空马尔可夫随机场模型,将轨迹分离信息以及超像素的时空邻域关系统一建模在马尔可夫随机场的能量函数中,并通过最小化能量函数得到每个像素的前背景标记结果.与现有基于运动轨迹的方法相比,文中算法不需要仿射摄像机模型的假设,有效地解决了运动轨迹等长带来的轨迹点区域缺失问题,并可同时处理静态背景和动态背景2种类型的视频;在多个公开数据集的测试结果表明,该算法在轨迹分离准确性、轨迹点密度以及像素标记准确率等方面均优于现有方法.     

一种改进的隐马尔可夫随机场遥感影像分割算法

针对传统的马尔科夫随机场影像分割算法对影像噪声和像素异常值敏感,容易产生分割结果不准确以及边缘不平滑等问题,提出了一种基于有限高斯混合模型的隐马尔科夫随机场影像分割算法。首先,以期望最大化算法代替传统的K-means方法获得影像初始分割结果,并用双边滤波器对初始分割结果进行滤波处理。其次,使用有限高斯混合模型和Potts模型分别对影像特征场和标记场建模,并用期望最大化算法进行参数估计,从而获得特征场能量和标记场能量。最后,利用迭代条件模式算法进行能量函数最小化优化,获得最优分割结果。结果表明:相比于经典MRF方法和传统HMRF方法,该算法获得的分割结果更精确,并且概率兰德指数和全局一致性误差指标都优于这两种算法。     

基于动态金字塔标记随机场模型的非监督纹理分割算法

在马尔可夫随机场纹理模型的基础上，提出一个基于金字塔结构的动态多尺度标记随机场模型，应用这个模型实现纹理图像分割．算法应用由粗至细的处理策略，实现了图像的区域紧凑性，克服了一层GRF标记场结构的运算复杂性，减少了运算时间，并且能够获得较好的分割结果。     

对马尔可夫随机场特征级图像融合的改进

提出了一种基于MAP的Markov随机场的图像融合方法。将感兴趣区特征的均值与方差作为马尔可夫随机场的概率参数,选取合适的模型,根据优化算法快速求得MAP解,完成图像初始标记过程,根据最大后验概率模型,对图像进行特征层融合。通过两组遥感图像的实验,证明MAP-MRF模型在遥感图像特征层融合中,具有较目前常用方法更好的效果。     

基于PSO的Markov随机场在医学图像分割中的应用

研究了应用粒子群优化算法（PSO）优化Markov随机场方法对磁共振图像进行分割的算法。建立了基于马尔可夫随机场的图像分割模型,针对马尔可夫随机场图像模型的局部相关特性和最大后验概率估计,将粒子群优化算法应用于该模型,快速获得图像分割目标的全局最优解。实验数据表明该方法的高效性。     

MRF model and FRAME model-based unsupervised image segmentation

This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first layer is modeled as a Markov Random Field (MRF) representing an unobservable region image and the second layer uses "Filters, Random and Maximum Entropy (Abb. FRAME)" model to represent multiple textures which cover each region. Compared with the traditional Hierarchical Markov Random Field (HMRF), the FRAME can use a bigger neighborhood system and model more complex patterns. The segmentation problem is formulated as Maximum a Posteriori (MAP) estimation according to the Bayesian rule. The iterated conditional modes (ICM) algorithm is carried out to find the solution of the MAP estimation. An algorithm based on the local entropy rate is proposed to simplify the estimation of the parameters of MRF. The parameters of FRAME are estimated by the ExpectationMaximum (EM) algorithm. Finally, an exp     

Discriminative Random Fields

In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and modeling these dependencies in a principled manner is crucial to achieve good classification accuracy. In this work, we present Discriminative Random Fields (DRFs) to model spatial interactions in images in a discriminative framework based on the concept of Conditional Random Fields proposed by lafferty et al.(2001). The DRFs classify image regions by incorporating neighborhood spatial interactions in the labels as well as the observed data. The DRF framework offers several advantages over the conventional Markov Random Field (MRF) framework. First, the DRFs allow to relax the strong assumption of conditional independence of the observed data generally used in the MRF framework for tractability. This assumption is too restrictive for a large number of applications in computer vision. Second, the DRFs derive their classification power by exploiting the probabilistic discriminative models instead of the generative models used for modeling observations in the MRF framework. Third, the interaction in labels in DRFs is based on the idea of pairwise discrimination of the observed data making it data-adaptive instead of being fixed a priori as in MRFs. Finally, all the parameters in the DRF model are estimated simultaneously from the training data unlike the MRF framework where the likelihood parameters are usually learned separately from the field parameters. We present preliminary experiments with man-made structure detection and binary image restoration tasks, and compare the DRF results with the MRF results. Sanjiv Kumar is currently with Google Research, Pittsburgh, PA, USA. His contact email is: sanjivk@google.com.     

结合多空间特征的多尺度马尔可夫随机场彩色图像分割

提出了一种结合多空间特征的多尺度马尔可夫随机场(MRF)模型——MS-MRMRF。针对RGB单空间对彩色图像描述不足的问题,模型首先将图像转化为HSV空间并与RGB空间结合形成多空间特征;然后根据多空间特征的形式,提出了一种模糊化估参的多尺度MRF模型对其进行分割。彩色图像的分割实验表明：相比现有的单空间特征的多尺度MRF算法,结合多空间特征的多尺度MRF可以有效地提高分割精度。     

A Markov Random Field Model-Based Approach to Natural Image Matting

This paper proposes a Markov Random Field (MRF) model-based approach to natural image matting with complex scenes. After the trimap for matting is given manually, the unknown region is roughly segmented into several joint sub-regions. In each sub-region, we partition the colors of neighboring background or foreground pixels into several clusters in RGB color space and assign matting label to each unknown pixel. All the labels are modelled as an MRF and the matting problem is then formulated as a maximum a posteriori (MAP) estimation problem. Simulated annealing is used to find the optimal MAP estimation. The better results can be obtained under the same user-interactions when images are complex. Results of natural image matting experiments performed on complex images using this approach are shown and compared in this paper.     

基于Markov随机场的运动目标快速分割

提出了一种基于MRF模型自适应运动目标图像分割方法，该法采用高斯混合模型描述视频序列的差分图像，用模拟退火快速EM算法对高斯分布的参数进行估计，在此基础上建立MRF模型，利用此模型构建能量函数，ICM算法把图像用一个能量函数取到最小值的组态来表示。     

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

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

二维纹理图象的产生

本文在R.Chellappa提出的马尔可夫模型[1]纹理综合方法的基础上,提出了一种级联的 马尔可夫模型.利用此模型进行纹理图象综合时,可以克服文献[1]中所提出的方法的不稳定 性,而且使模型应用范围更广泛,实验结果更理想.     

Real-time Defect Inspection of Textured Surfaces

Texture analysis plays an important role in the automated visual inspection of textured images to detect their defects. For this purpose, model-based and feature-based methods are implemented and tested for textile images in a laboratory environment. The methods are compared in terms of their success rates in determining the defects. The Markov Random Field model is applied on different DSP systems for real-time inspection.     

Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field

We present a new method for blind document bleed-through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate priors are derived from the full graph. The segmentation algorithm is based on Bayesian Maximum a Posteriori (MAP) estimation. The advantages of this separate approach are the adaptation of the prior to the contents creation process (e.g., superimposing two handwritten pages), and the improvement of the estimation of the recto pixels through an estimation of the verso pixels covered by recto pixels; moreover, the formulation as a binary labeling problem with two hidden labels per pixels naturally leads to an efficient optimization method based on the minimum cut/maximum flow in a graph. The proposed method is evaluated on scanned document images from the 18th century, showing an improvement of character recognition results compared to other restoration methods.