Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jesse D. Hall
dblp:58/5585
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1
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
1 paper |
Rendering · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering › global illumination
precomputed radiance transfer |
0.0 | 1 | 2003 | Clustered principal components for precomputed radiance transfer · ACM Trans. Graph. 2003 |
Rendering › global illumination
real-time global illumination |
0.0 | 1 | 2003 | Clustered principal components for precomputed radiance transfer · ACM Trans. Graph. 2003 |
Methods — techniques the papers use, named apart from their topics
spherical harmonics · 0.0principal component analysis · 0.0least-squares projection · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Clustered principal components for precomputed radiance transferabstractWe compress storage and accelerate performance of precomputed radiance transfer (PRT), which captures the way an object shadows, scatters, and reflects light. PRT records over many surface points a transfer matrix. At run-time, this matrix transforms a vector of spherical harmonic coefficients representing distant, low-frequency source lighting into exiting radiance. Per-point transfer matrices form a high-dimensional surface signal that we compress using clustered principal component analysis (CPCA), which partitions many samples into fewer clusters each approximating the signal as an affine subspace. CPCA thus reduces the high-dimensional transfer signal to a low-dimensional set of per-point weights on a per-cluster set of representative matrices. Rather than computing a weighted sum of representatives and applying this result to the lighting, we apply the representatives to the lighting per-cluster (on the CPU) and weight these results per-point (on the GPU). Since the output of the matrix is lower-dimensional than the matrix itself, this reduces computation. We also increase the accuracy of encoded radiance functions with a new least-squares optimal projection of spherical harmonics onto the hemisphere. We describe an implementation on graphics hardware that performs real-time rendering of glossy objects with dynamic self-shadowing and interreflection without fixing the view or light as in previous work. Our approach also allows significantly increased lighting frequency when rendering diffuse objects and includes subsurface scattering. Peter-Pike J. Sloan, Jesse D. Hall, John C. Hart, John M. Snyder |
ACM Trans. Graph. | 2 |