LAPACK: a portable linear algebra library for high-performance computers
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Matrix computations (3rd ed.)
EM algorithms for PCA and SPCA
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Merging and Splitting Eigenspace Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Incremental Singular Value Decomposition of Uncertain Data with Missing Values
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
Reflectance and Texture of Real-World Surfaces Authors
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Efficient and realistic visualization of cloth
EGRW '03 Proceedings of the 14th Eurographics workshop on Rendering
Synthesis and Rendering of Bidirectional Texture Functions on Arbitrary Surfaces
IEEE Transactions on Visualization and Computer Graphics
TensorTextures: multilinear image-based rendering
ACM SIGGRAPH 2004 Papers
Out-of-core tensor approximation of multi-dimensional matrices of visual data
ACM SIGGRAPH 2005 Papers
Hierarchical Tensor Approximation of Multi-Dimensional Visual Data
IEEE Transactions on Visualization and Computer Graphics
BTF compression via sparse tensor decomposition
EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
Integrated high-quality acquisition of geometry and appearance for cultural heritage
VAST'11 Proceedings of the 12th International conference on Virtual Reality, Archaeology and Cultural Heritage
| Hi-index | 0.00 |
Dimensionality reduction methods like Principal Component Analysis (PCA) have become commonplace for the compression of large datasets in computer graphics. One important application is the compression of Bidirectional Texture Functions (BTF). However, the use of such techniques has still many limitations that arise from the large size of the input data which results in impractically high compression times. In this paper, we address these shortcomings and present a method which allows for efficient parallelized computation of the PCA of a large BTF matrix. The matrix is first split into several blocks for which the PCA can be performed independently and thus in parallel. We scale the single subproblems in such a way, that they can be solved in-core using the EM-PCA algorithm. This allows us to perform the calculation on current GPUs exploiting their massive parallel computing power. The eigenspaces determined for the individual blocks are then merged to obtain the PCA of the whole dataset. This way nearly arbitrarily sized matrices can be processed considerably faster than by serial algorithms. Thus, BTFs with much higher spatial and angular resolution can be compressed in reasonable time.