Aner Ben-Artzi

dblp:46/412 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 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
Rendering · 91% Visual content generation and editing · 9%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering
appearance modeling
0.122008
A precomputed polynomial representation for interactive BRDF editing with global illumination · ACM Trans. Graph. 2008
Real-time BRDF editing in complex lighting · ACM Trans. Graph. 2006
Rendering › bidirectional reflectance distribution function
BRDF editing
0.122008
A precomputed polynomial representation for interactive BRDF editing with global illumination · ACM Trans. Graph. 2008
Real-time BRDF editing in complex lighting · ACM Trans. Graph. 2006
Rendering › global illumination
precomputed radiance transfer
0.122008
A precomputed polynomial representation for interactive BRDF editing with global illumination · ACM Trans. Graph. 2008
Real-time BRDF editing in complex lighting · ACM Trans. Graph. 2006
Rendering
global illumination
0.112008
A precomputed polynomial representation for interactive BRDF editing with global illumination · ACM Trans. Graph. 2008
Visual content generation and editing › image editing
appearance editing
0.112006
Inverse shade trees for non-parametric material representation and editing · ACM Trans. Graph. 2006
Rendering › appearance modeling
appearance representation
0.112006
Inverse shade trees for non-parametric material representation and editing · ACM Trans. Graph. 2006
Rendering
physically based rendering
0.022008
A precomputed polynomial representation for interactive BRDF editing with global illumination · ACM Trans. Graph. 2008
Real-time BRDF editing in complex lighting · ACM Trans. Graph. 2006
Rendering › global illumination
interreflection
0.012008
A precomputed polynomial representation for interactive BRDF editing with global illumination · ACM Trans. Graph. 2008

Methods — techniques the papers use, named apart from their topics

tensor precomputation · 0.1polynomial representation · 0.1monte carlo path tracing · 0.1precomputed radiance transfer · 0.1matrix factorization · 0.1incremental rendering · 0.1curve-based representation · 0.1constrained optimization · 0.1
YearPublicationVenuePosition
2008 A precomputed polynomial representation for interactive BRDF editing with global illumination
abstract
The ability to interactively edit BRDFs in their final placement within a computer graphics scene is vital to making informed choices for material properties. We significantly extend previous work on BRDF editing for static scenes (with fixed lighting and view) by developing a precomputed polynomial representation that enables interactive BRDF editing with global illumination. Unlike previous precomputation-based rendering techniques, the image is not linear in the BRDF when considering interreflections. We introduce a framework for precomputing a multibounce tensor of polynomial coefficients that encapsulates the nonlinear nature of the task. Significant reductions in complexity are achieved by leveraging the low-frequency nature of indirect light. We use a high-quality representation for the BRDFs at the first bounce from the eye and lower-frequency (often diffuse) versions for further bounces. This approximation correctly captures the general global illumination in a scene, including color-bleeding, near-field object reflections, and even caustics. We adapt Monte Carlo path tracing for precomputing the tensor of coefficients for BRDF basis functions. At runtime, the high-dimensional tensors can be reduced to a simple dot product at each pixel for rendering. We present a number of examples of editing BRDFs in complex scenes with interactive feedback rendered with global illumination.
Aner Ben-Artzi, Kevin Egan, Ravi Ramamoorthi, Frédo Durand
ACM Trans. Graph.1
2006 Exploiting Temporal Coherence for Incremental All-Frequency Relighting
Ryan S. Overbeck, Aner Ben-Artzi, Ravi Ramamoorthi, Eitan Grinspun
Rendering Techniques2
2006 Real-time BRDF editing in complex lighting
abstract
Current systems for editing BRDFs typically allow users to adjust analytic parameters while visualizing the results in a simplified setting (e.g. unshadowed point light). This paper describes a real-time rendering system that enables interactive edits of BRDFs, as rendered in their final placement on objects in a static scene, lit by direct, complex illumination. All-frequency effects (ranging from near-mirror reflections and hard shadows to diffuse shading and soft shadows) are rendered using a precomputation-based approach. Inspired by real-time relighting methods, we create a linear system that fixes lighting and view to allow real-time BRDF manipulation. In order to linearize the image's response to BRDF parameters, we develop an intermediate curve-based representation, which also reduces the rendering and precomputation operations to 1D while maintaining accuracy for a very general class of BRDFs. Our system can be used to edit complex analytic BRDFs (including anisotropic models), as well as measured reflectance data. We improve on the standard precomputed radiance transfer (PRT) rendering computation by introducing an incremental rendering algorithm that takes advantage of frame-to-frame coherence. We show that it is possible to render reference-quality images while only updating 10% of the data at each frame, sustaining frame-rates of 25-30fps.
Aner Ben-Artzi, Ryan S. Overbeck, Ravi Ramamoorthi
ACM Trans. Graph.1
2006 Inverse shade trees for non-parametric material representation and editing
abstract
Recent progress in the measurement of surface reflectance has created a demand for non-parametric appearance representations that are accurate, compact, and easy to use for rendering. Another crucial goal, which has so far received little attention, is editability: for practical use, we must be able to change both the directional and spatial behavior of surface reflectance (e.g., making one material shinier, another more anisotropic, and changing the spatial "texture maps" indicating where each material appears). We introduce an Inverse Shade Tree framework that provides a general approach to estimating the "leaves" of a user-specified shade tree from high-dimensional measured datasets of appearance. These leaves are sampled 1- and 2-dimensional functions that capture both the directional behavior of individual materials and their spatial mixing patterns. In order to compute these shade trees automatically, we map the problem to matrix factorization and introduce a flexible new algorithm that allows for constraints such as non-negativity, sparsity, and energy conservation. Although we cannot infer every type of shade tree, we demonstrate the ability to reduce multi-gigabyte measured datasets of the Spatially-Varying Bidirectional Reflectance Distribution Function (SVBRDF) into a compact representation that may be edited in real time.
Jason Lawrence, Aner Ben-Artzi, Christopher DeCoro, Wojciech Matusik, Hanspeter Pfister, Ravi Ramamoorthi, Szymon Rusinkiewicz
ACM Trans. Graph.2