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

Concept

Transformée de Hadamard

Publications associées (29)

Fixed Points of Generalized Approximate Message Passing with Arbitrary Matrices

Volkan Cevher

The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications. Approximate message passing (AMP) methods, based on Gaussian appr ...

2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

Inference for Generalized Linear Models via Alternating Directions and Bethe Free Energy Minimization

Ulugbek Kamilov

Generalized Linear Models (GLMs), where a random vector x is observed through a noisy, possibly nonlinear, function of a linear transform z = A x arise in a range of applications in nonlinear filtering and regression. Approximate Message Passing (AMP) meth ...

IEEE2015

Method for determining the walsh-hadamard transform of n samples of a signal and apparatus for performing the same

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A computer-implemented method for determining the Walsh-Hadamard transform of N samples of a signal, comprises electing a plurality of hashing C matrices Σ1, . . . ΣC, computing C hashes of a particular length based at least on a hashing front end and the ...

2015

Method and apparatus for low complexity spectral analysis of bio-signals

David Atienza Alonso, Andreas Peter Burg, Srinivasan Murali, Georgios Karakonstantis, Aviinaash Sankaranarayanan

A method and device for reducing the computational complexity of a processing algorithm, of a discrete signal, in particular of the spectral estimation and analysis of bio-signals, with minimum or no quality loss, which comprises steps of (a) choosing a do ...

2015

Compressed Sensing of Memoryless Sources : A Deterministic Hadamard Construction

Saeid Haghighatshoar

Compressed sensing is a new trend in signal processing for efficient sampling and signal acquisition. The idea is that most real-world signals have a sparse representation in an appropriate basis and this can be exploited to capture the sparse signal by ta ...

EPFL2014

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Positivity for Kac polynomials and DT-invariants of quivers

Tamás Hausel

We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich Soibelman ...

Annal Mathematics2013

Data-Driven Enhancement of State Mapping-Based Cross-Lingual Speaker Adaptation

Hui Liang

The thesis work was motivated by the goal of developing personalized speech-to-speech translation and focused on one of its key component techniques – cross-lingual speaker adaptation for text-to-speech synthesis. A personalized speech-to-speech translator ...

EPFL2012