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
Universal algorithm for compressive sampling
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-2638-6047
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
2015 (English)In: 2015 23rd European Signal Processing Conference, EUSIPCO 2015, Institute of Electrical and Electronics Engineers (IEEE), 2015, 689-693 p.Conference paper, Published paper (Refereed)
Resource type
Text
Abstract [en]

In a standard compressive sampling (CS) setup, we develop a universal algorithm where multiple CS reconstruction algorithms participate and their outputs are fused to achieve a better reconstruction performance. The new method is called universal algorithm for CS (UACS) that is iterative in nature and has a restricted isometry property (RIP) based theoretical convergence guarantee. It is shown that if one participating algorithm in the design has a converging recurrence inequality relation then the UACS also holds a converging recurrence inequality relation over iterations. An example of the UACS is presented and studied through simulations for demonstrating its flexibility and performance improvement.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2015. 689-693 p.
Keyword [en]
Compressive sampling, greedy algorithms, iterative fusion, restricted isometry property, Compressed sensing, Iterative methods, Matrix algebra, Signal processing, Reconstruction algorithms, Restricted isometry properties, Restricted isometry properties (RIP), Universal algorithm, Algorithms
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-186793DOI: 10.1109/EUSIPCO.2015.7362471ISI: 000377943800139Scopus ID: 2-s2.0-84963961479ISBN: 9780992862633 (print)OAI: oai:DiVA.org:kth-186793DiVA: diva2:938612
Conference
23rd European Signal Processing Conference, EUSIPCO 2015, 31 August 2015 through 4 September 2015
Note

QC 20160617

Available from: 2016-06-17 Created: 2016-05-13 Last updated: 2016-07-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusConference website

Search in DiVA

By author/editor
Zaki, AhmedChatterjee, SaikatRasmussen, Lars K.
By organisation
ACCESS Linnaeus Centre
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 23 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