Stochastic Gradient Matching Pursuit Algorithm Based on Sparse Estimation release_6y2hfkexd5e6hl7pk2nv7gp3xu

by Liquan Zhao, Yunfeng Hu, Yulong Liu

Published in Electronics by MDPI AG.

2019   p165

Abstract

The stochastic gradient matching pursuit algorithm requires the sparsity of the signal as prior information. However, this prior information is unknown in practical applications, which restricts the practical applications of the algorithm to some extent. An improved method was proposed to overcome this problem. First, a pre-evaluation strategy was used to evaluate the sparsity of the signal and the estimated sparsity was used as the initial sparsity. Second, if the number of columns of the candidate atomic matrix was smaller than that of the rows, the least square solution of the signal was calculated, otherwise, the least square solution of the signal was set as zero. Finally, if the current residual was greater than the previous residual, the estimated sparsity was adjusted by the fixed step-size and stage index, otherwise we did not need to adjust the estimated sparsity. The simulation results showed that the proposed method was better than other methods in terms of the aspect of reconstruction percentage in the larger sparsity environment.
In application/xml+jats format

Archived Files and Locations

application/pdf  7.0 MB
file_4uyui4eexvehrophs3bvnz6bxa
web.archive.org (webarchive)
res.mdpi.com (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2019-02-01
Language   en ?
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  2079-9292
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4531f9c1-2b54-425f-a64b-0cbe8b3f5456
API URL: JSON