Publication

Average Performance Analysis for Thresholding

Pierre Vandergheynst, Karin Schnass
2007
Journal Articles

Abstract

In this article is shown that with high probability the thresholding algorithm can recover signals that are sparse in a redundant dictionary as long as the {\it 2-Babel function} is growing slowly. This implies that it can succeed for sparsity levels up to the order of the ambient dimension. The theoretical bounds are illustrated with numerical simulations. As an application of the theory {\it sensing dictionaries} for optimal average performance are characterised and their performance is tested numerically.

Official source

https://infoscience.epfl.ch/entities/publication/bf54cd6f-3d6c-4bec-8585-19ea33a02804

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Average Performance Analysis for Thresholding

Chat with Graph Search

A Streamline Upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations Under Optimal Control

Measurement of the K+ → π+γγ decay

Statistical Inference for Inverse Problems: From Sparsity-Based Methods to Neural Networks