Sparse Signal Recovery via Tree Search Matching Pursuit
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Jaeseok | - |
dc.contributor.author | Choi, Jun Won | - |
dc.contributor.author | Shim, Byonghyo | - |
dc.date.accessioned | 2022-07-15T05:35:04Z | - |
dc.date.available | 2022-07-15T05:35:04Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2016-10 | - |
dc.identifier.issn | 1229-2370 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/153844 | - |
dc.description.abstract | Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a tree search based sparse signal recovery algorithm referred to as the tree search matching pursuit (TSMP). Two key ingredients of the proposed TSMP algorithm to control the computational complexity are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In numerical simulations of Internet of Things (IoT) environments, it is shown that TSMP outperforms conventional schemes by a large margin. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | KOREAN INST COMMUNICATIONS SCIENCES (K I C S) | - |
dc.title | Sparse Signal Recovery via Tree Search Matching Pursuit | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, Jun Won | - |
dc.identifier.doi | 10.1109/JCN.2016.000100 | - |
dc.identifier.scopusid | 2-s2.0-85011965752 | - |
dc.identifier.wosid | 000388681600003 | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMMUNICATIONS AND NETWORKS, v.18, no.5, pp.699 - 712 | - |
dc.relation.isPartOf | JOURNAL OF COMMUNICATIONS AND NETWORKS | - |
dc.citation.title | JOURNAL OF COMMUNICATIONS AND NETWORKS | - |
dc.citation.volume | 18 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 699 | - |
dc.citation.endPage | 712 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.identifier.kciid | ART002162872 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.description.journalRegisteredClass | kci | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordAuthor | Compressive sensing | - |
dc.subject.keywordAuthor | greedy algorithm | - |
dc.subject.keywordAuthor | sparse recovery | - |
dc.subject.keywordAuthor | tree pruning | - |
dc.subject.keywordAuthor | tree search | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.