1990
DOI: 10.1109/34.55103
|View full text |Cite
|
Sign up to set email alerts
|

Direct analytical methods for solving Poisson equations in computer vision problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
169
0

Year Published

1997
1997
2014
2014

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 224 publications
(169 citation statements)
references
References 12 publications
0
169
0
Order By: Relevance
“…We can simply use a Fourier transform on the entire image to re-integrate, a very fast method, using homogeneous Neumann boundary conditions. As well, in order to combine the Ambient and Flash gradients such that integrability is preserved, we project the combined set of edges onto an integrable convex set in the Fourier domain, before reintegrating via inverse Fourier transform [21,22]. The reintegrated ambient image for our example image is shown in Fig.…”
Section: Shadow-free Ambient Image Recoverymentioning
confidence: 99%
“…We can simply use a Fourier transform on the entire image to re-integrate, a very fast method, using homogeneous Neumann boundary conditions. As well, in order to combine the Ambient and Flash gradients such that integrability is preserved, we project the combined set of edges onto an integrable convex set in the Fourier domain, before reintegrating via inverse Fourier transform [21,22]. The reintegrated ambient image for our example image is shown in Fig.…”
Section: Shadow-free Ambient Image Recoverymentioning
confidence: 99%
“…To calculate height maps, the filtered gradients were integrated using a multigrid solver 13 for the Poisson equation 14 that minimizes integration inconsistency errors [ Fig. 2(g)].…”
Section: Pse Algorithmmentioning
confidence: 99%
“…However, this technique may prove to be inefficient-without further research-for dense data problems with nonuniform weighting on the data constraints, such as the optical flow problem, since the size of the associated (dense) capacitance matrix is too large. Although this problem may be circumvented by incorporating the capacitance matrix technique as part of an iterative scheme [15], however, it was pointed out in [16] that this semidirect numerical scheme only converges when the regularization parameter is very large. In this paper, we will introduce a physically based adaptive preconditioning technique which when used in conjunction with the conjugate gradient algorithm, outperforms-in computational efficiency-previously proposed preconditioning methods for some early vision problems in literature [9], [10], [11].…”
Section: Introductionmentioning
confidence: 99%