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

Deconvolution01:20

Deconvolution

Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.

You might also read

Related Articles

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

Sort by
Same author

Symmetric Entropy-Constrained Video Coding for Machines.

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

From Global to Granular: Revealing IQA Model Performance Via Correlation Surface.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Decouple-Then-Synergize: A Self-Paced Collaborative Learning Network for RGB-T Snowy Urban Scene Parsing.

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

Real-World Nighttime Image Dehazing via Bayesian-Based Fractional-Order Variational Model.

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

LB-PTQ: Effective Low-Bit Post-Training Quantization for Vision Transformers.

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

Decentralized electric vehicle charging enables large-scale photovoltaic integration in tropical cities.

Nature communications·2026
Same journal

Change-Prior-Guided Unsupervised Change Detection of Heterogeneous Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

AgonicDreamer: Enhancing Multi-View Consistency in Text-to-3D Generation via Rectified Score Distillation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

BiCM-Prompt: Bidirectional Cross-Modal Prompt Tuning for Class-Incremental Learning on Multisource Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

GoP-based Quality Enhancement on Video Compression.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Align then Tensorize: Multi-Level Consistent Anchor Graph Learning for Scalable Multi-View Clustering.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Beyond Fidelity: Diverse Image Synthesis via Retrieval-Augmented Diffusion.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Video

Updated: May 29, 2026

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

Low-complexity video coding based on two-dimensional singular value decomposition.

Zhouye Gu1, Weisi Lin, Bu-sung Lee

  • 1School of Computer Engineering, Nanyang Technological University, Singapore 639798. guzh0001@ntu.edu.sg

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

This study introduces a low-complexity video coding method using 2-D singular value decomposition (2-D SVD), achieving high efficiency without motion estimation. It offers a better balance of computation and temporal redundancy reduction, avoiding random access issues.

Related Experiment Videos

Last Updated: May 29, 2026

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:

  • Digital Signal Processing
  • Image and Video Compression

Background:

  • Traditional video coding relies on motion estimation (ME), increasing computational complexity.
  • Frame decoding dependency in hybrid codecs limits random access capabilities.

Purpose of the Study:

  • To propose a low-complexity video coding scheme leveraging 2-D singular value decomposition (2-D SVD).
  • To achieve high coding efficiency by exploiting the energy compaction property of 2-D SVD coefficients.
  • To offer a superior compromise between computational complexity and temporal redundancy reduction compared to existing methods.

Main Methods:

  • Utilizing 2-D singular value decomposition (2-D SVD) to exploit temporal correlations in visual signals.
  • Applying the energy compaction property of 2-D SVD coefficient matrices for efficient coding.
  • Developing a non-motion-estimation-based video coding approach.

Main Results:

  • The proposed 2-D SVD scheme achieves high coding efficiency.
  • It offers a better trade-off between computational complexity and temporal redundancy reduction.
  • The method avoids issues like unavailability of random access inherent in frame-dependent coding.

Conclusions:

  • The 2-D SVD video coding scheme presents a viable low-complexity alternative.
  • It demonstrates advantages over existing non-ME-based low-complexity codecs.
  • The approach shows significant potential for various video coding applications.