Sparse Random Approximation and Lossy Compression
Data Analysis, Statistics and Probability
2011-05-26 v1 Cryptography and Security
Abstract
We discuss a method for sparse signal approximation, which is based on the correlation of the target signal with a pseudo-random signal, and uses a modification of the greedy matching pursuit algorithm. We show that this approach provides an efficient encoding-decoding method, which can be used also for lossy compression and encryption purposes.
Cite
@article{arxiv.1105.4936,
title = {Sparse Random Approximation and Lossy Compression},
author = {M. Andrecut},
journal= {arXiv preprint arXiv:1105.4936},
year = {2011}
}
Comments
6 pages, 4 figures