Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Projection-based and look ahead strategies for atom selection
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.ORCID-id: 0000-0003-2638-6047
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.ORCID-id: 0000-0002-7926-5081
2012 (engelsk)Inngår i: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 60, nr 2, s. 634-647Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
IEEE , 2012. Vol. 60, nr 2, s. 634-647
Emneord [en]
Sparsity, Compressive sensing, Estimation
HSV kategori
Forskningsprogram
SRA - Informations- och kommunikationsteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-46514DOI: 10.1109/TSP.2011.2173682ISI: 000299434300008Scopus ID: 2-s2.0-84855955910OAI: oai:DiVA.org:kth-46514DiVA, id: diva2:453822
Forskningsfinansiär
ICT - The Next Generation
Merknad
QC 20120227Tilgjengelig fra: 2011-11-09 Laget: 2011-11-03 Sist oppdatert: 2017-12-08bibliografisk kontrollert

Open Access i DiVA

fulltext(415 kB)333 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 415 kBChecksum SHA-512
45fe8d25b79d915c04525259ac982eeb600ad5275788627fc06cfea8bd013f7f41bf9498fe2cfa02c5cb5fc0bcb5a9f88ed5b23958be79856cf36cbf9d34db70
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Chatterjee, SaikatSkolglund, Mikael

Søk i DiVA

Av forfatter/redaktør
Chatterjee, SaikatSundman, DennisVehkaperä, MikkoSkolglund, Mikael
Av organisasjonen
I samme tidsskrift
IEEE Transactions on Signal Processing

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 333 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 296 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf