Automated reprojection-based pixel shader optimization

Sitthi‐Amorn, Pitchaya; Lawrence, Jason; Yang, Lei; Sander, Pedro V.; Nehab, Diego; Xi, Jiahe

doi:10.1145/1409060.1409080

Cited by 26 publications

(16 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thereafter, to adapt to more changes in the input, Nehab et al [2007] proposed a reprojection-based shader optimization method that uses a screen buffer to cache optimized values. This method was extended to automate the use of data reprojection as a general and practical tool for optimizing procedural shaders [Sitthi-amorn et al 2008]. More recently, a Genetic Programming based shader simplification scheme was proposed to select optimal shaders that balance between performance and image quality [Sitthi-Amorn et al 2011].…”

Section: Related Workmentioning

confidence: 99%

“…Similarly, our approach leverages code analysis techniques, but distinguishes itself from previous approaches in that ours seeks to not only optimize computational operations in the fragment shader, but also distribute computations across different stages of shaders. Our method uses additional buffers to store approximated surface signals, which bears some similarity with those cache-based reprojection methods [Nehab et al 2007;Sitthi-amorn et al 2008]. However, the representation and the way we use these buffers are totally different.…”

Section: Related Workmentioning

confidence: 99%

“…Pellacini [2005] proposed a user-configurable shader simplification method for pixel-wise procedural modeling. Nehab et al [2007] and Sitthi-amorn et al [2008] presented a reprojection based scheme to optimize the shading of pixels. Most recently, Sitthi-amorn et al [2011] used Genetic Programming to fully automate the simplification process.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Automatic shader simplification using surface signal approximation

et al. 2014

View full text Add to dashboard Cite

In this paper, we present a new automatic shader simplification method using surface signal approximation. We regard the entire multi-stage rendering pipeline as a process that generates signals on surfaces, and we formulate the simplification of the fragment shader as a global simplification problem across multi-shader stages. Three new shader simplification rules are proposed to solve the problem. First, the code transformation rule transforms fragment shader code to other shader stages in order to redistribute computations on pixels up to the level of geometry primitives. Second, the surface-wise approximation rule uses high-order polynomial basis functions on surfaces to approximate pixel-wise computations in the fragment shader. These approximations are pre-cached and simplify computations at runtime. Third, the surface subdivision rule tessellates surfaces into smaller patches. It combines with the previous two rules to approximate pixel-wise signals at different levels of tessellations with different computation times and visual errors. To evaluate simplified shaders using these simplification rules, we introduce a new cost model that includes the visual quality, rendering time and memory consumption. With these simplification rules and the cost model, we present an integrated shader simplification algorithm that is capable of automatically generating variants of simplified shaders and selecting a sequence of preferable shaders. Results show that the sequence of selected simplified shaders balance performance, accuracy and memory consumption well.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automatic shader simplification using surface signal approximation

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Most incremental techniques in computer graphics [Laine et al 2007;Ragan-Kelley et al 2007;Sitthi-amorn et al 2008] use algorithms very specialized to their task. In contrast to this, we try to use the more extensible basis of dependency graphs.…”

Section: Microsoft's Windows Presentation Foundation (Wpf) [Microsoftmentioning

confidence: 99%

Lazy incremental computation for efficient scene graph rendering

Wörister

Steinlechner

Maierhofer

et al. 2013

Proceedings of the 5th High-Performance Graphics Conference

View full text Add to dashboard Cite

In order to provide a highly performant rendering system while maintaining a scene graph structure with a high level of abstraction, we introduce improved rendering caches, that can be updated incrementally without any scene graph traversal. The basis of this novel system is the use of a dependency graph, that can be synthesized from the scene graph and links all sources of changes to the affected parts of rendering caches. By using and extending concepts from incremental computation we minimize the computational overhead for performing the necessary updates due to changes in any inputs. This makes it possible to provide a high-level semantic scene graph, while retaining the opportunity to apply a number of known optimizations to the rendering caches even for dynamic scenes. Our evaluation shows that the resulting rendering system is highly competitive and provides good rendering performance for scenes ranging from completely static geometry all the way to completely dynamic geometry.

show abstract

“…Fortunately, it is often the case that at any given surface point, expensive elements of the surface shading (such as albedo) vary slowly or are constant over time. A number of techniques can automatically factor a procedural shader into static and dynamic layers [Guenter 1994;Jones et al 2000;Sitthi-amorn et al 2008]. Our idea is to sample the static and weakly dynamic layers at a lower temporal rate to achieve a higher spatial sampling rate for the same computational budget.…”

Section: Introductionmentioning

confidence: 99%

Amortized supersampling

Yang¹,

Nehab

Sander³

et al. 2009

ACM Trans. Graph.

Self Cite

View full text Add to dashboard Cite

We present a real-time rendering scheme that reuses shading samples from earlier time frames to achieve practical antialiasing of procedural shaders. Using a reprojection strategy, we maintain several sets of shading estimates at subpixel precision, and incrementally update these such that for most pixels only one new shaded sample is evaluated per frame. The key difficulty is to prevent accumulated blurring during successive reprojections. We present a theoretical analysis of the blur introduced by reprojection methods. Based on this analysis, we introduce a nonuniform spatial filter, an adaptive recursive temporal filter, and a principled scheme for locally estimating the spatial blur. Our scheme is appropriate for antialiasing shading attributes that vary slowly over time. It works in a single rendering pass on commodity graphics hardware, and offers results that surpass 4×4 stratified supersampling in quality, at a fraction of the cost.

show abstract

Automated reprojection-based pixel shader optimization

Cited by 26 publications

References 39 publications

Automatic shader simplification using surface signal approximation

Automatic shader simplification using surface signal approximation

Lazy incremental computation for efficient scene graph rendering

Amortized supersampling

Contact Info

Product

Resources

About