# US 2001/0033620 A1 · Decoding apparatus, control method therefor, and storage medium

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

- Number: US 2001/0033620 A1
- Document ID: US20010033620A1
- Status: Published application
- Kind: A1
- Application number: 09/836,252
- Filed: 2001-04-18
- Published: 2001-10-25
- Earliest claimed: 2000-04-20
- Assignees: Canon Kabushiki Kaisha
- Inventors: Osamu Itokawa
- Web page: https://patentgrep.com/patent/US20010033620A1

## CPC

- H04N 19/587: involving temporal sub-sampling or interpolation, e.g. decimation or subsequent interpolation of pictures in a video sequence
- H04N 19/132: Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
- H04N 19/156: Availability of hardware or computational resources, e.g. encoding based on power-saving criteria
- H04N 19/167: Position within a video image, e.g. region of interest [ROI]
- H04N 19/63: using sub-band based transform, e.g. wavelets
- H04N 19/64: characterised by ordering of coefficients or of bits for transmission
- H04N 19/645: by grouping of coefficients into blocks after the transform
- H04N 19/647: {using significance based coding, e.g. Embedded Zerotrees of Wavelets [EZW] or Set Partitioning in Hierarchical Trees [SPIHT]}
- H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards
- H04N 19/89: involving methods or arrangements for detection of transmission errors at the decoder
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

This invention provides a decoding apparatus and control method therefor capable of eliminating visual flaws between frames even if several frames cannot be decoded. The first data is read out (S201), and decoding of the frame data starts (S202). During decoding processing, whether the processing time exceeds a predetermined limit time of decoding processing assigned to the packet is monitored (S204). If decoding processing does not end within the predetermined limit time, only decoded data are written in a memory (S213). This can maintain image continuity.

## Claims

### Claim 1

A decoding apparatus for decoding an input signal which includes a code stream and data having time management information about decoding of the code stream, comprising:
buffering means for buffering the input signal;
decoding means for reading out the input signal from said buffering means, decoding the input signal, and writing decoded data in a predetermined memory;
output means for outputting the decoded data from the predetermined memory; and
control means for controlling said buffering means and said decoding means on the basis of the time management information.

### Claim 2 (depends on 1)

The apparatus according to claim 1, wherein said control means checks a time necessary for decoding from the time management information, checks whether processing ends within a limit time, and when the time reaches the limit time before processing of all data ends, controls said decoding means to write decoded data in the predetermined memory.

### Claim 3 (depends on 2)

The apparatus according to claim 2, wherein when the time reaches the limit time before processing of all data ends, said control means checks whether the decoded data have an image quality not lower than a preset lowest image quality, if the image quality is not higher than the lowest image quality, newly adds time management information to add a processing time of next data to a processing time of current data, and discards the next data.

### Claim 4 (depends on 1)

The apparatus according to claim 1, wherein said decoding means reads out data from said buffering means in accordance with priority set by said control means, decodes the data, and writes the data at a position having the same priority in the predetermined memory.

### Claim 5 (depends on 4)

The apparatus according to claim 4, wherein said decoding means uses as a processing unit a tile obtained by dividing a frame at a predetermined size.

### Claim 6 (depends on 4)

The apparatus according to claim 4, wherein the priority set by said control means is determined to change for each frame so as to prevent priority at the same position from being the same between successive frames.

### Claim 7 (depends on 5)

The apparatus according to claim 5, wherein the priority set by said control means is determined to be high at a tile of each frame near a center of a screen.

### Claim 8 (depends on 2)

The apparatus according to claim 2, wherein when the time reaches the limit time before processing of all data ends, said output means outputs the decoded data written in the predetermined memory with an image size corresponding to a size of the written data.

### Claim 9 (depends on 2)

The apparatus according to claim 2, wherein when the time reaches the limit time before processing of all data ends, said control means checks whether the decoded data have an image size not smaller than a preset smallest image size, if the image size is not larger than the smallest image size, newly adds time management information to add a processing time of next data to a processing time of current data, and discards the next data.

### Claim 10

A method of controlling a decoding apparatus for decoding an input signal which includes a code stream and data having time management information about decoding of the code stream, comprising:
a buffering step of buffering the input signal in a predetermined buffer;
a decoding step of reading out the input signal from the predetermined buffer, decoding the input signal, and writing decoded data in a predetermined memory;
a output step of outputting the decoded data from the predetermined memory; and
a control step of controlling at least one of the buffering step, the decoding step, and the output step on the basis of the time management information.

### Claim 11 (depends on 10)

The method according to claim 10, wherein in the control step, a time necessary for decoding is determined from the time management information, whether processing ends within a limit time is checked, and when the time reaches the limit time before processing of all data ends, the decoding step is controlled to write decoded data in the predetermined memory.

### Claim 12 (depends on 11)

The method according to claim 11, wherein in the control step, when the time reaches the limit time before processing of all data ends, whether the decoded data have an image quality not lower than a preset lowest image quality is checked, if the image quality is not higher than the lowest image quality, time management information is newly added to add a processing time of next data to a processing time of current data, and the next data is discarded.

### Claim 13 (depends on 10)

The method according to claim 10, wherein in the decoding step, data is read out from the buffering step in accordance with priority set in the control step, decoded, and written at a position having the same priority in the predetermined memory.

### Claim 14 (depends on 13)

The method according to claim 13, wherein in the decoding step, a tile obtained by dividing a frame at a predetermined size is used as a processing unit.

### Claim 15 (depends on 13)

The method according to claim 13, wherein the priority set in the control step is determined to change for each frame so as to prevent priority at the same position from being the same between successive frames.

### Claim 16 (depends on 14)

The method according to claim 14, wherein the priority set in the control step is determined to be high at a tile of each frame near a center of a screen.

### Claim 17 (depends on 11)

The method according to claim 11, wherein in the output step, when the time reaches the limit time before processing of all data ends, the decoded data written in the predetermined memory are output with an image size corresponding to a size of the written data.

### Claim 18 (depends on 11)

The method according to claim 11, wherein in the control step, when the time reaches the limit time before processing of all data ends, whether the decoded data have an image size not smaller than a preset smallest image size is determined, if the image size is not larger than the smallest image size, time management information is newly added to add a processing time of next data to a processing time of current data, and the next data is discarded.

### Claim 19

A storage medium which stores program codes functioning as a decoding apparatus for decoding an input signal which includes a code stream and data having time management information about decoding of the code stream, comprising:
a program code of the buffering step of buffering the input signal in a predetermined buffer;
a program code of the decoding step of reading out the input signal from the predetermined buffer, decoding the input signal, and writing decoded data in a predetermined memory;
a program code of the output step of outputting the decoded data from the predetermined memory; and
a program code of the control step of controlling at least one of the buffering step, the decoding step, and the output step on the basis of the time management information.

### Claim 20 (depends on 3)

The apparatus according to claim 3, further comprising lowest image quality setting means for setting the lowest image quality.

### Claim 21 (depends on 20)

The apparatus according to claim 20, wherein said lowest image quality setting means sets the lowest image quality in accordance with processing performance of said decoding means.

### Claim 22 (depends on 21)

The apparatus according to claim 21, wherein said lowest image quality setting means sets the lowest image quality on the basis of relationship between the processing performance of said decoding means and a designated playback speed.

### Claim 23 (depends on 22)

The apparatus according to claim 22, wherein the apparatus further comprises a first table representing the relationship between the playback speed and the lowest image quality, and said lowest image quality setting means sets the lowest image quality corresponding to the designated playback speed with reference to the first table.

### Claim 24 (depends on 9)

The apparatus according to claim 9, further comprising smallest image size setting means for setting the smallest image size.

### Claim 25 (depends on 24)

The apparatus according to claim 24, wherein said smallest image size setting means sets the smallest image size in accordance with processing performance of said decoding means.

### Claim 26 (depends on 25)

The apparatus according to claim 25, wherein said smallest image size setting means sets the smallest image size on the basis of relationship between the processing performance of said decoding means and a designated playback speed.

### Claim 27 (depends on 26)

The apparatus according to claim 26, wherein the apparatus further comprises a second table representing the relationship between the playback speed and the smallest image size, and said smallest image size setting means sets the smallest image size corresponding to the designated playback speed with reference to the second table.

### Claim 28 (depends on 12)

The method according to claim 12, further comprising the lowest image quality setting step of setting the lowest image quality.

### Claim 29 (depends on 28)

The method according to claim 28, wherein in the lowest image quality setting step, the lowest image quality is set in accordance with processing performance of the decoding step.

### Claim 30 (depends on 29)

The method according to claim 29, wherein in the lowest image quality setting step, the lowest image quality is set on the basis of relationship between the processing performance of the decoding step and a designated playback speed.

### Claim 31 (depends on 30)

The method according to claim 30, wherein in the lowest image quality setting step, the lowest image quality corresponding to the designated playback speed is set with reference to a first table representing the relationship between the playback speed and the lowest image quality.

### Claim 32 (depends on 18)

The method according to claim 18, further comprising the smallest image size setting step of setting the smallest image size.

### Claim 33 (depends on 32)

The method according to claim 32, wherein in the smallest image size setting step, the smallest image size is set in accordance with processing performance of the decoding step.

### Claim 34 (depends on 33)

The method according to claim 33, wherein in the smallest image size setting step, the smallest image size is set on the basis of relationship between the processing performance of the decoding step and a designated playback speed.

### Claim 35 (depends on 34)

The method according to claim 34, wherein in the smallest image size setting step, the smallest image size corresponding to the designated playback speed is set with reference to a second table representing the relationship between the playback speed and the smallest image size.
