Concept

Hartley transform

Publications associées (8)

Vertex-Frequency Analysis on Graphs

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs. To do so, we need to account for the intrinsic geometric structure of the ...

Academic Press Inc Elsevier Science2016

A Unifying Parametric Framework for 2D Steerable Wavelet Transforms

Michaël Unser

We introduce a complete parameterization of the family of two-dimensional steerable wavelets that are polar-separable in the Fourier domain under the constraint of self-reversibility. These wavelets are constructed by multiorder generalized Riesz transform ...

Siam Publications2013

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

Michaël Unser, Daniel Sage, Kunal Narayan Chaudhury

It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithm ...

IEEE2011

Recognition Of Reverberant Speech Using Frequency Domain Linear Prediction

Hynek Hermansky, Sriram Ganapathy, Samuel Thomas

Performance of a typical automatic speech recognition (ASR) system severely degrades when it encounters speech from reverberant environments. Part of the reason for this degradation is the feature extraction techniques that use analysis windows which are m ...

2008

Recognition Of Reverberant Speech Using Frequency Domain Linear Prediction

Hynek Hermansky, Sriram Ganapathy, Samuel Thomas

IDIAP2008

Basefield transforms with the convolution property

Martin Vetterli

We present a general framework for constructing transforms in the field of the input which have a convolution-like property. The construction is carried out over the reals, but is shown to be valid over more general fields. We show that these basefield tra ...

1994

Hartley transforms over Finite Fields

Martin Vetterli

A general framework is presented for constructing transforms in the field of the input which have a convolution-like property. The construction is carried out over finite fields, but is shown to be valid over the real and complex fields as well. It is show ...

Institute of Electrical and Electronics Engineers1993

Improved Fourier and Hartley transform algorithms: application to cyclic convolution of real data

Martin Vetterli

This paper highlights the possible tradeoffs between arithmetic and structural complexity when computing cyclic convolution of real data in the transform domain. Both Fourier and Hartley-based schemes are first explained in their usual form and then improv ...

1987

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search