5 October 2012 Matrix decomposition graphics processing unit solver for Poisson image editing
Author Affiliations +
Abstract
In recent years, gradient-domain methods have been widely discussed in the image processing field, including seamless cloning and image stitching. These algorithms are commonly carried out by solving a large sparse linear system: the Poisson equation. However, solving the Poisson equation is a computational and memory intensive task which makes it not suitable for real-time image editing. A new matrix decomposition graphics processing unit (GPU) solver (MDGS) is proposed to settle the problem. A matrix decomposition method is used to distribute the work among GPU threads, so that MDGS will take full advantage of the computing power of current GPUs. Additionally, MDGS is a hybrid solver (combines both the direct and iterative techniques) and has two-level architecture. These enable MDGS to generate identical solutions with those of the common Poisson methods and achieve high convergence rate in most cases. This approach is advantageous in terms of parallelizability, enabling real-time image processing, low memory-taken and extensive applications.
© 2012 SPIE and IS&T
Zhao Lei, Wei Li, "Matrix decomposition graphics processing unit solver for Poisson image editing," Journal of Electronic Imaging 21(4), 043007 (5 October 2012). https://doi.org/10.1117/1.JEI.21.4.043007 . Submission:
JOURNAL ARTICLE
9 PAGES


SHARE
RELATED CONTENT


Back to Top