• •    

CCML2017+218+联合时空多特征表示的无监督视频分割方法

李雪君,张开华,宋慧慧   

  1. 南京信息工程大学
  • 收稿日期:2017-05-31 发布日期:2017-05-31
  • 通讯作者: 张开华

CCML2017+218+Fusing Multiple Spatio-Temporal Feature representations Based Unsupervised Video Segmentation

  • Received:2017-05-31 Online:2017-05-31

摘要: 摘 要: 视频分割是计算机视觉技术中最困难的问题之一,分割的难点在于分割目标的无规则运动、快速变换的背景、目标外观的任意变化与形变等。本文提出了一种基于时空多特征表示的无监督视频分割算法,通过融合像素级、超像素级以及显著性三类特征设计由细粒度到粗粒度的稳健特征表示。首先,采用超像素分割对视频序列进行处理以提高运算效率,并设计图割算法进行快速求解;其次,利用光流法对相邻帧信息进行匹配,并通过KD树算法(K-dimension tree)实现最近邻搜索以引入各超像素的非局部时空颜色特征,从而增强分割的鲁棒性;然后,对采用超像素计算得到的分割结果,设计混合高斯模型进行完善;最后,引入图像的显著性特征,协同超像素分割与混合高斯模型的分割结果,设计投票获得更加准确的视频分割结果。实验结果表明该算法是一种稳健且有效的分割算法,其结果优于当前大部分无监督视频分割算法及部分半监督视频分割算法。

关键词: 关键词: 超像素分割, KD树, 混合高斯模型, 图割算法, 光流法

Abstract: Abstract: Video object segmentation is one of the most difficult problems in computer vision due to the factors like fast moving objects, cluttered backgrounds, arbitrary object appearance variation and shape deformation. In this paper we present a new unsupervised video segmentation algorithm based on multiple spatio-temporal feature representations. By the combination of saliency characteristics and other features obtained from pixels and superpixels, we design a coarse to fine-grained robust feature representation to represent each frame in a video sequence. First, we generate a set of superpixels to represent the foreground and background in order to improve computational efficiency and get segmentation results by graph-cut algorithm; then, the optical flow can be used to propagate information between adjacent frames, and the appearance of each superpixel can be updated by its non-local sptatio-temporally counterparts generated by the nearest neighboring searching method with the efficient K-dimension tree (KD-tree ) algorithm, so as to improve the robustness of the segmentation; after that, for segmentation results generated in superpixel-level, we construct a new Gaussian mixture model based on pixels to achieve pixel level refinement; finally, the algorithm calculate the saliency characteristics of each frame, as well as segmentation results generated by graph cut and Gaussian mixture model, to obtain a more accurate segmentation results by voting scheme. Extensive evaluations on the SegTrack dataset demonstrate the effectiveness of the proposed method, which performs favorably against some state-of-art methods.

Key words: Keywords:superpixel segmentation, KD-tree, gaussian mixture model, graph cut algorithm, optical flow

中图分类号: