Tile-Based Slice Addressing for Compact Video Bitstreams
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in efficiently compressing video data for transmission and storage, particularly in limited bandwidth environments, with inefficiencies in slice and tile partitioning leading to increased resource usage and processing overhead.
Innovation Solution
The method involves partitioning images into slices and tiles, using tile identifiers to define slice boundaries, allowing for efficient signaling of slice data without rewriting slice headers, and enabling parallel processing, thereby reducing resource usage and increasing decoding speed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If video data is compressed using traditional slice partitioning methods, then the video data can be transmitted and stored, but the bitstream size remains large consuming more network and memory resources
Solution Approach 1:
The image is divided into multiple slices, and each slice is further divided into tiles with unique tile identifiers. This hierarchical segmentation allows for more granular control and efficient signaling, where only necessary tile ID information needs to be transmitted in the bitstream rather than complete slice header information for every slice.
Solution Approach 2:
The patent changes the signaling parameter from complete slice header data to condensed tile identifier information. By signaling slices based on top-left and bottom-right tile IDs rather than relative positions in the frame, the bitstream is significantly condensed while maintaining the ability to reconstruct slice boundaries at the decoder.
2Ease of operation
If slice headers are rewritten when signaling sub-frames, then addressing can be maintained, but processing overhead and resource usage increase
Solution Approach 1:
Tile identifiers are assigned and established in advance during the encoding phase, creating a stable addressing framework that can be reused across different sub-frames and slices. This preliminary assignment eliminates the need to rewrite addressing information when signaling sub-frames, as the tile ID system remains consistent and reusable.
3Measurement precision
If traditional slice addressing based on relative position is used, then slice location can be determined, but decoding speed is limited due to sequential processing requirements
Solution Approach 1:
Each tile within a slice contains or is associated with tile identifier information that enables self-identification and self-positioning. The decoder can independently determine the location and boundaries of each slice by reading the tile ID information from the tiles themselves, without requiring sequential processing or external positioning information from previously decoded data.
Data Source
AI summary
A video coding mechanism is disclosed. The mechanism includes receiving a bitstream including image data coded in a plurality of slices. A top left tile identifier (ID) and a bottom right tile ID of a first slice are determined. Boundaries of the first slice are determined based on the top left tile ID and the bottom right tile ID. The first slice is decoded to generate a reconstructed image based on the boundaries of the first slice.