A Scale-Space Approach to Landmark Constrained Image Registration
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
A GPU Laplacian solver for diffusion curves and Poisson image editing
ACM SIGGRAPH Asia 2009 papers
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Computer Vision and Image Understanding
Fourier implementation of Poisson image editing
Pattern Recognition Letters
Random walks in directed hypergraphs and application to semi-supervised image segmentation
Computer Vision and Image Understanding
| Hi-index | 0.00 |
The inhomogeneous Poisson (Laplace) equation with internal Dirichlet boundary conditions has recently appeared in several applications ranging from image segmentation [1, 2, 3] to image colorization [4], digital photo matting [5, 6] and image filtering [7, 8]. In addition, the problem we address may also be considered as the generalized eigenvector problem associated with Normalized Cuts [9], the linearized anisotropic diffusion problem [10, 11, 8] solved with a backward Euler method, visual surface reconstruction with discontinuities [12, 13] or optical flow [14]. Although these approaches have demonstrated quality results, the computational burden of finding a solution requires an efficient solver. Design of an efficient multigrid solver is difficult for these problems due to unpredictable inhomogeneity in the equation coefficients and internal Dirichlet boundary conditions with unpredictable location and value. Previous approaches to multigrid solvers have typically employed either a data-driven operator (with fast convergence) or the maintenance of a lattice structure at coarse levels (with low memory overhead). In addition to memory efficiency, a lattice structure at coarse levels is also essential to taking advantage of the power of a GPU implementation [15,16,5,3]. In this work, we present a multigrid method that maintains the low memory overhead (and GPU suitability) associated with a regular lattice while benefiting from the fast convergence of a data-driven coarse operator.