Dealing with frequency perturbations in compressive reconstructions with Fourier sensing matrices
| Autor: | Karthik S. Gurumoorthy, Ajit Rajwade, Eeshan Malhotra, Himanshu Pandotra |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Physics
Basis (linear algebra) Noise (signal processing) Mathematical analysis Direction of arrival 020206 networking & telecommunications 02 engineering and technology Base (group theory) Matrix (mathematics) symbols.namesake Compressed sensing Fourier transform Control and Systems Engineering Signal Processing 0202 electrical engineering electronic engineering information engineering symbols 020201 artificial intelligence & image processing Computer Vision and Pattern Recognition Electrical and Electronic Engineering Computational problem Software |
| Zdroj: | Signal Processing. 165:57-71 |
| ISSN: | 0165-1684 |
| Popis: | In many applications in compressed sensing, the measurement matrix is a Fourier matrix, i.e., it measures the Fourier transform of the underlying signal at some specified ‘base’ frequencies { u i } i = 1 M , where M is the number of measurements. However due to system calibration errors, the system may measure the Fourier transform at frequencies { u i + δ i } i = 1 M that are different from the base frequencies and where { δ i } i = 1 M are unknown frequency perturbations. Ignoring such perturbations can lead to major errors in signal recovery. In this paper, we present a simple but effective alternating minimization algorithm to recover the perturbations in the frequencies in situ with the signal, which we assume is sparse or compressible in some known basis. In many cases, the perturbations { δ i } i = 1 M can be expressed in terms of a small number of unique parameters P ≪ M. We demonstrate that in such cases, the method leads to excellent quality results that are several times better than baseline algorithms (which are based on existing off-grid methods in the recent literature on direction of arrival (DOA) estimation, modified to suit the computational problem in this paper). Our results are also robust to noise in the measurement values. We also provide theoretical results for (1) the conditional convergence of our algorithm, and (2) the uniqueness of the solution for this computational problem, under some restrictions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect