SOSP: a stepwise optimal sparsity pursuit algorithm for practical compressed sensing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Guo, Huijuan | - |
dc.contributor.author | Han, Suqing | - |
dc.contributor.author | Hao, Fei | - |
dc.contributor.author | Park, Doo-Soon | - |
dc.contributor.author | Min, Geyong | - |
dc.date.accessioned | 2021-08-11T10:23:58Z | - |
dc.date.available | 2021-08-11T10:23:58Z | - |
dc.date.issued | 2019-01 | - |
dc.identifier.issn | 1380-7501 | - |
dc.identifier.issn | 1573-7721 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/4809 | - |
dc.description.abstract | Compressed Sensing (CS), as a promising paradigm for acquiring signals, is playing an increasing important role in many real-world applications. One of the major components of CS is sparse signal recovery in which greedy algorithm is well-known for its speed and performance. Unfortunately, in many classic greedy algorithms, such as OMP and CoSaMP, the real sparsity is a key prior information, but it is blind. In another words, the true sparsity is not available for many practical applications. Due to this disadvantage, the performance of these algorithms are significantly reduced. In order to avoid too much dependence of classic greedy algorithms on the true sparsity, this paper proposed an efficient reconstruction greedy algorithm for practical Compressed Sensing, termed stepwise optimal sparsity pursuit (SOSP). Differs from the existing algorithms, the unique feature of SOSP algorithm is that the assumption of sparsity is needed instead of the true sparsity. Hence, the limitations of sparsity in practical application can be tackled. Based on an arbitrary initial sparsity satisfying certain conditions, the SOSP algorithm employs two variable step sizes to hunt for the optimal sparsity step by step by comparing the final reconstruction residues. Since the proposed SOSP algorithm preserves the ideas of original algorithms and innovates the prior information of sparsity, thus it is applicable to any effective algorithm requiring known sparsity. Extensive experiments are conducted in order to demonstrate that the SOSP algorithm offers a superior reconstruction performance in terms of discarding the true sparsity. | - |
dc.format.extent | 24 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Nature | - |
dc.title | SOSP: a stepwise optimal sparsity pursuit algorithm for practical compressed sensing | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1007/s11042-017-4920-6 | - |
dc.identifier.scopusid | 2-s2.0-85021725377 | - |
dc.identifier.wosid | 000457317500002 | - |
dc.identifier.bibliographicCitation | Multimedia Tools and Applications, v.78, no.1, pp 3 - 26 | - |
dc.citation.title | Multimedia Tools and Applications | - |
dc.citation.volume | 78 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 3 | - |
dc.citation.endPage | 26 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | SIGNAL RECOVERY | - |
dc.subject.keywordPlus | RECONSTRUCTION | - |
dc.subject.keywordAuthor | Compressed sensing | - |
dc.subject.keywordAuthor | Sparsity pursuit | - |
dc.subject.keywordAuthor | Estimated sparsity | - |
dc.subject.keywordAuthor | Reconstruction | - |
dc.subject.keywordAuthor | Greedy algorithm | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.