When sparse representation techniques are used to tentatively recover the true sparse underlying model hidden in an observation vector, they can be seen as solving a joint detection and estimation problem. We consider the l 2 - l1 regularized criterion, that is probably the most used in the sparse representation community, and show that, from a detection point of view, minimizing this criterion is similar to applying the Generalized Likelihood Ratio Test. More specifically tuning the regularization parameter in the criterion amounts to set the threshold in the Generalized Likelihood Ratio Test. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Fuchs, J. J. (2010). The generalized likelihood ratio test and the sparse representations approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6134 LNCS, pp. 245–253). https://doi.org/10.1007/978-3-642-13681-8_29
Mendeley helps you to discover research relevant for your work.