Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Generalized fusion algorithm for compressive sampling reconstruction and RIP-based analysis
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0003-2638-6047
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
2017 (English)In: Signal Processing, ISSN 0165-1684, E-ISSN 1872-7557, Vol. 139, 36-48 p.Article in journal (Refereed) Published
Abstract [en]

We design a Generalized Fusion Algorithm for Compressive Sampling (gFACS) reconstruction. In the gFACS algorithm, several individual compressive sampling (CS) reconstruction algorithms participate to achieve a better performance than the individual algorithms. The gFACS algorithm is iterative in nature and its convergence is proved under certain conditions using Restricted Isometry Property (RIP) based theoretical analysis. The theoretical analysis allows for the participation of any off-the-shelf or new CS reconstruction algorithm with simple modifications, and still guarantees convergence. We show modifications of some well-known CS reconstruction algorithms for their seamless use in the gFACS algorithm. Simulation results show that the proposed gFACS algorithm indeed provides better performance than the participating individual algorithms.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2017. Vol. 139, 36-48 p.
Keyword [en]
Compressive sampling, Greedy algorithm, RIP analysis, Fusion strategy
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-208710DOI: 10.1016/j.sigpro.2017.03.021ISI: 000402214200004Scopus ID: 2-s2.0-85017439915OAI: oai:DiVA.org:kth-208710DiVA: diva2:1108470
Note

QC 2017-06-12

Available from: 2017-06-12 Created: 2017-06-12 Last updated: 2017-06-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Chatterjee, SaikatRasmussen, Lars Kildehöj

Search in DiVA

By author/editor
Chatterjee, SaikatRasmussen, Lars Kildehöj
By organisation
Communication TheoryACCESS Linnaeus CentreSignal Processing
In the same journal
Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 308 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf