000091178 001__ 91178
000091178 005__ 20190316233836.0
000091178 02470 $$2ISI$$a000248908100214
000091178 037__ $$aCONF
000091178 245__ $$aAverage case analysis of multichannel thresholding
000091178 269__ $$a2007
000091178 260__ $$c2007
000091178 336__ $$aConference Papers
000091178 520__ $$aThis paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter results in much weaker conditions on the dictionary. Numerical simulations confirm our theoretical findings and show that p-thresholding is an interesting low complexity alternative to simultaneous greedy or convex relaxation algorithms for processing sparse multichannel signals with balanced coefficients.
000091178 6531_ $$alts2
000091178 6531_ $$aLTS2
000091178 6531_ $$athresholding
000091178 6531_ $$aaverage case
000091178 6531_ $$amultichannel
000091178 6531_ $$aLTS2
000091178 700__ $$aGribonval, R.
000091178 700__ $$aMailhe, B.
000091178 700__ $$aRauhut, H.
000091178 700__ $$aSchnass, K.
000091178 700__ $$g120906$$aVandergheynst, P.$$0240428
000091178 7112_ $$cHonolulu$$aICASSP07
000091178 773__ $$tProc. ICASSP'07
000091178 8564_ $$uhttps://infoscience.epfl.ch/record/91178/files/DCSicassp07.pdf$$zn/a$$s76665
000091178 909C0 $$xU10380$$0252392$$pLTS2
000091178 909CO $$qGLOBAL_SET$$pconf$$ooai:infoscience.tind.io:91178$$pSTI
000091178 937__ $$aEPFL-CONF-91178
000091178 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000091178 980__ $$aCONF