pith. sign in

arxiv: 1502.05980 · v2 · pith:KIWAK25Cnew · submitted 2014-12-21 · 💻 cs.IT · math.IT

An Approach to 2D Signals Recovering in Compressive Sensing Context

classification 💻 cs.IT math.IT
keywords algorithmdatareconstructioncompressivedomainproposedsensingsignal
0
0 comments X
read the original abstract

In this paper we study the compressive sensing effects on 2D signals exhibiting sparsity in 2D DFT domain. A simple algorithm for reconstruction of randomly under-sampled data is proposed. It is based on the analytically determined threshold that precisely separates signal and non-signal components in the 2D DFT domain. The algorithm operates fast in a single iteration providing the accurate signal reconstruction. In the situations that are not comprised by the analytic derivation and constrains, the algorithm is still efficient and need just a couple of iterations. The proposed solution shows promising results in ISAR imaging (simulated data are used), where the reconstruction is achieved even in the case when less than 10% of data is available.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.