Cargando…
Stochastic Recursive Gradient Support Pursuit and Its Sparse Representation Applications
In recent years, a series of matching pursuit and hard thresholding algorithms have been proposed to solve the sparse representation problem with [Formula: see text]-norm constraint. In addition, some stochastic hard thresholding methods were also proposed, such as stochastic gradient hard threshold...
Autores principales: | Shang, Fanhua, Wei, Bingkun, Liu, Yuanyuan, Liu, Hongying, Wang, Shuang, Jiao, Licheng |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7506682/ https://www.ncbi.nlm.nih.gov/pubmed/32872609 http://dx.doi.org/10.3390/s20174902 |
Ejemplares similares
-
RobOMP: Robust variants of Orthogonal Matching Pursuit for sparse representations
por: Loza, Carlos A.
Publicado: (2019) -
Stochastic approximation and recursive algorithms and applications
por: Kushner, Harold J, et al.
Publicado: (2003) -
A Weak Selection Stochastic Gradient Matching Pursuit Algorithm
por: Zhao, Liquan, et al.
Publicado: (2019) -
Deep Sparse Autoencoder and Recursive Neural Network for EEG Emotion Recognition
por: Li, Qi, et al.
Publicado: (2022) -
Stochastic approximation and recursive estimation
por: Nevelson, M B, et al.
Publicado: (1976)