Open AccessNew inequalities on sparse representation in pairs of bases
Author(s) -
Guanlei Xu,
Xiaotong Wang,
Lijia Zhou,
Xiaogang Xu
Publication year - 2013
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2012.0365
Subject(s) - sparse approximation , representation (politics) , computer science , inequality , algorithm , mathematics , theoretical computer science , pattern recognition (psychology) , artificial intelligence , mathematical analysis , politics , political science , law
In this study, the authors investigated some new inequalities on sparse representation for pairs of bases and frames, which would enrich the theory ensemble. First, for fixed pairs of bases, frames and the signal to be represented, we presented the bounds (which can be used in practice directly) of l 0 ‐norm of signal coefficients by the max/min cross‐inner‐products, as is of much importance to bases and frames selections in sparse representation. Also, the error bounds associated with the given min cross‐inner‐products are achieved. Moreover, the equivalence condition between l 0 solution and l 1 solution was achieved via relations of cross‐inner‐products, as can be applied directly for selection of optimal bases. Finally, the estimation of the parameters of cross‐inner‐products was shown.