A GPU-based matting Laplacian solver for high resolution image matting

被引：2

作者：

Mengcheng Huang

Fang Liu

Enhua Wu

机构：

[1] Chinese Academy of Sciences,State Key Lab of Computer Science, Institute of Software

[2] Graduate University of Chinese Academy of Sciences,Department of Computer and Information Science, Faculty of Science and Technology

[3] University of Macau,undefined

来源：

The Visual Computer | 2010年 / 26卷

关键词：

Image matting; Matting Laplacian; Conjugate gradient solver; GPU;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The recently proposed matting Laplacian (Levin et al., IEEE Trans. Pattern Anal. Mach. Intell. 30(2):228–242, 2008) has been proven to be a state-of-the-art method for solving the image matting problem. Using this method, matting is formulated as solving a high-order linear system which is hard-constrained by the input trimap. The main drawback of this method, however, is the high computational cost. As the size of the input image increases, the matting Laplacian becomes expensive to solve in terms of both memory and computational time.

引用

页码：943 / 950

页数：7

共 7 条

[1] Agarwala A.(2007)Efficient gradient-domain compositing using quadtrees ACM Trans. Graph. 26 94-98
[2] Levin A.(2008)A closed-form solution to natural image matting IEEE Trans. Pattern Anal. Mach. Intell. 30 228-242
[3] Lischinski D.(2006)Locally adapted hierarchical basis preconditioning ACM Trans. Graph. 25 1135-1143
[4] Weiss Y.(2007)Image and video matting: A survey Found. Trends Comput. Graph. Vis. 3 97-175
[5] Szeliski R.(undefined)undefined undefined undefined undefined-undefined
[6] Wang J.(undefined)undefined undefined undefined undefined-undefined
[7] Cohen M.(undefined)undefined undefined undefined undefined-undefined

← 1 →