Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Orthonormality

Publications associées (12)

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Daniel Kressner, Alice Cortinovis

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

Spectral representation of EEG data using learned graphs with application to motor imagery decoding

Dimitri Nestor Alice Van De Ville, Hamid Behjat, Maliheh Miri

Electroencephalography (EEG) data entail a complex spatiotemporal structure that reflects ongoing organi-zation of brain activity. Characterization of the spatial patterns is an indispensable step in numerous EEG processing pipelines. We present a novel me ...

Elsevier Sci Ltd2023

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Polynomial models in finance

Damien Edouard Ackerer

This thesis presents new flexible dynamic stochastic models for the evolution of market prices and new methods for the valuation of derivatives. These models and methods build on the recently characterized class of polynomial jump-diffusion processes for w ...

EPFL2017

Universal and efficient compressed sensing by spread spectrum and application to realistic Fourier imaging techniques

Pierre Vandergheynst, Yves Wiaux, Rémi Gribonval, Gilles Puy

We advocate a compressed sensing strategy that consists of multiplying the signal of interest by a wide bandwidth modulation before projection onto randomly selected vectors of an orthonormal basis. Firstly, in a digital setting with random modulation, con ...

Institute of Electrical and Electronics Engineers2012

Spread Spectrum for Universal Compressive Sampling

Pierre Vandergheynst, Yves Wiaux, Rémi Gribonval, Gilles Puy

We propose a universal and efficient compressive sampling strategy based on the use of a spread spectrum technique. The method essentially consists in a random pre-modulation of the signal of interest followed by projections onto randomly selected vectors ...

2011

Multichannel Compressed Sensing via Source Separation for Hyperspectral Images

Pierre Vandergheynst, Mohammad Golbabaee

This paper describes a novel framework for compressive sampling of multichannel signals that are highly correlated across the channels. In this work, we assume few number of independent sources are generating the multichannel observations based on a linear ...

2010

Distributed Compressed Sensing of Hyperspectral Images via Blind Source Separation

Pierre Vandergheynst, Mohammad Golbabaee

This paper describes a novel framework for compressive sampling (CS) of multichannel signals that are highly dependent across the channels. In this work, we assume few number of sources are generating the multichannel observations based on a linear mixture ...

2010

Dictionary Identifiability from Few Training Samples

Rémi Gribonval, Karin Schnass

This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via

ell^1

minimisation, or more precisely the problem of identifying a dictionary

dico

from a set of training samples

Y

knowing that $ ...

2008

Compressed sensing and redundant dictionaries

Pierre Vandergheynst, Karin Schnass

This article extends the concept of it compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic ...

2008

Robust Control of Polytopic Systems by Convex Optimization

Alireza Karimi, Roland Longchamp

Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polytopic system is given over an infinite-dimensional space. A finite-dimensional app ...

2007

Robust Control of Polytopic Systems by Convex Optimization

Alireza Karimi, Roland Longchamp

2007

Publications associées (12)

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

ell^1

minimisation, or more precisely the problem of identifying a dictionary

dico

from a set of training samples

Y

knowing that $ ...

2008