Greedy recovery of sparse signals with dynamically varying support
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, Sun Hong | - |
dc.contributor.author | Yoo, Jin Hyeok | - |
dc.contributor.author | Kim, Sun woo | - |
dc.contributor.author | Choi, Jun Won | - |
dc.date.accessioned | 2021-07-30T05:31:32Z | - |
dc.date.available | 2021-07-30T05:31:32Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2018-11 | - |
dc.identifier.issn | 2219-5491 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/5253 | - |
dc.description.abstract | In this paper, we propose a low-complexity greedy recovery algorithm which can recover sparse signals with time-varying support. We consider the scenario where the support of the signal (i.e., the indices of nonzero elements) varies smoothly with certain temporal correlation. We model the indices of support as discrete-state Markov random process. Then, we formulate the signal recovery problem as joint estimation of the set of the support indices and the amplitude of nonzero entries based on the multiple measurement vectors. We successively identify the element of the support based on the maximum a posteriori (MAP) criteria and subtract the reconstructed signal component for detection of the next element of the support. Our numerical evaluation shows that the proposed algorithm achieves satisfactory recovery performance at low computational complexity. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | European Signal Processing Conference, EUSIPCO | - |
dc.title | Greedy recovery of sparse signals with dynamically varying support | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sun woo | - |
dc.contributor.affiliatedAuthor | Choi, Jun Won | - |
dc.identifier.doi | 10.23919/EUSIPCO.2018.8553450 | - |
dc.identifier.scopusid | 2-s2.0-85059816819 | - |
dc.identifier.bibliographicCitation | European Signal Processing Conference, v.2018, no.09, pp.578 - 582 | - |
dc.relation.isPartOf | European Signal Processing Conference | - |
dc.citation.title | European Signal Processing Conference | - |
dc.citation.volume | 2018 | - |
dc.citation.number | 09 | - |
dc.citation.startPage | 578 | - |
dc.citation.endPage | 582 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Computational complexity | - |
dc.subject.keywordPlus | Random processes | - |
dc.subject.keywordPlus | Recovery | - |
dc.subject.keywordPlus | Joint estimation | - |
dc.subject.keywordPlus | Low computational complexity | - |
dc.subject.keywordPlus | Maximum a posteriori | - |
dc.subject.keywordPlus | Multiple measurement vectors | - |
dc.subject.keywordPlus | Recovery algorithms | - |
dc.subject.keywordPlus | Recovery performance | - |
dc.subject.keywordPlus | Signal components | - |
dc.subject.keywordPlus | Temporal correlations | - |
dc.subject.keywordPlus | Signal reconstruction | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8553450 | - |
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.