Publications by Philippe Jost | EPFL Graph Search

On finding approximate nearest neighbours in a set of compressible signals

Numerous applications demand that we manipulate large sets of very high-dimensional signals. A simple yet common example is the problem of finding those signals in a database that are closest to a query. In this paper, we tackle this problem by restricting ...

2008

On finding nearest neighbors in a set of compressible signals

Pierre Vandergheynst, Philippe Jost

Numerous applications demand that we manipulate large sets of very high-dimensional signals. A simple yet common example is the problem of finding those signals in a database that are closest to a query. In this paper, we tackle this problem by restricting ...

2007

Learning Multi-Modal Dictionaries

Pierre Vandergheynst, Gianluca Monaci, Rémi Gribonval, Philippe Jost

Real-world phenomena involve complex interactions between multiple signal modalities. As a consequence, humans are used to integrate at each instant perceptions from all their senses in order to enrich their understanding of the surrounding world. This par ...

2007

Algorithmic aspects of sparse approximations

Philippe Jost

Typical tasks in signal processing may be done in simpler ways or more efficiently if the signals to analyze are represented in a proper way. This thesis deals with some algorithmic problems related to signal approximation, more precisely, in the novel fie ...

EPFL2007

MoTIF: An Efficient Algorithm for Learning Translation Invariant Dictionaries

Pierre Vandergheynst, Philippe Jost, Rémi Gribonval

The performances of approximation using redundant expansions rely on having dictionaries adapted to the signals. In natural high-dimensional data, the statistical dependencies are, most of the time, not obvious. Learning fundamental patterns is an alternat ...

2006

Learning Multi-Modal Dictionaries: Application to Audiovisual Data

Pierre Vandergheynst, Gianluca Monaci, Rémi Gribonval, Philippe Jost

This paper presents a methodology for extracting meaningful synchronous structures from multi-modal signals. Simultaneous processing of multi-modal data can reveal information that is unavailable when handling the sources separately. However, in natural hi ...

2006

Tree-Based Pursuit: Algorithm and Properties

Pascal Frossard, Pierre Vandergheynst, Philippe Jost

This paper proposes a tree-based pursuit algorithm that efficiently trades off complexity and approximation performance for overcomplete signal expansions. Finding the sparsest representation of a signal using a redundant dictionary is, in general, a NP-Ha ...

2006