Tile-Relative Addressing in Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Repositioning or extracting subsets of tiles or slices in video encoding requires rewriting slice headers, which is inefficient and increases bitrate and computational resources.
Innovation Solution
Encoding tile identifiers into slice headers and parameter set files to indicate tile positions, allowing for tile-relative addressing without rewriting slice headers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If slice headers are rewritten to reposition slices or extract subsets of tiles, then the desired repositioning functionality is achieved, but the bitrate increases and computational resources are consumed
Solution Approach 1:
The picture is divided into tiles with unique identifiers, allowing independent addressing of tile subsets. This segmentation enables repositioning operations to work with individual tiles or tile groups rather than requiring modification of the entire slice header structure, thus avoiding bitrate increase while achieving repositioning functionality.
Solution Approach 2:
Tile identifiers are introduced as an intermediary mechanism between the slice header and the actual tile data. Instead of rewriting slice headers to reposition content, the system uses tile identifiers to reference and reposition tiles independently, eliminating the need for header rewriting and associated bitrate penalties.
2Adaptability or versatility
If slice headers are rewritten to reposition slices, then repositioning functionality is achieved, but computational time and resources increase
Solution Approach 1:
Tiles are pre-identified and assigned unique identifiers during the encoding phase, before any repositioning operations are needed. This preliminary action creates a ready-to-use addressing system that allows rapid repositioning through simple identifier reference rather than complex header rewriting operations, significantly reducing computational time.
Solution Approach 2:
Instead of physically rewriting slice headers to reposition content, the system creates logical copies or references to tile identifiers. This allows multiple repositioning operations to be performed by simply referencing the same tile identifier data without actual data movement or header modification, minimizing computational overhead.
3Device complexity
If traditional block indexing is used to indicate slice position, then the encoding structure is simple, but repositioning operations become complex and inefficient
Solution Approach 1:
The system changes the addressing parameter from block index (position-based) to tile identifier (object-based). This parameter change transforms the repositioning operation from a complex header rewriting task to a simple identifier reference task, greatly improving ease of operation while maintaining encoding structure simplicity through the use of compact identifier fields.
Data Source
AI summary
An apparatus includes circuitry configured to: receive a sequence of pictures; encode a picture among the sequence of pictures as one or more slices and one or more tiles, wherein a slice comprises an integer number of tiles or is included in a tile; encode, into a slice header of a slice of the one or more slices, a subpicture identifier indicative of a subpicture that comprises the slice; wherein the subpicture identifier is indicative of a subpicture position for the subpicture comprising the slice, the subpicture identifier being among one or more subpicture identifiers indicative of one or more subpicture positions for one or more subpictures comprising one or more slices; and wherein the subpicture is an independently decodable spatiotemporal unit characterized in that a sequence of collocated subpictures is decodable independently of other subpictures.