Sparse Adaptive Iteratively-Weighted Thresholding Algorithm (SAITA) for [Formula: see text]-Regularization Using the Multiple Sub-Dictionary Representation

Both [Formula: see text] and [Formula: see text] are two typical non-convex regularizations of [Formula: see text] ([Formula: see text]), which can be employed to obtain a sparser solution than the [Formula: see text] regularization. Recently, the multiple-state sparse transformation strategy has be...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Yunyi, Zhang, Jie, Fan, Shangang, Yang, Jie, Xiong, Jian, Cheng, Xiefeng, Sari, Hikmet, Adachi, Fumiyuki, Gui, Guan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2017
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5751088/
https://www.ncbi.nlm.nih.gov/pubmed/29244777
http://dx.doi.org/10.3390/s17122920

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5751088/
https://www.ncbi.nlm.nih.gov/pubmed/29244777
http://dx.doi.org/10.3390/s17122920

Ejemplares similares