High-Accuracy and Quick Matting Based on Sample-Pair Refinement and Local Optimization

Bei HE  Guijin WANG  Chenbo SHI  Xuanwu YIN  Bo LIU  Xinggang LIN  

IEICE TRANSACTIONS on Information and Systems   Vol.E96-D   No.9   pp.2096-2106
Publication Date: 2013/09/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E96.D.2096
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Image Processing and Video Processing
quick matting,  hybrid direction,  sample-pair refinement,  adaptive sample clustering,  local optimization,  kalman filter,  

Full Text: PDF(6.1MB)>>
Buy this Article

Based on sample-pair refinement and local optimization, this paper proposes a high-accuracy and quick matting algorithm. First, in order to gather foreground/background samples effectively, we shoot rays in hybrid (gradient and uniform) directions. This strategy utilizes the prior knowledge to adjust the directions for effective searching. Second, we refine sample-pairs of pixels by taking into account neighbors'. Both high confidence sample-pairs and usable foreground/background components are utilized and thus more accurate and smoother matting results are achieved. Third, to reduce the computational cost of sample-pair selection in coarse matting, this paper proposes an adaptive sample clustering approach. Most redundant samples are eliminated adaptively, where the computational cost decreases significantly. Finally, we convert fine matting into a de-noising problem, which is optimized by minimizing the observation and state errors iteratively and locally. This leads to less space and time complexity compared with global optimization. Experiments demonstrate that we outperform other state-of-the-art methods in local matting both on accuracy and efficiency.