Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Downsampling

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...

Deconvolution

Deconvolution

Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...

Reconstruction of Signal using Interpolation

Reconstruction of Signal using Interpolation

Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...

Convolution: Math, Graphics, and Discrete Signals

Convolution: Math, Graphics, and Discrete Signals

In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Competitive neural trees for pattern classification.

IEEE transactions on neural networks·2008

Same author

Reformulated radial basis neural networks trained by gradient descent.

IEEE transactions on neural networks·2008

Same author

An axiomatic approach to soft learning vector quantization and clustering.

IEEE transactions on neural networks·2008

Same author

Soft learning vector quantization and clustering algorithms based on ordered weighted aggregation operators.

IEEE transactions on neural networks·2008

Same author

Soft learning vector quantization and clustering algorithms based on non-Euclidean norms: multinorm algorithms.

IEEE transactions on neural networks·2008

Same author

On the construction and training of reformulated radial basis function neural networks.

IEEE transactions on neural networks·2008

Search research articles

Related Experiment Videos

Image compression based on fuzzy algorithms for learning vector quantization and wavelet image decomposition.

N B Karayiannis, P I Pai, N Zervos

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society

|February 16, 2008

Summary

This study compares wavelet-based image compression using Linde-Buzo-Gray (LBG) and fuzzy learning vector quantization (FALVQ) algorithms. FALVQ demonstrates competitive performance in image compression quality.

Related Experiment Videos

Area of Science:

Digital Image Processing
Machine Learning
Signal Processing

Background:

Wavelet transform enables multiresolution subband decomposition of images.
Vector quantization compresses data by grouping similar vectors.
Linde-Buzo-Gray (LBG) and Fuzzy Adaptive Learning Vector Quantization (FALVQ) are unsupervised learning algorithms for vector quantization.

Discussion:

The study evaluates image compression performance using wavelet-based subband decomposition and vector quantization.
Performance is assessed by comparing reconstructed image quality from training and testing datasets.
Fuzzy algorithms for learning vector quantization (FALVQ) are explored alongside the traditional Linde-Buzo-Gray (LBG) algorithm.

Key Insights:

Both LBG and FALVQ algorithms are effective for designing multiresolution codebooks in wavelet-based image compression.
FALVQ shows comparable or superior performance to LBG in reconstructing images, indicating its potential for efficient image compression.
The unsupervised learning approach of these algorithms allows for adaptive codebook generation tailored to image characteristics.

Outlook:

Further research could explore hybrid approaches combining wavelet transforms with advanced deep learning-based quantization techniques.
Optimizing FALVQ parameters and exploring different fuzzy inference systems could enhance compression efficiency and quality.
Investigating the scalability of these methods for large-scale image and video compression applications is a promising direction.