Yin Yanpeng
Key Laboratory of Specialty Fiber Optics and Optical Access Networks, School of Communication and Information Engineering, Shanghai University, Shanghai 200072, ChinaZhou Ying
Key Laboratory of Specialty Fiber Optics and Optical Access Networks, School of Communication and Information Engineering, Shanghai University, Shanghai 200072, ChinaZeng Dan
Key Laboratory of Specialty Fiber Optics and Optical Access Networks, School of Communication and Information Engineering, Shanghai University, Shanghai 200072, ChinaCheng Cheng
Intelligent Multimedia Technology Research Center, Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences, Chongqing 400714,ChinaZhang Zhijiang
Key Laboratory of Specialty Fiber Optics and Optical Access Networks, School of Communication and Information Engineering, Shanghai University, Shanghai 200072, China1.Key Laboratory of Specialty Fiber Optics and Optical Access Networks, School of Communication and Information Engineering, Shanghai University, Shanghai 200072, China;2.Intelligent Multimedia Technology Research Center, Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences, Chongqing 400714,China
TP181
Face segmentation is quite challenging due to the diversity of hair styles, head poses, clothing, occlusions, and other phenomena. To improve the accuracy of face segmentation from the images with complex scenes, we present a method based on Conditional Random Fields (CRFs) in this paper. The CRFs model is defined on a graph, in which each node corresponds to a superpixel and each edge connects a pair of neighboring superpixels. The features of color and texture are used to define the node(unary) energy function, and the position distance and differences of features between adjacent superpixels are used to define the edge(binary) energy function. Segmentation is performed by inferring the CRFs model built by fusing node energy function and edge energy function. We evaluate the performance of the proposed method on two unconstrained face databases. Experimental results demonstrate that the proposed method can efficiently partition face.
