An Efficient Optimization Algorithm for Measurement Matrix Based on SVD and Improved Nesterov Accelerated Gradient
In compressed sensing, a measurement matrix having low coherence with a specified sparse dictionary has been shown to be advantageous over a Gaussian random matrix in terms of reconstruction performance. In this paper the problem of efficiently designing the measurement matrix is addressed. The meas...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Spolecnost pro radioelektronicke inzenyrstvi
2025-06-01
|
| Series: | Radioengineering |
| Subjects: | |
| Online Access: | https://www.radioeng.cz/fulltexts/2025/25_02_0234_0242.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In compressed sensing, a measurement matrix having low coherence with a specified sparse dictionary has been shown to be advantageous over a Gaussian random matrix in terms of reconstruction performance. In this paper the problem of efficiently designing the measurement matrix is addressed. The measurement matrix is designed by iteratively minimizing the difference between the Gram matrix of the sensing matrix and a target Gram matrix. A new target Gram matrix is designed by applying singular value decomposition to the sensing matrix and utilizing entry shrinking in the Gram matrix, leading to lower mutual coherence indicators. An improved Nesterov accelerated gradient algorithm is derived to update the measurement matrix, which can improve the convergence behavior. An efficient optimization algorithm for measurement matrix is proposed on the basis of alternating minimization. The experimental results and analysis show that the proposed algorithm performs well in terms of both computational complexity and reconstruction performance. |
|---|---|
| ISSN: | 1210-2512 |