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

281
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...
281
Discrete Fourier Transform01:15

Discrete Fourier Transform

229
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...
229
Fast Fourier Transform01:10

Fast Fourier Transform

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

Convolution: Math, Graphics, and Discrete Signals

236
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...
236
Relative Motion Analysis using Rotating Axes01:25

Relative Motion Analysis using Rotating Axes

450
Consider a component AB undergoing a linear motion. Along with a linear motion, point B also rotates around point A. To comprehend this complex movement, position vectors for both points A and B are established using a stationary reference frame.
However, to express the relative position of point B relative to point A, an additional frame of reference, denoted as x'y', is necessary. This additional frame not only translates but also rotates relative to the fixed frame, making it...
450
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

238
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
238

You might also read

Related Articles

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

Sort by
Same author

A Comparison of Varying Golden Proportion on Smile Aesthetic Perception Between Patients, Orthodontists and Restorative Dentists.

International journal of dentistry·2026
Same author

Engineering Dynamic Hydrophobic Domains in Bioreinforced Ionic Hydrogels for Robust and Transparent Soft Electronics.

Langmuir : the ACS journal of surfaces and colloids·2026
Same author

Reply.

Journal of vascular surgery·2026
Same author

A Decade of Innovation in Hydrazine Detection Methods.

Critical reviews in analytical chemistry·2026
Same author

Medicinal chemistry meets nanotechnology: machine learning assisted colorimetric sensing platform for oxalic acid based on drug mediated copper oxide nanoparticles.

RSC advances·2026
Same author

Vaginal injury resulting from blunt trauma: still an under evaluated entity.

The American journal of emergency medicine·2025
Same journal

Invaders taking over-Mollusc faunal change in volcanic barrier lakes of the Albertine Rift biodiversity hotspot.

PloS one·2026
Same journal

AI-driven molecular diversification and ligand-based optimization of macitentan derivatives targeting VEGFR1 and endothelin signaling pathways.

PloS one·2026
Same journal

Performance patterns and records in the world aquatics masters championships: Where do the most frequently represented nations among the top-ten masters swimmers come from?

PloS one·2026
Same journal

Modeling diurnal Temperature-Rainfall relationships under multicollinearity using PLS-SEM: A case study of Ghana.

PloS one·2026
Same journal

Organizational culture, social capital, and emergency capacity in primary healthcare institutions: A cross-sectional structural equation modeling study comparing ordinary and older communities.

PloS one·2026
Same journal

Impact of kidney function on the metabolome in the general population.

PloS one·2026
See all related articles

Related Experiment Video

Updated: Jun 15, 2025

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

15.6K

Efficient motion estimation and discrete cosine transform implementation using the graphics processing units.

Shahrukh Agha1, Farmanullah Jan2, Haroon Ahmed Khan1

  • 1Department of Electrical and Computer Engineering, COMSATS University Islamabad, Islamabad, Pakistan.

Plos One
|August 28, 2024
PubMed
Summary
This summary is machine-generated.

Graphics Processing Units (GPUs) accelerate computationally intensive Motion Estimation (ME) and 2D Discrete Cosine Transform (2D-DCT) in HEVC video encoding. This GPU acceleration enables real-time performance for high-resolution video processing.

More Related Videos

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
06:25

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

8.4K
A Protocol for Real-time 3D Single Particle Tracking
10:16

A Protocol for Real-time 3D Single Particle Tracking

Published on: January 3, 2018

14.9K

Related Experiment Videos

Last Updated: Jun 15, 2025

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

15.6K
Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
06:25

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

8.4K
A Protocol for Real-time 3D Single Particle Tracking
10:16

A Protocol for Real-time 3D Single Particle Tracking

Published on: January 3, 2018

14.9K

Area of Science:

  • Computer Engineering
  • Video Compression Technology
  • Parallel Computing

Background:

  • High Efficiency Video Coding (HEVC) standard involves computationally demanding Motion Estimation (ME) and 2D Discrete Cosine Transform (2D-DCT) processes.
  • Real-time performance of HEVC can be hindered by the computational complexity of ME and 2D-DCT.

Purpose of the Study:

  • To accelerate ME and 2D-DCT tasks in HEVC using Graphics Processing Units (GPUs).
  • To analyze the impact of GPU acceleration on the overall HEVC encoding time for real-time applications.

Main Methods:

  • Exploration of four parallelism levels (frame, macroblock, search area, SAD) for ME.
  • Implementation of multithreaded Loeffler DCT algorithm for 2D-DCT computation.
  • Comparative analysis of HEVC ME algorithms including Full Search (FS), Test Zone Search (TZS), and Efficient Hierarchical Diamond Search (EHDS).

Main Results:

  • GPU acceleration achieved ME processing for 25 high-resolution frames (3840x2160) in 0.15 seconds.
  • 2D-DCT, image reconstruction, and differencing for 25 frames were completed in 0.1 seconds.
  • Combined ME and 2D-DCT tasks were processed in 0.25 seconds, allowing ample time for other encoder components.

Conclusions:

  • GPU deployment significantly enhances the speed of ME and 2D-DCT in HEVC encoding.
  • The accelerated HEVC encoder is suitable for real-time applications due to reduced processing times.
  • Parallelism strategies at various levels are effective for GPU-based video processing acceleration.