# US 10,455,246 B2 · Image coding method and image decoding method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,455,246 B2
- Document ID: US10455246B2
- Status: Granted
- Kind: B2
- Application number: 16/180,125
- Filed: 2018-11-05
- Published: 2019-03-07
- Granted: 2019-10-22
- Earliest claimed: 2009-10-29
- Assignees: Sun Patent Trust
- Applicants: Sun Patent Trust
- Inventors: Takeshi Tanaka; Hisao Sasai
- Web page: https://patentgrep.com/patent/US10455246B2

## CPC

- H04N 19/44: Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
- H03M 7/4006: {Conversion to or from arithmetic code}
- H03M 7/4018: {Context adapative binary arithmetic codes [CABAC]}
- H04N 19/13: Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/194: involving only two passes
- H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence)
- H04N 19/61: in combination with predictive coding
- H04N 19/91: Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

An image coding method for improving coding efficiency by using more appropriate probability information is provided. The image coding method includes: a first coding step of coding a first set of blocks included in a first region sequentially based on first probability information; and a second coding step of coding a second set of blocks included in a second region sequentially based on second probability information. In the first coding step, the first probability information is updated depending on data of a target block to be coded, after coding the target block and before coding a next target block. In the second coding step, the second probability information is updated depending on the first probability information updated in the first coding step, before coding the first target block.

## Claims

### Claim 1

An integrated circuit that decodes an image having a plurality of blocks, said integrated circuit comprising
decoding circuitry which, in operation, decodes the blocks sequentially based on probability information indicating a data occurrence probability,
wherein said decoding circuitry updates the probability information depending on data of a first target block to be decoded among the blocks, after decoding the first target block and before decoding a second target block to be decoded next among the blocks, and
wherein said decoding circuitry decodes a third target block in the blocks based on the probability information (i) which is updated depending on the data of the first target block, the first target block being a neighboring block above the third target block and (ii) which is not updated depending on the data of the second target block, and
wherein the third target block (i) is located on a left end of the image, (ii) is different from the second target block, and (iii) is decoded after decoding the first target block.