Abstract
There is growing interest in solving linear L1 estimation problems for sparsity of the solution and robustness against non-Gaussian noise. This paper proposes a discrete-time neural network which can calculate large linear L1 estimation problems fast. The proposed neural network has a fixed computational step length and is proved to be globally convergent to an optimal solution. Then, the proposed neural network is efficiently applied to image restoration. Numerical results show that the proposed neural network is not only efficient in solving degenerate problems resulting from the nonunique solutions of the linear L1 estimation problems but also needs much less computational time than the related algorithms in solving both linear L1 estimation and image restoration problems.
| Original language | English |
|---|---|
| Pages (from-to) | 812-820 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Neural Networks and Learning Systems |
| Volume | 23 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2012 |
Keywords
- Discrete-time neural network
- convergence (telecommunication)
- discrete time systems
- estimation theory
- global convergence
- image restoration
- neural networks (computer science)
- parameter estimation
Fingerprint
Dive into the research topics of 'Discrete-time neural network for fast solving large linear L1 estimation problems and its application to image restoration'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver