Academic
Publications
An O(N) iterative solution to the Poisson equation in low-level vision problems

An O(N) iterative solution to the Poisson equation in low-level vision problems,10.1109/CVPR.1994.323804,S. H. Lai,B. C. Vemuri

An O(N) iterative solution to the Poisson equation in low-level vision problems   (Citations: 7)
BibTex | RIS | RefWorks Download
In this paper, we present a novel iterative numerical solution to the Poisson equation whose solution is needed in a variety of low-level vision problems. Our algorithm is an O(N) (N being the number of discretization points) iterative technique and does not make any assumptions on the shape of the input domain unlike the polyhedral domain assumption in the proof of convergence of multigrid techniques. We present two major results namely, a generalized version of the capacitance matrix theorem and a theorem on O(N) convergence of the alternating direction implicit method (ADI) used in our algorithm. Using this generalized theorem, we express the linear system corresponding to the discretized Poisson equation as a Lyapunov and a capacitance matrix equation. The former is solved using the ADI method while the solution to the later is obtained using a modified bi-conjugate gradient algorithm. We demonstrate the algorithm performance on synthesized data for the surface reconstruction and the SFS problems
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: