Demo Data from VLDB 2026 / reviewers in the wild / expert
Paul Green 0001
dblp:47/6983-1 · also Paul Elijah Green
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2009
0000-0002-8179-9445ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
3 papers |
Computational photography and imaging · 68% Rendering · 28% Image and video processing · 4% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational photography and imaging › depth of field
extended depth of field |
0.1 | 1 | 2009 | 4D frequency analysis of computational cameras for depth of field extension · ACM Trans. Graph. 2009 |
Computational photography and imaging › light field imaging
light field analysis |
0.1 | 1 | 2009 | 4D frequency analysis of computational cameras for depth of field extension · ACM Trans. Graph. 2009 |
Computational photography and imaging
depth estimation |
0.1 | 1 | 2007 | Multi-aperture photography · ACM Trans. Graph. 2007 |
Rendering
interactive rendering |
0.1 | 1 | 2007 | The lightspeed automatic interactive lighting preview system · ACM Trans. Graph. 2007 |
Image and video processing › image restoration
image deblurring |
0.0 | 1 | 2007 | Multi-aperture photography · ACM Trans. Graph. 2007 |
Computational photography and imaging › light field imaging
refocusing |
0.0 | 1 | 2007 | Multi-aperture photography · ACM Trans. Graph. 2007 |
Methods — techniques the papers use, named apart from their topics
deconvolution · 0.24d light field frequency analysis · 0.1progressive refinement · 0.1depth from defocus · 0.1data-flow analysis · 0.1cache compression · 0.1GPU shading · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | 4D frequency analysis of computational cameras for depth of field extensionabstractDepth of field (DOF), the range of scene depths that appear sharp in a photograph, poses a fundamental tradeoff in photography---wide apertures are important to reduce imaging noise, but they also increase defocus blur. Recent advances in computational imaging modify the acquisition process to extend the DOF through deconvolution. Because deconvolution quality is a tight function of the frequency power spectrum of the defocus kernel, designs with high spectra are desirable. In this paper we study how to design effective extended-DOF systems, and show an upper bound on the maximal power spectrum that can be achieved. We analyze defocus kernels in the 4D light field space and show that in the frequency domain, only a low-dimensional 3D manifold contributes to focus. Thus, to maximize the defocus spectrum, imaging systems should concentrate their limited energy on this manifold. We review several computational imaging systems and show either that they spend energy outside the focal manifold or do not achieve a high spectrum over the DOF. Guided by this analysis we introduce the lattice-focal lens, which concentrates energy at the low-dimensional focal manifold and achieves a higher power spectrum than previous designs. We have built a prototype lattice-focal lens and present extended depth of field results. Anat Levin, Samuel W. Hasinoff, Paul Green 0001, Frédo Durand, William T. Freeman |
ACM Trans. Graph. | 3 |
| 2007 | Efficient Reflectance and Visibility Approximations for Environment Map RenderingabstractAbstract We present a technique for approximating isotropic BRDFs and precomputed self‐occlusion that enables accurate and efficient prefiltered environment map rendering. Our approach uses a nonlinear approximation of the BRDF as a weighted sum of isotropic Gaussian functions. Our representation requires a minimal amount of storage, can accurately represent BRDFs of arbitrary sharpness, and is above all, efficient to render. We precompute visibility due to self‐occlusion and store a low‐frequency approximation suitable for glossy reflections. We demonstrate our method by fitting our representation to measured BRDF data, yielding high visual quality at real‐time frame rates. Paul Green 0001, Jan Kautz, Frédo Durand |
Comput. Graph. Forum | 1 |
| 2007 | Multi-aperture photographyabstractThe emergent field of computational photography is proving that, by coupling generalized imaging optics with software processing, the quality and flexibility of imaging systems can be increased. In this paper, we capture and manipulate multiple images of a scene taken with different aperture settings ( f -numbers). We design and implement a prototype optical system and associated algorithms to capture four images of the scene in a single exposure, each taken with a different aperture setting. Our system can be used with commercially available DSLR cameras and photographic lenses without modification to either. We leverage the fact that defocus blur is a function of scene depth and f /# to estimate a depth map. We demonstrate several applications of our multi-aperture camera, such as post-exposure editing of the depth of field, including extrapolation beyond the physical limits of the lens, synthetic refocusing, and depth-guided deconvolution. Paul Green 0001, Wenyang Sun, Wojciech Matusik, Frédo Durand |
ACM Trans. Graph. | 1 |
| 2007 | The lightspeed automatic interactive lighting preview systemabstractWe present an automated approach for high-quality preview of feature-film rendering during lighting design. Similar to previous work, we use a deep-framebuffer shaded on the GPU to achieve interactive performance. Our first contribution is to generate the deep-framebuffer and corresponding shaders automatically through data-flow analysis and compilation of the original scene. Cache compression reduces automatically-generated deep-framebuffers to reasonable size for complex production scenes and shaders. We also propose a new structure, the indirect framebuffer , that decouples shading samples from final pixels and allows a deep-framebuffer to handle antialiasing, motion blur and transparency efficiently. Progressive refinement enables fast feedback at coarser resolution. We demonstrate our approach in real-world production. Jonathan Ragan-Kelley, Charlie Kilpatrick, Brian W. Smith, Doug Epps, Paul Green 0001, Christophe Hery, Frédo Durand |
ACM Trans. Graph. | 5 |
| 2006 | View-dependent precomputed light transport using nonlinear Gaussian function approximationsabstractWe propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches can render rich global illumination effects, but high-frequency view-dependent effects such as sharp highlights remain a challenge. We introduce a new representation of the light transport operator based on sums of Gaussians. The nonlinear parameters of our representation enable 1) arbitrary bandwidth because scale is encoded as a direct parameter, and 2) high-quality interpolation across view and mesh triangles because we interpolate the mean direction of the Gaussians, thereby preventing linear cross-fading artifacts. However, fitting the precomputed light transport data to this new representation requires solving a nonlinear regression problem that is more involved than traditional linear and nonlinear (truncation) approximation techniques. We present a new data fitting method based on optimization that includes energy terms aimed at enforcing artifact-free interpolation. We demonstrate that our method achieves high visual quality with a small storage cost and an efficient rendering algorithm. Paul Green 0001, Jan Kautz, Wojciech Matusik, Frédo Durand |
SI3D | 1 |