An integrated approach for scene understanding based on Markov Random Field model

In this paper, we propose a Markov Random Field model-based approach as a unified and systematic way for modeling, encoding and applying scene knowledge to the image understanding problem. In our proposed scheme we formulate the image segmentation and interpretation problem as an integrated scheme and solve it through a general optimization algorithm. More specifically, the image is first segmented into a set of disjoint regions by a conventional region-based segmentation technique which operates on image pixels, and a Region Adjacency Graph (RAG) is then constructed from the resulting segmented regions based on the spatial adjacencies between regions. Our scheme then proceeds on the RAG by defining the region merging and labeling problem based on the MRF models. In the MRF model we specify the a priori knowledge about the optimal segmentation and interpretation in the form of clique functions and those clique functions are incorporated into the energy function to be minimized by a general optimization technique. In the proposed scheme, the image segmentation and interpretation processes cooperate in the simultaneous optimization process such that the erroneous segmentation and misinterpretation due to incomplete knowledge about each problem domain can be compensately recovered by continuous estimation of the single unified energy function. We exploit the proposed scheme to segment and interpret natural outdoor scene images.     

Fully Bayesian Field Slam Using Gaussian Markov Random Fields

This paper presents a fully Bayesian way to solve the simultaneous localization and spatial prediction problem using a Gaussian Markov random field (GMRF) model. The objective is to simultaneously localize robotic sensors and predict a spatial field of interest using sequentially collected noisy observations by robotic sensors. The set of observations consists of the observed noisy positions of robotic sensing vehicles and noisy measurements of a spatial field. To be flexible, the spatial field of interest is modeled by a GMRF with uncertain hyperparameters. We derive an approximate Bayesian solution to the problem of computing the predictive inferences of the GMRF and the localization, taking into account observations, uncertain hyperparameters, measurement noise, kinematics of robotic sensors, and uncertain localization. The effectiveness of the proposed algorithm is illustrated by simulation results as well as by experiment results. The experiment results successfully show the flexibility and adaptability of our fully Bayesian approach in a data‐driven fashion.     

Higher-order SVD analysis for crowd density estimation

This paper proposes a new method to estimate the crowd density based on the combination of higher-order singular value decomposition (HOSVD) and support vector machine (SVM). We first construct a higher-order tensor with all the images in the training set, and apply HOSVD to obtain a small set of orthonormal basis tensors that can span the principal subspace for all the training images. The coordinate, which best describes an image under this set of orthonormal basis tensors, is computed as the density character vector. Furthermore, a multi-class SVM classifier is designed to classify the extracted density character vectors into different density levels. Compared with traditional methods, we can make significant improvements to crowd density estimation. The experimental results show that the accuracy of our method achieves 96.33%, in which the misclassified images are all concentrated in their neighboring categories.     

A probabilistic framework for copy-move forgery detection based on Markov Random Field

Multimedia Tools and Applications - Copy-move forgery is one of the most common kind of image tampering where some part of an image is copied, may be with minor modifications, pasted to another...     

An information-theoretic wavelet-based texture descriptor using Gaussian Markov random field models

Multimedia Tools and Applications - Texture characterization and identification is a key issue for a variety of computer vision and image processing applications. Current techniques developed for...     

基于马尔科夫随机场框架的单幅图像去雾*

雾或霾等天气会降低场景的能见度,给机器视觉的后续处理造成影响。针对图像雾霾退化的恢复、及现有基于马尔科夫随机场图像去雾算法的缺陷,提出了一种新的基于马尔科夫随机场和暗通道先验的图像去雾算法。该算法以雾天条件下退化模型为基础,通过介质传输图和原始无雾图像的约束条件,利用暗通道先验获取介质传输图的粗估计,构造MRF框架下的代价函数。为使去雾图像保持更多的纹理细节,引入纹理检测函数改进代价函数,最终求得去雾图像和介质传输图。实验结果表明,本文方法可以得到较好的去雾效果,同时保持较多的纹理细节和更快的运算时间。     

Markov随机场与Gaussian曲线在MR图像分割中的应用

针对扫描的人脑组织MR图像边缘分辨率低、模糊性大的特点,本文提出了一种基于模糊Markov随机场和Gaussian曲线相结合的MR图像最佳阈值分割方法。该方法通过对图像的像素邻域属性的统计将模糊论引入其中,建立模糊Markov随机场,并利用Gaussian曲线对二维直方图最佳一维投影进行拟合,确定出图像中各脑组织的二维阈值点,在二维直方图上实现对脑组织的分割。通过实验表明,本算法能够有效提高脑组织的分辨率,对噪声的鲁棒性、结果区域的连通性相对于一维Otsu和二维Otsu算法都有了很大的提高。     

Probability density estimation using a Gaussian clustering algorithm

A version of the Tråvén's [1] Gaussian clustering algorithm for normal mixture densities is studied. Unlike in the case of the Tråvén's algorithm, no constraints on covariance structure of mixture components are imposed. Simulations suggest that the modified algorithm is a very promising method of estimating arbitrary continuous d-dimensional densities. In particular, the simulations have shown that the algorithm is robust against assuming the initial number of mixture components to be too large.This work was supported in part by the State Committee for Scientific Research (KBN) under grant PB 0589/P3/94/06. It was completed while the second author was on leave to the Department of Statistics, Rice University, Houston, Texas.     

基于纹理和高斯密度特征的图像检索算法

直接从DCT域中提取图像的特征是提高图像的检索效率的方法.直接从压缩域中提取图像的高斯密度,即计算图像在8个方向上的分段累加值,形成一个8*4的二维向量,再结合图像的纹理特征来进行图像检索.为了验证算法的可行性,建立了10000幅图像的图像库.实验结果表明,该方法能够准确地检索出目标图像,有效地提高了图像检索的精度和速度.     

马尔科夫随机场化的光照一致图像合成方法

针对图像合成中源图像与目标图像光照环境不一致造成直接合成图像不逼真的问题,提出一种基于马尔科夫随机场的光照一致图像合成方法.首先基于加权的泊松克隆方法构建梯度保持的光滑约束,削弱传统的泊松克隆方法在合成边界源图像和目标图像光照差异变化剧烈时产生的渗透效应;然后基于直方图对齐的方法构建光照一致的数据约束,保持合成图像前、背景亮度主轴的一致性;最后根据合成边界源图像的边缘特性以及源图像和目标图像光照差异变化的剧烈程度自适应地调整2项约束的权重,并采用融合局部和全局一致性的学习算法对构建的马尔科夫随机场函数进行快速求解.实验结果表明,该方法产生的合成效果在梯度特征保持方面以及亮度一致性方面均优于传统的泊松克隆方法,同时收敛速度得到了提高.     

基于马尔可夫随机场的运动目标检测

精确的目标检测是目标跟踪和识别的重要前提。提出了一种基于固定摄像机环境下的运动目标检测方案,利用多高斯和马尔可夫随机场的混合模型对视频序列进行前景分割,以达到对运动目标检测的目的。建立了马尔可夫随机场用以刻画图像中每个像素点与一定范围的领域内其他各点的关系,同时考虑一定的时域中的关系从而构建一个全局的约束,弥补多高斯模型只考虑单点信息的不足,使得前景分割更为准确。还给出了一种基于多高斯和马尔可夫随机场的新的能量函数形式,并给出了模拟退火方法对模型进行求解的方法。结果表明,利用该文的方法对运动目标进行检测,结果要优于多高斯模型。     

基于小波与高斯Markov随机场组合的轮廓纹理分割

为综合多尺度纹理模型和高斯型Markov随机场纹理模型各自的优点，本文提出了组合这两种模型的方法，Mallat的经验法、高斯型Markov随机场纹理模型和组合方法的对比实验表明，当纹理结构包含微结构时，组合方法分割纹理轮廓的性能最好、     

高阶马尔可夫随机场下目标识别模型的建立

目标识别是指一个特殊目标（或一种类型的目标）从其他目标（或其他类型的目标）中被区分出来的过程。给出了高阶马尔可夫随机场下的区域邻域系统定义;通过贝叶斯分析,构建了基于协方差矩阵描述子刻画的图像区域度量的先验模型和似然模型;应用随机算法得到极大后验估计,求得目标所在位置和角度;再通过以目标所在位置为中心,获得多个随机矩形;最终以覆盖范围最大者为所寻找的目标区域。通过Matlab仿真实验,对道路中的斑马线进行模拟识别。实验结果表明,可以达到在大区域中识别出既定目标的目的。     

Multi-scale and multi-column convolutional neural network for crowd density estimation

Multimedia Tools and Applications - In order to accurately identify objects of different sizes, we propose an efficient Multi-Scale and Multi-Column Convolutional Neural Network (MSMC) to estimate...     

图像分割中的马尔可夫随机场方法综述

马尔可夫随机场方法是图像分割中一个极为活跃的研究方向。本文介绍了基于马尔可夫随机场模型的一般理论与图像的关系,给出它在图像分割中的通用框架:包括空域和小波域图像模型的建立、最优准则的选取、标号数的确定、图像模型参数的估计和图像分割的实现,评述了其在图像分割中的应用,展望其发展的方向。     

基于马尔可夫随机场的快速图象分割

根据卫星遥感图象的特点,讨论了基于马可夫随机场的图象分割方法,建立了相应的基于马可夫随机场的图象分割模型,以实现复杂遥感图象的快速分割,并由此将图象分割问题转化成图象标记问题,进而转化成求解图象的最大后验概率估计的问题。虽然传统的模拟退火算法（SA）能达到后验概率的全局最大,但是时间复杂度太高,实际分割中经常采用次优算法,文中还引进了一种基于博弈理论的决定性退火算法（GSA）和一种基于竞争理论的算法（CA）,取得了快速分割图象的效果。试验证明,该两种算法完全可应用于复杂遥感图象的快速分割。     

A negotiation‐based service selection approach using swarm intelligence and kernel density estimation

Nowadays, the cloud computing environment is becoming a natural choice to deploy and provide Web services that meet user needs. However, many services provide the same functionality and high quality of service (QoS) but different self‐adaptive behaviors. In this case, providers' adaptation policies are useful to select services with high QoS and high quality of adaptation (QoA). Existing approaches do not take into account providers' adaptation policies in order to select services with high reputation and high reaction to changes, which is important for the composition of self‐adaptive Web services. In order to actively participate to compositions, candidate services must negotiate their self‐* capabilities. Moreover, they must evaluate the participation constraints against their capabilities specified in terms of QoS and adaptation policies. This paper exploits a variant of particle swarm optimization and kernel density estimation in the selection of service compositions and the concurrent negotiations of their QoS and QoA capabilities. Selection and negotiation processes are held between intelligent agents, which adopt swarm intelligence techniques for achieving optimal selection and optimal agreement on providers' offers. To resolve unknown autonomic behavior of candidate services, we deal with the lack of such information by predicting the real QoA capabilities of a service through the kernel density estimation technique. Experiments show that our solution is efficient in comparison with several state‐of‐the‐art selection approaches.     

Moving object detection using Markov Random Field and Distributed Differential Evolution

In this article, we present an algorithm for detecting moving objects from a given video sequence. Here, spatial and temporal segmentations are combined together to detect moving objects. In spatial segmentation, a multi-layer compound Markov Random Field (MRF) is used which models spatial, temporal, and edge attributes of image frames of a given video. Segmentation is viewed as a pixel labeling problem and is solved using the maximum a posteriori (MAP) probability estimation principle; i.e., segmentation is done by searching a labeled configuration that maximizes this probability. We have proposed using a Differential Evolution (DE) algorithm with neighborhood-based mutation (termed as Distributed Differential Evolution (DDE) algorithm) for estimating the MAP of the MRF model. A window is considered over the entire image lattice for mutation of each target vector of the DDE; thereby enhancing the speed of convergence. In case of temporal segmentation, the Change Detection Mask (CDM) is obtained by thresholding the absolute differences of the two consecutive spatially segmented image frames. The intensity/color values of the original pixels of the considered current frame are superimposed in the changed regions of the modified CDM to extract the Video Object Planes (VOPs). To test the effectiveness of the proposed algorithm, five reference and one real life video sequences are considered. Results of the proposed method are compared with four state of the art techniques and provide better spatial segmentation and better identification of the location of moving objects.     

Gaussian kernels for density estimation with compositional data

Common simplifications of the bandwidth matrix cannot be applied to existing kernels for density estimation with compositional data. In this paper, kernel density estimation methods are modified on the basis of recent developments in compositional data analysis and bandwidth matrix selection theory. The isometric log-ratio normal kernel is used to define a new estimator in which the smoothing parameter is chosen from the most general class of bandwidth matrices on the basis of a recently proposed plug-in algorithm. Both simulated and real examples are presented in which the behaviour of our approach is illustrated, which shows the advantage of the new estimator over existing proposed methods.