BTF Compression via Sparse Tensor Decomposition

In this paper, we present a novel compression technique for Bidirectional Texture Functions based on a sparse tensor decomposition. We apply the K‐SVD algorithm along two different modes of a tensor to decompose it into a small dictionary and two sparse tensors. This representation is very compact, allowing for considerably better compression ratios at the same RMS error than possible with current compression techniques like PCA, N‐mode SVD and Per Cluster Factorization. In contrast to other tensor decomposition based techniques, the use of a sparse representation achieves a rendering performance that is at high compression ratios similar to PCA based methods.

[1]  Baining Guo,et al.  Synthesis and rendering of bidirectional texture functions on arbitrary surfaces , 2004, IEEE Transactions on Visualization and Computer Graphics.

[2]  M. Alex O. Vasilescu,et al.  TensorTextures: multilinear image-based rendering , 2004, SIGGRAPH 2004.

[3]  Katsushi Ikeuchi,et al.  Appearance Based Object Modeling using Texture Database: Acquisition Compression and Rendering , 2002, Rendering Techniques.

[4]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[5]  Shree K. Nayar,et al.  Reflectance and Texture of Real-World Surfaces Authors , 1997, CVPR 1997.

[6]  Wojciech Matusik,et al.  Inverse shade trees for non-parametric material representation and editing , 2006, ACM Trans. Graph..

[7]  N. Ahuja,et al.  Out-of-core tensor approximation of multi-dimensional matrices of visual data , 2005, SIGGRAPH 2005.

[8]  Ares Lagae,et al.  Interactive Rendering with Bidirectional Texture Functions , 2003, Comput. Graph. Forum.

[9]  Ralf Sarlette,et al.  Efficient and Realistic Visualization of Cloth , 2003, Rendering Techniques.

[10]  Ralf Sarlette,et al.  Acquisition, Synthesis, and Rendering of Bidirectional Texture Functions , 2005, Comput. Graph. Forum.

[11]  Terrence J. Sejnowski,et al.  Learning Overcomplete Representations , 2000, Neural Computation.

[12]  Kjersti Engan,et al.  Multi-frame compression: theory and design , 2000, Signal Process..

[13]  M. Koudelka,et al.  Acquisition , Compression , and Synthesis of Bidirectional Texture Functions , 2003 .

[14]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[15]  Tamara G. Kolda,et al.  Efficient MATLAB Computations with Sparse and Factored Tensors , 2007, SIAM J. Sci. Comput..

[16]  Reinhard Klein,et al.  Compression and Real-Time Rendering of Measured BTFs Using Local PCA , 2003, VMV.

[17]  Szymon Rusinkiewicz,et al.  A New Change of Variables for Efficient BRDF Representation , 1998, Rendering Techniques.

[18]  Michael Elad,et al.  Efficient Implementation of the K-SVD Algorithm using Batch Orthogonal Matching Pursuit , 2008 .

[19]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[20]  Demetri Terzopoulos,et al.  TensorTextures: multilinear image-based rendering , 2004, ACM Trans. Graph..

[21]  Shree K. Nayar,et al.  Reflectance and texture of real-world surfaces , 1999, TOGS.

[22]  Pat Hanrahan,et al.  All-frequency shadows using non-linear wavelet lighting approximation , 2003, ACM Trans. Graph..

[23]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[24]  Joseph F. Murray,et al.  Dictionary Learning Algorithms for Sparse Representation , 2003, Neural Computation.

[25]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[26]  Narendra Ahuja,et al.  Out-of-core tensor approximation of multi-dimensional matrices of visual data , 2005, ACM Trans. Graph..

[27]  Chun Chen,et al.  Hierarchical Tensor Approximation of Multi-Dimensional Visual Data , 2008, IEEE Transactions on Visualization and Computer Graphics.

[28]  Reinhard Klein,et al.  Parallelized Matrix Factorization for fast BTF Compression , 2009, EGPGV@Eurographics.

[29]  ChenChun,et al.  Hierarchical Tensor Approximation of Multi-Dimensional Visual Data , 2008 .