Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/81440
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNarayanan, Sathiyaen
dc.contributor.authorSahoo, Sujit Kumaren
dc.contributor.authorMakur, Anamitraen
dc.date.accessioned2019-11-11T05:29:03Zen
dc.date.accessioned2019-12-06T14:31:01Z-
dc.date.available2019-11-11T05:29:03Zen
dc.date.available2019-12-06T14:31:01Z-
dc.date.issued2018en
dc.identifier.citationNarayanan, S., Sahoo, S. K., & Makur, A. (2018). Greedy pursuits based gradual weighting strategy for weightedℓ1-minimization. 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). doi:10.1109/ICASSP.2018.8462645en
dc.identifier.urihttps://hdl.handle.net/10356/81440-
dc.identifier.urihttp://hdl.handle.net/10220/50384en
dc.description.abstractIn Compressive Sensing (CS) of sparse signals, standard ℓ 1 -minimization can be effectively replaced with Weighted ℓ 1 -minimization (Wℓ 1 ) if some information about the signal or its sparsity pattern is available. If no such information is available, Re-Weighted ℓ 1 -minimization (ReWℓ 1 ) can be deployed. ReW ℓ 1 solves a series of Wℓ 1 problems, and therefore, its computational complexity is high. An alternative to ReWℓ 1 is the Greedy Pursuits Assisted Basis Pursuit (GPABP) which employs multiple Greedy Pursuits (GPs) to obtain signal information which in turn is used to run Wℓ 1 . Although GPABP is an effective fusion technique, it adapts a binary weighting strategy for running Wℓ 1 , which is very restrictive. In this article, we propose a gradual weighting strategy for Wℓ 1 , which handles the signal estimates resulting from multiple GPs more effectively compared to the binary weighting strategy of GPABP. The resulting algorithm is termed as Greedy Pursuits assisted Weighted ℓ 1 -minimization (GP-Wℓ 1 ). For GP-Wℓ 1 , we derive the theoretical upper bound on its reconstruction error. Through simulation results, we show that the proposed GP-Wℓ 1 outperforms ReWℓ 1 and the state-of-the-art GPABP.en
dc.format.extent5 p.en
dc.language.isoenen
dc.rights© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/ICASSP.2018.8462645en
dc.subjectWeighted ℓ1-minimizationen
dc.subjectGreedy Pursuits Assisted Basis Pursuiten
dc.subjectEngineering::Electrical and electronic engineeringen
dc.titleGreedy pursuits based gradual weighting strategy for weighted ℓ1-minimizationen
dc.typeConference Paperen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.contributor.conference2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)en
dc.identifier.doi10.1109/ICASSP.2018.8462645en
dc.description.versionAccepted versionen
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:EEE Conference Papers
Files in This Item:
File Description SizeFormat 
Greedy pursuits based gradual weighting strategy for weighted l(1)-minimization.pdf276.28 kBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.