The berkeley wavelet transform: a biologically inspired orthogonal wavelet transform

Ben Willmore1, Ryan J Prenger, Michael C-K Wu

  • 1Department of Physiology, Anatomy, and Genetics, University of Oxford, Parks Road, Oxford OX1 3PT, UK. benjamin.willmore@dpag.ox.ac.uk

Neural Computation
|January 16, 2008
PubMed

Related Concept Videos

Basic signals of Fourier Transform01:07

Basic signals of Fourier Transform

The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
Propagation of Waves01:07

Propagation of Waves

When a wave propagates from one medium to another, part of it may get reflected in the first medium, and part of it may get transmitted to the second medium. In such a case, the interface of the two mediums can be considered as a boundary that is neither fixed nor free.
Consider a scenario where a wave propagates from a string of low linear mass density to a string of high linear mass density. In such a case, the reflected wave is out of phase with respect to the incident wave, however the...
Effective Value of a Periodic Waveform01:07

Effective Value of a Periodic Waveform

The concept of effective value, the root mean square (RMS) value, is crucial in understanding electrical circuits and power delivery. This idea emerges from the necessity to measure the effectiveness of a voltage or current source in supplying power to a resistive load.
The effective value of a periodic current represents the direct current (DC) that conveys the same average power to a resistor as the periodic current itself. This concept is crucial when assessing AC circuits. To determine the...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Properties of Fourier Transform I01:21

Properties of Fourier Transform I

The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...