Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/17566
ชื่อเรื่อง: Iterative Hard Thresholding with Nonzero Index Initialization
ผู้แต่ง: Tausiesakul B.
Keywords: Gradient methods
Mean square error
Compressed-Sensing
Compressive sensing
Gradient-descent
Iterative hard thresholding
Local minimums
Nonlinear search
Objective functions
Signal acquisitions
Sparsity patterns
Thresholding algorithms
Compressed sensing
วันที่เผยแพร่: 2021
บทคัดย่อ: Several methods for signal acquisition in compressed sensing were proposed in the past. Iterative hard thresholding (IHT) algorithm and its variants can be considered as a kind of those methods based on gradient descent. Unfortunately, when the objective function has many local minima, the steepest descent typically suffers from being misled into attaining those local minima. One way to facilitate the nonlinear search to be close to the global solution is the preparation for good initialization. In this work, a nonzero index according to signal sparsity is applied as the initial value for the IHT algorithms, instead of all zeros as in the former works. Numerical examples illustrate that the nonzero index initialization can provide lower normalized root-mean-square error of the acquired signal than the conventional all-zeros initialization, especially for numerous nonzero elements in the signal. © 2021 IEEE.
URI: https://ir.swu.ac.th/jspui/handle/123456789/17566
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85119419643&doi=10.1109%2fSTCR51658.2021.9589000&partnerID=40&md5=97350a68b38921cda4cced29c6d1e95c
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.