Low-Rank Covariance Matrix Recovery From Rank-One Measurements

An Analytical Solution

Journal Article (2025)
Author(s)

Peilan Wang (University of Electronic Science and Technology of China)

Jun Fang (University of Electronic Science and Technology of China)

Binyao Ma (University of Electronic Science and Technology of China)

Bin Wang (University of Electronic Science and Technology of China)

Geert Leus (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group
Signal Processing Systems
DOI related publication
https://doi.org/10.1109/LSP.2025.3584252 Final published version
More Info
expand_more
Publication Year
2025
Language
English
Research Group
Signal Processing Systems
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository as part of the Taverne amendment. More information about this copyright law amendment can be found at https://www.openaccess.nl. Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Journal title
IEEE Signal Processing Letters
Volume number
32
Pages (from-to)
2674-2678
Downloads counter
142
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In this letter, we propose an analytical solution for recovering a low-rank positive semi-definite (PSD) matrix from its rank-one measurements. We show that by utilizing a set of structured measurement vectors, we can analytically determine the null space of this low-rank PSD matrix. Based on the result, the PSD matrix can be efficiently recovered. Our analysis shows that the proposed method only requires (N - K)(2K + 1)+ K
2 measurements to guarantee exact recovery of the PSD matrix, where N and K respectively denote the dimension and the rank of the PSD matrix. Numerical results show that the proposed method achieves a considerable improvement over existing state-of-the-art methods in terms of both sample complexity and computational efficiency. Specifically, the proposed method helps improve the computational efficiency by an order of magnitude as compared with existing methods.

Files

Low-Rank_Covariance_Matrix_Rec... (pdf)
(pdf | 0.617 Mb)
- Embargo expired in 14-01-2026
License info not available