Sparse Random Approximation and Lossy Compression

TL;DR

This paper introduces a sparse signal approximation method using pseudo-random signals and a modified greedy algorithm, enabling efficient lossy compression and encryption.

Contribution

It presents a novel approach combining pseudo-random correlation with a modified greedy pursuit for improved sparse approximation and compression.

Findings

Efficient encoding-decoding method demonstrated

Applicable for lossy compression and encryption

Enhances sparse signal approximation techniques

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.