Tensor Quantization: High-Dimensional Data Compression

Quantization is an important technique to transform the input sample values from a large set (or a continuous range) into the output sample values in a small set (or a finite set). It has been applied broadly for lossy-data compression, pattern recognition, probability density estimation, and cluste...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems for video technology 2022-08, Vol.32 (8), p.5566-5580
Main Authors: Chang, Shih Yu, Wu, Hsiao-Chun
Format: Article
Language:English
Subjects:
Algorithms
Clustering
Data compression
Data structures
Image coding
Image compression
Mathematical analysis
Matrix decomposition
Pattern recognition
Quantization (signal)
Signal processing algorithms
Spatial data
Speech recognition
tensor inversion
tensor least squares (TLS)
tensor quantization (TQ)
Tensors
Transforms
Vector quantization
Vector quantization (VQ)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Quantization is an important technique to transform the input sample values from a large set (or a continuous range) into the output sample values in a small set (or a finite set). It has been applied broadly for lossy-data compression, pattern recognition, probability density estimation, and clustering. Vector quantization (VQ) is a prevalent image-compression technique, which treats image matrices as stretched vectors and then finds the representative stretched vectors accordingly for a given image data set. One can use tensor data representation to directly characterize the original two-dimensional image data rather than stretch the image matrix into a long vector so as to destroy the original two-dimensional data structure. In this work, we propose a new tensor quantization (TQ) framework which does not need to reduce the dimensionality of the original image data and destroy the original two-dimensional spatial relationship among data; these two serious drawbacks of vector quantization are well known. We first present tensor calculus and then propose a new parallel tensor-inversion algorithm for TQ thereupon. We also establish the pertinent theoretical proof to justify that our proposed new TQ approach is superior to the existing VQ approach especially as the image dimension becomes large. Finally, numerical experiments to evaluate the image-compression performances of VQ and TQ are demonstrated and their corresponding computational-complexities are also compared.
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2022.3145341