The W-penalty and its application to alpha matting with sparse labels

Stephen Tierney, Junbin Gao, Yi Guo

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

Abstract

![CDATA[Alpha matting is an ill-posed problem, as such the user must supply dense partial labels for an acceptable solution to be reached. Unfortunately this labelling can be time consuming. In this paper we introduce the w-penalty function, which when incorporated into existing matting techniques allows users to supply extremely sparse input. The formulated objective function encourages driving matte values to 0 and 1. The experiments demonstrate the proposed model outperforms the state-of-the-art KNN matting algorithm. MATLAB code for our proposed method is freely available in the MatteKit package.]]
Original languageEnglish
Title of host publicationProceedings 2014 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2014, 25-27 November 2014, Wollongong, N.S.W.
PublisherIEEE
Number of pages7
ISBN (Print)9781479954094
DOIs
Publication statusPublished - 2014
EventDICTA (Conference) -
Duration: 25 Nov 2014 → …

Conference

ConferenceDICTA (Conference)
Period25/11/14 → …

Keywords

  • algorithms
  • alpha matting
  • image processing

Fingerprint

Dive into the research topics of 'The W-penalty and its application to alpha matting with sparse labels'. Together they form a unique fingerprint.

Cite this