Name
Abstract | ||
|---|---|---|
Filters with slowly decaying impulse responses have many uses in computer graphics. Recursive filters are often the fastest option for such cases. In this paper, we derive closed-form formulas for computing the exact initial feedbacks needed for recursive filtering infinite input extensions. We provide formulas for the constant-padding (e.g. clamp-to-edge), periodic (repeat) and even-periodic (mirror or reflect) extensions. These formulas were designed for easy integration into modern block-parallel recursive filtering algorithms. Our new modified algorithms are state-of-the-art, filtering images faster even than previous methods that ignore boundary conditions. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2980179.2980222 | ACM Trans. Graph. |
Keywords | Field | DocType |
parallel recursive filtering,infinite extension,GPUs | Boundary value problem,Mathematical optimization,Computer science,Filter (signal processing),Impulse (physics),Periodic graph (geometry),Computer graphics,Recursion | Journal |
Volume | Issue | ISSN |
35 | 6 | 0730-0301 |
Citations | PageRank | References |
0 | 0.34 | 28 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diego Nehab | 1 | 743 | 42.58 |
| A. Maximo | 2 | 87 | 8.10 |