Please use this identifier to cite or link to this item:
https://ir.swu.ac.th/jspui/handle/123456789/27378
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tausiesakul B. | |
dc.date.accessioned | 2022-12-14T03:17:15Z | - |
dc.date.available | 2022-12-14T03:17:15Z | - |
dc.date.issued | 2022 | |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85138166607&doi=10.23919%2fSpliTech55088.2022.9854267&partnerID=40&md5=8f5e1d795c01658933d97114031d568d | |
dc.identifier.uri | https://ir.swu.ac.th/jspui/handle/123456789/27378 | - |
dc.description.abstract | The acquisition of a discrete-time signal is an im-portant part of a compressive sensing problem. A fine algorithm that could bring better signal recovery performance is often called for. In this work, two homotopy algorithms that involve a soft thresholding decision are proposed using the Moore-Penrose inverse. The additional complexity required in the two proposed methods is relatively minimal, since the necessary matrix inverse (AA T) -1 and the matrix multiplication $A$ T (AA T) -1 can be done before the iteration starts, where $^{\top}$ is the transpose. Numerical examples illustrate the improved error performance for different values of the shrinking parameter $\gamma$. It is found that the greater the shrinking parameter, the less the signal recovery error one could obtain from the two new approaches. © 2022 University of Split, FESB. | |
dc.language | en | |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
dc.subject | Compressive sensing | |
dc.subject | homotopy algorithm | |
dc.subject | soft thresholding | |
dc.title | Soft Homotopy via Moore-Penrose Inverse | |
dc.type | Article | |
dc.rights.holder | Scopus | |
dc.identifier.bibliograpycitation | ACS Omega. Vol 7, No.18 (2022), p.16116-16126 | |
dc.identifier.doi | 10.23919/SpliTech55088.2022.9854267 | |
Appears in Collections: | Scopus 2022 |
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.