z-logo
open-access-imgOpen Access
Sparse codes as Alpha Matte
Author(s) -
Jubin Johnson,
Deepu Rajan,
Hisham Cholakkal
Publication year - 2014
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5244/c.28.74
Subject(s) - computer science , alpha (finance) , mathematics , statistics , construct validity , psychometrics
In this paper, image matting is cast as a sparse coding problem wherein the sparse codes directly give the estimate of the alpha matte. Hence, there is no need to use the matting equation that restricts the estimate of α from a single pair of foreground (F) and background (B) samples. A probabilistic segmentation provides a confidence value on the pixel belonging to F or B, based on which a dictionary is formed for use in sparse coding. This allows the estimate of α from more than just one pair of (F,B) samples. Experimental results on a benchmark dataset show the proposed method performs close to state-of-the-art methods.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom