Harmonic retrieval using weighted lifted-structure low-rank matrix completion

Mohammad Bokaei, Saeed Razavikia, Stefano Rini, Arash Amini*, Hamid Behrouzi

*此作品的通信作者

研究成果: Article同行評審

摘要

In this paper, we investigate the problem of recovering the frequency components of a mixture of K complex sinusoids from a random subset of N equally-spaced time-domain samples. Because of the random subset, the samples are effectively non-uniform. Besides, the frequency values of each of the K complex sinusoids are assumed to vary continuously within a given range. For this problem, we propose a two-step strategy: (i) we first lift the incomplete set of uniform samples (unavailable samples are treated as missing data) into a structured matrix with missing entries, which is potentially low-rank; then (ii) we complete the matrix using a weighted nuclear minimization problem. We call the method a weighted lifted-structured (WLi) low-rank matrix recovery. Our approach can be applied to a range of matrix structures such as Hankel and double-Hankel, among others, and provides improvement over the unweighted existing schemes such as EMaC and DEMaC. We provide theoretical guarantees for the proposed method, as well as numerical simulations in both noiseless and noisy settings. Both the theoretical and the numerical results confirm the superiority of the proposed approach.

原文English
文章編號109253
期刊Signal Processing
216
DOIs
出版狀態Published - 3月 2024

指紋

深入研究「Harmonic retrieval using weighted lifted-structure low-rank matrix completion」主題。共同形成了獨特的指紋。

引用此