MRF matting on complex images

Authors:
Shengyou Lin;Ruifang Pan;Jiaoying Shi
Affiliations:
Dept. of Communicative Technology, ZJICM, Hangzhou, P.R.C.;Dept. of Communicative Technology, ZJICM, Hangzhou, P.R.C.;State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou, P.R.C.
Venue:
MUSP'06 Proceedings of the 6th WSEAS international conference on Multimedia systems & signal processing
Year:
2006

Citing 6
Cited 0

Markov random field modeling in computer vision

Markov random field modeling in computer vision
Blue screen matting

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Lazy snapping

ACM SIGGRAPH 2004 Papers
"GrabCut": interactive foreground extraction using iterated graph cuts

ACM SIGGRAPH 2004 Papers
Poisson matting

ACM SIGGRAPH 2004 Papers
Technical section: Fast natural image matting in perceptual color space

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a novel approach to solve the matting problem on complex images using Markov Random Field (MRF) model. Although many natural image matting methods have been proposed, matting on complex images still remains as a challenge. Our approach, which we call MRF matting, partitions the image manually into three regions: foreground, background, and unknown region. Then, the unknown region is roughly segmented into several joint sub-regions by the user. In each sub-region, matting labels are defined and modelled as an MRF and assigned to the pixels in unknown region. Matting problem is then formulated as a maximum a posteriori (MAP) estimation problem on this MRF model and its associated Gibbs distribution. Simulated annealing is used to find the optimal matting solution. We compute alpha mattes of all the subregions and combine them into a final matte. When matting on complex images, our approach is demonstrated to be more robust than existing methods. Experimental results are shown and compared with other methods in this paper.