Publication

A simple test to check the optimality of a sparse signal approximation

Related publications (72)

About
Privacy
Disclaimer

Graph Chatbot

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.

A simple test to check the optimality of a sparse signal approximation

Graph Chatbot

Chat with Graph Search

Sparse Approximation Using M-Term Pursuits with Applications to Image and Video Compression

Learning redundant dictionaries with translation invariance property: the MoTIF algorithm

Tree-Based Pursuit: Algorithm and Properties

The M-Term Pursuit for Image Representation and Progressive Compression

Image/video representation and scalable coding using redundant dictionaries

Toward sparse and geometry adapted video approximations

Sparse Approximation by Linear Programming: Measuring the Error with the $ell_1$ Norm