Scalable Video Coding Using Inter-Layer Motion Prediction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current High Efficiency Video Coding (HEVC) lacks spatial and quality scalability, limiting its adaptability to different network conditions and device capabilities, and there is a need for improved scalability and coding efficiency compared to H.264 SVC.
Innovation Solution
The method involves configuring video data into a Base Layer (BL) and an Enhancement Layer (EL) where the EL has higher spatial resolution or better quality, using motion information from the BL to enhance coding efficiency through motion vector prediction and inter-layer prediction, and reusing CU structures and prediction modes to improve scalability and flexibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If HEVC is used for video coding, then coding efficiency is improved, but spatial and quality scalability is lost
Solution Approach 1:
The video content is segmented into multiple layers: a base layer and one or more enhancement layers. The base layer contains video data at a lower resolution or quality, while enhancement layers contain additional data to reconstruct higher resolution or quality versions. This segmentation enables scalable delivery where receivers can selectively decode only the base layer or base layer plus enhancement layers based on their capabilities and network conditions.
Solution Approach 2:
The patent introduces a new dimension to HEVC by adding layer indexing and scalability structures. Enhancement layer video data is organized with reference to base layer data through inter-layer prediction mechanisms, creating a multi-dimensional coding structure that preserves HEVC's coding efficiency while adding scalability capabilities across different quality and resolution dimensions.
2Manufacturing precision
If video is compressed to high resolution and high quality for broadband networks, then video quality is improved, but adaptability to mobile networks with limited bandwidth is reduced
Solution Approach 1:
The scalable video bitstream enables dynamic adaptation where the same encoded data can be flexibly decoded at different quality levels. receivers can dynamically select which enhancement layers to decode based on real-time network conditions and device capabilities, transitioning smoothly between high quality (broadband) and lower quality (mobile network) modes without requiring separate encodings.
Solution Approach 2:
The multi-layer video structure serves multiple functions: it provides high-quality video for broadband networks when all enhancement layers are decoded, and gracefully degraded quality for mobile networks when only the base layer or partial enhancement layers are decoded. This single bitstream structure universally serves both high-bandwidth and low-bandwidth scenarios.
3Device complexity
If a single video content is delivered in fixed resolution for specific network conditions, then coding simplicity is maintained, but flexibility for different network environments is reduced
Solution Approach 1:
The video is pre-encoded into a scalable structure with base layer and enhancement layers during the encoding phase. This preliminary organization of data into hierarchical layers enables flexible adaptation at the decoding phase without requiring complex real-time re-encoding or transcoding operations, maintaining coding simplicity while achieving network flexibility.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method and apparatus for coding video data using Inter prediction mode or Merge mode in a video coding system are disclosed, where the video data is configured into a Base Layer (BL) and an Enhancement Layer (EL), and the EL has higher spatial resolution or better video quality than the BL. In one embodiment, at least one information piece of motion information associated with one or more BL blocks in the BL is identified. A motion vector prediction (MVP) candidate list or a Merge candidate list for the selected block in the EL is then determined, where said at least one information piece associated with said one or more BL blocks in the BL is included in the MVP candidate list or the Merge candidate list. The input data associated with the selected block is coded or decoded using the MVP candidate list or the Merge candidate list.