Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Projection-based and look ahead strategies for atom selection
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0003-2638-6047
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-7926-5081
2012 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 60, no 2, 634-647 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, we improve iterative greedy search algorithms in which atoms are selected serially over iterations, i.e., one-by-one over iterations. For serial atom selection, we devise two new schemes to select an atom from a set of potential atoms in each iteration. The two new schemes lead to two new algorithms. For both the algorithms, in each iteration, the set of potential atoms is found using a standard matched filter. In case of the first scheme, we propose an orthogonal projection strategy that selects an atom from the set of potential atoms. Then, for the second scheme, we propose a look-ahead strategy such that the selection of an atom in the current iteration has an effect on the future iterations. The use of look-ahead strategy requires a higher computational resource. To achieve a tradeoff between performance and complexity, we use the two new schemes in cascade and develop a third new algorithm. Through experimental evaluations, we compare the proposed algorithms with existing greedy search and convex relaxation algorithms.

Place, publisher, year, edition, pages
IEEE , 2012. Vol. 60, no 2, 634-647 p.
Keyword [en]
Sparsity, Compressive sensing, Estimation
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-46514DOI: 10.1109/TSP.2011.2173682ISI: 000299434300008Scopus ID: 2-s2.0-84855955910OAI: oai:DiVA.org:kth-46514DiVA: diva2:453822
Funder
ICT - The Next Generation
Note
QC 20120227Available from: 2011-11-09 Created: 2011-11-03 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

fulltext(415 kB)264 downloads
File information
File name FULLTEXT01.pdfFile size 415 kBChecksum SHA-512
45fe8d25b79d915c04525259ac982eeb600ad5275788627fc06cfea8bd013f7f41bf9498fe2cfa02c5cb5fc0bcb5a9f88ed5b23958be79856cf36cbf9d34db70
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Chatterjee, SaikatSundman, DennisVehkaperä, MikkoSkolglund, Mikael
By organisation
Communication Theory
In the same journal
IEEE Transactions on Signal Processing
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 264 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
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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