General design algorithm for sparse frame expansions

Signal expansions using frames may be considered as generalizations of signal representations based on transforms and filter banks. Frames, or dictionaries, for sparse signal representations may be designed using an iterative algorithm with two main steps: (1) Frame vector selection and expansion co...

Full description

Saved in:
Bibliographic Details
Published inSignal processing Vol. 86; no. 1; pp. 117 - 126
Main Authors Skretting, Karl, Husøy, John Håkon, Aase, Sven Ole
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 2006
Elsevier Science
Subjects
Online AccessGet full text
ISSN0165-1684
1872-7557
DOI10.1016/j.sigpro.2005.04.013

Cover

Abstract Signal expansions using frames may be considered as generalizations of signal representations based on transforms and filter banks. Frames, or dictionaries, for sparse signal representations may be designed using an iterative algorithm with two main steps: (1) Frame vector selection and expansion coefficient determination for signals in a training set, selected to be representative of the signals for which compact representations are desired, using the frame designed in the previous iteration. (2) Update of frame vectors with the objective of improving the representation of step (1). This method for frame design was used by [Engan et al., Signal Processing 80 (2000) 2121–2140] for block-oriented signal expansions, i.e. generalizations of block-oriented transforms and by [Aase et al., IEEE Trans. Signal Process. 49(5) (2001) 1087–1096] for non-block-oriented frames—for short overlapping frames, that may be viewed as generalizations of critically sampled filter banks. Here we give the solution to the general frame design problem using the compact notation of linear algebra. This makes the solution both conceptually and computationally easier, especially for the overlapping frame case. Also, the solution is more general than those presented earlier, facilitating the imposition of constraints, such as symmetry, on the designed frame vectors.
AbstractList Signal expansions using frames may be considered as generalizations of signal representations based on transforms and filter banks. Frames, or dictionaries, for sparse signal representations may be designed using an iterative algorithm with two main steps: (1) Frame vector selection and expansion coefficient determination for signals in a training set, selected to be representative of the signals for which compact representations are desired, using the frame designed in the previous iteration. (2) Update of frame vectors with the objective of improving the representation of step (1). This method for frame design was used by [Engan et al., Signal Processing 80 (2000) 2121–2140] for block-oriented signal expansions, i.e. generalizations of block-oriented transforms and by [Aase et al., IEEE Trans. Signal Process. 49(5) (2001) 1087–1096] for non-block-oriented frames—for short overlapping frames, that may be viewed as generalizations of critically sampled filter banks. Here we give the solution to the general frame design problem using the compact notation of linear algebra. This makes the solution both conceptually and computationally easier, especially for the overlapping frame case. Also, the solution is more general than those presented earlier, facilitating the imposition of constraints, such as symmetry, on the designed frame vectors.
Author Husøy, John Håkon
Aase, Sven Ole
Skretting, Karl
Author_xml – sequence: 1
  givenname: Karl
  surname: Skretting
  fullname: Skretting, Karl
  email: karl.skretting@uis.no
– sequence: 2
  givenname: John Håkon
  surname: Husøy
  fullname: Husøy, John Håkon
  email: john.h.husoy@uis.no
– sequence: 3
  givenname: Sven Ole
  surname: Aase
  fullname: Aase, Sven Ole
  email: sven.o.aase@uis.no
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17309531$$DView record in Pascal Francis
BookMark eNqFkEFLxDAQhYOs4O7qP_DQi8fWSZsmrQdBFl2FBS96DtN0umbppiUpov_eLCsIHvQ0l-895n0LNnODI8YuOWQcuLzeZcFuRz9kOUCZgciAFydsziuVp6os1YzNI1amXFbijC1C2AFERMKciTU58tgnLcUOl2C_Hbyd3vZJN_gkjOgDJZ3HPSX0MaILdnDhnJ122Ae6-L5L9vpw_7J6TDfP66fV3SY1RSGnVHQKCJsSZY2GUFaqKwXUDYicZAOm4rWS0DSNqdpaVWQKLvO8brESXVVLWSzZ1bF3xGCwj284Y4Mevd2j_9RcFVCXBY-cOHLGDyF46n4Q0AdDeqePhvTBkAah4_wYu_kVM3bCKS6cPNr-v_DtMUxRwLslr4Ox5Ay11pOZdDvYvwu-ABNChkg
CODEN SPRODR
CitedBy_id crossref_primary_10_1109_LSP_2013_2288788
crossref_primary_10_1016_j_dsp_2006_02_002
crossref_primary_10_1109_TIP_2015_2458175
crossref_primary_10_1109_TSP_2012_2183129
crossref_primary_10_3934_ipi_2011_5_815
crossref_primary_10_1109_TSP_2010_2040671
crossref_primary_10_1016_j_dsp_2019_102654
crossref_primary_10_1109_TSP_2008_928160
crossref_primary_10_1016_j_sigpro_2013_12_004
crossref_primary_10_1109_TIP_2015_2495260
Cites_doi 10.1109/78.258082
10.1109/78.905866
10.1137/1031129
10.1109/76.554423
10.1109/IAI.2000.839600
10.1109/ICIP.1995.529037
10.1090/S0002-9947-1952-0047179-6
10.1109/29.17536
10.1109/78.735301
10.1109/ICASSP.1998.681826
10.1109/76.795050
10.1109/82.633439
10.1109/ICASSP.1998.681706
10.1016/S0165-1684(00)00072-4
10.1049/ip-vis:19990445
10.1162/089976600300015826
10.1109/ICIP.1998.723617
10.1109/83.913587
10.1109/18.57199
10.1109/78.917811
10.1109/ICIP.1994.413410
10.1137/S0097539792240406
10.1109/76.867927
10.1016/S0042-6989(97)00169-7
10.1109/76.554427
10.1109/78.668788
10.1109/78.917803
ContentType Journal Article
Copyright 2005 Elsevier B.V.
2006 INIST-CNRS
Copyright_xml – notice: 2005 Elsevier B.V.
– notice: 2006 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1016/j.sigpro.2005.04.013
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EISSN 1872-7557
EndPage 126
ExternalDocumentID 17309531
10_1016_j_sigpro_2005_04_013
S0165168405001489
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1~.
1~5
4.4
457
4G.
53G
5VS
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABFNM
ABFRF
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEFWE
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F0J
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
LG9
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TAE
TN5
WUQ
XPP
ZMT
~02
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
ID FETCH-LOGICAL-c336t-4f70eab5a69acea687f5409b042e6b0c819760bbbc8d978ec316229da84f89663
IEDL.DBID AIKHN
ISSN 0165-1684
IngestDate Mon Jul 21 09:15:41 EDT 2025
Thu Apr 24 23:10:09 EDT 2025
Wed Oct 01 01:45:32 EDT 2025
Fri Feb 23 02:28:12 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Dictionary
Frame
Filter banks
Matching pursuit
Frame design
Over-complete
Sparse signal representation
Sparse representation
Filter bank
Signal representation
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c336t-4f70eab5a69acea687f5409b042e6b0c819760bbbc8d978ec316229da84f89663
PageCount 10
ParticipantIDs pascalfrancis_primary_17309531
crossref_primary_10_1016_j_sigpro_2005_04_013
crossref_citationtrail_10_1016_j_sigpro_2005_04_013
elsevier_sciencedirect_doi_10_1016_j_sigpro_2005_04_013
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2006
2006-1-00
PublicationDateYYYYMMDD 2006-01-01
PublicationDate_xml – year: 2006
  text: 2006
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Signal processing
PublicationYear 2006
Publisher Elsevier B.V
Elsevier Science
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science
References Mallat, Zhang (bib3) 1993; 41
Banham, Brailean (bib8) 1997; 7
M. Vetterli, T. Kalker, Matching pursuit for compression and application to motion compensated video coding, in: Proceedings of the IEEE International Conference on Image Processing, ICIP-94, vol. 1, 1994, pp. 725–729.
Malvar, Staelin (bib37) 1989; 37
Vleeschouwer, Macq (bib10) 1999; 9
Neff, Zakhor (bib6) 1997; 7
Berg, Mikhael (bib13) 1997; 44
Natarajan (bib28) 1995; 24
Cvetković, Vetterli (bib33) 1998; 46
Engan, Aase, Husøy (bib1) 2000; 80
K. Engan, Frame based signal representation and compression, Ph.D. Thesis, Norges teknisk-naturvitenskapelige universitet (NTNU)/Høgskolen i Stavanger, available at
Heil, Walnut (bib24) 1989; 31
G. Davis, Adaptive nonlinear approximations, Ph.D. Thesis, New York University, September 1994.
Neff, Zakhor (bib7) 2000; 10
H. Li, I. Wollf, Multiscale matching pursuit for image coding, in: Proceedings of the ISSPA 1999, Brisbane, Australia, 1999, pp. 805–808.
October 2002.
M. Gharavi-Alkhansari, T.S. Huang, A fast orthogonal matching pursuit algorithm, in: Proceedings of the ICASSP ’98, Seattle, USA, 1998, pp. 1389–1392.
M.I. of Technology, The MIT-BIH Arrhythmia Database CD-ROM, second ed., MIT, 1992.
Duffin, Schaeffer (bib23) 1952; 72
M. Gharavi-Alkhansari, A model for entropy coding in matching pursuit, in: Proceedings of the IEEE International Conference on Image Processing, ICIP-98, vol. 1, 1998, pp. 778–782.
Durka, Ircha, Blinowska (bib18) 2001; 49
Trefethen, Bau (bib31) 1997
Daubechies (bib25) 1990; 36
Bölcskei, Hlawatsch, Feichtinger (bib34) 1998; 46
Olshausen, Field (bib21) 1997; 37
1999.
Gribonval (bib19) 2001; 49
Cotter, Adler, Rao, Kreutz-Delgado (bib29) 1999; 146
Lewicki, Sejnowski (bib22) 2000; 12
F. Bergeaud, S. Mallat, Matching pursuit of images, in: Proceedings of the IEEE International Conference on Image Processing, ICIP-95, vol. 1, 1995, pp. 53–56.
K. Skretting, Sparse signal representation using overlapping frames, Ph.D. Thesis, NTNU Trondheim and Høgskolen i Stavanger, available at
September 2000.
C.-L. Huang, S.-H. Hsu, Road sign interpretation using matching pursuit method, in: Proceedings of the 4th IEEE Southwest Symposium on Image Analysis and Interpretation, 2000, pp. 202–206.
Ramstad, Aase, Husøy (bib26) 1995
Gharavi-Alkhansari (bib16) 2001; 10
Vaidyanathan (bib32) 1993
Aase, Husøy, Skretting, Engan (bib2) 2001; 49
B.D. Rao, Signal processing with the sparseness constraint, in: Proceedings of the ICASSP ’98, Seattle, USA, 1998, pp. 1861–1864.
Y.-T. Chou, W.-L. Hwang, C.-L. Huang, Matching pursuit low-bit rate video coding with dictionary optimized by shape-gain vector quantizer, available at
Gersho, Gray (bib27) 1992
Gersho (10.1016/j.sigpro.2005.04.013_bib27) 1992
10.1016/j.sigpro.2005.04.013_bib4
Olshausen (10.1016/j.sigpro.2005.04.013_bib21) 1997; 37
Gribonval (10.1016/j.sigpro.2005.04.013_bib19) 2001; 49
Daubechies (10.1016/j.sigpro.2005.04.013_bib25) 1990; 36
10.1016/j.sigpro.2005.04.013_bib20
Lewicki (10.1016/j.sigpro.2005.04.013_bib22) 2000; 12
10.1016/j.sigpro.2005.04.013_bib5
Berg (10.1016/j.sigpro.2005.04.013_bib13) 1997; 44
Heil (10.1016/j.sigpro.2005.04.013_bib24) 1989; 31
Banham (10.1016/j.sigpro.2005.04.013_bib8) 1997; 7
10.1016/j.sigpro.2005.04.013_bib9
Gharavi-Alkhansari (10.1016/j.sigpro.2005.04.013_bib16) 2001; 10
Trefethen (10.1016/j.sigpro.2005.04.013_bib31) 1997
10.1016/j.sigpro.2005.04.013_bib17
Vleeschouwer (10.1016/j.sigpro.2005.04.013_bib10) 1999; 9
10.1016/j.sigpro.2005.04.013_bib14
Durka (10.1016/j.sigpro.2005.04.013_bib18) 2001; 49
10.1016/j.sigpro.2005.04.013_bib36
10.1016/j.sigpro.2005.04.013_bib15
Neff (10.1016/j.sigpro.2005.04.013_bib6) 1997; 7
Natarajan (10.1016/j.sigpro.2005.04.013_bib28) 1995; 24
Cvetković (10.1016/j.sigpro.2005.04.013_bib33) 1998; 46
Duffin (10.1016/j.sigpro.2005.04.013_bib23) 1952; 72
10.1016/j.sigpro.2005.04.013_bib30
Malvar (10.1016/j.sigpro.2005.04.013_bib37) 1989; 37
Neff (10.1016/j.sigpro.2005.04.013_bib7) 2000; 10
Cotter (10.1016/j.sigpro.2005.04.013_bib29) 1999; 146
Engan (10.1016/j.sigpro.2005.04.013_bib1) 2000; 80
10.1016/j.sigpro.2005.04.013_bib12
10.1016/j.sigpro.2005.04.013_bib35
10.1016/j.sigpro.2005.04.013_bib11
Aase (10.1016/j.sigpro.2005.04.013_bib2) 2001; 49
Vaidyanathan (10.1016/j.sigpro.2005.04.013_bib32) 1993
Ramstad (10.1016/j.sigpro.2005.04.013_bib26) 1995
Mallat (10.1016/j.sigpro.2005.04.013_bib3) 1993; 41
Bölcskei (10.1016/j.sigpro.2005.04.013_bib34) 1998; 46
References_xml – volume: 10
  start-page: 895
  year: 2000
  end-page: 912
  ident: bib7
  article-title: Modulus quantization for matching-pursuit video coding
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
– volume: 44
  start-page: 818
  year: 1997
  end-page: 828
  ident: bib13
  article-title: An efficient structure and algorithm for image representation using nonorthogonal basis images
  publication-title: IEEE Trans. Circuits Syst. II
– reference: October 2002.
– volume: 49
  start-page: 994
  year: 2001
  end-page: 1001
  ident: bib19
  article-title: Fast matching pursuit with a multiscale dictionary of Gaussian chirps
  publication-title: IEEE Trans. Signal Process.
– volume: 24
  start-page: 227
  year: 1995
  end-page: 234
  ident: bib28
  article-title: Sparse approximate solutions to linear systems
  publication-title: SIAM J. Comput.
– volume: 41
  start-page: 3397
  year: 1993
  end-page: 3415
  ident: bib3
  article-title: Matching pursuit with time-frequency dictionaries
  publication-title: IEEE Trans. Signal Process.
– reference: September 2000.
– reference: C.-L. Huang, S.-H. Hsu, Road sign interpretation using matching pursuit method, in: Proceedings of the 4th IEEE Southwest Symposium on Image Analysis and Interpretation, 2000, pp. 202–206.
– reference: M. Gharavi-Alkhansari, A model for entropy coding in matching pursuit, in: Proceedings of the IEEE International Conference on Image Processing, ICIP-98, vol. 1, 1998, pp. 778–782.
– volume: 46
  start-page: 3256
  year: 1998
  end-page: 3268
  ident: bib34
  article-title: Frame-theoretic analysis of oversampled filter banks
  publication-title: IEEE Trans. Signal Process.
– reference: K. Engan, Frame based signal representation and compression, Ph.D. Thesis, Norges teknisk-naturvitenskapelige universitet (NTNU)/Høgskolen i Stavanger, available at
– year: 1992
  ident: bib27
  article-title: Vector Quantization and Signal Compression
– year: 1997
  ident: bib31
  article-title: Numerical Linear Algebra
– volume: 9
  start-page: 984
  year: 1999
  end-page: 993
  ident: bib10
  article-title: Subband dictionaries for low-cost matching pursuits of video residues
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
– volume: 49
  start-page: 507
  year: 2001
  end-page: 510
  ident: bib18
  article-title: Stochastic time-frequency dictionaries for matching pursuit
  publication-title: IEEE Trans. Signal Process.
– volume: 31
  start-page: 628
  year: 1989
  end-page: 666
  ident: bib24
  article-title: Continuous and discrete wavelet transforms
  publication-title: SIAM Rev.
– reference: Y.-T. Chou, W.-L. Hwang, C.-L. Huang, Matching pursuit low-bit rate video coding with dictionary optimized by shape-gain vector quantizer, available at
– reference: M. Gharavi-Alkhansari, T.S. Huang, A fast orthogonal matching pursuit algorithm, in: Proceedings of the ICASSP ’98, Seattle, USA, 1998, pp. 1389–1392.
– volume: 46
  start-page: 1245
  year: 1998
  end-page: 1255
  ident: bib33
  article-title: Oversampled filter banks
  publication-title: IEEE Trans. Signal Process.
– volume: 80
  start-page: 2121
  year: 2000
  end-page: 2140
  ident: bib1
  article-title: Multi-frame compression: theory and design
  publication-title: Signal Processing
– reference: F. Bergeaud, S. Mallat, Matching pursuit of images, in: Proceedings of the IEEE International Conference on Image Processing, ICIP-95, vol. 1, 1995, pp. 53–56.
– volume: 12
  start-page: 337
  year: 2000
  end-page: 365
  ident: bib22
  article-title: Learning overcomplete representations
  publication-title: Neural Computation
– reference: G. Davis, Adaptive nonlinear approximations, Ph.D. Thesis, New York University, September 1994.
– reference: K. Skretting, Sparse signal representation using overlapping frames, Ph.D. Thesis, NTNU Trondheim and Høgskolen i Stavanger, available at
– volume: 37
  start-page: 3311
  year: 1997
  end-page: 3325
  ident: bib21
  article-title: Sparse coding with an overcomplete basis set: a strategy employed in V1
  publication-title: Vision Research
– volume: 7
  start-page: 119
  year: 1997
  end-page: 129
  ident: bib8
  article-title: A selective update approach to matching pursuits video coding
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
– volume: 36
  start-page: 961
  year: 1990
  end-page: 1005
  ident: bib25
  article-title: The wavelet transform, time-frequency localization and signal analysis
  publication-title: IEEE Trans. Inform. Theory
– volume: 146
  start-page: 235
  year: 1999
  end-page: 244
  ident: bib29
  article-title: Forward sequential algorithms for best basis selection
  publication-title: IEE Proc. Vis. Image Signal Process
– reference: M.I. of Technology, The MIT-BIH Arrhythmia Database CD-ROM, second ed., MIT, 1992.
– reference: M. Vetterli, T. Kalker, Matching pursuit for compression and application to motion compensated video coding, in: Proceedings of the IEEE International Conference on Image Processing, ICIP-94, vol. 1, 1994, pp. 725–729.
– year: 1995
  ident: bib26
  article-title: Subband Compression of Images—Principles and Examples
– volume: 37
  start-page: 553
  year: 1989
  end-page: 559
  ident: bib37
  article-title: The LOT: transform coding without blocking effects
  publication-title: IEEE Trans. Acoust. Speech, Signal Process.
– volume: 7
  start-page: 158
  year: 1997
  end-page: 171
  ident: bib6
  article-title: Very low bit-rate video coding based on matching pursuit
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
– reference: H. Li, I. Wollf, Multiscale matching pursuit for image coding, in: Proceedings of the ISSPA 1999, Brisbane, Australia, 1999, pp. 805–808.
– volume: 72
  start-page: 341
  year: 1952
  end-page: 366
  ident: bib23
  article-title: A class of nonharmonic Fourier series
  publication-title: Transactions of the American Mathematical Society
– reference: , 1999.
– reference: B.D. Rao, Signal processing with the sparseness constraint, in: Proceedings of the ICASSP ’98, Seattle, USA, 1998, pp. 1861–1864.
– volume: 10
  start-page: 526
  year: 2001
  end-page: 533
  ident: bib16
  article-title: A fast globally optimal algorithm for template matching using low-resolution pruning
  publication-title: IEEE Trans. Image Process.
– volume: 49
  start-page: 1087
  year: 2001
  end-page: 1096
  ident: bib2
  article-title: Optimized signal expansions for sparse representation
  publication-title: IEEE Trans. Signal Process.
– year: 1993
  ident: bib32
  article-title: Multirate Systems and Filter Banks
– ident: 10.1016/j.sigpro.2005.04.013_bib35
– volume: 41
  start-page: 3397
  issue: 12
  year: 1993
  ident: 10.1016/j.sigpro.2005.04.013_bib3
  article-title: Matching pursuit with time-frequency dictionaries
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.258082
– volume: 49
  start-page: 507
  issue: 3
  year: 2001
  ident: 10.1016/j.sigpro.2005.04.013_bib18
  article-title: Stochastic time-frequency dictionaries for matching pursuit
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.905866
– volume: 31
  start-page: 628
  issue: 4
  year: 1989
  ident: 10.1016/j.sigpro.2005.04.013_bib24
  article-title: Continuous and discrete wavelet transforms
  publication-title: SIAM Rev.
  doi: 10.1137/1031129
– volume: 7
  start-page: 119
  issue: 1
  year: 1997
  ident: 10.1016/j.sigpro.2005.04.013_bib8
  article-title: A selective update approach to matching pursuits video coding
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
  doi: 10.1109/76.554423
– ident: 10.1016/j.sigpro.2005.04.013_bib4
– ident: 10.1016/j.sigpro.2005.04.013_bib20
– ident: 10.1016/j.sigpro.2005.04.013_bib17
  doi: 10.1109/IAI.2000.839600
– ident: 10.1016/j.sigpro.2005.04.013_bib11
  doi: 10.1109/ICIP.1995.529037
– volume: 72
  start-page: 341
  year: 1952
  ident: 10.1016/j.sigpro.2005.04.013_bib23
  article-title: A class of nonharmonic Fourier series
  publication-title: Transactions of the American Mathematical Society
  doi: 10.1090/S0002-9947-1952-0047179-6
– volume: 37
  start-page: 553
  issue: 4
  year: 1989
  ident: 10.1016/j.sigpro.2005.04.013_bib37
  article-title: The LOT: transform coding without blocking effects
  publication-title: IEEE Trans. Acoust. Speech, Signal Process.
  doi: 10.1109/29.17536
– volume: 46
  start-page: 3256
  issue: 12
  year: 1998
  ident: 10.1016/j.sigpro.2005.04.013_bib34
  article-title: Frame-theoretic analysis of oversampled filter banks
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.735301
– ident: 10.1016/j.sigpro.2005.04.013_bib5
  doi: 10.1109/ICASSP.1998.681826
– year: 1997
  ident: 10.1016/j.sigpro.2005.04.013_bib31
– ident: 10.1016/j.sigpro.2005.04.013_bib12
– volume: 9
  start-page: 984
  issue: 7
  year: 1999
  ident: 10.1016/j.sigpro.2005.04.013_bib10
  article-title: Subband dictionaries for low-cost matching pursuits of video residues
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
  doi: 10.1109/76.795050
– volume: 44
  start-page: 818
  issue: 10
  year: 1997
  ident: 10.1016/j.sigpro.2005.04.013_bib13
  article-title: An efficient structure and algorithm for image representation using nonorthogonal basis images
  publication-title: IEEE Trans. Circuits Syst. II
  doi: 10.1109/82.633439
– year: 1992
  ident: 10.1016/j.sigpro.2005.04.013_bib27
– ident: 10.1016/j.sigpro.2005.04.013_bib30
  doi: 10.1109/ICASSP.1998.681706
– volume: 80
  start-page: 2121
  year: 2000
  ident: 10.1016/j.sigpro.2005.04.013_bib1
  article-title: Multi-frame compression: theory and design
  publication-title: Signal Processing
  doi: 10.1016/S0165-1684(00)00072-4
– year: 1993
  ident: 10.1016/j.sigpro.2005.04.013_bib32
– ident: 10.1016/j.sigpro.2005.04.013_bib36
– volume: 146
  start-page: 235
  issue: 5
  year: 1999
  ident: 10.1016/j.sigpro.2005.04.013_bib29
  article-title: Forward sequential algorithms for best basis selection
  publication-title: IEE Proc. Vis. Image Signal Process
  doi: 10.1049/ip-vis:19990445
– year: 1995
  ident: 10.1016/j.sigpro.2005.04.013_bib26
– volume: 12
  start-page: 337
  year: 2000
  ident: 10.1016/j.sigpro.2005.04.013_bib22
  article-title: Learning overcomplete representations
  publication-title: Neural Computation
  doi: 10.1162/089976600300015826
– ident: 10.1016/j.sigpro.2005.04.013_bib14
  doi: 10.1109/ICIP.1998.723617
– volume: 10
  start-page: 526
  issue: 4
  year: 2001
  ident: 10.1016/j.sigpro.2005.04.013_bib16
  article-title: A fast globally optimal algorithm for template matching using low-resolution pruning
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/83.913587
– volume: 36
  start-page: 961
  issue: 5
  year: 1990
  ident: 10.1016/j.sigpro.2005.04.013_bib25
  article-title: The wavelet transform, time-frequency localization and signal analysis
  publication-title: IEEE Trans. Inform. Theory
  doi: 10.1109/18.57199
– volume: 49
  start-page: 1087
  issue: 5
  year: 2001
  ident: 10.1016/j.sigpro.2005.04.013_bib2
  article-title: Optimized signal expansions for sparse representation
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.917811
– ident: 10.1016/j.sigpro.2005.04.013_bib9
  doi: 10.1109/ICIP.1994.413410
– volume: 24
  start-page: 227
  year: 1995
  ident: 10.1016/j.sigpro.2005.04.013_bib28
  article-title: Sparse approximate solutions to linear systems
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539792240406
– volume: 10
  start-page: 895
  issue: 6
  year: 2000
  ident: 10.1016/j.sigpro.2005.04.013_bib7
  article-title: Modulus quantization for matching-pursuit video coding
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
  doi: 10.1109/76.867927
– volume: 37
  start-page: 3311
  year: 1997
  ident: 10.1016/j.sigpro.2005.04.013_bib21
  article-title: Sparse coding with an overcomplete basis set: a strategy employed in V1
  publication-title: Vision Research
  doi: 10.1016/S0042-6989(97)00169-7
– volume: 7
  start-page: 158
  issue: 1
  year: 1997
  ident: 10.1016/j.sigpro.2005.04.013_bib6
  article-title: Very low bit-rate video coding based on matching pursuit
  publication-title: IEEE Trans. Circuits Syst. Video Technol.
  doi: 10.1109/76.554427
– ident: 10.1016/j.sigpro.2005.04.013_bib15
– volume: 46
  start-page: 1245
  issue: 5
  year: 1998
  ident: 10.1016/j.sigpro.2005.04.013_bib33
  article-title: Oversampled filter banks
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.668788
– volume: 49
  start-page: 994
  issue: 5
  year: 2001
  ident: 10.1016/j.sigpro.2005.04.013_bib19
  article-title: Fast matching pursuit with a multiscale dictionary of Gaussian chirps
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.917803
SSID ssj0001360
Score 1.8409367
Snippet Signal expansions using frames may be considered as generalizations of signal representations based on transforms and filter banks. Frames, or dictionaries,...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 117
SubjectTerms Applied sciences
Dictionary
Exact sciences and technology
Filter banks
Frame
Frame design
Information, signal and communications theory
Matching pursuit
Over-complete
Signal and communications theory
Signal representation. Spectral analysis
Signal, noise
Sparse signal representation
Telecommunications and information theory
Title General design algorithm for sparse frame expansions
URI https://dx.doi.org/10.1016/j.sigpro.2005.04.013
Volume 86
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect (Elsevier)
  customDbUrl:
  eissn: 1872-7557
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001360
  issn: 0165-1684
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1872-7557
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001360
  issn: 0165-1684
  databaseCode: ACRLP
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Freedom Collection Journals
  customDbUrl:
  eissn: 1872-7557
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001360
  issn: 0165-1684
  databaseCode: AIKHN
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1872-7557
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001360
  issn: 0165-1684
  databaseCode: AKRWK
  dateStart: 19930101
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLb2uIAQ4inGY-qBa7c-0rQ5ThPTALELTNqtatJ0FI1tWovEid-O06Z7HNAkrlXcVk782Y4-2wD3zEObcZzYjH3mmARjemVS1OSE-RxdFJEFGfNlRIdj8jTxJjXoV7Uwilapsb_E9AKt9ZOu1mZ3mabdV1WIY6teJZ6K8wNWhyb6nyBoQLP3-DwcrQHZdotiYbXeVAJVBV1B88rSKUKVvlwhHct2__JQR8soQ70l5cCLLS80OIFjHT4avfIPT6Em52dwuNVU8ByI7iRtxAU5w4hm08Uqzd8_DYxPDQSQVSaNRHGyDPmNWKCuy7ILGA8e3vpDU89GMIXr0twkiW_JiHsRZZGQEQ38BGMvxtEGJeWWQEfvU4tzLoIYE0UpXJs6DoujgCQBpjjuJTTmi7m8AiPGpCTGzE-gr1J1skEiMGUmRBCfcNu3W-BW-giFbhyu5lfMwooh9hGWWlQzLb3QIiFqsQXmWmpZNs7Ys96vVB3uHIAQsX2PZHtnZzafQ_RiiDHX_371DRxsrlxuoZGvvuQdBiE5b0O982O39VH7BTCB2ic
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEG4QD2qM8RnxgT14Leyj226PhkhQgYuQcNtsu13EIBDAxJO_3eluV-BgSLxu2t3NtP1mvuabGYTuRQBnxvMSknDhEQoxvTlSjEgquAQXRXUmxux0WatPnwfBoIQaRS6MkVVa7M8xPUNr-6RurVmfjUb1V5OI45paJYGJ80Oxg3Zp4HHDwGrfK52H62epwmY0McOL_LlM5LUYDQGo7NUKrTmu_5d_OpzFC7Bamre7WPNBzWN0ZINH_JD_3wkq6ckpOlgrKXiGqK0jjZNMmoHj8XAK_P_tA0N0igE-5guNU6PIwvoLkMBcli3OUb_52Gu0iO2MQJTvsyWhKXd0LIOYiVjpmIU8hchLSDiBmklHgZvnzJFSqjABmqiV7zLPE0kc0jQEguNfoPJkOtGXCCdASRLgfQo8lcmSDVMFhJlSRTmVLncryC_sESlbNtx0rxhHhT7sPcqtaDpaBpFDI7BiBZHfWbO8bMaW8bwwdbSx_BEg-5aZ1Y2VWX0OsEsAwlz9-9V3aK_V67Sj9lP35Rrtry5fblB5Of_UtxCOLGU1224__Nza7w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=General+design+algorithm+for+sparse+frame+expansions&rft.jtitle=Signal+processing&rft.au=Skretting%2C+Karl&rft.au=Hus%C3%B8y%2C+John+H%C3%A5kon&rft.au=Aase%2C+Sven+Ole&rft.date=2006&rft.pub=Elsevier+B.V&rft.issn=0165-1684&rft.eissn=1872-7557&rft.volume=86&rft.issue=1&rft.spage=117&rft.epage=126&rft_id=info:doi/10.1016%2Fj.sigpro.2005.04.013&rft.externalDocID=S0165168405001489
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0165-1684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0165-1684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0165-1684&client=summon