Adaptive Search Range Method for Motion Estimation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Multiview video coding (MVC) technologies face challenges in efficiently reducing computation time for motion and disparity estimation, particularly with high-resolution videos, as broader search ranges are required for better coding quality but lead to longer execution times, consuming significant computational resources.
Innovation Solution
An adaptive search range method is introduced for motion and disparity estimation, where the initial search range is divided into regions, and a candidate search range is calculated based on motion or disparity vector distributions, allowing for dynamic adjustment of search ranges to optimize computation time without sacrificing coding quality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If a broader search range is used for motion and disparity estimation, then coding quality is improved, but computation time increases
Solution Approach 1:
The search range is divided into multiple regions, and the algorithm selectively searches only the relevant regions where motion or disparity vectors are likely to be found, rather than searching the entire broad search range. This segmentation reduces computation time while maintaining coding quality by concentrating search efforts in areas of interest.
Solution Approach 2:
The algorithm performs motion and disparity estimation on only a subset of blocks (e.g., non-skipped blocks, or blocks with high prediction error) rather than all blocks in the frame. This partial action approach reduces overall computation time while maintaining sufficient coding quality for the majority of the video content.
2Manufacturing precision
If motion and disparity estimation is performed for all blocks, then coding quality is improved, but computational resources are consumed
Solution Approach 1:
The patent applies motion and disparity estimation selectively to only certain blocks (e.g., non-skipped blocks, blocks with high residual error, or blocks in regions of interest) rather than all blocks. This partial application of the estimation process significantly reduces computational resource consumption while maintaining adequate coding quality for the overall video stream.
Solution Approach 2:
Different blocks are treated differently based on their local characteristics. Blocks that require high precision (e.g., those with high prediction error or in important regions) receive full motion and disparity estimation, while other blocks use simpler or skipped modes. This local differentiation optimizes the balance between coding quality and computational resource usage.
Data Source
AI summary
An adaptive search range method for motion/disparity estimation is provided in multi-view video coding (MVC) technology. The method uses a initial search range as a first search range, perform an estimation flow for first blocks in a first frame to obtain vector distribution, and obtain at least a first candidate search range in accordance with the vector distribution. The first candidate search range is selected as a second search range to perform estimation flow for second blocks in a second frame, and an estimation vector according to the estimation flow is obtained and provided as video coding.


