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

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...
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...
Convolution: Math, Graphics, and Discrete Signals01:24

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...
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...
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...

You might also read

Related Articles

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

Sort by
Same author

Comparison of Long-Term Outcomes Between Second-Generation Single Long Stents and Overlapping Stents for Long-Diffuse Coronary Artery Disease　- Systematic Review and Meta-Analysis.

Circulation reports·2025
Same author

Edge-Aware Extended Star-Tetrix Transforms for CFA-Sampled Raw Camera Image Compression.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2022
Same author

Wavelet-based Spectral-Spatial Transforms for CFA-Sampled Raw Camera Image Compression.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2019
Same author

Interactions between Kisspeptin Neurons and Hypothalamic Tuberoinfundibular Dopaminergic Neurons in Aged Female Rats.

Acta histochemica et cytochemica·2017
Same author

2D Non-Separable Block-Lifting Structure and Its Application to M-Channel Perfect Reconstruction Filter Banks for Lossy-to-Lossless Image Coding.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2015
Same author

Reversible symmetric nonexpansive convolution: an effective image boundary processing for M-channel lifting-based linear-phase filter banks.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2014

Related Experiment Video

Updated: Jun 12, 2026

Quantitative Optical Microscopy: Measurement of Cellular Biophysical Features with a Standard Optical Microscope
14:09

Quantitative Optical Microscopy: Measurement of Cellular Biophysical Features with a Standard Optical Microscope

Published on: April 7, 2014

Integer DCT based on direct-lifting of DCT-IDCT for lossless-to-lossy image coding.

Taizo Suzuki, Masaaki Ikehara

    IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
    |June 4, 2010
    PubMed
    Summary

    This study introduces a hardware-friendly integer Discrete Cosine Transform (IntDCT) for efficient image coding. This new IntDCT method is compatible with existing devices, simplifying lossless-to-lossy image compression.

    Related Experiment Videos

    Last Updated: Jun 12, 2026

    Quantitative Optical Microscopy: Measurement of Cellular Biophysical Features with a Standard Optical Microscope
    14:09

    Quantitative Optical Microscopy: Measurement of Cellular Biophysical Features with a Standard Optical Microscope

    Published on: April 7, 2014

    Area of Science:

    • Digital Signal Processing
    • Image Compression Technologies

    Background:

    • Discrete Cosine Transform (DCT) is fundamental for JPEG/MPEG but standard implementations are not optimized for integer-based lossless-to-lossy coding.
    • Existing integer DCT (IntDCT) methods often necessitate redesigned hardware, limiting their practical adoption.

    Purpose of the Study:

    • To propose a novel hardware-friendly integer DCT (IntDCT) suitable for both lossless and lossy image coding applications.
    • To enable the use of IntDCT without requiring modifications to existing DCT hardware.

    Main Methods:

    • The proposed IntDCT is implemented using a direct-lifting approach applied to the standard DCT and inverse DCT (IDCT).
    • This lifting technique allows seamless integration with existing DCT hardware components.

    Main Results:

    • The direct-lifting IntDCT is compatible with existing DCT devices, allowing them to be utilized for every lifting block.
    • The method was validated through its successful application in lossless-to-lossy image coding scenarios.

    Conclusions:

    • The developed hardware-friendly IntDCT offers a practical solution for advanced image compression.
    • This approach facilitates the transition to integer-based transforms without significant hardware redesign, improving efficiency and flexibility.