Dynamical Sparse Recovery with Finite-time ...
Document type :
Compte-rendu et recension critique d'ouvrage
DOI :
Title :
Dynamical Sparse Recovery with Finite-time Convergence
Author(s) :
Yu, Lei [Auteur]
Wuhan University [China]
Zheng, Gang [Auteur]
Deformable Robots Simulation Team [DEFROST ]
Barbot, Jean-Pierre [Auteur]
Laboratoire QUARTZ [QUARTZ ]
Wuhan University [China]
Zheng, Gang [Auteur]
Deformable Robots Simulation Team [DEFROST ]
Barbot, Jean-Pierre [Auteur]
Laboratoire QUARTZ [QUARTZ ]
Journal title :
IEEE Transactions on Signal Processing
Pages :
6146-6157
Publisher :
Institute of Electrical and Electronics Engineers
Publication date :
2017-08-09
ISSN :
1053-587X
English keyword(s) :
Sparse Recovery
ℓ1-minimization
Dynamical System
Finite-time Convergence
ℓ1-minimization
Dynamical System
Finite-time Convergence
HAL domain(s) :
Informatique [cs]/Traitement du signal et de l'image [eess.SP]
English abstract : [en]
Even though Sparse Recovery (SR) has been successfully applied in a wide range of research communities, there still exists a barrier to real applications because of the inefficiency of the state-of-the-art algorithms. In ...
Show more >Even though Sparse Recovery (SR) has been successfully applied in a wide range of research communities, there still exists a barrier to real applications because of the inefficiency of the state-of-the-art algorithms. In this paper, we propose a dynamical approach to SR which is highly efficient and with finite-time convergence property. Firstly, instead of solving the ℓ1 regularized optimization programs that requires exhausting iterations, which is computer-oriented, the solution to SR problem in this work is resolved through the evolution of a continuous dynamical system which can be realized by analog circuits. Moreover, the proposed dynamical system is proved to have the finite-time convergence property, and thus more efficient than LCA (the recently developed dynamical system to solve SR) with exponential convergence property. Consequently, our proposed dynamical system is more appropriate than LCA to deal with the time-varying situations. Simulations are carried out to demonstrate the superior properties of our proposed system.Show less >
Show more >Even though Sparse Recovery (SR) has been successfully applied in a wide range of research communities, there still exists a barrier to real applications because of the inefficiency of the state-of-the-art algorithms. In this paper, we propose a dynamical approach to SR which is highly efficient and with finite-time convergence property. Firstly, instead of solving the ℓ1 regularized optimization programs that requires exhausting iterations, which is computer-oriented, the solution to SR problem in this work is resolved through the evolution of a continuous dynamical system which can be realized by analog circuits. Moreover, the proposed dynamical system is proved to have the finite-time convergence property, and thus more efficient than LCA (the recently developed dynamical system to solve SR) with exponential convergence property. Consequently, our proposed dynamical system is more appropriate than LCA to deal with the time-varying situations. Simulations are carried out to demonstrate the superior properties of our proposed system.Show less >
Language :
Anglais
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-01649419/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01649419/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01649419/document
- Open access
- Access the document
- document
- Open access
- Access the document
- dynamic_sparse_recovery_finite_time_V8.pdf
- Open access
- Access the document
- dynamic_sparse_recovery_finite_time_V8.pdf
- Open access
- Access the document