基于颜色和纹理信息的快速前景提取方法  

A Fast Object Extraction Method Based on Color and Texture Information

作　　者：穆亚东[1] 周秉锋[1] 

机构地区：[1]北京大学计算机科学技术研究所,北京100871

出　　处：《计算机学报》2009年第11期2252-2259,共8页Chinese Journal of Computers

基　　金：国家自然科学基金(60573149;60973054)资助

摘　　要：近年来,研究者们提出了许多算法来处理前景提取和图像抽取问题.然而,这些算法存在许多共同缺点:需要三元图作为输入、计算时间过长、大部分算法仅仅使用颜色信息等等.在这篇文章里,作者提出了一种新的快速多层次前景提取方法.首先,应用一种改进的多层次图分割算法,将输入图像粗略地分割为前景和背景两个部分.然后,使用信念传播算法(belief propagation)估计前景/背景交界处像素的不透明度.不同于通常的信念传播算法,在平滑项和颜色项之外,作者通过构造灰度共生矩阵引入了纹理信息.鉴于数码相机图像的分辨率仍在持续快速增长,作者提出的多层次图分割算法可以在加速上述计算过程的同时,获得可以和当前许多算法相媲美的局部最优解.实验结果证明文中所提出的算法对于大尺寸图像尤其有效.In recent years researchers have developed many algorithms for object extraction and image matting. However, previous approaches usually require trimaps as input, or consume intolerably long time to get the final results, and most of them just consider the color information. This paper proposes a novel fast hierarchical object extraction method. First the input image is segmented roughly into two regions： foreground and background, using a modified hierarchical Graph Cuts algorithm. After that, the opacity values for the pixels nearby the foreground/background border are estimated using belief propagation （BP）. Unlike traditional BP-based approaches, besides the smoothness and color constraints, the texture information is introduced by building grayscale co-occurrence matrices. Moreover, considering the fact that the resolution of photographs taken by digital cameras continues to increase at a rapid and steady pace, the modified version of hierarchical Graph Cuts proposed in this paper could accelerate the above-mentioned computation process, getting a comparably satisfactory local optimal solution as previous approaches. Experiments show that the method is effective and efficient especially for large images.

关 键 词：分层图分割 信念传播 共生矩阵 马尔可夫随机场 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]