Please use this identifier to cite or link to this item:
https://ir.swu.ac.th/jspui/handle/123456789/27377
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-85137782224&doi=10.1109%2fCIVEMSA53371.2022.9853651&partnerID=40&md5=c042dcc231a0a9ac24b530091e62b551 | |
dc.identifier.uri | https://ir.swu.ac.th/jspui/handle/123456789/27377 | - |
dc.description.abstract | The acquisition of a discrete-time signal is an important 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⊺)-1 and the matrix multiplication A⊺(AA⊺)-1 can be done before the iteration starts, where ·⊺ is the transpose. Numerical examples illustrate the improved error performance for different values of the shrinking parameter γ. It is found that the greater the shrinking parameter, the less the signal recovery error one could obtain from the two new approaches. © 2022 IEEE. | |
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 through Moore-Penrose Inverse | |
dc.type | Article | |
dc.rights.holder | Scopus | |
dc.identifier.bibliograpycitation | Carbohydrate Polymers. Vol 297, No. (2022), p.- | |
dc.identifier.doi | 10.1109/CIVEMSA53371.2022.9853651 | |
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.