Palette Mode Image Encoding Using Run-Value Information
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing demand for high-resolution and high-quality images leads to a significant increase in transmission and storage costs due to the large amount of information required, necessitating the development of high-efficient image compression technologies.
Innovation Solution
An image encoding/decoding method and apparatus based on a palette mode that utilizes run-value information of a reuse palette predictor, allowing for efficient encoding and decoding by constructing a palette table and index map from the bitstream, and independently parsing run-value information to optimize data transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If high-resolution and high-quality image data is transmitted and stored, then image quality is improved, but transmission cost and storage cost increase
Solution Approach 1:
The patent changes the parameter representation by converting image data into a palette-based format where colors are represented by indices rather than full color values. This parameter transformation reduces the amount of data needed to represent the same visual information, directly addressing the contradiction between maintaining image quality and reducing transmission/storage requirements
Solution Approach 2:
The patent creates a palette table that serves as a reference copy of color information, allowing multiple pixels to reference the same color entry. Instead of storing complete color data for every pixel, the system stores compact palette index values that point to the actual color definitions in the palette table, significantly reducing data quantity while preserving visual quality
2Manufacturing precision
If palette prediction information is encoded for each block, then encoding precision is improved, but device complexity increases
Solution Approach 1:
The patent performs preliminary action by constructing and storing a palette table in advance before encoding the actual image blocks. This pre-computed palette serves as a reference that simplifies subsequent block encoding operations, as the encoder can directly reference pre-defined color entries rather than computing color representations in real-time, thereby reducing encoding complexity while maintaining precision
Solution Approach 2:
The palette table serves multiple functions: it acts as a color reference for prediction, a compression dictionary for index mapping, and a shared resource across multiple blocks. This multi-functionality allows the system to achieve high encoding precision through palette prediction while avoiding the complexity of separate encoding mechanisms for each block
3Speed
If run-value information is parsed independently, then processing speed is improved, but loss of information increases
Solution Approach 1:
The patent segments the encoding process into independent components: palette table construction, run-value information generation, and block encoding. By segmenting run-value information into separate, independently parseable units that reference the stable palette table, the system enables parallel and independent processing of different blocks without information loss, as each segment contains all necessary information to reconstruct its corresponding block using the shared palette reference
Data Source
AI summary
An image encoding/decoding method and apparatus are provided. The image decoding method comprises obtaining palette prediction information and palette index information of a current block from a bitstream, constructing a palette table for the current block based on the palette prediction information, generating a palette index map for the current block based on the palette index information, and decoding the current block based on the palette table and the palette index map. The palette prediction information may comprise run-value information specifying a first palette entry reused in the palette table among palette entries in the palette predictor for the current block, the run-value information may be obtained from the bitstream only when an index value of the first palette entry is smaller than a first size of the palette predictor, and last run-value information of the palette predictor may have a first value for terminating search of the first palette entry, based on the first palette entry being a last reused palette entry in the palette table.