Related Experiment Video
Updated: Jul 7, 2026

Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
Fast full search equivalent encoding algorithms for image compression using vector quantization
1Dept. of Electr. Eng., Utah State Univ., Logan, UT.
Abstract:
Three fast search routines to be used in the encoding phase of vector quantization (VQ) image compression systems are presented. These routines, which are based on geometric considerations, provide the same results as an exhaustive (or full) search. Examples show that the proposed algorithms need only 3-20% of the number of mathematical operations required by a full search and fewer than 50% of the operations required by recently proposed alternatives.
Related Concept Videos
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Vector Representation of Complex Numbers
Consider a function defined as the product of the complex factors in the numerator divided by the product of the complex factors in the denominator.
Vector Operations
A vector multiplied by a scalar value is called scalar multiplication. The result obtained is a new vector with a different magnitude. If the scalar is positive, the direction of the vector remains the same, but if it is negative, the direction of the vector is reversed. For example, the product of the mass and velocity yields the momentum.
Parseval's Theorem for Fourier transform
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a signal's...
Vector or Cross Product
Consider the cross product of two vectors. Imagine rotating the first vector about...
