Flexible quantization

Microsoft Corporation C. 186513 ουν» njjwiab fimaw ww b\y v>»a

Flexible Quantization WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00021.tif" id="idf0001" />

FLEXIBLE QUANTIZATION

Background 1. Block Transform-Based Coding

Transform coding is a compression technique used in many audio, image 5 and video compression systems. Uncompressed digital image and video is typically represented or captured as samples of picture elements or colors at locations in an image or video frame arranged in a two-dimensional (2D) grid.

This is referred to as a spatial-domain representation of the image or video. For example, a typical format for images consists of a stream of 24-bit color picture 10 element samples arranged as a grid. Each sample is a number representing color components at a pixel location in the grid within a color space, such as RGB, or YIQ, among others. Various image and video systems may use various different color, spatial and time resolutions of sampling. Similarly, digital audio is typically represented as time-sampled audio signal stream. For example, a typical audio 15· format cpnsists of a stream of 16-bit amplitude samples of an audio signal taken at regular time intervals.

Uncompressed digital audio, image and video signals can consume considerable storage and transmission capacity. Transform coding reduces the size of digital audio, images and video by transforming the spatial-domain 20 representation of the signal into a frequency-domain (or other like transform domain) representation, and then reducing resolution of certain generally less perceptible frequency components of the transform-domain representation. This generally produces much less perceptible degradation of the digital signal compared to reducing color or spatial resolution of images or video in the spatial 25 domain, or of audio in the time domain.

More specifically, a typical block transform-based codec 100 shown in

Figure 1 divides the uncompressed digital image’s pixels into fixed-size two dimensional blocks (Xh ... Xn), each block possibly overlapping with other blocks. A linear transform 120-121 that does spatial-frequency analysis is applied to each 30 block, which converts the spaced samples within the block to a set of frequency (or transform) coefficients generally representing the strength of the digital signal in 1 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00022.tif" id="idf0002" />

corresponding frequency bands over the block interval. For compression, the transform coefficients may be selectively quantized 130 (i.e., reduced in resolution, such as by dropping’ least significant bits of the coefficient values or otherwise mapping values in a higher resolution number set to a lower resolution), and also 5 entropy or variable-length coded 130 into a compressed data stream. At decoding, the transform coefficients will inversely transform 170-171 to nearly reconstruct the original color/spatial sampled image/video signal (reconstructed blocks Xp...Xn).

The block transform 120-121 can be defined as a mathematical operation on 10 a vector x of size N. Most often, the operation is a linear multiplication, producing the transform domain output y — Mx, M being the transform matrix. When the input data is arbitrarily long, it is segmented into N sized vectors and a block transform is applied to each segment. For the purpose of data compression, reversible block transforms are chosen. In other words, the matrix M is invertible. 15 In multiple dimensions (e.g., for image and video), block transforms are typically implemented as separable operations. The matrix multiplication is applied separably along each dimension of the data (i.e., both rows and columns).

For compression, the transform coefficients (components of vector y) may be selectively quantized (i.e., reduced in resolution, such as by dropping least 20 significant bits of the coefficient values or otherwise mapping values in a higher resolution number set to a lower resolution), and also entropy or variable-length coded into a compressed data stream.

At decoding in the decoder 150, the inverse of these operations (dequantization/entropy decoding 160 and inverse block transform 170-171) are 25 applied on the decoder 150 side, as show in Fig. 1. While reconstructing the data, the inverse matrix M1 (inverse transform 170-171) is applied as a multiplier to the transform domain data. When applied to the transform domain data, tlie inverse transform nearly reconstructs the original time-domain or spatial-domain digital media. 30 In many block transform-based coding applications, the transform is desirably reversible to support both lossy and lossless compression depending on 2 WO 2007/13058« PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00023.tif" id="idf0003" />

the quantization factor. With no quantization (generally represented as a quantization factor of 1) for example, a codec utilizing a reversible transform can exactly reproduce the input data at decoding. However, the requirement of reversibility in these applications constrains the choice of transforms upon which 5 the codec can be designed.

Many image and video compression systems, such as MPEG and Windows Media, among others, utilize transforms based on the Discrete Cosine Transform (DCT). The DCT is known to have favorable energy compaction properties that result in near-optimal data compression. In these compression systems, the inverse 10 DCT (IDCT) is employed in the reconstruction loops in both the encoder and the decoder of the compression system for reconstructing individual image blocks. 2. Quantization

According to one possible definition, quantization is a term used for an approximating non-reversible mapping function commonly used for lossy 15 compression, in which there is a specified set of possible output values, and each member of the set of possible output values has an associated set of input values that result in the selection of that particular output value. A variety of quantization techniques have been developed, including scalar or vector, uniform or non-uniform, with or without dead zone, and adaptive or non-adaptive quantization. 20 The quantization operation is essentially a biased division by a quantization parameter QP which is performed at the encoder. The inverse quantization or multiplication operation is a multiplication by QP performed at the decoder. These processes together introduce a loss in the original transform coefficient data, which shows up as compression errors or artifacts in the decoded image. In a simplistic 25 codec, a certain fixed value of QP can be applied to all transform coefficients in a frame. While this may be an acceptable solution in some cases, it has several deficiencies:

The human visual system is not equally sensitive to all frequencies, or to all spatial locations within a frame, or to all luminance and chrominance channels. 30 Using different QP values for different coefficients may provide a visually superior 3 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00024.tif" id="idf0004" />

encoding even with the same or smaller number of compressed bits. Likewise, other error metrics can be suitably optimized as well.

Rate control or the ability of an encoder to produce a compressed file of a desired size is not easy to perform with a single QP across the entire frame. 5 It is therefore desirable to allow the encoder to vary QP across the image in an arbitrary manner. · However, this means that the actual value of QP used for each data partition should be signaled in the bitstream. This leads to an enormous overhead just to carry the QP signaling information, making it unsuitable in practice. What is desired is a flexible yet bit-economic means of signaling QP, 10 particularly for commonly encountered scenarios.

In summary, quantization is the primary mechanism for most image and video codecs to control compressed image quality and compression ratio. Quantization methods supported by most popular codecs provide few features or little flexibility, or incur significant overhead of additional bits. Often, an image or 15 a video frame is usually quantized uniformly, or with limited ability to vary quantization over spatial locations. This lack of flexibility hurts compression quality, and prevents accurate rate control on the fly. On the other hand, some codecs provide nearly unrestricted freedom in supporting quantization methods. Encoding to signal use of different quantizers takes additional bits in the encoded 20 media, and could itself adversely affect compression efficiency. Further, the process of building a conformant decoder requires a large number of test passes generated by all possible combinations of the quantizer methods, which can be onerous.

Summary 25 The following Detailed Description presents variations of a flexible quantization technique that provides the ability to vary quantization along various dimensions of the encoded digital media data. For example, one representative implementation of the flexible quantization technique can vaiy quantization over three dimensions — over (i) spatial locations, (ii) frequency sub bands, and (iii) 30 color channels. The Detailed Description further presents ways to efficiently signal the flexible quantization in the encoded digital media data. The benefit of this 4 WO 2007/130580 PCT/US2007/0J0848

<img img-format="tif" img-content="drawing" file="IL194133AD00025.tif" id="idf0005" />

quantization approach is that the overhead incurred by quantization related side information is minimized for the primary usage scenarios, while allowing maximum flexibility if desired by the encoder.

This Summary is provided to introduce a selection of concepts in a 5 simplified form that is further described below in the Detailed Description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter. Additional features and advantages of the invention will be made apparent from the following detailed description of embodiments that 10 proceeds with reference to the accompanying drawings.

Brief Description Of The Drawings

Figure 1 is a block diagram of a conventional block transform-based codec in the prior art.

Figure 2 is a flow diagram of a representative encoder incorporating the 15 block pattern coding.

Figure 3 is a flow diagram of a representative decoder incorporating the block pattern coding.

Figure 4 is a table containing a pseudo-code definition for signaling of a DC quantizer according to a flexible quantization technique. 20 Figure 5 is a table containing a pseudo-code definition for signaling of a low-pass quantizer according to the flexible quantization technique.

Figure 6 is a table containing.a pseudo-code definition for signaling of a high-pass quantizer according to the flexible quantization technique.

Figure 7 is a table containing a pseudo-code definition for signaling of 25 quantizers at a frame layer according to the flexible quantization technique.

Figure 8 is a table containing a pseudo-code definition for signaling of quantizers at a tile layer in spatial mode according to the flexible quantization technique.

Figure 9 is a table containing a pseudo-code definition for signaling of 30 quantizers of a DC sub-band at the tile layer in frequency mode according to the flexible quantization technique. 5 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00026.tif" id="idf0006" />

Figure 10 is a table containing a pseudo-code definition for signaling of quantizers of a low-pass sub-band at the tile layer in frequency mode according to the flexible quantization technique.

Figure 11 is a table containing a pseudo-code definition for signaling of 5 quantizers of a high-pass sub-band at the tile layer in frequency mode according to the flexible quantization technique.

Figure 12 is a table containing a pseudo-code definition for signaling of quantizers at a macroblock layer in spatial mode according to the flexible quantization technique. 10 Figure 13 is a table containing a pseudo-code definition for signaling of low- pass quantizers at the macroblock layer in frequency mode according to the flexible quantization technique.

Figure 14 is a table containing a pseudo-code definition for signaling of high-pass quantizers at the macroblock layer in frequency mode according to the 15 flexible quantization technique.

Figure 15 is a block diagram of a suitable computing environment for implementing a media encoder/decoder with flexible quantization.

Detailed Description

The following description relates to coding and decoding techniques that 20 provide efficient flexible quantization that can vary the quantization applied along spatial, frequency and color dimensions (referred to herein as “Flexible Quantization”). The following description describes an example implementation of the technique in the context of a digital media compression system or codec. The digital media system codes digital media data in a compressed form for 25 transmission or storage, and decodes the data for playback or other processing. For purposes of illustration, this exemplaiy compression system incorporating this flexible quantization is an image or video compression system. Alternatively, the technique also can be incorporated into compression systems or codecs for other 2D data. The flexible quantization technique does not require that the digital media 30 compression system encodes the compressed digital media data in a particular coding format. 6 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00027.tif" id="idf0007" />

1. Encoder/Decoder

Figures 2 and 3 are a generalized diagram of the processes employed in a representative 2-dimensional (2D) data encoder 200 and decoder 300. The diagrams present a generalized or simplified illustration of a compression system 5 incorporating the 2D data encoder and decoder that implement the block pattern coding. In alternative compression systems using the block pattern coding, additional or fewer processes than those illustrated in this representative encoder and decoder can be used for the 2D data compression. For example, some encoders/decoders may also include color conversion, color formats, scalable 10 coding, lossless coding, macroblock modes, etc. The compression system (encoder and decoder) can provide lossless and/or lossy compression of the 2D data, depending on the quantization which may be based on a quantization parameter varying from lossless to lossy.

The 2D data encoder 200 produces a compressed bitstream 220 that is a 15 more compact representation (for typical input) of 2D data 210 presented as input to the encoder. For example, the 2D data input can be an image, a frame of a video sequence, or other data having two dimensions. The 2D data encoder divides a frame of the input data into blocks (illustrated generally in Figure 2 as partitioning 230), which in the illustrated implementation are non-overlapping 4x4 pixel blocks 20 that form a regular pattern across the plane of the frame. These blocks are grouped in clusters, called macroblocks, which are 16x16 pixels in size in this representative encoder. In turn, the macroblocks are grouped into regular structures called tiles. The tiles also form a regular pattern over the image, such that tiles in a horizontal row are of uniform height and aligned, and tiles in a vertical column are of uniform 25 width and aligned. In the representative encoder, the tiles can be any arbitrary size that is a multiple of 16 in the horizontal and/or vertical direction. Alternative encoder implementations can divide the image into block, macroblock, tiles, or other units of other size and structure. A “forward overlap” operator 240 is applied to each edge between blocks, 30 after which each 4x4 block is transformed using a block transform 250. This block transform 250 can be the reversible, scale-free 2D transform described by 7 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00028.tif" id="idf0008" />

Srinivasan, U.S, Patent Application No. 11/015,707, entitled, “Reversible Transform For Lossy And Lossless 2-D Data Compression,” filed December 17, 2004. The overlap operator 240 can be the reversible overlap operator described by Tu et al., U.S. Patent Application No. 11/015,148, entitled, “Reversible Overlap

5 Operator for Efficient Lossless Data Compression/’ filed December 17,2004; and by Tu et al., U.S. Patent Application No. 11/035,991, entitled,. “Reversible 2-Dimensional Pre-/Post-Filtering For Lapped Biorthogonal Transform,” filed January 14, 2005. Alternatively, the discrete cosine transform or other block transforms and overlap operators can be used. Subsequent to the transform, the DC 10 coefficient 260 of each 4x4 transform block is subject to a similar processing chain (tiling, forward overlap, followed by 4x4 block transform). The resulting DC transform coefficients and the AC transform coefficients are quantized 270, entropy coded 280 and packetized 290.

The decoder performs the reverse process. On the decoder side, the 15 transform coefficient bits are extracted 310 from their respective packets, from which the coefficients are themselves decoded 320 and dequantized 330. The DC coefficients 340 are regenerated by applying an inverse transform, and the plane of DC coefficients is “inverse overlapped” using a suitable smoothing operator applied across the DC block edges. Subsequently, the entire data is regenerated by 20 applying the 4x4 inverse transform 350 to the DC coefficients, and the AC coefficients 342 decoded from the bitstream. Finally, the block edges in the resulting image planes are inverse overlap filtered 360. This produces a reconstructed 2D data output.

In an exemplary implementation, the encoder 200 (Figure 2) compresses an 25 input image into the compressed bitstream 220 (e.g., a file), and the decoder 300 (Figure 3) reconstructs the original input or an approximation thereof, based on whether lossless or lossy coding is employed. The process of encoding involves the application of a forward lapped transform (LT) discussed below, which is implemented with reversible 2-dimensional pre-/post-filtering also described more 30 fully below. The decoding process involves the application of the inverse lapped transform (ILT) using the reversible 2-dimensional pre-/post-filtering. 8 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD00029.tif" id="idf0009" />

The illustrated LT and the ILT are inverses of each other, in an exact sense, and therefore can be collectively referred to as a reversible lapped transform. As a reversible transform, the LTZELT pair can be used for lossless image compression.

The input data 210 compressed by the illustrated encoder 200/decoder 300 5 can be images of various color formats (e.g., RGB/YUV4:4:4, YUV4:2:2 or YUV4:2:0 color image formats). Typically, the input image always has a luminance (Y) component. If it is a RGB/YUV4:4:4, YUV4:2:2 or YUV4:2:0 image, the image also has chrominance components, such as a U component and a V component. The separate color planes or components of the image can have ί 0 different spatial resolutions. In case of an input image in the YUV 4:2:0 color format for example, the U and V components have half of the width and height of the Y component.

As discussed above, the encoder 200 tiles the input image or picture into macroblocks. In an exemplary implementation, the encoder 200 tiles the input 15 image into 16x16 pixel areas (called “macroblocks”) in the Y channel (which may be 16x16, 16x8 or 8x8 areas in the U and V channels depending on the color format). Each macroblock color plane is tiled into 4x4 pixel regions or blocks. Therefore, a macroblock is composed for the various color formats in the following manner for this exemplary encoder implementation: 20 1. For a grayscale image, each macroblock contains 16 4x4 luminance (Y) blocks. 2. For a YUV4:2:0 format color image, each macroblock contains 16 4x4 Y blocks, and 4 each 4x4 chrominance (U and V) blocks.

3. For a YUV4:2:2 format color image, each macroblock contains 16 4x4 Y 25 blocks, and 8 each 4x4 chrominance (U and V) blocks. 4. For a RGB or YUV4:4:4 color image, each macroblock contains 16 blocks each of Y, U and V channels.

Accordingly, after transform, a macroblock in this representative encoder 200/decoder 300 has three frequency sub bands: a DC sub band (DC macroblock), 30 a low pass sub band (low pass macroblock), and a high pass sub band (high pass 9 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000210.tif" id="idf0010" />

macroblock). In the representative system, the low pass and/or high pass sub bands are optional in the bitstream - these sub bands may be entirely dropped.

Further, the compressed data can be packed into the bitstream in one of two orderings: spatial order and frequency order. For the spatial order, different sub 5 bands of the same macroblock within a tile are ordered together, and the resulting bitstream of each tile is written into one packet. For the frequency order, the same sub band from different macroblocks within a tile arc grouped together, and thus the bitstream of a tile is written into three packets: a DC tile packet, a low pass tile packet, and a high pass tile packet. In addition, there may be other data layers. 10 Thus, for the representative system, an image is organized in the following “dimensions”:

Spatial dimension : Frame —► Tile —► Macroblock;

Frequency dimension : DC | Low pass [ High pass; and

Channel dimension: Luminance | Chrominance_0 | Chrominance_l ... (e.g. as Y | 15 U|V).

The arrows above denote a hierarchy, whereas the vertical bars denote a partitioning.

Although the representative system organizes the compressed digital media data in spatial, frequency and channel dimensions, the flexible quantization 20 approach described here can be applied in alternative encoder/decoder systems that organize their data along fewer, additional or other dimensions. For example, the flexible quantization approach can be applied to coding using a larger number of frequency bands, other format of color channels (e.g., YIQ, RGB, etc.), additional image channels (e.g., for stereo vision or other multiple camera arrays). 25 2. Flexible Quantization Overview

In the representative encoder/decoder, the quantization operation is essentially a biased division by a quantization parameter QP which is performed at the encoder. The inverse quantization or multiplication operation is a multiplication by QP performed at the decoder. However, alternative 30 implementations of the flexible quantization described herein can utilize other forms of quantization, including uniform and non-uniform, scalar or vector, with or 10 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000211.tif" id="idf0011" />

without dead zone, etc. The quantization/inverse quantization processes together introduce a loss in the original transform coefficient data, which shows up as compression errors or artifacts in the decoded image. In a simplistic codec, a certain fixed value of QP can be applied to all transform coefficients in a frame. 5 While this may be an acceptable solution in some cases, it has several deficiencies:

The human visual system is not equally sensitive to all frequencies, or to all spatial locations within a frame, or to atl luminance and chrominance channels. Using different QP values for different coefficients may provide a visually superior encoding even with the same or smaller number of compressed bits. Likewise, 10 other error metrics can be suitably optimized as well.

Rate control or the ability of an encoder to produce a compressed file of a desired size is not easy to perform with a single QP across the entire frame.

Ideally therefore, it should be possible to allow the encoder to vary QP across the image in an arbitrary manner. However, this means that the actual value 15 of QP used for each data partition (macroblock/tile/channel/sub band, etc.) should be signaled in the bitstream. This leads to an enormous overhead just to carry the QP signaling information, making it unsuitable in practice. What is desired is a flexible yet bit-economic means of signaling QP, particularly for commonly encountered scenarios. 20 The flexible quantization technique described herein provides the ability to vary quantization along various partitions or dimensions of the encoded digital media data. For example, one implementation of the flexible quantization technique in the representative encoder 200/decoder 300 system can vary quantization over three dimensions - over (i) spatial locations, (ii) frequency sub . 25 bands, and (iii) color channels. However, quantization can be varied over fewer, additional or other dimensions or partitions of the data in other alternative implementations of the flexible quantization technique. This technique also includes ways to efficiently signal the flexible quantization in the encoded media data. The benefit of this quantization approach is that the overhead incurred by 30 quantization related side information is minimized for the primary usage scenarios, while allowing maximum flexibility if desired by the encoder. '11 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000212.tif" id="idf0012" />

The flexible quantization technique provides fine spatial granularity control of the quantization. In one particular implementation, the flexible quantization allows control over quantization applied to the frame, tile, or down to the macroblock. If the frame is not quantized uniformly, then each tile can be 5 quantized uniformly; if a tile is not quantized uniformly, then each macroblock will be quantized differently.

The flexible quantization further allows quantization control along the frequency sub band dimension. In one particular implementation, the flexible quantization includes a sub band mode to specify a quantization relationship among 10 frequency sub bands. The sub bands can be quantized uniformly, or partially uniformly (low pass sub band using DC sub band quantizer, and/or high pass sub band using low pass quantizer), or independently.

The flexible quantization also allows control over quantization applied along the channel dimension of the data. In one particular implementation, the flexible 15 quantization includes a channel mode to specify a quantization relationship among color channels. The channels can be quantized uniformly, or partially uniformly (chrominance channels uniformly but luminance independently), or independently.

The flexible quantization described herein also provides techniques to efficiently signal in side information of the compressed digital media data, 20 combinations of the above quantization control over spatial, frequency sub band and channel that are of significance to the primary usage scenarios. Further, the flexible quantization technique provides a way to efficiently define choice of quantizer by indexing from a defined subset of possible quantizers in the digital media data. 25 3. Flexible quantization in the spatial dimension:

In the spatial dimension, three choices are provided by the flexible quantization technique in the representative encoder/decoder; • The entire frame can be coded using the same quantization rule. • Else, an entire tile can be coded using the same quantization rule and 30 different tiles within the frame can use different quantization rules. 12 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000213.tif" id="idf0013" />

• Else, each macroblock within a tile can be coded using the same quantization rule and different macroblocks within the tile can use different quantization rules.

One means of signaling these possibilities is as follows: A binary signal is 5 sent in the bitstream at the frame level indicating whether the first possibility is true. If not, a fixed length symbol is sent in the bitstream within each tile indicating the number of quantization rules used for this tile. If the tile uses more than 1 quantization rule; then a variable length symbol is sent within each macroblock within the corresponding tile that indicates the quantization rule used by the 10 macroblock. The decoder interprets the bitstream in a manner consistent with the encoder.

The representative encoder 200/decoder 300 uses a variant of the above signaling. A binary signal, represented by a generic syntax element, herein labeled as *iXXX_FRAME_UNIFORM,” is only sent at the frame level (where XXX is a 15 placeholder specifying the particular frequency sub band or channel dimension of quantizer control). At the tile level, the number of distinct quantizer rules is sent in a tile-level syntax element (XXX_QUANTIZERS) only when the frame level syntax element (XXXFRAMEUNIEORM) is false. If this number is equal to 1, it means that there is only one rule and therefore all macroblocks within the tile are 20 uniformly coded with the same quantization rule (indicating choice 2), and if not it indicates choice of the third possibility. 4. Flexible quantization across frequency bands:

For flexible quantization across frequency bands, the bitstream syntax of the representative encoder 200/decoder 300 defines two switches:

, 25 - The low pass macroblock uses the same quantization rule as the DC macrobiock at the same spatial location. This corresponds to the syntax element USEJ3C_QUANTIZER. • The high pass macroblock uses the same quantization rule as the low pass macroblock at the same spatial location. This corresponds to the 3 0 syntax element USEJLP_QUANTIZER. 13 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000214.tif" id="idf0014" />

These switches are enabled at the frame layer when the entire frame uses the same quantization rule, or at the tile layer otherwise. These switches are not enabled at the macroblock layer. All macroblocks within a tile therefore obey the same rules across frequency bands. A binary symbol is sent for each of the 5 switches at the appropriate (frame or tile) layer. 5. Flexible quantization across image channels:

For flexible quantization across channels, the bitstream syntax of the representative encoder 200/decoder 300 permits three choices:

. All channels — luminance and chrominance have the same quantization 10 . rule. This is indicated by the generic syntax element XXX_CH_MODE == CHJJNIFORM. . Luminance follows one' quantization rule and all chrominance channels follow a different quantization rule, indicated by XXX_CH_MODE = CH„MIXED. 15 . All channels are free to choose different quantization rules, indicated by XXX_CH_MODE = CHJNDEPENDENT. 6. Combinatorial flexible quantization:

The representative encoder 200/decoder 300 uses a bitstream syntax defined· in the code tables shown in Figures 4-14 that can efficiently encode the particular 20 choice out of the flexible quantization options across the dimensions discussed above. With several quantization options available across each of the spatial, frequency sub band and channel dimensions, the number of permutations of the available quantization options is large. Adding to the complexity of flexible quantization across the three dimensions is the fact that the bitstream of the 25 representative encoder 200/decoder 300 can be laid out in spatial or frequency ordering. However, this does not change the available quantization options, and only affects the serialization of the signals. The syntax defined in Figures 4-14 provides an efficient coding of the combinatorial flexible quantization rules.

Some salient features of the combinatorial quantization rules as defined in 30 the syntax of the representative encoder/decoder are as follows. 14 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000215.tif" id="idf0015" />

DC quantization is not allowed to vary on a macroblock basis. This allows the differential coding of quantized DC values without having to do an inverse scaling operation. Coding the DC band of an image tile with a relatively small quantizer even when the AC (low pass and high pass) bands are coded with varying 5 quantization does not appreciably affect the bit rate.

At one end of the scale, all transform coefficients within a frame use the same quantization parameter. At the other end of the scale, low pass and high pass quantization rules for all channels are allowed to vary independently for each macroblock of the tile / frame. The only restriction is that the number of distinct 10 low pass and high pass quantizer rules (covering all channels) is each restricted to 16. Each such rule may specify independent values of quantization parameter for each channel.

Between these extremes, several combinations are permitted as specified by the syntax tables shown in Figures 4-14. 15 7. Indexing of quantizer parameters:

The specific quantization parameter (QP) in the representative encoder/decoder is based on a harmonic scale. An 8 bit value of a quantizer parameter index (QPI) corresponds to a value of QP which can be relatively large. A second level of indexing is performed so that QPIs varying across macroblocks 20 can be coded in an efficient manner.

More particularly, the encoder 200 can define a set in the bitstream containing between 1 and 16 QPI “vectors.” Each QPI vector is composed of one or more QPI values, based on which XXX_CHANNEL__MODE is chosen. Such sets are defined for DC, low pass and high pass sub bands, based on the frequency

25 band switch. Further, the DC set has only one QPI vector since only one DC quantizer is permissible in a tile-channel. The coding of these sets is defined in the tables shown in Figures 4-6.

As shown in the tables of Figures 7-11, signaling of the QPI vector sets of DC, low pass and high pass frequency sub bands occurs as follows. Based onthe 30 other coding modes, the cardinality of each set (i.e., the number of QPI vectors in the set) is indicated for low pass and high pass sub bands at the start of the 15 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000216.tif" id="idf0016" />

corresponding tile or frame. The cardinality of the DC set is 1. In the pseudo-code tables, the syntax element denoting cardinality is labeled as “XXX_QUANTIZERS.” (In practice, XXX_QUANTIZERS - 1 is sent in the bitstream.) The syntax elements labeled “XXX_QUANTIZER” in the tables 5 denotes the coding of QPI sets, which is defined in the tables shown in Figures 4-6. At the macroblock level, it is sufficient to send only the index QI of the desired QPI vector from within the QPI set. The tables in Figures 12-14 define the syntax of sending QI on a macroblock basis. The syntax element corresponding to QI is labeled, “XXX_QUANTIZER_INDEX.” A variable length code is used to 10 signal QI. First, a one bit symbol is sent indicating whether QI is zero or not. If not, then a fixed length code of length being given by ceil(Iog2(XXX„QUANTIZERS - 1)) is sent indicating the specific QI different from zero. This allows for an efficient encoding of a “default” quantization rule (QI ~ 0) with as low as one bit per macroblock. When XXX_QUANTIZERS is 1, 15 XXX_QUANTIZER_JNDEX is uniquely zero and therefore QI need not be signaled. 8. Extensions

The above description of the flexible quantization is specific to its implementation in a representative encoder and decoder, and syntax. However, the 20 principles of this technique are extensible to other digital media compression systems and formats as well. For instance, the representative encoder/decoder has only three frequency sub bands (DC, low pass and high pass). But, more generally, alternative implementations of the flexible quantization can be extended in a straightforward manner to a multitude of frequency sub bands. Likewise, 25 alternative flexible quantization implementations can vary the quantizer at finer spatial granularity, such as by sending quantization index (QI) information at the sub-macroblock (such as block) level. Many extensions to the underlying principles of the flexible quantization technique are possible within the same framework. 16 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000217.tif" id="idf0017" />

9. Computing Environment

The above-described processing techniques for flexible quantization can be realized on any of a variety of digital media encoding and/or decoding systems, including among other examples, computers (of various form factors, including 5 server, desktop, laptop, handheld, etc,); digital media recorders and players; image and video capture devices (such as cameras, scanners, etc.); communications equipment (such as telephones, mobile phones, conferencing equipment, etc.); display, printing or other presentation devices; and etc. The flexible quantization techniques can be implemented in hardware circuitry, in firmware controlling 10 digital media processing hardware, as well as in communication software executing within a computer or other computing environment, such as shown in Figure 15.

Figure 15 illustrates a generalized example of a suitable computing environment (1500) in which described embodiments may be implemented. The computing environment (1500) is not intended to suggest any limitation as to scope 15 of use or functionality of the invention, as the present invention may be implemented in diverse general-purpose or special-purpose computing environments.

With reference to Figure 15, the computing environment (1500) includes at least one processing unit (1510) arid memory (1520). In Figure 15, this most basic 20 configuration (1530) is included within a dashed line. The processing unit (1510) executes computer-executable instructions and may be a real or a virtual processor. In a multi-processing system, multiple processing units execute computer-executable Instructions to increase processing power. The memory (1520) may be volatile memory (e.g., registers, cache, RAM), non-volatile memory (e.g., ROM, 25 EEPROM, flash memory, etc.), or some combination of the two. The memory (1520) stores software (1580) implementing the described digital media encoding/decoding with flexible quantization techniques. A computing environment may have additional features. For example, the computing environment (1500) includes storage (1540), one or more input devices 30 (1550), one or more output devices (1560), and one or more communication connections (1570). An interconnection mechanism (not shown) such as a bus, 17 WO 2007/130580 PCT/US2007/010848 controller, or network interconnects the components of the computing environment (1500). Typically, operating system software (not shown) provides an operating environment for other software executing in the computing environment (1500), and coordinates activities of the components of the computing environment (1500). 5 The storage (1540) may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, CD-RWs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment (1500). The storage (1540) stores instructions for the software (1580) implementing the described digital media 10 encoding/decoding with flexible quantization techniques.

The input device(s) (1550) may be a touch input device such as a keyboard, mouse, pen, or trackball, a voice input device, a scanning device, or another device that provides input to the computing environment (1500). For audio, the input device(s) (1550) may be a sound card or similar device that accepts audio input in 15 analog or digital form from a microphone or microphone array, or a CD-ROM reader that provides audio samples to the computing environment. The output device(s) (1560) may be a display, printer, speaker, CD-writer, or another device that provides output from the computing environment (1500).

The communication connection(s) (1570) enable communication over a 20 communication medium to another computing entity. The communication medium conveys information such as computer-executable instructions, compressed audio or video information, or other data in a modulated data signal. A modulated data signal is a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. .By way of example, and not 25 limitation, communication media include wired or wireless techniques implemented with an electrical, optical, RF, infrared, acoustic, or other carrier.

The described digital media encoding/decoding with flexible quantization techniques herein can be described in the general context of computer-readable media. Computer-readable media are any available media that can be accessed 30 within a computing environment. By way of example, and not limitation, with the 18 WO 2007/130580 PCT/US2007/010848

<img img-format="tif" img-content="drawing" file="IL194133AD000218.tif" id="idf0018" />

computing environment (1500), computer-readable media include memory (1520), storage (1540), communication media, and combinations of any of the above.

The described digital media encoding/decoding with flexible quantization techniques herein can be described in the general context of computer-executable 5 instructions, such as those included in program modules, being executed in a computing environment on a target real or virtual processor. Generally, program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The functionality of the program modules may be combined or split between 10 program modules as desired in various embodiments. Computer-executable instructions for program modules may be executed within a local or distributed computing environment.

For the sake of presentation, the detailed description uses terms like “determine,” “generate,” “adjust,” and “apply” to describe computer operations in a 15 computing environment. These terms are high-level abstractions for operations performed by a computer, and should not be confused with acts performed by a human being. The actual computer operations corresponding to these terms vary depending on implementation.

In view of the many possible embodiments to which the principles of our 20 invention may be applied, we claim as our invention all such embodiments as may come within the scope and spirit of the following claims and equivalents thereto. 19 □’Ewan pp^a , crnxan ;w:n ατα inia^a pnow pnszn irn nr -jaoa ,ρνιη pxan paoana ma™ na^maa np’ioa .zrtwan rwaa mp’pan ρ-ίΛ axnria ......r. Geo&lt;su«r □innn Pi? »*···»· · ·* sw J«w\ ♦ *·*' '♦·"* · ·· 1$ Apt 212 04 $5:25 40300 .(mcna nannn) cras&amp;amp;’an nwa

<img img-format="tif" img-content="drawing" file="IL194133AD000219.tif" id="idf0019" />