2009 16th IEEE International Conference on Image Processing (ICIP) 2009
DOI: 10.1109/icip.2009.5414119
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting redundancy to solve the Poisson equation using local information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…This gradient domain compression algorithm is computationally very expensive, as it seeks to solve Poisson equation. The authors of [172] developed a local Fattal's operator to solve the Poisson equation locally and repeatedly, thus making it parallelize-able there by executable in real-time. The modified Poisson solver uses only local information from pixel and its 3 × 3 window neighbors, for computing a tone mapped pixel independent of Fattal's operator on other pixel locations with in the window.…”
Section: Field Programmable Gate Arraymentioning
confidence: 99%
“…This gradient domain compression algorithm is computationally very expensive, as it seeks to solve Poisson equation. The authors of [172] developed a local Fattal's operator to solve the Poisson equation locally and repeatedly, thus making it parallelize-able there by executable in real-time. The modified Poisson solver uses only local information from pixel and its 3 × 3 window neighbors, for computing a tone mapped pixel independent of Fattal's operator on other pixel locations with in the window.…”
Section: Field Programmable Gate Arraymentioning
confidence: 99%
“…22 product; here, the b value is 0.9, and the mantissa is normalized to be between 0.5 and 1, so the output power term is between 1.000 and 1.072. This means that the output of the (6,-6) m 3 u,v (6,-6) m 4 u,v (6,-6) The second lookup table is the exponent lookup table and is indexed by the sum of the exponents. Each of the exponents has four bits; when all the exponents are added together, the final sum of the exponents has seven bits to avoid the possibility of any overflow.…”
Section: Attenuation Factor Computationmentioning
confidence: 99%
“…The HDR local TMO proposed in the thesis relies on a novel technique for solving the Poisson equation. Our local Poisson solver [3] gives hardware that is independent of image size, and amenable to real-time implementation. Rather than work with the entire image at once to find the complete output image, our local Poisson solver finds one pixel of the output image at a time, considering it to be the center pixel in a 3×3…”
mentioning
confidence: 99%
See 1 more Smart Citation