Related Experiment Video
Updated: Jul 7, 2026

13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Fast fractal compression of greyscale images
Summary
A novel fractal compression algorithm for greyscale images significantly speeds up the process by reducing it to a nearest neighbors problem. This new method achieves faster image compression without compromising visual quality.
Area of Science:
- Computer Vision
- Image Processing
- Data Compression
Background:
- Fractal compression is a lossy compression technique based on fractal self-similarity.
- Existing fractal compression methods can be computationally intensive.
- Efficient algorithms are needed to improve the speed of fractal image compression.
Discussion:
- The presented algorithm leverages previous research to frame compression as a nearest neighbors problem.
- A geometrical partition of the image block feature space is central to the algorithm's design.
- This approach aims to optimize the search for self-similarities within image blocks.
Key Insights:
- The new algorithm demonstrates a significant improvement in compression speed compared to existing methods.
- Experimental results confirm that the enhanced speed does not lead to any loss in image quality.
- The method effectively balances compression efficiency and fidelity for greyscale images.
Outlook:
- Further research could explore the application of this algorithm to color images.
- Optimization of the geometrical partition could lead to even greater speed enhancements.
- This work provides a foundation for developing faster and more efficient fractal-based image compression techniques.
Related Concept Videos
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
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...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Upsampling
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
Introduction to Scalers
Many familiar physical quantities can be specified completely by giving a single number and the appropriate unit. For example, "a class period lasts 50 min," or "the gas tank in my car holds 65 L," or "the distance between the two posts is 100 m." A physical quantity that can be specified completely in this manner is called a scalar quantity. The word "scalar" is a synonym for "number." Time, mass, distance, length, volume, temperature, and energy are some examples of scalar quantities.
Scalar...
Scalar...
Convergence of Fourier Series
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
