Markerless human body motion capture using Markov random field and dynamic graph cuts

Current vision-based human body motion capture methods always use passive markers that are attached to key locations on the human body. However, such systems may confront subjects with cumbersome markers, making it difficult to convert the marker data into kinematic motion. In this paper, we propose a new algorithm for markerless computer vision-based human body motion capture. We compute volume data (voxels) representation from the images using the method of SFS (shape from silhouettes), and consider the volume data as a MRF (Markov random field). Then we match a predefined human body model with pose parameters to the volume data, and the calculation of this matching is transformed into energy function minimization. We convert the problem of energy function construction into a 3D graph construction, and get the minimal energy by the max-flow theory. Finally, we recover the human pose by Powell algorithm.     

基于马尔科夫随机场的炉膛火焰图像分割

提出一种基于马尔科夫随机场模型的火焰图像分割算法。将由系统装置获取的原始火焰图像从RGB空间变换到HSV颜色空间,以提取颜色特征。分别对原始图像建立Potts标记场模型和有限正态混合观测场模型(FGMM),结合颜色特征,运用贝叶斯估计和ICM算法,计算最大后验概率(MAP),并完成图像分割。实验证明,该算法可以有效地分割炉膛火焰图像,为之后的工作奠定了基础。     

基于运动捕获数据的虚拟人动画研究

随着三维游戏等行业对计算机动画制作需求的增加,在三维动画制作软件中人工调整虚拟人动作的工作方式已经不再适合现在的计算机动画制作。运动捕获技术是直接记录物体的运动数据并将其用于生成计算机动画,具有高效率、所生成的动画真实感强等优点,因而获得了广泛应用。提出了一种利用运动捕获数据来生成动画的方法,基于运动捕获得到的数据建立并驱动三维骨架模型,从而产生骨架的运动,形成动画。该方法可以充分利用现有的大量运动捕获数据,因此具有较大的应用前景。     

Image denoising based on hierarchical Markov random field

We propose a hierarchical Markov random field model-based method for image denoising in this paper. The method employs a Markov random field (MRF) model with three layers. The first layer represents the underlying texture regions. The second layer represents the noise free image. And the third layer is the observed noisy image. Iterated conditional modes (ICM) is used to find the maximum a posteriori (MAP) estimation of the noise free image and texture region field. The experimental results show that the new method can effectively suppress additive noise and restore image details.     

基于马尔可夫随机场的纹理图像并行分割

基于消息传递接口（Message Passing Interface,MPI）和消息传递并行编程模型,提出了一种针对计算机集群（Cluster）的纹理图像并行分割算法。该算法使用马尔可夫随机场作为纹理特征,通过将图像分块,把特征提取的计算量均匀的分布到并行系统中的各个节点上,从而极大地减少了计算时间。在遥感图像上的实验发现,该算法在4机并行的环境下可以取得与单机串行程序一样精确的分割,而耗时仅为串行程序的31.95％。令人满意的实验结果表明该并行算法不但可以有效的应用于纹理图像分割,而且也为使用计算机集群实现高时间复杂度的图像处理提供了有益的启示。     

Pattern recognition using Markov random field models

In this paper, we propose Markov random field models for pattern recognition, which provide a flexible and natural framework for modelling the interactions between spatially related random variables in their neighbourhood systems. The proposed approach is superior to conventional approaches in many aspects. This paper introduces the concept of states into Markov random filed models, presents a theoretic analysis of the approach, discusses issues of designing neighbourhood system and cliques, and analyses properties of the models. We have applied our method to the recognition of unconstrained handwritten numerals. The experimental results show that the proposed approach can achieve high performance.     

改进的分层马尔可夫随机场彩色图像分割算法

针对传统的分层马尔可夫随机场（MRF）算法难以描述彩色图像像素值分布等问题,提出一种基于RGB色彩统计分布的分层MRF分割算法。在分层MRF模型的基础上,设定了相关参数并对分割过程进行了公式推导;结合RGB色彩统计分布模型,重写了分层MRF能量函数,利用k-means算法作为预分割算法,实现了算法的无监督分割。相比传统的分层MRF分割模型,该算法充分利用了彩色图像的像素值的信息,可有效地减少颜色分布参数和计算成本,能更准确地描述各分割对象的颜色分布;且该算法不受目标和背景颜色区间分布、目标空间分布的限制,能够很好地描述不同目标和背景。通过大量实验验证了算法的有效性,其在运算速度、分割精度等方面均优于传统MRF算法和模糊C均值（FCM）算法。     

基于马尔可夫随机场的运动分割研究

运动对象的分割技术一直是图像处理和计算机视觉领域的重要研究课题。采用一种将运动估计方法与马尔可夫随机场（MRF）模型相结合的运动分割方法。采用鲁棒统计技术与误差模型相结合构成运动估计的目标函数,运动模型为仿射运动,通过过松弛算法获得每种运动的运动参数;根据误差最小原则确定运动对应区域的初值,采用马尔可夫随机场（MRF）模型对运动估计结果进行平滑去噪。最后给出了该方法在通用图像实例上的实验结果。     

Modeling multiple interactions with a Markov random field in query expansion for session search

How to automatically understand and answer users' questions (eg, queries issued to a search engine) expressed with natural language has become an important yet difficult problem across the research fields of information retrieval and artificial intelligence. In a typical interactive Web search scenario, namely, session search, to obtain relevant information, the user usually interacts with the search engine for several rounds in the forms of, eg, query reformulations, clicks, and skips. These interactions are usually mixed and intertwined with each other in a complex way. For the ideal goal, an intelligent search engine can be seen as an artificial intelligence agent that is able to infer what information the user needs from these interactions. However, there still exists a big gap between the current state of the art and this goal. In this paper, in order to bridge the gap, we propose a Markov random field–based approach to capture dependence relations among interactions, queries, and clicked documents for automatic query expansion (as a way of inferring the information needs of the user). An extensive empirical evaluation is conducted on large‐scale web search data sets, and the results demonstrate the effectiveness of our proposed models.     

Hidden Markov random field models for TCA image analysis

Tooth Cementum Annulation (TCA) is an age estimation method carried out on thin cross sections of the root of mammalian teeth. Age is computed by adding the tooth eruption age to the count of annual incremental lines which are called tooth rings and appear in the cementum band. The number of rings is computed from an intensity (gray scale) image of the cementum band, by estimating the average ring width and then dividing the area of the cementum band by this estimate. The ring width is estimated by modelling the image by a hidden Markov random field, where intensities are assumed to be pixelwise conditionally independent and normally distributed, given a Markov random field of hidden binary labels, representing the“true scene”. To incorporate image macro-features (the long-range dependence among intensities and the quasi-periodicity in the placement of tooth rings), the label random field is defined by an energy function that depends on a parametric Gabor filter, convolved with the true scene. The filter parameter represents the unknown of main interest, i.e. the average width of the rings. The model is estimated through an EM algorithm, relying on the mean field approximation of the hidden label distribution and allows to predict the locations of the rings in the image.     

基于改进马尔可夫随机场的钢轨缺陷分割

为提高钢轨缺陷分割对噪声的鲁棒性,提出一种基于改进马尔可夫随机场(MRF)的钢轨缺陷分割方法。利用背景差分法对灰度进行预处理,消除灰度分布不均的干扰。对模糊if-then规则的前提部分采用马尔可夫随机场来利用图像中的空间约束,结果部分指定像素距离图算法,通过使用马尔可夫随机场(MRF)在相邻像素图像之间并入局部空间信息,推导出新的自适应模糊集和MRF相结合的钢轨表面缺陷自动分割方法。建立标准的FCM、GMM和该方法的钢轨缺陷分割对比实验,验证了算法的有效性和优越性。     

基于马尔可夫随机场模型的运动对象分割算法

提出了一种基于马尔可夫随机场(MRF)模型的运动分割算法,仅使用了压缩流中的运动矢量和块编码模式信息,可以在复杂场景下对运动对象有很好的分割效果.利用运动矢量量化的方法来对运动矢量进行预处理,对运动矢量进行马尔可夫建模,利用能量最小函数进行优化得到运动对象分割的效果.实验表明:与现有的方法相比,该方法可从复杂场景中更准确地对运动对象进行分割.     

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

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

随机场中运动一致性的多线索目标跟踪

目的 通过建立各线索间的关联,提高多线索目标跟踪方法的鲁棒性,利用简单而有效的模型使多线索目标跟踪方法的表达和实现变得容易.方法 在不同线索描述下的目标对象间引入运动一致性约束,利用链状结构随机场模型表达不同线索描述下的目标对象及其约束关系,将多线索目标跟踪问题转化为随机场目标函数的简单优化求解.实验中结合亮度直方图、方向梯度直方图和局部二进制模式描述目标对象.结果 15组公测视频序列上的实验结果表明,所提方法相对于多种优秀的目标跟踪方法,在目标受到遮挡、运动模糊、光照变化、背景杂乱等因素干扰时,获得了较低中心位置误差和较高的精度值,反映了所提方法的有效性.结论 运动一致性约束能够较好地增强各线索间的关联,通过链状结构的随机场模型表达该约束关系和各线索描述下的目标对象,在提高跟踪鲁棒性的同时,使跟踪方法的实现变得简单.     

Parallel exact sampling and evaluation of Gaussian Markov random fields

Markov chain Monte Carlo algorithms are computationally expensive for large models. Especially, the so-called one-block Metropolis-Hastings (M-H) algorithm demands large computational resources, and parallel computing seems appealing. A parallel one-block M-H algorithm for latent Gaussian Markov random field (GMRF) models is introduced. Important parts of this algorithm are parallel exact sampling and evaluation of GMRFs. Parallelisation is achieved with parallel algorithms from linear algebra for sparse symmetric positive definite matrices. The parallel GMRF sampler is tested for GMRFs on lattices and irregular graphs, and gives both good speed-up and good scalability. The parallel one-block M-H algorithm is used to make inference for a geostatistical GMRF model with a latent spatial field of 31,500 variables.     

马尔可夫随机场理论在目标跟踪中的应用

在目标跟踪问题中,被跟踪目标的尺度变化、旋转变化和遮挡都会造成跟踪精确度的降低或目标的丢失。针对这些问题,提出了一种基于马尔可夫随机场的目标跟踪方法,将运动目标跟踪问题看作是前景和背景的二值分类问题,建立前景背景分割的马尔可夫随机场模型,从而实现对前景背景的分类,以完成对运动目标的跟踪。试验证明,这种方法可以有效地克服前景目标的尺度变化和旋转变化以及遮挡给目标跟踪带来的困难。     

MRF–MAP–MFT visual object segmentation based on motion boundary field

In our earlier work, a two-pass motion estimation algorithm (TPA) was developed to estimate a motion field for two adjacent frames in an image sequence where contextual constraints are handled by several Markov random fields (MRFs) and the maximum a posteriori (MAP) configuration is taken to be the resulting motion field. In order to provide a trade-off between efficiency and effectiveness, the mean field theory (MFT) was selected to carry out the optimization process to locate the MAP with desirable performance. Given that currently in the disciplines of digital library [IEEE Trans. PAMI 18 (8) (1996); IEEE Trans. Image Process. 11 (8) (2002) 912] and video processing [IEEE Trans. Circ. Sys. Video Tech. 7 (1) (1997)] of utmost interest are the extraction and representation of visual objects, instead of estimating motion field, in this paper we focus on segmenting out visual objects based on spatial and temporal properties present in two contiguous frames in the same MRF–MAP–MFT framework. To achieve object segmentation, a “motion boundary field” is introduced which can turn off interactions between different object regions and in the mean time remove spurious object boundaries. Furthermore, in light of the generally smooth and slow velocities in-between two contiguous frames, we discover that in the process of calculating matching blocks, assigning different weights to different locations can result in better object segmentation. Experimental results conducted on both synthetic and real-world videos demonstrate encouraging performance.     

基于隐马尔可夫随机场的社区结构发现算法

针对社区结构发现问题,提出了一种基于隐马尔可夫随机场社区发现算法.该方法将网络中的顶点度数映射为顶点信息值,用马尔可夫随机场模型描述网络中上下文信息并构造系统能量函数,使用迭代条件模式算法对能量方程进行优化.该方法在Zachary空手道俱乐部网络、海豚关系网络以及美国大学足球联赛网络上进行验证,实验结果表明,该算法的准确率较高.     

复杂环境下的运动车辆检测

针对目前采用的车辆检测方法的优缺点,提出了一种新的车辆区域检测方法,能够消除阴影干扰。该算法首先运用选择性背景更新法进行背景相减,获取感兴趣区域,然后提出基于图的区域分割算法,对感兴趣区域进行再分割。该方法充分考虑了视频图像全局和局部的空间信息,根据分割区域的大小自动自适应地调节对图像局部细节的忽略程度,从而获取局部区域像素信息较为一致的分割块。最后基于分割过程中所具有的马尔科夫属性,运用条件随机域的方法建立分割后验概率分布,求取最大后验概率确定标号,并对具有相同标号的相邻分割进行合并。     

Scale selection for anisotropic diffusion filter by Markov random field model

The selection of stopping time (i.e., scale) significantly affects the performance of anisotropic diffusion filter for image denoising. This paper designs a Markov random field (MRF) scale selection model, which selects scales for image segments, then the denoised image is the composition of segments at their optimal scales in the scale space. Firstly, statistics-based scale selection criteria are proposed for image segments. Then we design a scale selection energy function in the MRF framework by considering the scale coherence between neighboring segments. A segment-based noise estimation algorithm is also developed to estimate the noise statistics efficiently. Experiments show that the performance of MRF scale selection model is much better than the previous global scale selection schemes. Combined with this scale selection model, the anisotropic diffusion filter is comparable to or even outperform the state-of-the-art denoising methods in performance.