Show simple item record

dc.contributor.authorKose, K.en_US
dc.contributor.authorGunay, O.en_US
dc.contributor.authorCetin, A. E.en_US
dc.date.accessioned2015-07-28T12:03:54Z
dc.date.available2015-07-28T12:03:54Z
dc.date.issued2014-01en_US
dc.identifier.issn1051-2004
dc.identifier.urihttp://hdl.handle.net/11693/12922
dc.description.abstractIn most compressive sensing problems, 1 norm is used during the signal reconstruction process. In this article, a modified version of the entropy functional is proposed to approximate the 1 norm. The proposed modified version of the entropy functional is continuous, differentiable and convex. Therefore, it is possible to construct globally convergent iterative algorithms using Bregman’s row-action method for compressive sensing applications. Simulation examples with both 1D signals and images are presented. © 2013 Elsevier Inc. All rights reserved.en_US
dc.language.isoEnglishen_US
dc.source.titleCompressive sensingen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.dsp.2013.09.010en_US
dc.subjectModified entropy functionalen_US
dc.subjectProjection onto convex setsen_US
dc.subjectIterative row-action methodsen_US
dc.subjectBregman-projectionen_US
dc.subjectProximal splittingen_US
dc.titleCompressive sensing using the modified entropy functionalen_US
dc.typeArticleen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage63en_US
dc.citation.epage70en_US
dc.citation.volumeNumber24en_US
dc.identifier.doi10.1016/j.dsp.2013.09.010en_US
dc.publisherAcademic Pressen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record