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...
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...
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...
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
Properties of DTFT I01:24

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...

You might also read

Related Articles

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

Sort by
Same author

Colorimetric tetra-combo loop-mediated isothermal amplification assay for efficient SARS-CoV-2 detection.

Tropical biomedicine·2026
Same author

[Monomorphic epitheliotropic intestinal T-cell lymphoma: a clinicopathological and genetic mutation characteristics analysis of forty-two cases].

Zhonghua bing li xue za zhi = Chinese journal of pathology·2025
Same author

[Epidemiological characteristics of marburg virus disease: a systematic review].

Zhonghua liu xing bing xue za zhi = Zhonghua liuxingbingxue zazhi·2025
Same author

[Clinicopathological features of hereditary breast cancer and advances in germline testing].

Zhonghua bing li xue za zhi = Chinese journal of pathology·2025
Same author

Shoulder and Neck Balance in Adolescent Idiopathic Scoliosis: Which Radiographic Indices are Reliable and Practical?

Malaysian orthopaedic journal·2024
Same author

[Epidemiological characteristics of severe fever with thrombocytopenia syndrome in China, 2018-2021].

Zhonghua liu xing bing xue za zhi = Zhonghua liuxingbingxue zazhi·2024

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

A fast encoding algorithm for fractal image compression using the DCT inner product.

T K Truong1, J H Jeng, I S Reed

  • 1Coll. of Electr. and Inf. Eng., I-Shou Univ.

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|February 8, 2008
PubMed
Summary
This summary is machine-generated.

A new fast encoding algorithm for fractal image compression significantly speeds up the process by eliminating redundant computations. This method achieves comparable image quality (PSNR) and is approximately six times faster than existing approaches.

More Related Videos

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
11:34

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

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

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
11:34

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Area of Science:

  • Computer Science
  • Image Processing
  • Digital Signal Processing

Background:

  • Fractal image compression offers efficient data compression.
  • Existing encoding algorithms can be computationally intensive.
  • Optimization of the encoding process is crucial for practical applications.

Purpose of the Study:

  • To develop a fast encoding algorithm for fractal image compression.
  • To reduce the computational complexity of the fractal image encoding process.
  • To maintain high image quality (PSNR) while accelerating encoding.

Main Methods:

  • Developed a novel encoding algorithm utilizing frequency domain calculations.
  • Integrated mean square error (MSE) computations with eight dihedral symmetries simultaneously.
  • Eliminated redundant computations within the encoding algorithm.

Main Results:

  • Achieved a six-fold increase in encoding speed compared to the baseline method.
  • Maintained nearly identical Peak Signal-to-Noise Ratio (PSNR) for retrieved images.
  • Demonstrated the algorithm's efficiency through software simulations.

Conclusions:

  • The proposed fast encoding algorithm significantly enhances fractal image compression efficiency.
  • The algorithm's speed improvement and maintained image quality make it highly practical.
  • It is adaptable for integration with advanced fractal compression techniques like quadtree and classification.