 | |
|---|---|
Abstract We present a new multi-level preconditioning scheme for discrete Poisson equations that arise in various computer graphics applications such as image colorization, edge-preserving decomposition, and geodesic distances on three-dimensional meshes. Our approach interleaves the selection of fine- and coarse-level variables with the removal of weak connections between potential fine-level variables (sparsification) and the compensation for these changes by strengthening nearby connections. By applying these operations before each elimination step and repeating the procedure recursively on the resulting smaller systems, we obtain a highly efficient multi-level preconditioning scheme with linear time and memory requirements. Our experiments demonstrate that our new scheme outperforms or is comparable with other state-of-the-art methods, both in terms of operation count and wall-clock time. This speedup is achieved by the new method's ability to reduce the condition number of irregular Laplacian matrices as well as homogeneous systems. It can therefore be used for a wide variety of problems, including 3D meshes, without the need to carefully match the algorithm to the problem characteristics. |
|
Links:
|
|
|
Bibtex reference:
@article{Krishnan2013,
author = {Krishnan, Dilip and Fattal, Raanan and Szeliski, Richard},
title = {Efficient preconditioning of laplacian matrices for computer graphics},
journal = {ACM Trans. Graph.},
issue_date = {July 2013},
volume = {32},
number = {4},
month = {July},
year = {2013},
issn = {0730-0301},
pages = {142:1--142:15},
articleno = {142},
numpages = {15},
url = {http://doi.acm.org/10.1145/2461912.2461992},
doi = {10.1145/2461912.2461992},
acmid = {2461992},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {computational photography, laplacians, matrix preconditioning, mesh processing, multigrid},
} | |
