Sparse Coding for Alpha Matting

Existing color sampling-based alpha matting methods use the compositing equation to estimate alpha at a pixel from the pairs of foreground (F) and background (B) samples. The quality of the matte depends on the selected (F,B) pairs. In this paper, the matting problem is reinterpreted as a sparse cod...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on image processing Vol. 25; no. 7; pp. 3032 - 3043
Main Authors: Johnson, Jubin, Varnousfaderani, Ehsan Shahrian, Cholakkal, Hisham, Rajan, Deepu
Format: Journal Article
Language:English
Published: United States IEEE 01.07.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Alpha matting
Coding
Coherence
Dictionaries
Estimates
Estimation
Exact solutions
Graph model
Image coding
Image color analysis
Mathematical analysis
Mattes
Optimization
Pixels
Sparse coding
Videos
Alpha matting
sparse coding
graph model
ISSN:1057-7149, 1941-0042
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Existing color sampling-based alpha matting methods use the compositing equation to estimate alpha at a pixel from the pairs of foreground (F) and background (B) samples. The quality of the matte depends on the selected (F,B) pairs. In this paper, the matting problem is reinterpreted as a sparse coding of pixel features, wherein the sum of the codes gives the estimate of the alpha matte from a set of unpaired F and B samples. A non-parametric probabilistic segmentation provides a certainty measure on the pixel belonging to foreground or background, based on which a dictionary is formed for use in sparse coding. By removing the restriction to conform to (F,B) pairs, this method allows for better alpha estimation from multiple F and B samples. The same framework is extended to videos, where the requirement of temporal coherence is handled effectively. Here, the dictionary is formed by samples from multiple frames. A multi-frame graph model, as opposed to a single image as for image matting, is proposed that can be solved efficiently in closed form. Quantitative and qualitative evaluations on a benchmark dataset are provided to show that the proposed method outperforms the current stateoftheart in image and video matting.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1057-7149
1941-0042
DOI:10.1109/TIP.2016.2555705