A Matching Pursuit Full Search Algorithm for Image Approximations
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.
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse, we mean that only a few dictionary elements, compared to the ambient signal ...
With the flood of information available today the question how to deal with high dimensional data/signals, which are cumbersome to handle, to calculate with and to store, is highly important. One approach to reducing this flood is to find sparse signal rep ...
In this work we present a new greedy algorithm for sparse approximation called LocOMP. LocOMP is meant to be run on local dictionaries made of atoms with much shorter supports than the signal length. This notably encompasses shift-invariant dictionaries an ...
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift- invariant signal dictionaries with localized atoms, such as time-frequency dictionaries, and achieves a ...
This paper shows the construction of an algorithm to calculate the roots of both, the cross-product of Bessel functions respectively of their first derivatives. The algorithm has shown globally convergent behavior for a large range of values of the argumen ...
We propose a new method for imaging sound speed in breast tissue from measurements obtained by ultrasound tomography (UST) scan- ners. Given the measurements, our algorithm finds a sparse image representation in an overcomplete dictionary that is adapted t ...
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse, we mean that only a few dictionary elements, compared to the ambient signal ...
Demand has emerged for next generation visual technologies that go beyond conventional 2D imaging. Such technologies should capture and communicate all perceptually relevant three-dimensional information about an environment to a distant observer, providin ...
We consider the problem of reconstruction of astrophysical signals probed by radio interferometers with baselines bearing a non-negligible component in the pointing direction. The visibilities measured essentially identify with a noisy and incomplete Fouri ...
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework for the localization problem and provide sparse approximations to its optimal ...
