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
FROGS: A serial reversible greedy search algorithm
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-2638-6047
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2012 (English)In: 2012 Swedish Communication Technologies Workshop, Swe-CTW 2012, IEEE , 2012, 40-45 p.Conference paper, Published paper (Refereed)
Abstract [en]

For compressed sensing, in the framework of greedy search reconstruction algorithms, we introduce the notion of initial support-set. The initial support-set is an estimate given to a reconstruction algorithm to improve the performance of the reconstruction. Furthermore, we classify existing greedy search algorithms as being serial or parallel. Based on this classification and the goal of robustness to errors in the initial support-sets we develop a new greedy search algorithm called FROGS. We end the paper with careful numerical experiments concluding that FROGS perform well compared to existing algorithms (both in terms of performance and execution time) and that it is robust against errors in the initial support-set.

Place, publisher, year, edition, pages
IEEE , 2012. 40-45 p.
Keyword [en]
Compressed sensing, greedy search, greedy pursuit, initial support
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-104239DOI: 10.1109/Swe-CTW.2012.6376286Scopus ID: 2-s2.0-84871871730ISBN: 978-146734763-1 (print)OAI: oai:DiVA.org:kth-104239DiVA: diva2:563624
Conference
2012 Swedish Communication Technologies Workshop (Swe-CTW 2012). 24-26 October 2012, Lund, Sweden
Funder
VinnovaICT - The Next Generation
Note

QC 20121108

Available from: 2012-11-08 Created: 2012-10-30 Last updated: 2013-04-15Bibliographically approved

Open Access in DiVA

fulltext(143 kB)298 downloads
File information
File name FULLTEXT01.pdfFile size 143 kBChecksum SHA-512
14e0d30a0bef8e06859841fa301a914a4fbcaee07961abee4adb082d1ec0e378f1ed76a414f8b1862969f50cffc91dc012267a2bcb6d01e95bf2bcb99ca9def8
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Chatterjee, SaikatSkoglund, Mikael

Search in DiVA

By author/editor
Sundman, DennisChatterjee, SaikatSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 298 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 128 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