Quantization Codebook Constraint for Efficient Multidimensional Encoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In encoding with a combination of Huffman encoding and multidimensional encoding, the appearance probability of predetermined quantization values is not constrained to improve encoding efficiency.

Innovation Solution

An encoder and decoder that constrain the appearance probability of a predetermined quantization value to 0, using a constraint code book with variable length codes that increase in length as appearance probability decreases, allowing for improved encoding efficiency by optimizing code allocation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If Huffman encoding and multidimensional encoding are combined, then encoding efficiency is improved, but the code book becomes bigger as the number of dimensions increases

Engineering Contradiction:
Improveencoding efficiencyVSAvoidcode book size
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent extracts and removes the predetermined quantization value (typically zero values) from the encoding process by constraining its appearance probability to 0. This eliminates the need to allocate code words for these frequent but redundant values, thereby reducing code book size while maintaining encoding efficiency for the remaining quantization values

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent applies different encoding strategies to different parts of the quantization value distribution. By identifying that certain quantization values (predetermined ones) have specific characteristics (high appearance probability but low information content), it applies a constraint specifically to these local elements rather than treating all quantization values uniformly, thus optimizing the overall code book structure

Inventive Principle:
Principle #3Local quality

2Productivity

If variable length codes are allocated based on appearance probability, then encoding efficiency is improved, but more bits are required for quantization values with lower appearance probability

Engineering Contradiction:
Improveencoding efficiencyVSAvoidcode length
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent converts the harmful effect of having to allocate long codes to low-probability values by eliminating the need to encode predetermined high-probability values (constraining their probability to 0). This transforms the problem into a benefit where the most frequently occurring values require no encoding bits at all, and the remaining values can use optimized variable length codes

Inventive Principle:
Principle #22Blessing in disguise (Convert harm into benefit)

Data Source

PatentUS10255925B2Encoder and encoding method, decoder and decoding method, and program
Publication Date: 2019.04.09 SONY GROUP CORP
  • US10255925B2 patent drawing
  • US10255925B2 patent drawing
  • US10255925B2 patent drawing

AI summary

The present technology relates to an encoder and an encoding method, a decoder and a decoding method, and a program by which encoding efficiency is able to be improved by constraining an appearance probability of a predetermined quantization value of an encoding target to 0 when encoding with a combination of Huffman encoding and multidimensional encoding is performed.