Adaptive quantization for enhancement layer video coding

Description

BACKGROUND

Engineers use compression (also called coding or encoding) to reduce the bit rate of digital video. Compression decreases the cost of storing and transmitting video by converting the video into a lower bit rate form. Decompression (also called decoding) reconstructs a version of the original video from the compressed form. A “codec” is an encoder/decoder system.

Generally, much of the bit rate reduction from compression is achieved through quantization. According to one possible definition, quantization is a term used for an approximating non-reversible mapping function commonly used for lossy 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.

In many implementations, an encoder performs quantization essentially as a biased division of an original data value by a quantization factor. One or more quantization parameters (QPs) indicate the quantization factor for purposes of inverse quantization of the data value. For inverse quantization, often implemented as a multiplication operation, an encoder or decoder reconstructs a version of the data value using the quantization factor indicated by the QP(s). Quantization typically introduces loss in fidelity to the original data value, which can show up as compression errors or artifacts in the results of decoding.

Most scalable video codecs split video into a base layer and an enhancement layer. The base layer alone provides a reconstruction of the video at a lower quality level and/or a lower resolution, and the enhancement layer can be added to provide extra information that will increase the video quality. Many single-layer digital video coding standards today allow for QPs to vary spatially in the base layer. This feature allows encoding to adapt to the macroblock characteristics and thus achieve better perceptual quality for a given rate.

While the above described techniques provide acceptable performance in some instances of scalable video coding, none of them provide the advantages and benefits of the techniques and tools described below.

SUMMARY

In summary, the detailed description presents techniques and tools for scalable encoding and decoding of enhancement layer video using a spatially variable quantization. The quantization may be variable for an entire picture of the enhancement layer video or separately variable for each color channel in the enhancement layer video for the picture. The techniques and tools improve the performance of a general-purpose video encoder when it encodes an enhancement layer of video pictures.

In some embodiments, a tool such as an encoder encodes enhancement layer video for a picture organized in multiple color channels (e.g., a luma (“Y”) channel and two chroma (“U” and “V”) channels). The tool selectively varies quantization spatially over the frame, and in some cases the tool selectively varies quantization spatially and also varies quantization between the multiple color channels of the enhancement layer video for the picture. The tool outputs encoded enhancement layer video for the picture in a bitstream, signaling QP information. The QP information indicates QPs that at least in part parameterize the varied quantization of the enhancement layer video for the picture.

For corresponding decoding, a tool such as a decoder decodes enhancement layer video for a picture organized in multiple color channels. The tool receives encoded enhancement layer video for the picture in a bitstream, receiving QP information indicating QPs that at least in part parameterize varied quantization of the enhancement layer video for the picture. During inverse quantization, the tool accounts for quantization that varies spatially over the frame and between the multiple color channels of the enhancement layer video for the picture.

In other embodiments, a tool such as a video decoder receives encoded information for video for a picture from a bitstream. The encoded information includes QP selection information for a current unit of the video for the picture. When the tool decodes the current unit, the tool predicts a QP for the current unit using one or more QPs for spatially neighboring units of the video for the picture. The tool then selects between the predicted QP and another QP using the QP selection information, and uses the selected QP in reconstruction of the current unit. In some implementations, the tool decodes different information for predicted QPs for each color channel.

For corresponding encoding, a tool such as an encoder signals encoded information for video for a picture from a bitstream. The encoded information includes QP selection information for a current unit of the video for the picture. When the tool encodes the current unit, after determining a QP for the current unit, the tool encodes the QP selection information. The tool predicts a QP for the current unit using one or more QPs for spatially neighboring units of the video for the picture. If the predicted QP is the actual QP for the current unit, the QP selection information so indicates. Otherwise, the QP selection information indicates another QP for the current unit.

The foregoing and other objects, features, and advantages will become more apparent from the following detailed description, which proceeds with reference to the accompanying figures. This summary is provided to introduce a selection of concepts in a simplified form that are 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 to limit the scope of the claimed subject matter.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a suitable computing environment in which several described embodiments may be implemented.

FIG. 2 is a block diagram of an exemplary encoding system for encoding a picture of enhancement layer video quantized with one or more QPs that vary spatially and/or across color channels of the picture.

FIG. 3 is a block diagram of an exemplary decoding system for decoding a picture of enhancement layer video quantized with one or more QPs that vary spatially and/or across color channels of the picture.

FIG. 4 is a flow chart of a generalized technique for encoding enhancement layer video quantized with one or more QPs that vary spatially and/or across color channels of a picture.

FIG. 5 is a flow chart showing an exemplary technique of determining and signaling the QPs used to encode enhancement layer video quantized with one or more QPs that vary spatially and/or across color channels of a picture.

FIGS. 6A and 6B are flow charts showing exemplary techniques of signaling QPs for macroblocks of enhancement layer video for a picture, where the QPs vary spatially and/or across color channels.

FIG. 7 is a flow chart of a generalized technique for decoding enhancement layer video quantized with one or more QPs that vary spatially and/or across color channels of a picture.

FIG. 8 is a flow chart of an generalized technique for using spatial prediction to encode and signal QPs for units of video.

FIG. 9 is a flow chart of an exemplary technique of using spatial prediction to encode and signal a QP for a macroblock.

FIG. 10 is a flow chart of a generalized technique for using spatial prediction to decode QPs for units of video.

FIG. 11 is a pseudocode listing illustrating bitstream syntax for signaling/receiving information that indicates frame QP and channel QPs in first and second example combined implementations.

FIG. 12 is a pseudocode listing illustrating an example QP prediction rule in the first and second example combined implementations.

FIG. 13 is a pseudocode listing illustrating bitstream syntax for signaling/receiving information that indicates number of bits used for macroblock-level differential QP information in the first example combined implementation.

FIG. 14 is a pseudocode listing illustrating bitstream syntax for signaling/receiving QP selection information in the first example combined implementation.

FIG. 15 is pseudocode listing illustrating bitstream syntax for signaling/receiving information that indicates how to populate a table of QP values in the second example combined implementation.

FIG. 16 is a pseudocode listing illustrating bitstream syntax for signaling/receiving QP selection information in the second example combined implementation.

FIGS. 17A-F are VLC tables used for QP selection information in the second example combined implementation.

DETAILED DESCRIPTION

Techniques and tools for adapting quantization spatially and from color channel-to-channel are described herein. Depending on implementation, adapting quantization spatially and across color channels of enhancement layer video can help improve scalable video coding performance in several respects, especially for high-fidelity encoding of high bit depth video.

Many base layer video encoders adapt quantization spatially. When enhancement layer video represents quality differences between reconstructed base layer video and the original video, the energy of the signal in the enhancement layer can vary roughly in proportion to the strength of adaptive quantization in the base layer. Adapting quantization of the enhancement layer video spatially helps improve encoding performance for the enhancement layer video.

Spatially adapting quantization of enhancement layer video can have other advantages. In some scalable video encoding/decoding systems, certain areas of enhancement layer video are predicted from base layer video, while other areas of the enhancement layer video are predicted from previously reconstructed enhancement layer video, for example, using motion compensation. Using different levels of quantization in the different areas of the enhancement layer video can improve performance by allowing the encoder to adapt to the characteristics of the different areas.

Adapting quantization between color channels of enhancement layer video can also improve performance. Different video formats can use samples in different color spaces such as RGB, YUV and YCbCr. For YUV or YCbCr, Y represents the brightness (luma) channel of video, and U and V, or Cb and Cr, represent the color (chroma) channels of the video. The human eye is, in general, more sensitive to variations in brightness than color, so encoders have been developed to take advantage of this fact by reducing the resolution of the chroma channels relative to the luma channel. In the YUV color space, one chroma sampling rate is 4:4:4 which indicates that for every luma sample, a corresponding U sample and a V sample are present. Another chroma sampling rate is 4:2:2, which indicates that a single U sample and a single V sample correspond to two horizontal luma samples. Chroma sampling rates at lower resolution, such as 4:2:2 or 4:2:0, result in fewer chroma samples and typically require fewer bits to encode than higher resolution chroma sample rates, such as 4:4:4. Aside from different resolutions in different channels due to chroma sampling, each color channel in the video may be quantized to a different level of fidelity in the base layer video.

Some scalable video encoders encode base-layer video a low chroma sampling rate (e.g., 4:2:0) and/or fidelity, and encode enhancement-layer video at a higher chroma sampling rate (e.g., 4:2:2 or 4:4:4). The chroma channels of the enhancement layer video may thus have different signal energies than the luma channel. Using different levels of quantization in the different channels of the enhancement layer video can improve performance by allowing the encoder to adapt to the characteristics of the channels.

In some implementations, part or all of enhancement layer video can be remapped to a lower chroma resolution for encoding/decoding with a base layer video encoder/decoder. Adapting quantization between channels can help in this situation too. For example, if the base layer video is a tone-mapped version of the enhancement layer video, using different QPs for the luma channel, as compared to the chroma channels, can improve performance.

Techniques and tools for efficiently encoding and signaling QP values are also described herein. For example, one method of encoding and signaling QP values for enhancement layer video includes using QP prediction to exploit inter-unit, spatial redundancy in QP values. In many scenarios, this helps reduce the cost of signaling QPs for units of a picture or a color channel of the picture, where a unit is a block, macroblock, segment, or some other type of unit. Spatial QP prediction can be used in conjunction with a simple mechanism to signal whether or not quantization varies spatially over picture, or across the color channels in the picture.

Some of the techniques and tools described herein address one or more of the problems noted in the background. Typically, a given technique/tool does not solve all such problems. Rather, in view of constraints and tradeoffs in encoding time, encoding resources, decoding time, decoding resources and/or quality, the given technique/tool improves encoding and/or performance for a particular implementation or scenario.

I. Computing Environment.

FIG. 1 illustrates a generalized example of a suitable computing environment (100) in which several of the described embodiments may be implemented. The computing environment (100) is not intended to suggest any limitation as to scope of use or functionality, as the techniques and tools may be implemented in diverse general-purpose or special-purpose computing environments.

With reference to FIG. 1, the computing environment (100) includes at least one processing unit (110) and memory (120). In FIG. 1, this most basic configuration (130) is included within a dashed line. The processing unit (110) 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 (120) may be volatile memory (e.g., registers, cache, RAM), non-volatile memory (e.g., ROM, EEPROM, flash memory, etc.), or some combination of the two. The memory (120) stores software (180) implementing an encoder with one or more of the described techniques and tools for enhancement layer video coding and/or decoding using QPs that vary spatially and/or across the color channels of a picture.

A computing environment may have additional features. For example, the computing environment (100) includes storage (140), one or more input devices (150), one or more output devices (160), and one or more communication connections (170). An interconnection mechanism (not shown) such as a bus, controller, or network interconnects the components of the computing environment (100). Typically, operating system software (not shown) provides an operating environment for other software executing in the computing environment (100), and coordinates activities of the components of the computing environment (100).

The storage (140) may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment (100). The storage (140) stores instructions for the software (180) implementing the video encoder and/or decoder.

The input device(s) (150) 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 (100). For audio or video encoding, the input device(s) (150) may be a sound card, video card, TV tuner card, or similar device that accepts audio or video input in analog or digital form, or a CD-ROM or CD-RW that reads audio or video samples into the computing environment (100). The output device(s) (160) may be a display, printer, speaker, CD-writer, or another device that provides output from the computing environment (100).

The communication connection(s) (170) enable communication over a communication medium to another computing entity. The communication medium conveys information such as computer-executable instructions, audio or video input or output, 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 limitation, communication media include wired or wireless techniques implemented with an electrical, optical, RF, infrared, acoustic, or other carrier.

The techniques and tools can be described in the general context of computer-readable media. Computer-readable media are any available media that can be accessed within a computing environment. By way of example, and not limitation, with the computing environment (100), computer-readable media include memory (120), storage (140), communication media, and combinations of any of the above.

The techniques and tools can be described in the general context of computer-executable 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 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 “produce” and “encode” to describe computer operations in a 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.

II. Exemplary Encoding Tool.

FIG. 2 is a block diagram of an encoding tool (200) for encoding input video as a base layer and an enhancement layer in conjunction with which some described embodiments may be implemented. For the base layer, the format of the base layer bit stream (248) can be a Windows Media Video or VC-1 format, MPEG-x format (e.g., MPEG-1, MPEG-2, or MPEG-4), H.26x format (e.g., H.261, H.262, H.263, or H.264), or other format.

The tool (200) processes video pictures. The term “picture” generally refers to source, coded, or reconstructed image data. For progressive video, a picture is a progressive video frame. For interlaced video, a picture may refer to an interlaced video frame, the top field of the frame, or the bottom field of the frame, depending on context. The generic term “picture” will be used to represent these various options.

The encoding tool includes a first scaler (204) which accepts input video pictures (202) and outputs base layer video to a base layer encoder (220). The first scaler (204) may downsample or otherwise scale the input video pictures (202), for example, to reduce sample depth, spatial resolution or chroma sampling resolution. Or, in some instances, the first scaler upsamples the input video pictures (202) or does not alter the input video pictures (202) at all.

The base layer encoder (220) encodes the base layer video and outputs a base layer bit stream (248), and additionally makes available reconstructed base layer video which is input to an inverse scaler (252). If the reconstructed base layer video has a different bit depth, spatial resolution, chroma sampling rate, etc. than the input video pictures (202) due to scaling, then the inverse scaler (252) may upsample (or otherwise inverse scale) the reconstructed base layer video so that it has the same resolution as the input video pictures (202).

The input video pictures (202) are compared against the reconstructed base layer video to produce enhancement layer video that is input to a second scaler (254). The second scaler (254) may or may not be the same physical component or software program as the first scaler (204). The second scaler (254) outputs the enhancement layer video (256) to an enhancement layer encoder (240).

The enhancement layer encoder (240) compresses inter-coded, predicted “pictures” (256) of the enhancement layer video and intra-coded “pictures” (256) of the enhancement layer video. The “picture” at a given time in the enhancement layer video represents differences between an input video picture and a reconstructed base layer video picture, but is still encoded as a picture by the example encoder (240). For the sake of presentation, FIG. 3 shows a path for intra-coded content through the enhancement layer encoder (240) and a path for inter-coded predicted content. Many of the components of the enhancement layer encoder (240) are used for compressing both intra-coded content and inter-coded, predicted content. The exact operations performed by those components can vary depending on the type of information being compressed. Although FIG. 2 shows a single enhancement layer encoder (240), the enhancement layer video (256) can itself be separated into multiple layers of residual video for encoding with separate residual encoders. Generally, the enhancement layer video (256) that is encoded represents differences (but not necessarily all differences) between the reconstructed base layer video and the input video.

In general, within the encoder (240), inter-coded, predicted content (as a picture) is represented in terms of prediction from previously reconstructed content (as one or more other pictures, which are typically referred to as reference pictures or anchors). For example, content at a given time is encoded as a progressive P-frame or B-frame, interlaced P-field or B-field, or interlaced P-frame or B-frame. Within the encoder (240), a prediction residual is the difference between predicted information and corresponding original enhancement layer video.

If the enhancement layer video (256) content is encoded as a predicted picture, a motion estimator (258) estimates motion of macroblocks or other sets of samples of the enhancement layer video picture with respect to one or more reference pictures, which represent previously reconstructed enhancement layer video content. The picture store (264) buffers reconstructed enhancement layer video (266) as a reference picture. When multiple reference pictures are used, the multiple reference pictures can be from different temporal directions or the same temporal direction. The motion estimator (258) outputs motion information (260) such as motion vector information.

The motion compensator (262) applies motion vectors to the reconstructed enhancement layer video content (266) (stored as reference picture(s)) when forming a motion-compensated current picture (268). The difference (if any) between a block of the motion-compensated enhancement layer video (268) and corresponding block of the original enhancement layer video (256) is the prediction residual (270) for the block. During later reconstruction of the enhancement layer video, reconstructed prediction residuals are added to the motion compensated enhancement layer video (268) to obtain reconstructed content closer to the original enhancement layer video (256). In lossy compression, however, some information is still lost from the original enhancement layer video (256). Alternatively, a motion estimator and motion compensator apply another type of motion estimation/compensation.

A frequency transformer (280) converts spatial domain video information into frequency domain (i.e., spectral, transform) data. For block-based video content, the frequency transformer (280) applies a DCT, variant of DCT, or other forward block transform to blocks of the samples or prediction residual data, producing blocks of frequency transform coefficients. Alternatively, the frequency transformer (280) applies another conventional frequency transform such as a Fourier transform or uses wavelet or sub-band analysis. The frequency transformer (280) may apply an 8×8, 8×4, 4×8, 4×4 or other size frequency transform.

A quantizer (282) then quantizes the blocks of transform coefficients. The quantizer (282) applies non-uniform, scalar quantization to the spectral data with a step size that varies spatially on a picture-by-picture basis, macroblock-by-macroblock basis or other basis. Additionally, in some cases the quantizer varies quantization across color channels of the enhancement layer video picture. The quantizer (282) can also apply another type of quantization, for example, a uniform or adaptive quantization for at least some spectral data coefficients, or directly quantizes spatial domain data in an encoder system that does not use frequency transformations.

When a reconstructed enhancement layer video picture is needed for subsequent motion estimation/compensation, an inverse quantizer (290) performs inverse quantization on the quantized spectral data coefficients. An inverse frequency transformer (292) performs an inverse frequency transform, producing blocks of reconstructed prediction residuals (for predicted enhancement layer video content) or samples (for intra-coded residual video content). If the enhancement layer video (256) was motion-compensation predicted, the reconstructed prediction residuals are added to the motion-compensated predictors (268) to form the reconstructed enhancement layer video. The picture store (264) buffers the reconstructed enhancement layer video for use in subsequent motion-compensated prediction.

The entropy coder (284) compresses the output of the quantizer (282) as well as certain side information (e.g., quantization parameter values) Typical entropy coding techniques include arithmetic coding, differential coding, Huffman coding, run length coding, LZ coding, dictionary coding, and combinations of the above. The entropy coder (284) typically uses different coding techniques for different kinds of information, and can choose from among multiple code tables within a particular coding technique.

A controller (not shown) receives inputs from various modules such as the motion estimator (258), frequency transformer (280), quantizer (282), inverse quantizer (290), and entropy coder (284). The controller evaluates intermediate results during encoding, for example, setting quantization step sizes and performing rate-distortion analysis. The controller works with modules such as the motion estimator (258), frequency transformer (280), quantizer (282), and entropy coder (284) to set and change coding parameters during encoding. When an encoder evaluates different coding parameter choices during encoding, the encoder may iteratively perform certain stages (e.g., quantization and inverse quantization) to evaluate different parameter settings. The encoder may set parameters at one stage before proceeding to the next stage. Or, the encoder may jointly evaluate different coding parameters. The tree of coding parameter decisions to be evaluated, and the timing of corresponding encoding, depends on implementation. In some embodiments, the controller also receives input from an encoding session wizard interface, from another encoder application interface, or from another source to designate video as having specific content to be encoded using specific rules.

The above description explicitly addresses motion compensation for enhancement layer video. The encoder (240) additionally performs intra-compression of the enhancement layer video. In that instance, the scaler (254) provides enhancement layer video (256) to the encoder (240) and the encoder intra-compresses it as an intra-coded picture, without motion compensation. Instead, the enhancement layer video (256) is provided directly to the frequency transformer (280), quantizer (282), and entropy coder (284) and output as encoded video. A reconstructed version of the intra-coded enhancement layer video can be buffered for use in subsequent motion compensation of other enhancement layer video.

The relationships shown between modules within the encoder (240) indicate general flows of information in the encoder; other relationships are not shown for the sake of simplicity. In particular, FIG. 2 generally does not show side information indicating modes, tables, etc. used for a video sequence, picture, macroblock, block, etc. Such side information, once finalized, is sent in the output bit stream, typically after entropy encoding of the side information.

Particular embodiments of video encoders typically use a variation or supplemented version of the enhancement layer encoder (240). Depending on implementation and the type of compression desired, modules of the encoder can be added, omitted, split into multiple modules, combined with other modules, and/or replaced with like modules. For example, the controller can be split into multiple controller modules associated with different modules of the encoder. In alternative embodiments, encoders with different modules and/or other configurations of modules perform one or more of the described techniques.

III. Exemplary Decoding Tool.

FIG. 3 is a block diagram of a decoding system (300), including an exemplary enhancement layer decoder (340), in conjunction with which some described embodiments may be implemented. The system (300) includes a base layer decoder (320) which receives a base layer bit stream (302) and outputs reconstructed base layer video to a first inverse scaler (352). The base layer bit stream (302) can be a bit stream in a Windows Media Video or VC-1 format, MPEG-x format (e.g., MPEG-1, MPEG-2, or MPEG-4), H.26x format (e.g., H.261, H.262, H.263, or H.264), or other format. In certain embodiments, the base layer bit stream (302) is encoded using motion compensation, and thus the base layer decoder (320) includes a motion compensation loop. The first inverse scaler (352) is operable to upsample or otherwise inverse scale the reconstructed base layer video to the desired bit depth, spatial resolution, chroma sampling rate and/or other resolution of the output reconstructed video pictures (398).

The system further includes an enhancement layer decoder (340) operable to receive an enhancement layer bit stream (304). The enhancement layer bit stream (304) can be the same format as the base layer bit stream (302), or it may be a different format. The entropy decoder (384) is operable to decode elements of the bit stream that were encoded by entropy encoding methods including arithmetic coding, differential coding, Huffman coding, run length coding, LZ coding, dictionary coding, and combinations of the above. The entropy decoder (384) typically uses different decoding techniques for different kinds of information, and can choose from among multiple code tables within a particular decoding technique. The entropy decoder (384) outputs side information such as motion vector information (360) to a motion compensator (362).

An inverse quantizer (390) applies inverse quantization to some of the output of the entropy decoder (384). In certain embodiments, the inverse quantizer (390) is operable to reverse non-uniform scalar quantization with a step size that varies on a picture-by-picture basis, macroblock-by-macroblock basis, color channel-by-color channel basis, or some other basis. More generally, the inverse quantizer (390) is operable to reverse quantization applied during encoding.

An inverse frequency transformer (392) accepts the output of the inverse quantizer (390). The inverse frequency transformer (392) is operable to produce blocks of spatial domain values by applying an inverse DCT, variant of inverse DCT, or other reverse block transform to the output of the inverse quantizer (390). The inverse frequency transformer (392) may be operable to reverse an 8×8, 8×4, 4×8, 4×4 or some other size frequency transform. The inverse frequency transformer (392) outputs reconstructed values (370) for a prediction residual (in the case of inter-coded enhancement layer video content) or samples (in the case of intra-coded enhancement layer video content).

The motion vector information (360) output from the entropy decoder (384) is input to a motion compensator (362). The motion compensator (362) applies the motion vector information to previously reconstructed enhancement layer video buffered in a picture store (364) and outputs motion-compensation-predicted enhancement layer video (368).

In decoding of inter-coded enhancement layer video, the motion-compensation-predicted enhancement layer video (368) is combined with the prediction residuals (370) to form reconstructed enhancement layer video (366). The reconstructed enhancement layer video (366) is buffered by the picture store (364) (for use in subsequent motion compensation) and output from the enhancement layer decoder (340) to a second inverse scaler (354).

The enhancement layer decoder (340) may be operable to decode 8-bit video, 10-bit video, or video with some other bit depth. If the enhancement layer decoder (340) decodes 8-bit video and output video with a higher bit depth (e.g., 10-bit) is to be reconstructed, then the second inverse scaler (354) upsamples the reconstructed enhancement layer video (366) to the higher bit depth. Or, if the enhancement layer decoder (340) decodes 16-bit video and output video with a lower bit depth (e.g., 8-bit) is to be reconstructed, then the second inverse scaler (354) downsamples the reconstructed enhancement layer video (366) to the lower bit depth. The decoding tool combines the inverse scaled, reconstructed enhancement layer video output from the second inverse scaler (354) with the inverse scaled, reconstructed base layer video output by the first inverse scaler (352), to produce reconstructed video pictures (398) for the output video.

The above description explicitly addresses decoding of inter-coded enhancement layer video. The decoder (340), using intra-decoding, also decodes intra-coded enhancement layer video. In that instance, the entropy decoder (384), inverse quantizer (390), and inverse frequency transformer (392) act as previously mentioned to produce samples of the enhancement layer video, bypassing motion compensation. The reconstructed enhancement layer video (366) is buffered in a picture store (364) for use in future motion compensation.

The relationships shown between modules within the decoder (340) indicate general flows of information in the decoder; other relationships are not shown for the sake of simplicity. In particular, FIG. 3 generally does not show side information indicating modes, tables, etc. used for a video sequence, picture, macroblock, block, etc.

Particular embodiments of video decoders typically use a variation or supplemented version of the generalized decoder (340). Depending on implementation and the type of compression desired, modules of the decoder can be added, omitted, split into multiple modules, combined with other modules, and/or replaced with like modules. In alternative embodiments, decoders with different modules and/or other configurations of modules perform one or more of the described techniques.

Although FIG. 3 shows a single enhancement layer decoder (340), the enhancement layer video can itself be separated into multiple layers of residual video for encoding with separate residual encoders and signaling as multiple enhancement layer bit streams. A given decoding system includes one or more separate residual decoders for decoding one or more of the multiple enhancement layer bit streams. Generally, the enhancement layer video that is decoded represents differences (but not necessarily all differences) between the reconstructed base layer video and the original input video.

IV. Varying Quantization Spatially and across Channels.

According to a first set of techniques and tools, an encoder varies quantization of enhancement layer video spatially and/or across color channels of a picture. For example, the encoder varies quantization from unit-to-unit for multiple units (such as macroblocks) of enhancement layer video, potentially using different quantization in different color channels for the units. The encoder signals quantization parameters that parameterize the variable quantization. A corresponding decoder varies inverse quantization of the enhancement layer video spatially and/or across color channels of a picture.

A. Generalized Encoding Technique.

FIG. 4 shows a flow chart for a generalized technique (400) for encoding an enhancement layer video with quantization that varies spatially across a picture and/or across color channels of the picture. An encoding tool (200), such as that described with reference to FIG. 2 performs the technique (400), or some other tool may be used.

The encoding tool determines (405) whether to vary quantization spatially for a picture of enhancement layer video. This may be indicated by user input or through analysis of the picture or portions of the picture. For example, if a user desires a high degree of rate-distortion efficiency in compression, the user may direct the tool to use spatially varying QPs. Alternatively, if the picture being encoded has a high degree of complexity or spatial variance above a threshold value, then a pre-set threshold in software directs the tool to use spatially varying QPs when encoding the picture.

The tool also determines (410) whether to vary quantization between the plural color channels of the picture of enhancement layer video. The pictures can be images of various color formats (e.g., YUV or YCbCr for color space, with 4:4:4, 4:2:2 or 4:2:0 chroma sampling rate). If it is a YUV or YCbCr image, the image has a luma channel and two chroma channels. The separate channels (also called color planes or components) of the image can have different spatial resolutions. The tool may vary the QP across different color channels of the picture according to a user indication, encoder wizard setting, or through analysis of a picture, a portion of the picture, and/or one or more of the color channels.

Next, the tool encodes (420) the picture of enhancement layer video using determined QP or QPs. The tool determines one or more QPs for the picture. If the picture's QPs do not vary spatially over the picture, then only a single QP is used for the picture. If the picture's QPs do vary spatially, then a different QP is determined for each unit (e.g., macroblock, block) in the picture. Additionally, if QPs vary across the color channels of the picture, then the tool determines multiple QPs for the multiple channels, and potentially determines different QPs for each unit in the picture. For example, a different QP is determined for the luma channel and each of the chroma channels of a unit in the picture. Generally, the encoding tool applies the QP(s) to each of the units in the picture and produces an enhancement layer bit stream.

The tool outputs (430) the encoded enhancement layer bit stream, which includes information indicating the QP or QPs used. Typically, the information indicating the QP or QPs is interspersed in the bit stream with the other parameterized information for the picture or units. For example, the tool signals one or more QPs for each unit in the picture in the enhancement layer bit stream. The signaling can be done in the bit stream at the picture level or the unit level. In some implementations, the tool signals a single bit at the picture level to indicate whether QP varies spatially, and if QP varies spatially then the tool signals another bit to indicate whether QP varies across the color channels of the picture. If QP varies spatially over the picture or across the color channels of the picture, the tool signals the value(s) of the QP(s) for each of the units in the picture at the unit level of the bit stream. In this case the tool may additionally signal at the picture level how many bits are used to signal QP information for each unit at the unit level of the bit stream. Alternatively, the tool signals a table comprising different possible QP values, and then signals a selection value from the table for each of the units in the picture at the unit level in the bit stream.

The tool performs the technique (400) for a picture of enhancement layer video and repeats the technique (400) on a picture-by-picture basis. Alternatively, the tool performs the technique for a group of pictures, slice, or other section of video, and repeats the technique on that basis.

B. Exemplary Encoding Technique.

FIG. 5 shows a flowchart of an exemplary technique (500) of encoding enhancement layer video using QPs that vary spatially or across color channels of an individual frame. An encoding tool (200), such as that described with reference to FIG. 2 is used to perform the technique (500), or some other tool may be used. The tool repeats the technique (500) on a frame-by-frame basis.

The tool first determines (505) whether QP varies spatially for the frame. The tool analyzes the frame to determine whether varying QP would be acceptable or desirable according to one or more of a number of criteria such as desired rate-distortion efficiency, compression speed, degree of complexity of the frame, or other criteria. For example, a user indicates through a user interface such as an encoding wizard that a high degree of rate-distortion efficiency is desired. The tool then determines that a spatially variable QP is necessary to achieve the desired degree of rate-distortion efficiency. Alternatively, the tool determines that the complexity of the frame is above a pre-determined or user-defined threshold and thus determines that a spatially variable QP is desired.

If the tool determines that a spatially variable QP is not desired, the tool determines (510) the frame QP according to criteria such as rate constraints of the compressed file, perceptual quality and/or complexity of the input video. The tool signals (515) the frame QP in the enhancement layer bit stream.

If the tool determines that QP does vary spatially, the tool determines (520) whether QP varies across the color channels of the frame. The tool analyzes each color channel separately or together with the other color channels to determine whether varying QP would be acceptable or desirable for each color channel, according to one or more of a number of criteria such as desired rate-distortion efficiency, compression speed, degree of complexity of the frame, complexity of each channel in the frame, amount of variance within channels and between different channels, or some other criteria.

If the tool determines that QP does not vary across the color channels, the tool determines (525) QPs to use within the frame. For example, the tool determines QPs for macroblocks in the frame according to criteria such as rate constraints, perceptual quality and/or complexity of the video for the respective macroblocks.

After the tool has determined (525) QPs within the frame, the tool signals (530) the frame QP. Generally, the frame QP is the “default” QP used when encoding each macroblock in the frame. In one example, the frame QP is an average of the QPs of the macroblocks in the frame. Alternatively, the tool determines the frame QP as the most common QP in the frame to reduce the bit cost for signaling the QPs for macroblocks. For example, the tool signals that QP varies spatially, that QP does not vary across channels, and that the frame QP is signaled using x bits, and then signals the value of the frame QP itself Alternatively, the tool may signal that the frame QP is one of a number of entries in a given table (e.g., a QP table for a sequence), or the tool may signal the frame QP in some other manner.

The tool then signals (535) the QPs for the macroblocks in the frame. In one embodiment, this comprises signaling the QP for each of the macroblocks with respect to a predicted QP which can be either a frame QP or a QP that is predicted based on the QPs of one or more other, spatially adjacent macroblocks in the frame. In another embodiment, this comprises signaling the QP for each of the macroblocks as one of a plurality of values in a table.

If the tool determines that QP does vary both spatially and across color channels, then the tool determines (540) QPs to use within a first color channel of the frame. For example, the tool proceeds to determine QPs for macroblocks in the Y color channel according to criteria such as rate constraints, perceptual quality and/or complexity of the video for the respective macroblocks.

After the tool determines (540) the QPs for macroblocks in the channel, the tool signals (545) the frame QP for the channel. Generally, the frame QP for the channel is the “default” QP used when encoding each macroblock in the channel. In one example, the tool determines the frame QP for the channel by averaging the QPs of each of the macroblocks in the channel. In another example, the tool chooses the frame QP for the channel as the most commonly used QP in the channel. In one embodiment, signaling the frame QP for the channel comprises signaling that QP varies both spatially and across the different color channels in the frame, and then signaling the frame QP for the channel itself Alternatively, the frame QP for the channel may be signaled as one of several values in a QP table (e.g., a QP table for a sequence).

After the tool has signaled the frame QP for the channel, the tool checks (550) whether there are other color channels in the frame that have not been analyzed, for example, the chroma (U, V) channels. If there are, then the tool performs the determining (540) step and the signaling (545) step for the frame QP for each of the other channels. Alternatively, the tool may perform the determining step (540) for the frame QP for each of the channels before the signaling step (545) for any of the channels, or the steps may be performed in some other order.

The tool next signals (555) the QPs for macroblocks for each of the channels. In one embodiment, this comprises signaling the QP for each of the macroblocks in each of the channels with respect to a predicted QP. The predicted QP can be the channel QP, or the predicted QP can be a QP based on the QPs of one or more neighboring macroblocks in the color channel. In another embodiment, the tool signals the QP of each of the macroblocks in each of the channels as one of a plurality of QP values in a table.

In some cases, each of the color channels may not vary spatially, and so the tool indicates with a skip bit that the QPs for the macroblocks in a color channel are all equal to the frame QP for the channel at some point in the encoding process, such as at the signaling step (545) or the signaling step (555).

C. QP Signaling for Macroblocks in each Color Channel.

FIG. 6A is a flowchart showing details (600) of one approach to signaling (555) the QPs for macroblocks in each of plural color channels.

The tool signals (605) frame-level information for QP variation within one or more of the channels. For example, the tool signals at the frame level the number of bits used to define macroblock QPs relative to the frame QP for each of the channels. Alternatively, the tool signals information indicating a QP index table and populates the table with a plurality of values for different QPs, which can include the channel QP. A different table is indicated for each of the color channels or, alternatively, two or more of the color channels can share a table. Additionally, one or more of the colors channels may not vary spatially over the frame, and so only a single QP may be indicated for that channel.

On a macroblock-by-macroblock basis, the tool signals (615) information for the QP of the next macroblock. In one embodiment, the tool signals whether the actual QP of the macroblock is the same as the macroblock's predicted QP, which can be the QP of the frame for the color channel or a spatially predicted value for the QP of the macroblock. Macroblock QP prediction rules vary depending on implementation. If the actual QP is not the same as the predicted QP, the tool then signals a difference value between the QP of the macroblock and the predicted QP. Alternatively, the tool signals whether the actual QP of the macroblock is equal to the macroblock's predicted QP, which again can be the QP of the frame for the color channel or a spatially predicted QP value for the macroblock. If the macroblock QP is not equal to the predicted QP, then the tools signals that the QP of the macroblock is one of a plurality of QP values in a QP index table.

After the tool has signaled information for the QP of the macroblock in the given color channel, the tool checks (620) whether there is another color channel with a spatially varying QP. If there are one or more other color channels whose QPs have not been signaled, then the tool performs the signaling (615) step for the macroblock in the next color channel. If there is not another color channel with a spatially varying QP, the tool checks (625) whether there is another macroblock in the frame. The macroblocks can be checked according to a raster scan order or some other order. If there is another macroblock in the channel whose QPs have not been signaled, then the tool performs the signaling (615) and checking (620) steps for the next macroblock. If there is no other macroblock in the frame, then the tool is done signaling the QPs for macroblocks in each color channel of the frame.

D. QP Signaling for Macroblocks in the Frame.

FIG. 6
b is a flowchart showing details (630) of one approach to signaling (535) the spatially varying QPs of the macroblocks in the frame.

As a first step, the tool signals (635) frame-level information for QP spatial variation over the frame. For example, the tool signals at the frame level the number of bits used to define macroblock QPs relative to the frame QP. Alternatively, the tool signals information indicating a QP index table and populates the table with a plurality of values for different QPs.

On a macroblock-by-macroblock basis, the tool signals (645) information for the QP of the next macroblock. The tool signals whether the QP of the macroblock is to the same as the macroblock's predicted QP, which can be the QP of the frame or a spatially predicted value for the QP of the macroblock. Macroblock QP prediction rules vary depending on implementation. If the actual QP is not the same as the predicted QP, the tool signals a difference value between the QP of the macroblock and the predicted QP. Alternatively, if the macroblock QP is not equal to one the predicted QP, then the tool signals that the QP of the macroblock is one of a plurality of QP values in a QP index table.

After the tool has signaled information for the QP of the macroblock for the frame, the tool checks (650) whether there is another macroblock in the frame. The macroblocks can be checked according to a raster scan order or some other order. If there is another macroblock in the frame, then the tool performs the signaling (645) step for the next macroblock. If there is not another macroblock in the frame, then the tool finishes.

E. Generalized Decoding Technique.

FIG. 7 shows a general method (700) for decoding enhancement layer video with inverse quantization that varies spatially across a picture or across color channels of the picture. A decoding tool (300), such as the one described with reference to FIG. 3, is used to perform the technique (700), or some other tool may be used.

The decoding tool receives (710) encoded information in a bit stream for enhancement layer video. The encoded information includes information that indicates QPs for units (e.g., macroblocks, blocks) of a picture or its channels. In some embodiments, the tool receives information signaled according to the techniques shown in FIGS. 5, 6A and 6B, receiving syntax elements that are signaled, evaluating the syntax elements and following the appropriate conditional bit stream paths, to determine QPs that vary spatially and/or between channels of a picture. Alternatively, the tool receives QP information signaled according to another approach.

The tool then decodes (720) the enhancement layer video. In doing so, the tool varies inverse quantization (according to the signaled QP information) spatially and/or between channels for units of the enhancement layer video.

The tool performs the technique (700) for a picture of the enhancement layer video and repeats the technique on a picture-by-picture basis. Alternatively, the tool performs the technique for a group of pictures, slice, or other section of video, and repeats the technique on that basis.

V. Predictive Coding and Decoding of Quantization Parameters.

According to a second set of techniques and tools, an encoder predictively codes quantization parameters using spatial prediction. A corresponding decoder predicts the quantization parameters using spatial prediction during decoding. For example, the encoder and decoder predict a macroblock's QP using a QP prediction rule than considers QPs of spatially adjacent macroblocks within a picture or channel of a picture. Spatial prediction of QPs can be used to encode QPs that vary both spatially and between channels, or it can be used in encoding and decoding of other types of QPs.

A. Generalized Encoding.

FIG. 8 is a flowchart showing a generalized technique (800) for encoding and signaling QPs using spatial prediction. An encoding tool (200), such as that described with reference to FIG. 2 may be used to perform the method (800), or some other tool may be used. The technique (800) is described with reference to an entire picture, but the technique may be applied separately to each color channel in the picture.

The tool gets (805) the QP for the next unit in the picture. The unit can be a macroblock, block or other region of the picture. As the technique (800) addresses encoding and signaling of QP values, the encoder has already determined QPs of the units and the QP of the picture.

The tool determines (810) the predicted QP for the unit. The value of the predicted QP depends on the QP prediction rule in operation. Although the QP prediction rule depends on implementation, the encoder and decoder use the same QP prediction rule, whatever it happens to be. A first example prediction rule compares QPs of units to the left of the current unit and above the current unit. If the QPs of the two neighboring units are the same, the encoder uses that QP as the predicted QP. Otherwise, the encoder uses the picture QP as the predicted QP for the current unit. According to a second example prediction rule, the encoder uses the median QP among QPs for left, top, and top right neighbors as the predicted QP. Alternatively, the encoder uses another prediction rule, for example, considering a single neighbor's QP to be the predicted QP. For any of these example rules, the QP prediction rule addresses cases where one or more of the neighboring units are outside of a picture or otherwise have no QP, for example, by using the picture QP or other default QP as the predicted QP of the current unit, or by substituting a dummy QP value for the missing neighbor unit.

The tool signals (825) the QP for the unit with reference to the predicted QP. For example, the tool signals a single bit indicating whether or not the unit uses the predicted QP. If not, the tool also signals information indicating the actual QP for the unit. One approach to signaling the actual QP is to signal the difference between the QP for the unit and the predicted QP. Another approach is to signal a QP index that indicates an alternative QP in a table of QPs available to both the encoder and the decoder. Alternatively, instead of signaling the use/do-not-use selection decision separately from selection refinement information, the tool jointly signals the selection information, using a single code to indicate not to use the predicted QP and also indicating the actual QP to use.

The tool then checks (830) to see whether there are other units with QPs to be encoded in the picture (or channel). If there are other units, then the tool repeats the steps of getting (810) the QP for the next unit, determining (810) the predicted QP for that unit, and signaling (825) the QP for that unit.

B. Generalized Decoding.

FIG. 10 is a flowchart showing a general technique (1000) for using spatial prediction to decode QPs for units of video A decoding tool, such as the decoding tool (300) described with reference to FIG. 3 or other decoding tool, performs the technique (1000). The technique (1000) is described with reference to an entire picture, but the technique may be applied separately to each color channel in the picture.

The tool receives (1010) QP selection information for the next unit (e.g., macroblock, block) in the picture. Generally, the selection information indicates whether the QP for the unit is the predicted QP or another QP, in which case the QP selection information also indicates what the other QP is. For example, the tool receives (as part of the QP selection information) a single bit indicating whether or not the unit uses the predicted QP. If not, the tool also receives (as part of the QP selection information) information indicating the actual QP for the unit. In a differential coding approach, the tool receives information indicating the difference between the QP for the unit and the predicted QP. In an alternative QP selection approach, the tool receives a QP index that indicates an alternative QP in a table of QPs available to both the encoder and the decoder. The QP selection information can include a separate decision flag and selection code, or it can include a single code that jointly represents the information.

The tool predicts (1010) the QP of the unit, and the value of the predicted QP depends on the QP prediction rule in operation. Any of the example QP prediction rules described with reference to FIG. 8, when used during encoding, is also used during decoding. Even when the predicted QP is not used as the actual QP for the current unit, the predicted QP is used to determine the actual QP. Alternatively, when the QP selection information indicates that a predicted QP is not used, the encoder skips determination of the predicted QP and decodes an independently signaled QP for the current unit.

The tool selects (1015) between the predicted QP and another QP, using the QP selection information. For example, the tool interprets part of the QP selection information that indicates whether or not the unit uses the predicted QP. If not, the tool also interprets additional QP selection information that indicates the other QP for the unit. In a differential coding approach, the tool combines a differential value and the predicted QP to determine the other QP. In an alternative QP selection approach, the tool looks up a QP index in a table of QPs available to determine the other QP.

The tool then checks (1025) whether there are other units with QPs to be reconstructed in the picture (or channel). If there are, then the tool repeats the steps of receiving QP selection information for the next unit, determining the predicted QP for that unit, and selecting the QP for that unit.

C. Exemplary Prediction Rules.

FIG. 9 is a flowchart illustrating a technique (900) for using an exemplary prediction rule for predicting the QP of a macroblock during encoding. An encoding tool, such as that described with reference to FIG. 2, performs the technique (900) when encoding and signaling the QP for a macroblock (QP_MB) in a frame or channel of the frame.

The tool first checks (905) whether the QP of a macroblock immediately to the left of the current macroblock (QP_LEFT) is the same as the QP of a macroblock immediately above the current macroblock (QP_TOP). QP_LEFT being equal to QP_TOP indicates a trend for the QPs of that particular section of the frame or color channel such that it is reasonable to assume that QP_MB, the QP of the current macroblock, is most likely close to, if not equal to, QP_LEFT. Thus, QP_PRED is set (910) to be equal to QP_LEFT. If QP_LEFT is not equal to QP_TOP, or if either QP_LEFT or QP_TOP is unavailable, then QP_PRED is set (915) to be equal to QP_FRAME, which is the default QP of the frame or color channel. Generally, QP_FRAME is to the average of the QPs for the frame or color channel, the most common QP in the frame or color channel, or some other value expected to reduce bit rate associated with signaling QPs for macroblocks.

In alternative QP prediction rules, QP_PRED is predicted according to the QPs of different macroblocks, such as QP_TOP and QP_BOTTOM (the QP of a macroblock directly below the current macroblock), QP_LEFT and QP_RIGHT (the QP of a macroblock directly to the right of the current macroblock), or some other combination of QPs in the frame or channel, depending on scan order followed in encoding QPs for the macroblocks. Or, QP_PRED is predicted with regard to only a single previously decoded QP (such as QP_LEFT), three previously decoded QPs, or some other combination of QPs. In some examples, the tool performs multiple checks to determine QP_PRED. For example, if QP_LEFT is not equal to QP_TOP_LEFT, the tool checks to determine whether QP_TOP_LEFT is equal to QP_TOP, and if so, sets QP_PRED equal to QP_LEFT (assuming horizontal continuity in QP values). In still other examples, QP_PRED is based on the QPs of other color channels or previously reconstructed macroblocks in other frames.

Returning to FIG. 9, the tool then checks (920) whether QP_MB is equal to QP_PRED. In areas of the frame or color channel with high levels of redundancy in QP values, QP_MB will most likely be equal to QP_PRED. In this instance, the tool signals (930) that QP_SKIP is 1. QP_SKIP is a one-bit indicator which, when set to 1, indicates that the current macroblock uses QP_PRED and the bit stream includes no other QP selection information for the current macroblock.

If QP_MB is not equal to QP_PRED, then the tool signals (925) that QP_SKIP is 0. Setting QP_SKIP to 0 indicates during encoding and decoding that QP_MB is not equal to the QP_PRED and therefore another QP is signaled (935) for QP_MB. In a differential coding approach, this other QP is signaled as a difference value relative to QP_PRED. In an alternate QP selection approach, QP_MB is signaled as one of a number of available QPs in a table of QP values. Or, the other QP is signaled in some other manner.

D. Treatment of Skip Macroblocks.

A QP prediction rule accounts for the unavailability of a neighbor QP by, for example, assigning a picture QP or other default QP to be the predicted QP for the current unit. In some implementations, an encoder and decoder reduce the frequency of unavailable QPs by buffering dummy QP values to units that otherwise lack QPs. For example, even if QP varies spatially in a frame or channel, some macroblocks may still be encoded and decoded without using a QP. For a skipped macroblock or macroblock for which all blocks are not coded (according to the coded block pattern for the macroblock), the bit stream includes no transform coefficient data and no QP is used. Similarly, when QP varies spatially and between channels, if a macroblock has transform coefficient data in a first channel but not a second channel (e.g., since the coded block status of the block(s) in the second channel is 0 in the coded block pattern), the bit stream includes no QP information for the macroblock in the second channel.

Thus, in some implementations, if QP is not available for a particular unit, the encoder and decoder infer the QP for the unit to be equal to the predicted QP for the unit, and the inferred value is used for subsequent QP prediction. For example, if a macroblock is skipped, the QP of the macroblock is set to be equal to the predicted QP for the macroblock, and the inferred QP value is buffered along with other actual QPs (and perhaps inferred QP values) for the frame.

VI. Combined Implementations.

In first and second combined implementations, an encoder and decoder use QPs that vary spatially and/or between channels of enhancement layer video, and the encoder and decoder use spatial prediction when encoding and decoding values of QP for macroblocks. The encoder and decoder use the same QP prediction rule in the first and second combined implementations, although other QP prediction rules can instead be used. In the first combined implementation, when the predicted QP is not used for a macroblock, the actual QP for the macroblock is signaled differentially relative to the predicted QP. In contrast, in the second combined implementation, when the predicted QP is not used for a macroblock, the actual QP for the macroblock is signaled as an alternative QP index to a table of available QPs for the frame.

A. General Signaling in First and Second Combined Implementations.

In the first and second combined implementations, QP_FRAME_UNIFORM is a 1-bit frame level syntax element. It indicates whether QP varies spatially across the frame. If QP_FRAME_UNIFORM equals 0, then the QP varies spatially across the frame. If QP_FRAME_UNIFORM does not equal 0, then the QP does not vary spatially across the frame, and the encoder and decoder use simple frame-level signaling of frame QP.

Similarly, QP_CHANNEL_UNIFORM is a 1-bit frame level syntax element that indicates whether QP varies across the color channels of the frame. If QP_CHANNEL_UNIFORM equals 0, then QP varies across the color channels (in addition to potentially varying spatially within each channel). If QP_CHANNEL_UNIFORM does not equal 0, then QP does not vary across the color channels.

FIG. 11 illustrates bit stream syntax and pseudocode for receiving information that indicates frame QP and channel-specific QPs in first and second example combined implementations. FIGS. 11 through 16 show color channels for the YUV color space, but the pseudocode could be adapted to the RGB space, YCbCr, or some other color space.

If QP_CHANNEL_UNIFORM does not equal 0, then QP does not vary across the color channels, and the bit stream includes N bits signaling QP_FRAME. If QP_CHANNEL_UNIFORM equals 0 then the bit stream includes N bits for QP_FRAME_Y, N bits for QP_FRAME_U, and N bits for QP_FRAME_V. The value of N can be pre-defined, set for a sequence, or even set for a frame. Moreover, although FIG. 11 shows the same value of N bits for all types of QP, different numbers of bits can be used to signal QP_FRAME, QP_FRAME_Y, QP_FRAME_U, and/or QP_FRAME_V.

FIGS. 11 and 13 to 16 illustrate decoder-side operations to receive bit stream syntax elements and determine QPs of macroblocks. The corresponding encoder-side encoding and signaling operations mirror the operations shown in FIGS. 11 and 13 to 16. For example, instead of receiving information for a differential QP value (or alternate QP index) and decoding it, an encoder determines the differential QP value (or alternate QP index) and signals it.

B. Spatial Prediction Rule in First and Second Combined Implementations.

FIG. 12 shows an example QP prediction rule used by the encoder and the decoder in the first and second example combined implementations. The QP prediction rule generally corresponds to the rule explained with reference to steps (905, 910 and 915) of FIG. 9 For a current macroblock, if both the left neighboring macroblock and the top neighboring macroblock are available, and the two neighboring macroblocks have equal QPs, then this QP is used as the predicted QP for the current macroblock. If, however, QP_TOP is different from QP_LEFT, or if either of the neighbors is unavailable, the tool uses QP_FRAME (or the appropriate channel-specific QP_FRAME_value for the Y, U or V channel) as the predicted QP for the current macroblock.

Alternatively, the encoder and the decoder use a different QP prediction rule. For example, the encoder and decoder set the predicted QP for a current macroblock to be the median of QP values from the left, top and top-right neighbors. Or, the encoder and decoder set the predicted QP for a current macroblock to be QP_LEFT if the QP values from top-left and top neighbors are the same (showing a horizontal consistency trend), set the predicted QP for the current macroblock to be QP_TOP if the QP values from top-left and left neighbors are the same (showing a vertical consistency trend), and otherwise set the predicted QP for the current macroblock to be QP_FRAME.

C. Signaling QP Differentials in First Combined Implementation.

In a first scheme, the QP_MB is not the same as QP_PRED, the bit stream includes a differential value that indicates QP_MB relative to QP_PRED. Generally, the differential is signaled as a signed or unsigned integer according to a convention determined by the encoder and decoder.

FIG. 13 illustrates bit stream syntax and pseudocode for receiving information that indicates the number of bits used to differentially signal QP_MB for a frame or channels. The syntax elements shown in FIG. 13 are signaled at frame level in the bit stream. If QP_FRAME_UNIFORM==0, then QP varies spatially over the frame of enhancement layer video and thus QP_MB information is signaled at the macroblock level. If QP_FRAME_UNIFORM does not equal 0, then the QP of the frame (or channels) is signaled at the frame level of the bit stream.

If QP_CHANNEL_UNIFORM is not equal to 0, then the tool decodes NUM_BITS_QP_MB (3 bits). NUM_BITS_QP_MB (3 bits) is a 3-bit value that indicates the number of bits used to signal QP_MB differentials for macroblocks in a frame. This yields a number from 0 bits to 7 bits for differential QP_MB information. When the number of bits is 0, the predicted QP is always used for macroblocks, since no differential bits are allowed. At the other extreme, when the number of bits is 7, differentials within a range of 2⁷=128 steps relative to QP_PRED can be signaled. Depending on convention, the differential values can vary from −64 to 63 in integer QP steps, −32 to 95 in integer QP steps, −32 to 31.5 in half-QP steps, etc. In some implementations, the range is generally centered around QP_PRED (or differential of zero). Setting the number of bits used to signal differential QP_MB information trades off the costs of signaling the differential QP_MB information at higher resolution versus the quality benefits of using the greater range of QP or resolution of QP.

If QP_CHANNEL_UNIFORM is=0, then the tool decodes NUM_BITS_QP_MB_Y (3 bits), NUM_BITS_QP_MB_Y (3 bits), and NUM_BITS_QP_MB_Y (3 bits), which are 3-bit values that indicate the number of bits used to signal QP_MB differentials for macroblocks in the Y channel, the U channel, and the V channel, respectively. This yields a number from 0 bits to 7 bits for differential QP_MB information in the respective channels. Different channels do not need to use the same number of differential QP_MB bits as each other. For example, the Y channel may be much more complex than either the U channel or the V channel, and thus the Y channel may use 4 bits for differential QP_MB values whereas the U channel and the V channel each use 2 bits. By setting the number of differential QP_MB bits to zero for a channel, spatially adaptive quantization is effectively disabled for that channel.

FIG. 14 illustrates bit stream syntax and pseudocode for receiving information that indicates QP for each macroblock. FIG. 14 shows macroblock-level syntax elements. If QP_FRAME_UNIFORM is equal to 0, QP varies spatially over the frame. For a current macroblock, the bit stream includes a bit QP SKIP, which is used to indicate whether QP_MB is equal to QP_PRED. If QP_SKIP is equal to 1, then QP_MB is set to be equal to QP_PRED. QP_SKIP=0 indicates that QP_MB is being signaled explicitly. If so, the next bit stream syntax elements depend on whether QP_CHANNEL_UNIFORM is equal to 0.

If QP_CHANNEL_UNIFORM is not equal to 0, then the bit stream includes DIFF_QP_MB (NUM_BITS_QP_MB bits). In the example of FIG. 13, NUM_BITS_QP_MB can be an integer from 0 to 7. For the current macroblock, DIFF_QP_MB represents the difference between QP_MB and QP_PRED. QP_MB is determined to be: QP_MB=DIFF_QP_MB+QP_PRED, where QP_PRED is the already predicted QP for the current macroblock.

If QP_CHANNEL_UNIFORM is equal to 0, then QP for the current macroblock varies across the different color channels of the frame, and so the bit stream includes DIFF_QP_MB_Y (NUM_BITS_QP_MB_Y bits), DIFF_QP_MB_U (NUM_BITS_QP_MB_U bits), and DIFF_QP_MB_V (NUM_BITS_QP_MB_V bits). In the example of FIG. 13, the number of bits for differential QP_MB per channel can be an integer from 0 to 7. DIFF_QP_MB_Y represents the difference between QP_MB_Y and QP_PRED_Y. QP_MB_Y=DIFF_QP_MB_Y+QP_PRED_Y. DIFF_QP_MB_U and DIFF_QP_MB_V represent similar values for the U and V channels, respectively.

This design allows for a very simple and efficient way to exploit inter-macroblock redundancy in QPs. Even when different color channels use different quantizers for a given macroblock, a 1-bit QP_SKIP element for the macroblock is sufficient to indicate that the QPs of the color channels are identical to the QPs of the corresponding color channels of a neighboring macroblock (such as the left or top neighbor). Further, prediction using a simple comparison and selecting a single neighboring macroblock's QP is simpler than blending two or more neighboring macroblocks—it eliminates the need for a median or averaging operation, and provides similar efficiency in compression. More complicated QP prediction rules can provide more accurate prediction at the cost of higher computational complexity.

In the approach shown in FIGS. 13 and 14, a simple fixed length coding (FLC) table (with code lengths that can vary from frame to frame or channel to channel) is used. For many distributions of differential QP_MB values, performance of such FLCs can be as good as a variable length coding. Alternatively, an encoder and decoder use variable length codes for differential QP_MB values.

Additionally, the ability to send the number of bits used to signal the differential QP provides an additional degree of flexibility in improving compression efficiency. If the macroblock QPs are very close to the frame QP, this proximity can be exploited by using only 1 or 2 bits to signal the differential QP_MBs for the macroblocks that do not use predicted QP. If the macroblock QPs are very different (in terms of having a larger range), more bits are used to signal the differential QP_MBs for the macroblocks.

The number of bits used to signal the differential QP_MBs for each color channel can also be different based on the characteristics of the respective macroblock QPs are for each channel. For example, if the QP of the U and V channels for all of the macroblocks remains the same, and the luma QP varies spatially for the macroblocks, the tool uses zero bits for signaling the differential QP_MB for each of the U and V channels, and 1 or more bits for signaling the differential QP_MBs of the Y channel.

D. Signaling Alternative QPs in Second Combined Implementation.

In the second combined implementation, if QP_SKIP is not equal to 1, then QP_MB is explicitly signaled using a QP index at the macroblock level. The QP index references a QP in a table of available QPs, which is signaled at frame level. FIG. 15 illustrates bit stream syntax and pseudocode for receiving information that specifies the QP values in the table for a frame (or tables for channels), then populating the QP table. FIG. 15 shows frame-level syntax elements.

If QP_FRAME_UNIFORM is equal to 0 (QP varies spatially across the frame) and QP_CHANNEL_UNIFORM is not equal to 0 (QP does not vary across the color channels in the frame), the bit stream includes syntax elements specifying the values of a QP table for the frame. NUM_QP_INDEX (3 bits) is a 3-bit value regulating the number of different QPs in the table for the frame. NUM_QP_INDEX has 2³=8 possible values, from 0 to 7. In other examples, NUM_QP_INDEX may be signaled using more or less bits.

The internal variable NUM_QP, also regulating the number of different QPs in the table, is equal to NUM_QP_INDEX+2, for a range of 2 to 9. The first QP in the QP index table, QP_MB_TABLE[0], is QP_FRAME, the default QP value for the frame. The available QPs are generally ordered from most frequent to least frequent, to facilitate effective variable length coding of QP indices at macroblock level. For example, in the tables shown in FIGS. 17A to 17F, a single bit is used to signal if QP_MB is equal to QP_MB_TABLE[0].

The remaining rows of the QP table are filled, from position 1 through the position NUM_QP-1, by receiving and decoding a QP value for each position. In FIG. 15, the bit stream includes 8 bits to signal the QP value of each position in the table, though in other examples more or less bits can be used. In FIG. 15, the QP index table is produced with QP_FRAME at position 0 in the table and signaled QP values at each of the other positions in the table from 1 to NUM_QP_INDEX+1.

If QP_CHANNEL_UNIFORM is equal to 0 (QP varies across the color channels in the frame), the bit stream includes syntax elements to populate a QP table for each of the Y, U, and V color channels in the frame. For each channel, the positions of the table are filled with the channel-specific QP and alternate QPs.

FIG. 16 illustrates bit stream syntax and pseudocode for receiving information that indicates QP for a macroblock, then determining the QP, in the second combined implementation. FIG. 16 shows macroblock-level syntax elements. QP_SKIP is used as in the first combined implementation. Again, if QP_SKIP is equal to 1 for a current macroblock, then QP_MB=QP_PRED for that macroblock. If QP_SKIP is not equal to 1, then additional information indicating QP_MB is signaled explicitly for the macroblock. In the second combined implementation, however, the tool signals the non-predicted QP with reference to the QP table established at the frame level.

When QP_CHANNEL_UNIFORM indicates QP does not vary between channels, NUM_QP_EFFECTIVE, an internal counter, equals NUM_QP-1 (where NUM_QP is set from frame-level information in the bit stream, as in FIG. 15). This establishes the count of alternate QP values stored in the QP table for the frame. For example, if NUM_QP is equal to 9, then the QP table has 8 alternate QP values, the frame QP value at position 0 and 8 alternate QP values at positions 1-8 in the table. Thus, NUM_QP_EFFECTIVE is equal to 8. QP_ID is a value that is used to locate a QP in the QP table. Initially, QP_ID is 0.

If NUM_QP_EFFECTIVE is greater than 1, the QP table comprises the default value and at least two alternate values at positions 1 and 2, and a variable length code (“VLC”) in the bit stream indicates the QP_ID (index of position in the QP table) of the QP to use for the macroblock. FIGS. 17A-F show several examples of VLC tables that may be used for variable length coding and decoding. For example, FIG. 17A shows a VLC table (1700) corresponding to NUM_QP_EFFECTIVE=2, wherein the VLC table (1700) comprises a QP_ID of 0 corresponding to a VLC of 0. The VLC table (1700) further comprises a QP_ID of 1 corresponding to a VLC of 1. Similarly, FIG. 17B shows a VLC table (1705) corresponding to NUM_QP_EFFECTIVE=3, with VLCs s for QP_IDs of 0, 1, and 2. FIGS. 17C-F show VLC tables (1710, 1715, 1720, 1730) corresponding to NUM_QP_EFFECTIVE=4, 5, 6, and 7, respectively. Typically, the most common QP_ID values in the frame or color channel are positioned near the top of the VLC tables, so that the most common QP_IDs are signaled using fewer bits. Alternatively, the encoder and decoder use other VLCs to represent QP_IDs. Instead of using different VLC tables for different values of NUM_QP_EFFECTIVE, the encoder and decoder can use a single table, but changing multiple tables typically results in slightly more efficient signaling. (For example, compare VLCs lengths for QP_ID==1 in the different VLC tables in FIGS. 17A and 17B.)

There is no VLC table for NUM_QP_EFFECTIVE=1 because, if a QP table has only the QP_FRAME (or channel QP) and one alternate QP, the non-predicted QP can be inferred to be the QP that is not the predicted QP. In other words, QP_PRED for the current macroblock is one of the two QP values in the table. If the macroblock does not use QP_PRED (i.e., QP_SKIP==0), then the only other option for the macroblock is the other QP in the QP table, and no VLC is included in the bitstream for QP_ID.

If NUM_QP_EFFECTIVE is greater than 1, the bit stream includes a VLC associated with a QP_ID in one of the VLC tables, where NUM_QP_EFFECTIVE indicates the table to use. For example, if NUM_QP_EFFECTIVE is equal to 4 and the tool decodes the Huffman code 110, then the tool determines the corresponding QP_ID of 2 from the table (1710) shown in FIG. 17C. When NUM_QP_EFFECTIVE is equal to 4, the number of alternate QP values in the QP table is 4, and the QP table also includes the QP_FRAME. Thus, the QP_IDs in the QP table are 0, 1, 2, 3 and 4. The corresponding VLC table includes only four positions, however, because a position is not needed for the predicted QP, which could have ID of 0, 1, 2, 3 or 4 in the QP table. This helps reduce overall bit rate associated with signaling QP_IDs.

Thus, whether or not NUM_QP_EFFECTIVE is greater than 1, the decoding tool determines the ID of the QP_PRED, which is shown as QP_PRED_ID. The tool then checks whether the signaled QP_ID (or initialized QP_ID) is greater than QP_PRED_ID. If so, then the tool increments QP_ID. If not, then the tool does not increment QP_ID. Once the tool has determined the appropriate QP_ID, the tool determines QP_MB with the value in the QP table indicated by QP_ID.

For example, if the predicted QP for a current macroblock has a QP_PRED_ID of 1 and NUM_QP_EFFECTIVE is 1, QP_ID retains its initial value of 0 and references the other (non-predicted) QP in the QP table with two available QPs. If the QP_PRED_ID of the predicted QP is 0, QP_IP is incremented and references the other (non-predicted) QP in the QP table with two available QPs.

As another example, let QP_PRED_ID be equal to 2 for a current macroblock. If the tool receives a VLC that indicates QP_ID of 0 in the table (1715) shown in FIG. 17D, since QP_ID<QP_PRED_ID, the tool looks up the value QP_ID of 0 in the QP table. In contrast, if the tool receives a VLC that indicates QP_ID of 4 in the table (1715) shown in FIG. 17D, the tool increments the QP_ID and looks up the value QP_ID of 4 in the QP table. By exploiting the fact that signaled QP_ID values need not include QP_PRED_ID as a possible choice, overall bit rate associated with signaling QP_ID values is reduced.

If QP_CHANNEL_UNIFORM is equal to 0 (QP varies between channels), then this process is performed for the macroblock in each color channel of the frame where QP_SKIP is not equal to 1.

The approach of the second combined implementation is particularly useful if a small set of QP choices in a wide range are desired for QPs for macroblocks in the frame or color channel. For example, if certain sections of the frame or color channel are very complex spatially or temporally while other sections of the frame or color channel are relatively uniform, this scheme may help improve overall compression of the frame of enhancement layer video. This technique also exploits inter-macroblock redundancy within sections, allows for signaling of the most common macroblock QPs using the shortest VLC codes, and, in certain cases, improves performance by using a VLC code for a lower QP_ID to signal a QP_ID that is actually higher.

VII. Alternatives.

Although many of the examples presented herein relate to encoding and decoding of enhancement layer video, the techniques and tools described herein for spatial prediction of QPs can be applied to other types of video more generally. Similarly, the techniques and tools described herein for varying QP spatially and/or across channels can be applied to other types of video more generally.

Many of the examples of QP prediction involve spatial prediction of a single predicted QP for a current unit. Alternatively, an encoder and decoder compute multiple predictors for a current unit, and the bit stream includes information indicating a selection of the predicted QP for the current unit from among the multiple predictors. As another alternative, instead of performing spatial prediction of QPs, the encoder and decoder use temporal prediction from co-located macroblocks in other pictures, or use prediction of QPs of macroblocks in one channel from QPs of co-located macroblocks in another color channel.

In view of the many possible embodiments to which the principles of the disclosed invention may be applied, it should be recognized that the illustrated embodiments are only preferred examples of the invention and should not be taken as limiting the scope of the invention. In some cases certain steps in the above described techniques can be omitted or repeated. Rather, the scope of the invention is defined by the following claims. We therefore claim as our invention all that comes within the scope and spirit of these claims.

Claims

1. A computing device comprising a processing unit, memory and a storage medium storing computer-executable instructions which, when executed, cause the computing device to perform: encoding enhancement layer video, including varying quantization spatially and between plural color channels of the enhancement layer video for a picture organized in plural color channels, and further including, when unit-level spatial quantization variation is used for the picture, for a current unit of the enhancement layer video for the picture, predicting a unit-level quantization parameter (“QP”) for the current unit using one or more unit-level QPs for spatially neighboring units; and outputting the encoded enhancement layer video in a bitstream, including: signaling in the bitstream information that indicates an on/off decision for unit-level spatial quantization variation for the picture; and signaling in the bitstream QP information that indicates plural QPs that at least in part parameterize the varied quantization of the enhancement layer video for the picture, the QP information including, when unit-level spatial quantization variation is used, the unit-level QP for the current unit signaled in the bitstream as a differential QP relative to the predicted unit-level QP for the current unit, thereby facilitating combination by a video decoder of the differential QP with a prediction of the unit-level QP computed by the video decoder for the current unit.
2. The computing device of claim 1 wherein the current unit and the spatially neighboring units are blocks or macroblocks of the picture.
3. The computing device of claim 1 wherein the encoding further comprises: determining whether to use unit-level spatial quantization variation based at least in part on one or more of: (a) a user setting that controls speed of the encoding; (b) a user setting that controls complexity of the encoding; (c) analysis of complexity of the video for the picture; and (d) analysis of spatial variance of the video for the picture.
4. The computing device of claim 1 wherein the information that indicates the on/off decision for unit-level spatial quantization variation for the picture is a one-bit flag.
5. The computing device of claim 1 wherein the encoding includes performing the quantization on transform coefficients of blocks of units of the enhancement layer video for the picture, and wherein the encoding further includes, for the current unit, determining a different QP value per color channel of the current unit.
6. The computing device of claim 1 wherein the QP information further comprises: information that indicates one or more picture-level QPs for the enhancement layer video for the picture or respective color channels of the enhancement layer video for the picture.
7. The computing device of claim 1 wherein the spatially neighboring units include a left unit that is to the left of the current unit and an above unit that is above the current unit, and wherein the predicting the unit-level QP for the current unit uses one or more prediction rules based on QP for the left unit and QP for the above unit.
8. The computing device of claim 7 wherein, according to the one or more prediction rules: if the QP for the left unit is not available, another QP is substituted for the QP for the left unit; andif the QP for the above unit is not available, another QP is substituted for the QP for the above unit.
9. The computing device of claim 1 wherein the spatially neighboring units include a left unit that is to the left of the current unit and an above unit that is above the current unit, and wherein the predicting the unit-level QP for the current unit uses one or more prediction rules based upon the QP for the left unit, the QP for the above unit and, if neither the QP for the left unit nor the QP for the above unit is available, a default QP.
10. In a computing device that implements a scalable video decoder, a method comprising: receiving encoded data in a bitstream for enhancement layer video, the encoded data including: information in the bitstream that indicates an on/off decision for unit-level spatial quantization variation for a picture organized in plural color channels; andquantization parameter (“QP”) information in the bitstream that indicates plural QPs that at least in part parameterize inverse quantization of the enhancement layer video for the picture, the QP information including, when unit-level spatial quantization variation is used, a differential QP in the bitstream for a unit-level QP for a current unit of the enhancement layer video for the picture; anddecoding the enhancement layer video for the picture, including varying inverse quantization spatially and between the plural color channels of the enhancement layer video for the picture, and further including, when unit-level spatial quantization variation is used, for the current unit: predicting the unit-level QP for the current unit using one or more unit-level QPs for spatially neighboring units; andcombining the predicted unit-level QP for the current unit with the differential QP from the bitstream for the current unit.
11. The method of claim 10 wherein the current unit and the spatially neighboring units are blocks or macroblocks of the picture.
12. The method of claim 10 wherein the information that indicates the on/off decision for unit-level spatial quantization variation for the picture is a one-bit flag.
13. The method of claim 10 wherein the decoding includes performing the inverse quantization on transform coefficients of blocks of units of the enhancement layer video for the picture, and wherein the decoding further includes, for the current unit, determining a different QP value per color channel of the current unit.
14. The method of claim 10 wherein the QP information further comprises: information that indicates one or more picture-level QPs for the enhancement layer video for the picture or respective color channels of the enhancement layer video for the picture.
15. The method of claim 10 wherein the spatially neighboring units include a left unit that is to the left of the current unit and an above unit that is above the current unit, and wherein the predicting the unit-level QP for the current unit uses one or more prediction rules based on QP for the left unit and QP for the above unit.
16. The method of claim 15 wherein, according to the one or more prediction rules: if the QP for the left unit is not available, another QP is substituted for the QP for the left unit; andif the QP for the above unit is not available, another QP is substituted for the QP for the above unit.
17. The method of claim 10 wherein the spatially neighboring units include a left unit that is to the left of the current unit and an above unit that is above the current unit, and wherein the predicting the unit-level QP for the current unit uses one or more prediction rules based upon the QP for the left unit, the QP for the above unit and, if neither the QP for the left unit nor the QP for the above unit is available, a default QP.
18. A computer-readable memory or storage device having stored therein computer-executable instructions for causing a computing device, when programmed thereby, to perform: receiving encoded data in a bitstream for enhancement layer video, the encoded data including: a one-bit flag in the bitstream that indicates an on/off decision for unit-level spatial quantization variation for a picture organized in plural color channels; andquantization parameter (“QP”) information in the bitstream that indicates plural QPs that at least in part parameterize inverse quantization of the enhancement layer video for the picture, the QP information including, when unit-level spatial quantization variation is used, a differential QP in the bitstream for a unit-level QP for a current unit of the enhancement layer video for the picture; anddecoding the enhancement layer video for the picture, including varying inverse quantization spatially and between the plural color channels of the enhancement layer video for the picture, and further including, when unit-level spatial quantization variation is used, for the current unit: predicting the unit-level QP for the current unit using one or more unit-level QPs for spatially neighboring units, wherein the current unit and the spatially neighboring units are blocks or macroblocks of the picture; andcombining the predicted unit-level QP for the current unit with the differential QP from the bitstream for the current unit.
19. The computer-readable memory or storage device of claim 18 wherein the QP information further comprises: information that indicates one or more picture-level QPs for the enhancement layer video for the picture or respective color channels of the enhancement layer video for the picture.
20. The computer-readable memory or storage device of claim 18 wherein the spatially neighboring units include a left unit that is to the left of the current unit and an above unit that is above the current unit, and wherein the predicting the unit-level QP for the current unit uses one or more prediction rules based upon the QP for the left unit, the QP for the above unit and, if neither the QP for the left unit nor the QP for the above unit is available, a default QP.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation of U.S. patent application Ser. No. 14/307,282, filed Jun. 17, 2014, which is a continuation of U.S. patent application Ser. No. 12/156,864, filed Jun. 3, 2008, the disclosure of which is hereby incorporated by reference.

US Referenced Citations (349)

Number	Name	Date	Kind
4583114	Catros	Apr 1986	A
4679079	Catros et al.	Jul 1987	A
4774574	Daly et al.	Sep 1988	A
4821119	Gharavi	Apr 1989	A
4862264	Wells et al.	Aug 1989	A
4965830	Barham et al.	Oct 1990	A
4992889	Yamagami et al.	Feb 1991	A
5072295	Murakami et al.	Dec 1991	A
5128758	Azadegan et al.	Jul 1992	A
5136377	Johnston et al.	Aug 1992	A
5144426	Tanaka et al.	Sep 1992	A
5146324	Miller et al.	Sep 1992	A
5179442	Azadegan et al.	Jan 1993	A
5210623	Weldy	May 1993	A
5237410	Inoue	Aug 1993	A
5241395	Chen	Aug 1993	A
5253058	Gharavi	Oct 1993	A
5263088	Hazu et al.	Nov 1993	A
5301242	Gonzales et al.	Apr 1994	A
5303058	Fukuda et al.	Apr 1994	A
5317396	Fujinami	May 1994	A
5317672	Crossman et al.	May 1994	A
5333212	Ligtenberg	Jul 1994	A
5351310	Califano et al.	Sep 1994	A
5374958	Yanagihara	Dec 1994	A
5412429	Glover	May 1995	A
5452104	Lee	Sep 1995	A
5461421	Moon	Oct 1995	A
5473377	Kim	Dec 1995	A
5481553	Suzuki et al.	Jan 1996	A
5506916	Nishihara et al.	Apr 1996	A
5510785	Segawa et al.	Apr 1996	A
5537440	Eyuboglu et al.	Jul 1996	A
5537493	Wilkinson	Jul 1996	A
5539469	Jung	Jul 1996	A
5559557	Kato	Sep 1996	A
5565920	Lee et al.	Oct 1996	A
5587708	Chiu	Dec 1996	A
5590139	Suzuki et al.	Dec 1996	A
5606371	Gunnewick et al.	Feb 1997	A
5623424	Azadegan et al.	Apr 1997	A
5629779	Jeon	May 1997	A
5631644	Katata et al.	May 1997	A
5654760	Ohtsuki	Aug 1997	A
5657087	Jeong et al.	Aug 1997	A
5663763	Yagasaki et al.	Sep 1997	A
5724097	Hibi et al.	Mar 1998	A
5724456	Boyack et al.	Mar 1998	A
5731836	Lee	Mar 1998	A
5731837	Hurst, Jr.	Mar 1998	A
5739861	Music	Apr 1998	A
5751358	Suzuki et al.	May 1998	A
5751379	Markandey et al.	May 1998	A
5761088	Hulyalkar et al.	Jun 1998	A
5764803	Jacquin et al.	Jun 1998	A
5781788	Woo et al.	Jul 1998	A
5786856	Hall et al.	Jul 1998	A
5802213	Gardos	Sep 1998	A
5809178	Anderson et al.	Sep 1998	A
5815097	Schwartz et al.	Sep 1998	A
5819035	Devaney et al.	Oct 1998	A
5825310	Tsutsui	Oct 1998	A
5835145	Ouyang et al.	Nov 1998	A
5835237	Ebrahimi	Nov 1998	A
5844613	Chaddha	Dec 1998	A
5850482	Meany et al.	Dec 1998	A
5867167	Deering	Feb 1999	A
5870435	Choi et al.	Feb 1999	A
5877813	Lee et al.	Mar 1999	A
5878166	Legall	Mar 1999	A
5880775	Ross	Mar 1999	A
5883672	Suzuki et al.	Mar 1999	A
5926791	Ogata et al.	Jul 1999	A
5969764	Sun et al.	Oct 1999	A
5970173	Lee et al.	Oct 1999	A
5990957	Ryoo	Nov 1999	A
6044115	Horiike et al.	Mar 2000	A
6049630	Wang et al.	Apr 2000	A
6058362	Malvar	May 2000	A
6072831	Chen	Jun 2000	A
6084636	Fujiwara	Jul 2000	A
6088392	Rosenberg	Jul 2000	A
6091777	Guetz et al.	Jul 2000	A
6104751	Artieri	Aug 2000	A
6118817	Wang	Sep 2000	A
6118903	Liu	Sep 2000	A
6125140	Wilkinson	Sep 2000	A
6148107	Ducloux et al.	Nov 2000	A
6148109	Boon et al.	Nov 2000	A
6160846	Chiang et al.	Dec 2000	A
6167091	Okada et al.	Dec 2000	A
6182034	Malvar	Jan 2001	B1
6212232	Reed et al.	Apr 2001	B1
6215905	Lee et al.	Apr 2001	B1
6223162	Chen et al.	Apr 2001	B1
6240135	Kim	May 2001	B1
6240380	Malvar	May 2001	B1
6243497	Chiang et al.	Jun 2001	B1
6249614	Bocharova et al.	Jun 2001	B1
6256422	Mitchell et al.	Jul 2001	B1
6256423	Krishnamurthy	Jul 2001	B1
6263022	Chen et al.	Jul 2001	B1
6263024	Matsumoto	Jul 2001	B1
6275614	Krishnamurthy et al.	Aug 2001	B1
6278735	Mohsenian	Aug 2001	B1
6285774	Schumann et al.	Sep 2001	B1
6292588	Shen et al.	Sep 2001	B1
6314208	Konstantinides et al.	Nov 2001	B1
6337881	Chaddha	Jan 2002	B1
6347116	Haskell et al.	Feb 2002	B1
6348945	Hayakawa	Feb 2002	B1
6356709	Abe et al.	Mar 2002	B1
6359928	Wang et al.	Mar 2002	B1
6360017	Chiu et al.	Mar 2002	B1
6370502	Wu et al.	Apr 2002	B1
6373894	Florencio et al.	Apr 2002	B1
6385343	Kuroda et al.	May 2002	B1
6389171	Washington	May 2002	B1
6393155	Bright et al.	May 2002	B1
6408026	Tao	Jun 2002	B1
6418166	Wu et al.	Jul 2002	B1
6438167	Shimizu et al.	Aug 2002	B1
6456744	Lafe	Sep 2002	B1
6463100	Cho et al.	Oct 2002	B1
6466620	Lee	Oct 2002	B1
6473534	Merhav et al.	Oct 2002	B1
6490319	Yang	Dec 2002	B1
6493385	Sekiguchi et al.	Dec 2002	B1
6519284	Pesquet-Popescu et al.	Feb 2003	B1
6526096	Lainema et al.	Feb 2003	B2
6546049	Lee	Apr 2003	B1
6571019	Kim et al.	May 2003	B1
6593925	Hakura et al.	Jul 2003	B1
6600836	Thyagarajan et al.	Jul 2003	B1
6647152	Willis et al.	Nov 2003	B2
6654417	Hui	Nov 2003	B1
6678422	Sharma et al.	Jan 2004	B1
6687294	Yan et al.	Feb 2004	B2
6693645	Bourges-Sevenier	Feb 2004	B2
6704718	Burges et al.	Mar 2004	B2
6721359	Bist et al.	Apr 2004	B1
6728317	Demos	Apr 2004	B1
6731811	Rose	May 2004	B1
6738423	Lainema et al.	May 2004	B1
6747660	Olano et al.	Jun 2004	B1
6748020	Eifrig et al.	Jun 2004	B1
6759999	Doyen	Jul 2004	B1
6760482	Taubman	Jul 2004	B1
6765962	Lee et al.	Jul 2004	B1
6771830	Goldstein et al.	Aug 2004	B2
6785331	Jozawa et al.	Aug 2004	B1
6788740	Van der Schaar et al.	Sep 2004	B1
6792157	Koshi et al.	Sep 2004	B1
6795584	Karczewicz et al.	Sep 2004	B2
6801572	Yamada et al.	Oct 2004	B2
6807317	Mathew et al.	Oct 2004	B2
6810083	Chen et al.	Oct 2004	B2
6831947	Ribas Corbera	Dec 2004	B2
6862320	Isu et al.	Mar 2005	B1
6865291	Zador	Mar 2005	B1
6873654	Rackett	Mar 2005	B1
6876703	Ismaeil et al.	Apr 2005	B2
6882753	Chen et al.	Apr 2005	B2
6895052	Hanamura et al.	May 2005	B2
6907142	Kalevo et al.	Jun 2005	B2
6909745	Puri et al.	Jun 2005	B1
6947045	Ostermann et al.	Sep 2005	B1
6975680	Demos	Dec 2005	B2
6977659	Dumitras et al.	Dec 2005	B2
6983018	Lin et al.	Jan 2006	B1
6990242	Malvar	Jan 2006	B2
7016546	Fukuhara et al.	Mar 2006	B2
7020204	Auvray et al.	Mar 2006	B2
7027506	Lee et al.	Apr 2006	B2
7027507	Wu	Apr 2006	B2
7035473	Zeng et al.	Apr 2006	B1
7042941	Laksono et al.	May 2006	B1
7058127	Lu et al.	Jun 2006	B2
7099389	Yu et al.	Aug 2006	B1
7099515	Lin et al.	Aug 2006	B2
7110455	Wu et al.	Sep 2006	B2
7162096	Horowitz	Jan 2007	B1
7200277	Joshi et al.	Apr 2007	B2
7280700	Tourapis et al.	Oct 2007	B2
7289154	Gindele	Oct 2007	B2
7295609	Sato et al.	Nov 2007	B2
7301999	Filippini et al.	Nov 2007	B2
7307639	Dumitras et al.	Dec 2007	B1
7356085	Gavrilescu et al.	Apr 2008	B2
7463780	Fukuhara et al.	Dec 2008	B2
7471830	Lim et al.	Dec 2008	B2
7580584	Holcomb et al.	Aug 2009	B2
7609767	Srinivasan et al.	Oct 2009	B2
7738554	Lin et al.	Jun 2010	B2
7778476	Alvarez et al.	Aug 2010	B2
7801383	Sullivan	Sep 2010	B2
7869517	Ghanbari	Jan 2011	B2
7889790	Sun	Feb 2011	B2
7995649	Zuo et al.	Aug 2011	B2
8711925	Tu et al.	Apr 2014	B2
20010017887	Furukawa et al.	Aug 2001	A1
20010048718	Bruls et al.	Dec 2001	A1
20020021756	Jayant et al.	Feb 2002	A1
20020024999	Yamaguchi et al.	Feb 2002	A1
20020044602	Ohki	Apr 2002	A1
20020118748	Inomata et al.	Aug 2002	A1
20020118884	Cho et al.	Aug 2002	A1
20020136297	Shimada et al.	Sep 2002	A1
20020136308	Le Maguet et al.	Sep 2002	A1
20020154693	Demos et al.	Oct 2002	A1
20020186890	Lee et al.	Dec 2002	A1
20030021482	Lan et al.	Jan 2003	A1
20030053702	Hu	Mar 2003	A1
20030095599	Lee et al.	May 2003	A1
20030103677	Tastl et al.	Jun 2003	A1
20030108100	Sekiguchi et al.	Jun 2003	A1
20030113026	Srinivasan et al.	Jun 2003	A1
20030128754	Akimoto et al.	Jul 2003	A1
20030128756	Oktem	Jul 2003	A1
20030138150	Srinivasan	Jul 2003	A1
20030147463	Sato et al.	Aug 2003	A1
20030185420	Sefcik et al.	Oct 2003	A1
20030194010	Srinivasan et al.	Oct 2003	A1
20030206582	Srinivasan et al.	Nov 2003	A1
20030215011	Wang et al.	Nov 2003	A1
20030219073	Lee et al.	Nov 2003	A1
20030223493	Ye et al.	Dec 2003	A1
20030235247	Wu et al.	Dec 2003	A1
20040008901	Avinash	Jan 2004	A1
20040022316	Ueda et al.	Feb 2004	A1
20040036692	Alcorn et al.	Feb 2004	A1
20040090397	Doyen et al.	May 2004	A1
20040091168	Jones et al.	May 2004	A1
20040151243	Bhaskaran et al.	Aug 2004	A1
20040158719	Lee et al.	Aug 2004	A1
20040190610	Song et al.	Sep 2004	A1
20040202376	Schwartz et al.	Oct 2004	A1
20040228406	Song	Nov 2004	A1
20040264568	Florencio	Dec 2004	A1
20040264580	Chiang Wei Yin et al.	Dec 2004	A1
20050002575	Joshi et al.	Jan 2005	A1
20050008075	Chang et al.	Jan 2005	A1
20050013365	Mukerjee et al.	Jan 2005	A1
20050013497	Hsu et al.	Jan 2005	A1
20050013498	Srinivasan et al.	Jan 2005	A1
20050013500	Lee et al.	Jan 2005	A1
20050015246	Thumpudi et al.	Jan 2005	A1
20050015259	Thumpudi et al.	Jan 2005	A1
20050024487	Chen	Feb 2005	A1
20050031034	Kamaci et al.	Feb 2005	A1
20050036698	Beom	Feb 2005	A1
20050036699	Holcomb et al.	Feb 2005	A1
20050041738	Lin et al.	Feb 2005	A1
20050052294	Liang et al.	Mar 2005	A1
20050053151	Lin et al.	Mar 2005	A1
20050053158	Regunathan et al.	Mar 2005	A1
20050084009	Furukawa et al.	Apr 2005	A1
20050084013	Wang et al.	Apr 2005	A1
20050094731	Xu et al.	May 2005	A1
20050105612	Sung et al.	May 2005	A1
20050105622	Gokhale	May 2005	A1
20050123048	Kondo et al.	Jun 2005	A1
20050123274	Crinon et al.	Jun 2005	A1
20050135484	Lee et al.	Jun 2005	A1
20050147163	Li et al.	Jul 2005	A1
20050152451	Byun	Jul 2005	A1
20050180500	Chiang et al.	Aug 2005	A1
20050180502	Puri	Aug 2005	A1
20050190836	Lu et al.	Sep 2005	A1
20050207492	Pao	Sep 2005	A1
20050232501	Mukerjee	Oct 2005	A1
20050238096	Holcomb et al.	Oct 2005	A1
20050243918	Ebara et al.	Nov 2005	A1
20050254719	Sullivan	Nov 2005	A1
20050259729	Sun	Nov 2005	A1
20050276493	Xin et al.	Dec 2005	A1
20060013307	Olivier et al.	Jan 2006	A1
20060013309	Ha et al.	Jan 2006	A1
20060018552	Malayath et al.	Jan 2006	A1
20060034368	Klivington	Feb 2006	A1
20060038826	Daly	Feb 2006	A1
20060056508	Lafon et al.	Mar 2006	A1
20060071825	Demos	Apr 2006	A1
20060083308	Schwarz et al.	Apr 2006	A1
20060088098	Vehvilainen	Apr 2006	A1
20060098733	Matsumura et al.	May 2006	A1
20060104350	Liu	May 2006	A1
20060104527	Koto et al.	May 2006	A1
20060126724	Cote	Jun 2006	A1
20060126728	Yu et al.	Jun 2006	A1
20060133478	Wen	Jun 2006	A1
20060133479	Chen et al.	Jun 2006	A1
20060140267	He et al.	Jun 2006	A1
20060165176	Raveendran et al.	Jul 2006	A1
20060188014	Civanlar et al.	Aug 2006	A1
20060197777	Cha et al.	Sep 2006	A1
20060227868	Chen et al.	Oct 2006	A1
20060238444	Wang et al.	Oct 2006	A1
20060239576	Mukherjee	Oct 2006	A1
20060245506	Lin et al.	Nov 2006	A1
20060256851	Wang et al.	Nov 2006	A1
20060256867	Turaga et al.	Nov 2006	A1
20060257037	Samadani	Nov 2006	A1
20060268990	Lin et al.	Nov 2006	A1
20060268991	Segall et al.	Nov 2006	A1
20070002946	Bouton et al.	Jan 2007	A1
20070009039	Ryu	Jan 2007	A1
20070009042	Craig et al.	Jan 2007	A1
20070053603	Monro	Mar 2007	A1
20070081586	Raveendran et al.	Apr 2007	A1
20070081588	Raveendran et al.	Apr 2007	A1
20070140333	Chono et al.	Jun 2007	A1
20070147497	Bao et al.	Jun 2007	A1
20070160138	Wedi et al.	Jul 2007	A1
20070160151	Bolton et al.	Jul 2007	A1
20070189626	Tanizawa et al.	Aug 2007	A1
20070201553	Shindo	Aug 2007	A1
20070223579	Bao	Sep 2007	A1
20070230565	Tourapis et al.	Oct 2007	A1
20070237221	Hsu et al.	Oct 2007	A1
20070237222	Xia et al.	Oct 2007	A1
20070237236	Chang et al.	Oct 2007	A1
20070237237	Chang et al.	Oct 2007	A1
20070248163	Zuo et al.	Oct 2007	A1
20070248164	Zuo et al.	Oct 2007	A1
20070258518	Tu et al.	Nov 2007	A1
20070258519	Srinivasan	Nov 2007	A1
20070297508	Kobayashi	Dec 2007	A1
20080008394	Segall	Jan 2008	A1
20080031346	Segall	Feb 2008	A1
20080068446	Barkley et al.	Mar 2008	A1
20080080615	Tourapis et al.	Apr 2008	A1
20080089410	Lu et al.	Apr 2008	A1
20080101465	Chono et al.	May 2008	A1
20080144951	Zhang	Jun 2008	A1
20080187042	Jasinschi	Aug 2008	A1
20080192822	Chang et al.	Aug 2008	A1
20080240235	Holcomb et al.	Oct 2008	A1
20080240250	Lin et al.	Oct 2008	A1
20080240257	Chang et al.	Oct 2008	A1
20080260278	Zuo et al.	Oct 2008	A1
20080304562	Chang et al.	Dec 2008	A1
20090207919	Yin et al.	Aug 2009	A1
20090213930	Ye et al.	Aug 2009	A1
20090245587	Holcomb et al.	Oct 2009	A1
20090290635	Kim et al.	Nov 2009	A1
20090296808	Regunathan et al.	Dec 2009	A1
20100128786	Gao et al.	May 2010	A1
20100177826	Bhaumik et al.	Jul 2010	A1

Foreign Referenced Citations (69)

Number	Date	Country
1327074	Feb 1994	CA
1512785	Jul 2004	CN
1526236	Sep 2004	CN
0331094	Sep 1989	EP
0932306	Jul 1999	EP
1465349	Oct 2004	EP
1871113	Dec 2007	EP
897363	May 1962	GB
H01-221084	Sep 1989	JP
H04-079687	Mar 1992	JP
05-227525	Sep 1993	JP
H06-086264	Mar 1994	JP
H06-189287	Jul 1994	JP
07-222145	Aug 1995	JP
07-250327	Sep 1995	JP
08-336139	Dec 1996	JP
09-200758	Jul 1997	JP
10-174106	Jun 1998	JP
10-336656	Dec 1998	JP
11-041610	Feb 1999	JP
2000-013794	Jan 2000	JP
2001-008215	Jan 2001	JP
2001-016594	Jan 2001	JP
2001-358948	Dec 2001	JP
2002-058029	Feb 2002	JP
2002-518899	Jun 2002	JP
2003061090	Feb 2003	JP
2003-230142	Aug 2003	JP
2004-007650	Jan 2004	JP
2004-007788	Jan 2004	JP
2004-023288	Jan 2004	JP
2004-056249	Feb 2004	JP
2004-194076	Jul 2004	JP
2004-247889	Sep 2004	JP
6-296275	Oct 2004	JP
2004-535126	Nov 2004	JP
2005-524304	Aug 2005	JP
2005-236990	Sep 2005	JP
2005-260467	Sep 2005	JP
2007-520165	Jul 2007	JP
2007-195146	Aug 2007	JP
2007-281949	Oct 2007	JP
2007-312340	Nov 2007	JP
2008-005337	Jan 2008	JP
2008-099045	Apr 2008	JP
2011-514056	Apr 2011	JP
132895	Oct 1998	KR
10-2003-0068140	Aug 2003	KR
2119269	Sep 1998	RU
2119727	Sep 1998	RU
2127962	Mar 1999	RU
WO 9309636	May 1993	WO
WO 9721302	Jun 1997	WO
WO 9925121	May 1999	WO
WO 9948300	Sep 1999	WO
WO 0021207	Apr 2000	WO
WO 0072599	Nov 2000	WO
WO 0207438	Jan 2002	WO
WO 02080575	Oct 2002	WO
WO 03092297	Nov 2003	WO
WO 2004100554	Nov 2004	WO
WO 2004100556	Nov 2004	WO
WO 2005065030	Jul 2005	WO
WO 2005076614	Aug 2005	WO
WO 2006075895	Jul 2006	WO
WO 2006112620	Oct 2006	WO
WO 2007015047	Feb 2007	WO
WO 2007130580	Nov 2007	WO
WO 2009105732	Aug 2009	WO

Non-Patent Literature Citations (119)

Entry
Appeal Decision to Grant a Patent dated Feb. 12, 2015, from Japanese Patent Application No. 2011-512545, 3 pp.
Atzori et al., “Adaptive Anisotropic Filtering (AAF) for Real-Time Visual Enhancement of MPEG-Coded Video Sequences,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 12, No. 5, pp. 285-298 (May 2002).
Augustine et al., “Region of Interest Editing of MPEG-2 Video Streams in the Compressed Domain,” 2004 IEEE Int'l Conf. on Multimedia and Expo: ICME'04, vol. 1, Issue 27-30, pp. 559-562 (Jun. 2004).
Bist et al., “Adaptive Quantization for Low Bit Rate Video Coding,” Proc. 1998 Int'l Conf. on Image Processing (ICIP 98), pp. 925-928 (Oct. 1998).
Calderbank et al., “Wavelet transforms that map integers to integers,” Mathematics Subject Classification, Aug. 1996, 39 pages.
Chai et al., “Face Segmentation Using Skin-Color Map in Videophone Applications,” IEEE Transaction on Circuits and Systems for Video Technology, vol. 9, No. 4, pp. 551-564, Jun. 1999.
Chang et al., “Adaptive Wavelet Thresholding for Image Denoising and Compression,” IEEE Trans on Image Processing, vol. 9, No. 9, pp. 1532-1546 (Sep. 2000).
Chrysafis et al., “Context-based Adaptive Image Coding,” Proc. of the 30th Asilomar Conf. on Signals, Systems, and Computers, 5 pp. (Nov. 1996).
Communication dated Sep. 17, 2013, from European Patent Application No. 09770648.5, 4 pp.
Correia et al., “Classification of Video Segmentation Application Scenarios,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 14, No. 5, pp. 735-741, May 2004.
Daly et al., “Face-Based Visually-Optimized Image Sequence Coding,” 1998 International Conference on Image Processing, vol. 3, pp. 443-447, Oct. 1998.
De Simone, et al., “A comparative study of JPEG 2000, AVC/H.264, and HD Photo,” SPIE Optics and Photonics, Applications of Digital Image Processing XXX, 12 pp. (Aug. 2007).
Donoho et al., “Data compression and Harmonic Analysis,” IEEE transaction on information theory, vol. 44, No. 6, Oct. 1998, pp. 2435-2476.
Eleftheriadis et al., “Dynamic Rate Shaping of Compressed Digital Video,” IEEE Transactions on Multimedia, vol. 8, No. 2, Apr. 2006, pp. 297-314.
Extended European Search Report dated Jul. 29, 2014, from European Patent Application No. 14000799, 7 pp.
Farvardin et al., “Optimum quantizer performance for a class of non-Gaussian memoryless sources,” IEEE Trans. Inform. Theory, vol. IT-30, No. 3, pp. 485-497 (May 1984).
Flierl et al., “A Video Codec Incorporating Block-Based Multi-Hypothesis Motion-Compensated Prediction,” in Proceedings of the SPIE Conference on Visual Communications and Image Processing, Perth, Australia, vol. 4067, pp. 238-249 (Jun. 2000).
Flierl et al., “Generalized B Pictures and the Draft H.264/AVC Video Compression Standard,” in IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, No. 7, pp. 587-597 (Jul. 2003).
Foos et al., “JPEG 2000 compression of medical imagery,” Proc. SPIE, vol. 3980, pp. 85-96 (Feb. 2000).
France Telecom et al., “KTA 1.8 Software Manual,” ITU-T COM 16—C410—E, 18 pp. (Apr. 2008).
Garrigues et al., “Atom position coding in a matching pursuit based video coder,” Lecture Notes in Computer Science, 4 pp. (Sep. 2005).
Gavrilescu et al., “Embedded Multiple Description Scalar Quantizers,” IEE Electronics Letters, vol. 39, No. 13, 12 pp. (Jun. 2003).
Gish et al., “Asymptotically efficient quantizing,” IEEE Trans. Inform. Theory, vol. IT-14, No. 5 (Sep. 1968).
Golner et al., “Region Based Variable Quantization for JPEG Image Compression,” IEEE Symp. on Circuits and Systems, pp. 604-607 (Aug. 2000).
Golston et al., “Video codecs tutorial: Trade-offs with H.264, VC-1 and other advanced codecs,” Video/Imaging Design Line, 9 pp. (Mar. 2006).
“H.264 & IPTV Over DSL—Enabling New Telco Revenue Opportunities,” White Paper, 12 pp. (May 15, 2004).
Hannuksela et al., “Sub-picture: ROI coding and unequal error protection,” Proc. 2002 Int'l Conf. on Image Processing, vol. 3, Issue 24-28, pp. 537-540 (Jun. 2002).
International Search Report of the International Searching Authority, mailed Nov. 1, 2007, for International Patent Application No. PCT/US2007/010848.
International Search Report and Written Opinion of the International Searching Authority, mailed Jan. 14, 2010, for International Patent Application No. PCT/US2009/045659, 11 pp.
“ISO/IEC 11172-2 Coding of moving pictures and associated audio for digital storage media at up to about 1.5 Mbit/s,” MPEG (Moving Pictures Expert Group), International Organization for Standardization, MPEG1 Video, 122 pp. (Aug. 1993).
“ISO/IEC 13818-2. Generic coding of moving pictures and associated audio information,” MPEG (Moving Pictures Expert Group), International Organization for Standardization, MPEG2 Video, 23 pp. (Dec. 2000).
ISO/IEC, “14496-2: Information Technology—Coding of Audio-Visual Objects—Part 2: Visual,” 724 pp. (Jun. 2004).
ISO/IEC, “Study text (version 3) of ISO/IEC 14496-10:2005/FPDAM3 Scalable Video Coding (in integrated form with ISO/IEC 14996-10),” ISO/IEC JTC 1/SC 29/WG 11 N8962, pp. 59-103, 175-196, 404-423, 453-470 (Apr. 2007).
ITU-T, “ITU-T Recommendation H.261: Video Codec for Audiovisual Services at p×64 kbits,” 28 pp. (Mar. 1993).
ITU-T, “ITU-T Recommendation H.262: Information Technology—Generic Coding of Moving Pictures and Associated Audio Information: Video,” 218 pp. (Jul. 1995).
ITU-T, “ITU-T Recommendation H.263: Video Coding for Low Bit Rate Communication,” 167 pp. (Feb. 1998).
ITU-T, “CCITT Recommendation T.81: Information Technology—Digital Compression and Coding of Continuous-Tone Still Images—Requirements and Guidelines,” 190 pp. (Sep. 1992).
ITU-T, “ITU-T Recommendation T.84: Terminals for Telematic Services—Information Technology—Digital Compression and Coding of Continuous-Tone Still Images: Extensions,” 84 pp. (Jul. 1996).
ITU-T, “ITU-T Recommendation T.801: JPEG 2000 image coding system: Extensions,” 334 pp. (Aug. 2002).
Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG, “Draft ITU-T Recommendation and Final Draft International Standard of Joint Video Specification (ITU-T Rec. H.264 ISO/IEC 14496-10 AVC,” 253 pp. (May 2003).
Joshi et al., “Comparison of generalized Gaussian and Laplacian modeling in DCT image coding,” IEEE Signal Proc. Letters, vol. SPL-2, No. 5, pp. 81-82 (May 1995).
Karczewicz et al., “Rate Distortion Optimized Quantization,” JVT-AA026, 8 pp. (Apr. 2008).
Kim et al., “Still image coding based on vector quantization and fractal approximation,” IEEE Transactions on Image Processing, vol. 5, No. 4, pp. 587-597 (Apr. 1996).
Kopp, “Lossless Wavelet Based Image Compression with Adaptive 2D Decomposition,” Proc. 4th Int'l Conf. in Central Europe on Computer Graphics and Visualization 96, pp. 141-149 (Feb. 12-16, 1996).
Kuhn, “Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation, PASSAGE,” Kluwer Academic Publications, 18 pp. (Jan. 1, 2001).
Lam et al., “A mathematical analysis of the DCT coefficient distributions for images,” IEEE Trans. Image Proc., vol. IP-9, No. 10, pp. 1661-1666 (Oct. 2000).
Lee et al., “Spatio-Temporal Model-Assisted Compatible Coding for Law and Very Low Bitrate Videotelephony,” 3rd IEEE International Conference on Image Processing, 4 pages, Sep. 1996.
LeGall, “MPEG: A Video Compression Standard for Multimedia Application,” Communications of the ACM, vol. 34, No. 4, pp. 47-58 (Apr. 1991).
LeGall, “The MPEG Video Compression Algorithm,” Signal Processing: Image Communication 4, vol. 4, No. 2, pp. 129-140 (Apr. 1992).
LeGall et al., “Transmission of HDTV signals under 140 Mbit/s using a subband decomposition and Discrete Cosine Transform coding,” in Signal Processing of HDTV, Elsevier, Amsterdam, pp. 287-293 (Oct. 1988).
Lei et al., “Rate Adaptation Transcoding for Precoded Video Streams,” 13 pp. (month unknown, 2000).
Limb, “A Picture-Coding Algorithm for the Merli Scan,” IEEE Transactions on Communications, pp. 300-305 (Apr. 1973).
Lin et al, “Low-complexity face-assisted coding scheme for low bit rate video telephony,” IEICE Trans. Inf. & Sys., vol. E86-D, No. 1, pp. 101-108 (Jan. 2003).
Lin et al, “Low-complexity face-assisted video coding,” Proc. 2000 Int'l Conf. on Image Processing, vol. 2, pp. 207-210 (Sep. 2000).
Liu et al., “Workload Characterization and Cost-Quality Tradeoffs in MPEG-4 Decoding On Resource-Constrained Devices,” IEEE Workshop on Embedded Systems for Real-Time Multimedia, pp. 129-134 (Jan. 2005).
Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inform. Theory, vol. IT-28, No. 2, pp. 7-12 (Mar. 1982) (reprint of work originally presented in Jul. 1957).
Loomis, “Using the Advanced Settings of the Windows Media Video 9 Advanced Profile Codec,” 13 pp. (Document dated Apr. 2006) [Downloaded from the World Wide Web on May 31, 2007].
Lopresto et al., “Image Coding Based on Mixture Modeling of Wavelet Coefficients and a Fast Estimation-Quantization Framework,” Proc. IEEE Data Compression Conference, (Snowbird, UT), pp. 221-230 (Mar. 1997).
Luo et al., “A Scene Adaptive and Signal Adaptive Quantization for Subband Image and Video Compression Using Wavelets,” IEEE Trans. on Circuits and Systems for Video Tech., vol. 7, No. 2, pp. 343-357 (Apr. 1997).
Malah, “Time-Domain Algorithms for Harmonic Reduction and Time Scaling of Speech Signals,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-27, No. 2, Apr. 1979, 13 pages.
Mallat, “A theory for multiresolution signal decomposition: the wavelet representation,” IEEE Trans. Pattern Anal. and Machine Intell., vol. PAMI-11, No. 7, pp. 674-692 (Jul. 1989).
Man et al., “Three-Dimensional Subband Coding Techniques for Wireless Video Communications,” IEEE Trans. on Circuits and Systems for Video Technology, vol. 12, No. 6, pp. 386-397 (Jun. 2002).
Marcellin et al., “An overview of quantization in JPEG 2000,” Signal Processing: Image Communication, vol. 17, pp. 73-84 (Jan. 2002).
Masala et al., “Perceptually Optimized MPEG Compression of Synthetic Video Sequences,” Proc. ICIP, pp. I-601-I-604 (Sep. 2005).
Max, “Quantizing for minimum distortion,” IEEE Trans. Inform. Theory, vol. IT-6, No. 1, pp. 7-12 (Mar. 1960).
Microsoft Corporation, “Microsoft Debuts New Windows Media Player 9 Series, Redefining Digital Media on the PC,” 4 pp. (Sep. 4, 2002) [Downloaded from the World Wide Web on May 14, 2004].
Mitra et al., “Two-Stage Color Palettization for Error Diffusion,” Proceedings of SPIE, pp. 207-217 (Jun. 2002).
Mook, “Next-Gen Windows Media Player Leaks to the Web,” BetaNews, 17 pp. (Jul. 19, 2002) [Downloaded from the World Wide Web on Aug. 8, 2003].
Muller, “Distribution shape of two-dimensional DCT coefficients of natural images,” IEE Electronics Letters, vol. 29, No. 22 (Oct. 1993).
Murakami et al., “Comparison between DPCM and Hadamard transform coding in the composite coding of the NTSC color TV signal,” IEEE Trans. on Commun., vol. COM-30, No. 3, pp. 469-479 (Mar. 1982).
Musmann et al., “Advances in Picture Coding,” Proceedings of the IEEE, vol. 73, No. 4, pp. 523-548 (Apr. 1985).
Neff et al., “Modulus Quantization for Matching Pursuit Video Coding,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 10, No. 6, pp. 895-912 (Sep. 2000).
Nguyen et al., “Set Theoretic Compression with an Application to Image Coding,” IEEE Transactions on Image Processing, vol. 7, No. 7, pp. 1051-1056 (Jul. 1998).
Notice on Grant dated Jun. 14, 2013, from corresponding Chinese Patent Application No. 200980121348.3, 4 pp.
Notice on the First Office Action dated Oct. 18, 2012, from Chinese Patent Application No. 200980121348.3, 8 pp.
Office action dated Dec. 11, 2012, from Japanese Patent Application No. 2011512545, 6 pp.
Office action dated Oct. 31, 2013, from Japanese Patent Application No. 2011-512545, 4 pp.
Office action dated Jun. 3, 2014, from Japanese Patent Application No. 2013-122385, 15 pp.
Office action dated Aug. 28, 2013, from Mexican Patent Application No. MX/a/2010/012818 (no English translation), 3 pp.
Office action dated Feb. 6, 2014, from Mexican Patent Application No. MX/a/2010/012818 (no English translation), 2 pp.
Park et al., “A post processing method for reducing quantization effects in low bit-rate moving picture coding,” IEEE Trans. Circuits Syst. Video Technology, vol. 9, pp. 161-171 (Feb. 1999).
Pre-trial Report dated Jun. 16, 2014, from Japanese Patent Application No. 2011-512545, 4 pp.
Puri et al., “Motion-Compensated Video Coding with Adaptive Perceptual Quantization,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 1, No. 4, pp. 351-361 (Dec. 1991).
Radha et al., “The MPEG-4 Fine-Grained Scalable Video Coding Method for Multimedia Streaming Over IP,” IEEE Trans. on Multimedia, vol. 3, No. 1, pp. 53-68 (Mar. 2001).
Reininger et al., “Distribution of two-dimensional DCT coefficients for images,” IEEE Trans. on Commun., vol. COM-31, No. 6, pp. 835-839 (Jun. 1983).
Ribas Corbera et al., “Rate Control in DCT Video Coding for Low-Delay Communications,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 9, No. 1, pp. 172-185 (Feb. 1999).
Richardson, H.264 and MPEG-4 Video Compression, pp. 50-56 and 187-196 (2003).
Schallauer et al., “PRESTO—Preservation Technologies for European Broadcast Archives, D5.4—High Quality Compression for Film and Video,” 80 pp. (Sep. 18, 2002).
Schuster et al., “A Theory for the Optimal Bit Allocation Between Displacement Vector Field and Displaced Frame Difference,” IEEE J. on Selected Areas in Comm., vol. 15, No. 9, pp. 1739-1751 (Dec. 1997).
Sethuraman et al., “Model Based Multi-Pass Macroblock-Level Rate Control for Visually Improved Video Coding,” IEEE Proc. of Workshop and Exhibition on MPEG-4, pp. 59-62 (Jun. 2001).
Shanableh et al., “Heterogeneous Video Transcoding to Lower Spatio-Temporal Resolutions and Different Encoding Formats,” IEEE Transactions on Multimedia, vol. 2, No. 2, pp. 101-110 (Jun. 2000).
Shen et al., “Rate-Distortion Optimization for Fast Hierarchical B-Picture Transcoding,” IEEE, pp. 5279-5282 (May 2006).
Shoushun et al., “Adaptive-Quantization Digital Image Sensor for Low-Power Image Compression,” in IEEE Transactions on Circuits and Systems—I: Regular Papers, vol. 54, No. 1, pp. 13-25 (Jan. 2007).
Sony Electronics Inc., “Sony Vizaro DVD Encoder System DVA-V700,” 4 pp. (Apr. 2001).
Srinivasan et al., “HD Photo: A new image coding technology for digital photography,” Proc. of SPIE, vol. 6696, 19 pp. (Jan. 2007).
Sullivan, “Efficient scalar quantization of exponential and Laplacian random variables,” IEEE Trans. Inform. Theory, vol. IT-42, No. 5, pp. 1365-1374 (Sep. 1996).
Sullivan et al., “Rate-Distortion Optimization for Video Compression,” IEEE Signal Processing Magazine, pp. 74-90 (Nov. 1998).
Sullivan et al., “The H.264/AVC Advanced Video Coding Standard: Overview and Introduction to the Fidelity Range Extensions,” 21 pp. (Aug. 2004).
Supplementary European Search Report dated Jun. 24, 2011, from European Patent Application No. 09770648.5, 12 pp.
Tao et al., “Adaptive Model-driven Bit Allocation for MPEG Video Coding,” IEEE Transactions on Circuits and Systems for Video Tech., vol. 10, No. 1, pp. 147-157 (Feb. 2000).
Tong, “A perceptually adaptive JPEG coder,” Thesis, University of Toronto, 124 pp.
Tong, “Region of Interest (ROI) Based Rate Control for H.236 Compatible Video Conferencing,” The University of Texas at Arlington, Ph.D. Thesis, 115 pp. (Dec. 2005).
Tsang et al., “Fuzzy Based Rate Control for Real-Time MPEG Video,” IEEE Transactions on Fuzzy Systems, pp. 504-516 (Nov. 1998).
Wang, et al., “A Framework for Adaptive Scalable Video Coding Using Wyner-Ziv Techniques,” EURASIP Journal on Applied Signal Processing, pp. 1-18 (month unknown, 2006).
Watson, “Perceptual Optimization of DCT Color Quantization Matrices,” IEEE Conf. on Image Processing, pp. 100-104 (Nov. 1994).
Watson et al., “Visibility of Wavelet Quantization Noise,” IEEE Trans. on Image Processing, vol. 6, No. 8, pp. 1164-1175 (Aug. 1997).
Wiegand et al., “Joint Draft 10 of SVC Amendment,” JVT-W201, 23rd meeting of Joint Video Team, San Jose, CA, pp. 74-77, 92-98, 182-185, 399-400, 19 pp. (Apr. 2007).
Wiegand et al., “Joint Draft 10 of SVC Amendment,” JVT-W201, 23rd meeting of Joint Video Team, San Jose, CA, sections 7.4.2.2, 7.4.5, 8.5.8, G.7.3.6 and G.7.4.5, 19 pp. (Apr. 2007).
Wien, “Variable Block-Size Transforms for Hybrid Video Coding,” Dissertation, 182 pp. (Feb. 2004).
Wu et al., “Context-Based, Adaptive, Lossless Image Coding,” IEEE Trans. Communications, vol. 45, pp. 437-444 (Apr. 1997).
Wu et al., “Joint Estimation of Forward and Backward Motion Vectors for Interpolative Prediction of Video,” IEEE Transactions on Image Processing, vol. 3, No. 5, pp. 684-687 (Sep. 1994).
Xiong et al., “Wavelet Packet Image Coding Using Space-Frequency Quantization,” IEEE Transactions on Image Processing, vol. 7, No. 6, pp. 892-898 (Jun. 1998).
Yang et al., “Rate Control for Videophone Using Local Perceptual Cues,” IEEE Transactions on Circuits and Systems for Video Tech., vol. 15, No. 4, pp. 496-507 (Apr. 2005).
Yoo et al., “Adaptive Quantization of Image Subbands with Efficient Overhead Rate Selection,” IEEE Conf. on Image Processing, pp. 361-364 (Sep. 1996).
Yuen et al., “A survey of hybrid MC/DPCM/DCT video coding distortions,” Signal Processing, vol. 70, pp. 247-278 (Nov. 1998).
Zaid et al., “Wavelet Image Coding with Adaptive Thresholding,” 4 pp. (Jul. 2002).
Zhang et al., “Adaptive Field/Frame Selection for High Compression Coding,” SPIE Conf. on Image and Video Communications and Processing, 13 pp. (Jan. 2003).
Zhike et al., “Adaptive Quantization Scheme for Very Low Bit Rate Video Coding,” Proceedings of Asia-Pacific Conference on Communications and Optoelectronics and Communications Conference, pp. 940-943 (Oct. 18, 1999).
Notice of Reason for Rejection dated Jul. 22, 2015, from Japanese Patent Application No. 2013-122385, 6 pp.

Related Publications (1)

	Number	Date	Country
	20150043633 A1	Feb 2015	US

Continuations (2)

	Number	Date	Country
Parent	14307282	Jun 2014	US
Child	14523725		US
Parent	12156864	Jun 2008	US
Child	14307282		US

Adaptive quantization for enhancement layer video coding

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

CPC

International Classifications

Disclaimer

Abstract