Sparse Representation of 3D Images for Piecewise Dimensionality Reduction with High Quality Reconstruction
arXiv:1807.11116
Abstract
Sparse representation of 3D images is considered within the context of data reduction. The goal is to produce high quality approximations of 3D images using fewer elementary components than the number of intensity points in the 3D array. This is achieved by means of a highly redundant dictionary and a dedicated pursuit strategy especially designed for low memory requirements. The benefit of the proposed framework is illustrated in the first instance by demonstrating the gain in dimensionality reduction obtained when approximating true color images as very thin 3D arrays, instead of performing an independent channel by channel approximation. The full power of the approach is further exemplified by producing high quality approximations of hyper-spectral images with a reduction of up to 371 times the number of data points in the representation.
arXiv commentAll the scripts and images for reproducing the results are available on http://www.nonlinear-approx.info/examples/node09.html
References in corpus (6)
- Tensor Decompositions for Signal Processing Applications From Two-way to Multiway Component Analysis
- Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- A survey of sparse representation: algorithms and applications
- Hierarchized block wise image approximation by greedy pursuit strategies
- Self Contained Encrypted Image Folding
- Adaptive non-uniform B-spline dictionaries on a compact interval