Cargando…
A Weak Selection Stochastic Gradient Matching Pursuit Algorithm
In the existing stochastic gradient matching pursuit algorithm, the preliminary atomic set includes atoms that do not fully match the original signal. This weakens the reconstruction capability and increases the computational complexity. To solve these two problems, a new method is proposed. Firstly...
Autores principales: | Zhao, Liquan, Hu, Yunfeng, Jia, Yanfei |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6566407/ https://www.ncbi.nlm.nih.gov/pubmed/31117279 http://dx.doi.org/10.3390/s19102343 |
Ejemplares similares
-
Stochastic Recursive Gradient Support Pursuit and Its Sparse Representation Applications
por: Shang, Fanhua, et al.
Publicado: (2020) -
Optimal Estimation of Wavelet Decomposition Level for a Matching Pursuit Algorithm
por: Kaplun, Dmitry, et al.
Publicado: (2019) -
An Application of the Orthogonal Matching Pursuit Algorithm in Space-Time Adaptive Processing
por: Ślesicka, Anna, et al.
Publicado: (2020) -
Sparsity Adaptive Matching Pursuit Detection Algorithm Based on Compressed Sensing for Radar Signals
por: Wei, Yanbo, et al.
Publicado: (2017) -
Duration analysis using matching pursuit algorithm reveals longer bouts of gamma rhythm
por: Chandran KS, Subhash, et al.
Publicado: (2018)