20240040124. FLEXIBLE COEFFICIENT CODING IN VIDEO COMPRESSION simplified abstract (Apple Inc.)

FLEXIBLE COEFFICIENT CODING IN VIDEO COMPRESSION

Organization Name

Apple Inc.

Inventor(s)

Alican Nalci of Cupertino CA (US)

Yunfei Zheng of Santa Clara CA (US)

Hilmi Enes Egilmez of Santa Clara CA (US)

Yeqing Wu of Cupertino CA (US)

Yixin Du of Milpitas CA (US)

Alexandros Tourapis of Los Gatos CA (US)

Jun Xin of San Jose CA (US)

Hsi-Jung Wu of San Jose CA (US)

Arash Vosoughi of Cupertino CA (US)

Dzung T. Hoang of San Jose CA (US)

FLEXIBLE COEFFICIENT CODING IN VIDEO COMPRESSION - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240040124 titled 'FLEXIBLE COEFFICIENT CODING IN VIDEO COMPRESSION

Simplified Explanation

The abstract of the patent application describes a flexible coefficient coding (FCC) approach. This approach involves organizing coefficient samples within a transform unit (TU) or a prediction unit (PU) into variable coefficient groups (VCGs) based on spatial sub-regions. The shape and boundaries of the VCGs can be irregular and determined by the relative distance of coefficient samples or scan ordering within a TU. Each VCG can encode a different number of symbols for a given syntax element or a different number of syntax elements within the same TU or PU.

• The FCC approach allows for the encoding of a variable number of symbols or syntax elements depending on the type of arithmetic coding engine used.
• For multi-symbol arithmetic coding (MS-AC), a VCG can encode a different number of symbols for a syntax element.
• For binary arithmetic coders (BACs), FCC allows for coding a variable number of syntax elements in different VCGs.
• Probability models and context derivation rules can be tailored for each VCG to provide better granularity for entropy modeling.
• Different VCGs can use different entropy coders, including combinations of arithmetic coding, Golomb-Rice coding, and Huffman coding.

Potential applications of this technology:

• Video and image compression algorithms
• Data transmission and storage systems
• Multimedia streaming services
• Real-time video encoding and decoding

Problems solved by this technology:

• Efficient compression of coefficient samples in transform units or prediction units
• Improved granularity for entropy modeling in arithmetic coding
• Flexibility in encoding different numbers of symbols or syntax elements

Benefits of this technology:

• Higher compression efficiency
• Improved video and image quality
• Reduced bandwidth and storage requirements
• Faster data transmission and decoding speed

Original Abstract Submitted

a flexible coefficient coding (fcc) approach is presented. in the first aspect, spatial sub-regions are defined over a transform unit (tu) or a prediction unit (pu). these sub-regions organize the coefficient samples residing inside a tu or a pu into variable coefficient groups (vcgs). each vcg corresponds to a sub-region inside a larger tu or pu. the shape of vcgs or the boundaries between different vcgs may be irregular, determined based on the relative distance of coefficient samples with respect to each other. alternatively, the vcg regions may be defined according to scan ordering within a tu. each vcg can encode a 1) different number of symbols for a given syntax element, or a 2) different number of syntax elements within the same tu or pu. whether to code more symbols or more syntax elements may depend on the type of arithmetic coding engine used in a particular coding specification. for multi-symbol arithmetic coding (ms-ac), a vcg may encode a different number of symbols for a syntax element. for example, to encode absolute coefficient values inside a tu after performing a transform such as the discrete cosine transform (dct), a vcg region may be defined around lower-frequency transform coefficients and for that vcg m-symbols can be encoded the absolute coefficient values. another vcg region can be defined around the higher-frequency transform coefficients to encode k-symbols, where k may be different than m. for binary arithmetic coders (bacs), fcc allows for coding a variable number of syntax elements in different vcgs. in this case, one vcg in a tu may code m-syntax elements associated with signaling the absolute coefficient value, where each one of the m-syntax elements may have 2-symbols. probability models and context derivation rules may be tailored for each vcg in a given tu or pu. since each vcg may code a different number of symbols or syntax elements in different spatial locations of a tu or pu, different context models may be used for each vcg to provide better granularity for entropy modeling for arithmetic coding. furthermore, different vcgs may also use different entropy coders including combinations of arithmetic coding, golomb-rice coding, huffman coding.