Fast Fourier-Based Generation of the Compression Matrix for Deterministic Compressed Sensing
The primary goal of this work is to review the importance of data compression and present a fast Fourier-based method for generating the deterministic compression matrix in the area of deterministic compressed sensing. The principle concepts of data compression such as general process of data compression, sparse signals, coherence matrix and Restricted Isometry Property (RIP) have been defined. We have introduced two methods of sparse data compression. The first method is formed by utilizing a stochastic matrix which is a common approach, and the second method is created by utilizing a deterministic matrix which is proposed more recently. The main goal of this work is to improve the execution time of the deterministic matrix generation. The execution time is related to the generation method of the deterministic matrix. Furthermore, we have implemented a software which makes it possible to compare different methods of reconstructing data compression. To make this comparison, it is necessary to draw and compare certain graphs, e.g. phase transition, the ratio of output signal to noise and input signal to noise, signal to noise output and also the ratio of percentage of accurate reconstructing and order of sparse signals for various reconstructing methods. To facilitate this process, the user would be able to draw his/her favorite graphs in GUI environment.
Code (0)
등록된 구현이 없습니다.
Tasks
compressed sensingData CompressionSimilar Papers 제목 키워드 기반
Fast Evaluation of Additive Kernels: Feature Arrangement, Fourier Methods, and Kernel Derivatives
One of the main computational bottlenecks when working with kernel based learning is dealing with the large and typically dense kernel matrix. Techniques dealing with fast approximations of the matrix vector product for …
Gaussian ProcessesMulti-dimensional graph fractional Fourier transform and its application
Many multi-dimensional signals appear in the real world, such as digital images and data that has spatial and temporal dimensions. How to show the spectrum of these multi-dimensional signals correctly is a key challenge …
Data CompressionMPDCompress - Matrix Permutation Decomposition Algorithm for Deep Neural Network Compression
Deep neural networks (DNNs) have become the state-of-the-art technique for machine learning tasks in various applications. However, due to their size and the computational complexity, large DNNs are not readily deployabl…
Neural Network CompressionQuantizationAccelerated Volumetric Compression without Hierarchies: A Fourier Feature Based Implicit Neural Representation Approach
Volumetric data compression is critical in fields like medical imaging, scientific simulation, and entertainment. We introduce a structure-free neural compression method combining Fourierfeature encoding with selective v…
M2T: Masking Transformers Twice for Faster Decoding
We show how bidirectional transformers trained for masked token prediction can be applied to neural image compression to achieve state-of-the-art results. Such models were previously used for image generation by progress…
Image CompressionImage Generation