ISO/IEC 15444-11:2007 情報技術— JPEG 2000画像コーディングシステム：ワイヤレス—パート11： | ページ 5

3.1

backward compatible

Includes all techniques that produce a bitstream that will lead the Part-1 decoder to decode/display according to JPEG 2000 Part 4 (ITU-T Rec. T.803 | ISO/IEC 15444-4) specifications in case of error-free environment.

3.2

backward compatible with extensions

Includes all techniques that produce a bitstream that will not lead the Part-1 decoder to crash in case of error-free environment. A JPWL decoder is required to correctly decode/display images.

3.3

big endian

The bits of a value representation occur in order from most significant to least significant.

3.4

bitstream

The sequence of bits resulting from the coding of a sequence of symbols. It does not include the markers or marker segments in the main and tile-part headers or the EOC marker. It does include any packet headers and in stream markers and marker segments not found within the main or tile-part headers.

3.5

Bit Error Rate

BER

The BER is defined as the statistical expected value of the ratio between the number of erroneous bits in the received data and the size of the received data themselves.

3.6

code-block

A rectangular grouping of coefficients from the same subband of a tile-component.

3.7

codestream

A collection of one or more bit streams and the main header, tile-part headers, and the EOC required for their decoding and expansion into image data. This is the image data in a compressed form with all of the signalling needed to decode.

3.8

data partitioning

Data partitioning is a modification of the organization of the codestream, with a separation of the compressed data in different parts.

3.9

decoder

An embodiment of a decoding process, and optionally a colour transformation process.

3.10

decoding process

A process which takes as its input all or part of a codestream and outputs all or part of a reconstructed image.

3.11

encoder

An embodiment of an encoding process.

3.12

encoding process

A process that takes as its input all or part of a source image data and outputs a codestream.

3.13

Forward Error Correction

FEC

The FEC consists of any techniques aiming at providing error detection and/or correction capability by adding redundancy to the codestream.

3.14

interleaving

Interleaving is a modification of the data ordering of a codestream.

3.15

JPWL Registration Authority

An organization that is in charge of delivering a unique ID to reference a JPWL tool and storing the parameter list of its description.

3.16

layer

A collection of compressed image data from coding passes of one, or more, code-blocks of a tilecomponent. Layers have an order for encoding and decoding that must be preserved.

3.17

little endian

The bits of a value representation occur in order from least significant to most significant.

3.18

marker

A two-byte code in which the first byte is hexadecimal FF (0xFF) and the second byte is a value between 1 (0x01) and hexadecimal FE (0xFE).

3.19

marker segment

A marker and associated (not empty) set of parameters.

3.20

non-backward compatible

Includes all techniques that produce a bitstream that may lead the JPEG 2000 Part 1 decoder to crash also in case of error-free environment. This kind of technique is outside of the scope of this Recommendation | International Standard.

3.21

packet

A part of the bitstream comprising a packet header and the compressed image data from one layer of oneprecinct of one resolution level of one tile-component.

3.22

packet header

Portion of the packet that contains signalling necessary for decoding that packet.

3.23

Packet Loss Rate

PLR

The PLR is defined as the statistical expected value of the ratio between the number of packets discarded during the transmission, and the number of packets sent during the transmission. Within this definition, it is intended that a packet is considered at transmission level, and not as a basic entity of a JPEG 2000 codestream.

3.24

pointer markers and pointer marker segments

Markers and marker segments that offer information about the location of structures in the codestream.

3.25

precinct

A rectangular region of a transformed tile-component, within each resolution level, used for limiting the size of packets.

3.26

precision

Number of bits allocated to a particular sample, coefficient, or other binary numerical representation.

3.27

systematic codes

A systematic code is one that produces a given number of redundancy symbols in addition to the original input data symbols.

3.28

tile

A rectangular array of points on the reference grid, registered with and offset from the reference grid origin and defined by a width and height. The tiles which overlap are used to define tile-components.

3.29

tile-component

All the samples of a given component in a tile.

3.30

tile index

The index of the current tile ranging from zero to the number of tiles minus one.

3.31

tile-part

A portion of the codestream with compressed image data for some, or all, of a tile. The tile-part includes at least one, and up to all, of the packets that make up the coded tile.

3.32

tile-part header

A group of markers and marker segments at the beginning of each tile-part in the codestream that describe the tile-part coding parameters.

3.33

transcoder

An embodiment of a transcoding process.

3.34

transcoding process

A process which takes as its input all or part of a codestream and outputs all or parts of it, together with the possible addition of other data.

3.35

Unequal Error Protection (UEP)

UEP refers to the act of assigning different degrees of error protection to different parts of a codestream.