Global illumination using photon maps
Proceedings of the eurographics workshop on Rendering techniques '96
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Pose space deformation: a unified approach to shape interpolation and skeleton-driven deformation
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
A ray tracing solution for diffuse interreflection
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Multi-weight enveloping: least-squares approximation techniques for skin animation
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation
EigenSkin: real time large deformation character skinning in hardware
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation
DyRT: dynamic response textures for real time deformation simulation with graphics hardware
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Geometry-driven photorealistic facial expression synthesis
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Clustered principal components for precomputed radiance transfer
ACM SIGGRAPH 2003 Papers
Precomputing interactive dynamic deformable scenes
ACM SIGGRAPH 2003 Papers
Precomputed local radiance transfer for real-time lighting design
ACM SIGGRAPH 2005 Papers
Statistical acceleration for animated global illumination
ACM SIGGRAPH 2006 Papers
Direct-to-indirect transfer for cinematic relighting
ACM SIGGRAPH 2006 Papers
Real-time data driven deformation using kernel canonical correlation analysis
ACM SIGGRAPH 2008 papers
Optimizing cubature for efficient integration of subspace deformations
ACM SIGGRAPH Asia 2008 papers
Skipping steps in deformable simulation with online model reduction
ACM SIGGRAPH Asia 2009 papers
Pose-space animation and transfer of facial details
Proceedings of the 2008 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Face poser: Interactive modeling of 3D facial expressions using facial priors
ACM Transactions on Graphics (TOG)
Subspace self-collision culling
ACM SIGGRAPH 2010 papers
Learning from humanoid cartoon designs
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
Interactive region-based linear 3D face models
ACM SIGGRAPH 2011 papers
LibEE: a multithreaded dependency graph for character animation
Proceedings of the Digital Production Symposium
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Global illumination with radiance regression functions
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
One-to-many: example-based mesh animation synthesis
Proceedings of the 12th ACM SIGGRAPH/Eurographics Symposium on Computer Animation
An efficient construction of reduced deformable objects
ACM Transactions on Graphics (TOG)
Sparse localized deformation components
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
Many applications in Computer Graphics contain computationally expensive calculations. These calculations are often performed at many points to produce a full solution, even though the subspace of reasonable solutions may be of a relatively low dimension. The calculation of facial articulation and rendering of scenes with global illumination are two example applications that require these sort of computations. In this paper, we present Key Point Subspace Acceleration and Soft Caching, a technique for accelerating these types of computations. Key Point Subspace Acceleration (KPSA) is a statistical acceleration scheme that uses examples to compute a statistical subspace and a set of characteristic key points. The full calculation is then computed only at these key points and these points are used to provide a subspace based estimate of the entire calculation. The soft caching process is an extension to the KPSA technique where the key points are also used to provide a confidence estimate for the KPSA result. In cases with high anticipated error the calculation will then "fail through" to a full evaluation of all points (a cache miss), while frames with low error can use the accelerated statistical evaluation (a cache hit).