Video String Matching with History-Based Reference Location Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding systems face inefficiencies in managing reference sample locations for intra block copy (IBC) and string matching in single value string mode, where reference sample locations can exceed valid ranges and fail to update, leading to unusable memory and synchronization issues.
Innovation Solution
Implementing a method to update and manage reference locations in a history list for video coding, using a history-based list to store recent sample locations and constrain their range, ensuring efficient use and synchronization for IBC and string matching operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If reference sample locations are not constrained in IBC and string matching, then more reference samples are available for matching, but reference locations exceed valid ranges and become unusable
Solution Approach 1:
The patent applies parameter changes by constraining reference sample locations to valid ranges using boundary checks. When reference locations exceed picture boundaries or valid regions, the system adjusts them to fall within acceptable ranges, ensuring reliability while maintaining adaptability through the history-based list mechanism.
Solution Approach 2:
The patent introduces a history-based list as an intermediary structure that stores and manages reference sample locations. This mediator maintains the validity of reference locations by updating them systematically, allowing the system to access multiple reference samples while ensuring they remain within valid ranges through controlled updates.
2Reliability
If reference sample locations are updated frequently, then synchronization is improved, but processing overhead increases
Solution Approach 1:
The patent applies preliminary action by updating reference sample locations in advance during the encoding process. The history-based list pre-stores valid reference locations, so they are ready for decoding without requiring intensive real-time processing, thus improving synchronization while reducing processing overhead.
Solution Approach 2:
The system implements self-service through automatic updates of the history-based list during encoding and decoding operations. The reference sample locations are maintained and updated automatically by the coding/decoding process itself, reducing the need for external management and minimizing processing overhead.
3Ease of operation
If a history-based list is implemented, then reference sample management is improved, but memory usage increases
Solution Approach 1:
The patent applies segmentation by dividing the reference sample management into a structured history-based list with specific entries. Instead of managing all reference samples uniformly, the system segments them into a controlled list that stores only necessary historical locations, improving manageability while limiting memory consumption to essential data.
Solution Approach 2:
The patent implements discarding and recovering by maintaining a limited-size history-based list that stores only recent and relevant reference sample locations. Older or redundant entries are discarded when the list reaches capacity, while important reference locations are recovered and reused, optimizing memory usage while maintaining effective reference sample management.
Data Source
AI summary
A method, computer program, and computer system is provided for coding video data. Video data including one or more reference locations is received. The one or more reference locations are updated in a history list associated with the received video data based on intra block copy for a single value string mode. The video data is decoded based on the updated reference locations.