期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种自动分割人脸的方法 被引量：1

Method of extracting faces automatically
下载PDF
导出
摘要 基于图切分理论,提出了一种自动分割人脸的方法。对于一幅人脸图像,首先通过人脸检测算法,确定人脸图像的大致前景和背景区域;然后利用高斯混合模型建立其前景和背景区域的颜色模型;最后迭代地运用图切分算法准确地分割出人脸目标。该方法创新之处在于实现了人脸图像前景目标的全自动分割。实验结果说明了该方法的有效性。 This paper presented a method of extracting faces automatically based on graph cut. For a face image, firstly, identified the approximate face region by the algorithm of the face detection. Then, built the color model for background and foreground utilizing the GMM （ Gaussian mixture model）. Lastly, extracted successfully the accurate face region using the iterative graph cut. The innovation of the method lies in that can extract the special foreground object full-automatically from a face image. Experimental results indicate that the method has application values.
作者 傅冠华 陈益强 刘军发 周经野 李鹏飞
机构地区 湘潭大学信息工程学院计算机科学与技术系 中国科学院计算技术研究所前瞻研究中心
出处 《计算机应用研究》 CSCD 北大核心 2008年第10期3060-3062,共3页 Application Research of Computers
基金 国家自然科学基金资助项目(60772057) 北京科技新星计划基金资助项目(2005B54)
关键词 自动分割 人脸检测 图切分 混合高斯模型 automatic extraction face detection graph cut Gaussian mixture model（GMM）
分类号 TP391.41 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1MORTENSEN F N, BARRETT W A. Intelligent scissors for image composition[ C ]//Proc of the 22nd of ACM SIGGRAPH International Conference on Computer Graphics and Interactive Techniques. 1995.
  • 2KASS M, WITKIN A,TERZOLPOULOS D. Snakes: active contour models[ J]. Intemational Journal of Computer Vision, 1998,1 (4) :321-331.
  • 3贾云涛,胡事民.基于图切分的交互式图像染色算法[J].计算机学报,2006,29(3):508-512. 被引量：15
  • 4刘则毅,徐高奎,丁雅斌.一种新的图像合成方法[J].中国图象图形学报,2007,12(3):432-437. 被引量：5
  • 5LI Yin, SUN Jian, CHI K. Lazy snapping[ C]//Proc of ACM SIGGRAPH. 2004.
  • 6ROTHER C, KOLMOGOROV V, BLAKE A. Grabcat-interactive foreground extraction using iterated graph cuts [ C ]//Proc of SIGGRAPH. 2004.
  • 7BOYKOV Y, MARIE-PIERRE J. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images [C]// Proc of IEEE International Conference on Computer Vision. 2001.
  • 8CASELLES V, KIMMEL R, SAPIRO G. Geodesic active contours [C]//Proc of IEEE International Conference on Computer Vision. 1995.
  • 9ORCHARD M, BOUMAN C. Color quantization of images[ J]. IEEE Trans on Signal Processing, 1991,139(12) :2677-2690.
  • 10BOYKOV Y, KOLMOGOROV Y. An experimental comparison of rain-cut/max-flow algorithms for energy minimization in vision [ J ]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004,26(9) :1124-1137.

二级参考文献23

  • 1Neuraltek,2003.BlackMagic photo colorization software 2.8,http://www.timebrush.com/blackmagic
  • 2Levin A.,Lischinski D.,Weiss Y..Colorization using optimization.ACM Transactions on Graphics,2004,23(3):689～694
  • 3Pratt W.K..Digital Image Processing.John Wiley & Sons,1991
  • 4Rogowitz B.E.,Kalvin A.D..The "Which Blair Project":Aquick visual method for evaluating perceptual color maps.In:Proceedings of the IEEE Visualization,San Diego,California,2001,183～190
  • 5Welsh Tomihisa,Ashikhmin Michael,Mueller Klaus.Transferring color to greyscale images.In:Proceedings of the SIGGRAPH,San Antonio,Texas,2002,277～280
  • 6Boykov Yuri,Veksler Olga,Zabih Ramin.Fast approximate energy minimization via graph cuts.IEEE Transactions on Pattern Analysis Machine Intelligence,2001,23(11):1222～1239
  • 7Kwatra Vivek,Schodl Arno,Essa Irfan,Turk Greg,Bobick Aaron.Graphcut textures:Image and video synthesis using graph cuts.ACM Transactions on Graphics,2003,22(3):277～286
  • 8Boykov Yuri,Jolly Marie.Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images.In:Proceedings of the IEEE International Conference on Computer Vision,CD-ROM,2001
  • 9Ford L.R.,Fulkerson D.R..Flows in Networks.Princeton,NJ:Princeton University Press,1962
  • 10Goldberg A.V.,Tarjan R.E..A new approach to the maximum flow problem.Journal of the Association for Computing Machinery,1988,35(4):921～940

共引文献18

同被引文献15

  • 1章毓晋.图像工程[M].2版.北京:清华大学出版社,2005.
  • 2GREIG D M, PORTEOUS B T, SEHEULT A H. Exact maximum a posteriori estimation for binary images [ J]. Journal of the Royal Statistical Society, 1989,51 ( 2 ) :271-279.
  • 3BOYKOV Y, JOLLY M. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images[ C]//Proc of the 8th IEEE International Conference on Computer Vision. 2001:105-112.
  • 4FREEDMAN D, ZHANG Tao. Interactive graph cut based segmentation with shape priors [ C ]//Proc of IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Washington DC: IEEE Computer Society,2005:755-762.
  • 5CHANG Hang, YANG Qing, PARVIN B. A Bayesian approach for image segmentation with shape priors[ C]//Proc of the 26th IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 2008 : 1-8.
  • 6LANG X Pian-peng, ZHU Feng, HAO Ying-ming, et al. Automatic image segmentation incorporating shape priors via graph cuts[ C ]// Proc of IEEE International Conference on Information and Automation. Piscataway : IEEE Computer Society, 2009 : 192-195.
  • 7DAS P, VEKSLER O, ZAVADSKY V, et al. Semiautomatic segmentation with compact shape prior[ J]. Image and Vision Computing, 2009,27 ( 1- 2) :206-219.
  • 8VEKSLER O. Star shape prior for graph-cut image segmentation [ C]//Proc of the lOth European Conference on Computer Vision: Part III. Berlin: Springer-Verlag, 2008:454-467.
  • 9LANG Xian-peng, ZHU Feng. Image segmentation with improved star shape prior via graph cut [ C ]//Proc of the 9th Asian Conference on Computer Vision. 2008.
  • 10BOYKOV Y, FUNKA-LEA G, ZAVADSKY V, et al. Graph cuts and efficient N-D image segmentation[J]. Journal of Computer Vision, 2006,70(2) :109-131.

引证文献1

二级引证文献4

计算机应用研究
2008年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部