Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

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...
Downsampling01:20

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...
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:

You might also read

Related Articles

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

Sort by
Same author

Multiparticle simulation of ion motion in the ion trap mass spectrometer: Resonant and direct current pulse excitation.

Journal of the American Society for Mass Spectrometry·2013
Same author

Broad-band fourier transform quadrupole ion trap mass spectrometry.

Analytical chemistry·2011
See all related articles

Related Experiment Video

Updated: Jul 7, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Speed-up in fractal image coding: comparison of methods.

M Polvere1, M Nappi

  • 1ENEL, Rome, Italy.

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|February 8, 2008
PubMed
Summary

This study enhances fractal image coding speed by comparing feature vector techniques. Combining Saupe with the mass center coding scheme achieved the best time-distortion performance, overcoming slow encoding times.

More Related Videos

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
06:37

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Published on: June 15, 2022

Related Experiment Videos

Last Updated: Jul 7, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
06:37

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Published on: June 15, 2022

Area of Science:

  • Computer Science
  • Image Processing
  • Data Compression

Background:

  • Fractal image compression offers resolution independence and fast decoding but suffers from long encoding times.
  • Existing speed-up methods for fractal coding include classification and feature vector techniques.
  • Key feature vector methods compared are Fisher, Hurtgen, and Saupe.

Purpose of the Study:

  • To evaluate and compare different speed-up techniques for fractal image coding.
  • To introduce and assess novel coding schemes combining existing methods.
  • To identify the most effective approach for improving fractal coding efficiency.

Main Methods:

  • Comparative analysis of classification and feature vector methods (Fisher, Hurtgen, Saupe).
  • Introduction of a new feature vector scheme using the block's mass center.
  • Development of hybrid schemes: Saupe with Fisher, and Saupe with mass center.

Main Results:

  • Feature vector techniques outperform classification methods in fractal image coding speed-up.
  • The combined Saupe and mass center coding scheme demonstrated superior performance.
  • This hybrid approach achieved the best time-distortion curves among tested methods.

Conclusions:

  • Feature vector methods are crucial for accelerating fractal image compression.
  • Combining established techniques like Saupe with novel approaches like mass center coding yields optimal results.
  • The Saupe-mass center combination represents a significant advancement in efficient fractal image coding.