Related Experiment Video
Updated: Jul 7, 2026

13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Prediction of image partitions using Fourier descriptors: application to segmentation-based coding schemes
Summary
This study introduces a novel region-by-region prediction technique for partition sequences, utilizing Fourier descriptors for motion and shape analysis. The method enhances video object plane coding through accurate partition interpolation and extrapolation.
Area of Science:
- Computer Vision
- Image Processing
- Video Coding
Background:
- Partition sequences are crucial in segmentation-based video coding.
- Accurate prediction of these partitions is essential for efficient compression.
- Existing methods may lack robustness in handling complex motion and shape deformations.
Purpose of the Study:
- To develop a novel prediction technique for partition sequences.
- To apply this technique for partition interpolation and extrapolation in video coding.
- To improve the efficiency and accuracy of segmentation-based video compression.
Main Methods:
- A region-by-region approach involving parameterization, prediction, ordering, and creation.
- Utilizing Fourier descriptors to model regular motion and shape deformation over time.
- Predicting region evolution in the Fourier domain and combining them using morphological tools.
Main Results:
- Demonstrated effectiveness in noncausal partition prediction for interpolation tasks.
- Showcased successful causal partition prediction for extrapolation in coding applications.
- Validated performance on complete partitions and sequences of binary images (Video Object Planes - VOPs).
Conclusions:
- The proposed technique offers a robust method for predicting partition sequences.
- It effectively handles both regular motion and shape deformation for improved video coding.
- The approach shows promise for enhancing segmentation-based video compression strategies.
Related Concept Videos
Extraction: Partition and Distribution Coefficients
The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
For extracting a solute from an aqueous phase into an organic...
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
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...
Convergence of Fourier Series
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Discrete-Time Fourier Series
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]...
For a discrete-time periodic signal x[n]...
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...
