Systems and methods for adaptively filtering DCT coefficients in a video encoder

Related Application

This application claims the benefit under 35 U.S.C. § 119(e) of U.S. Provisional Application No. 60/403,851, filed August 14, 2002, the entirety of which is hereby incorporated by reference. This application is also related to U.S. Patent Application [<u>          </u>] with Attorney Docket INTV.028A. entitled SYSTEMS AND METHODS FOR SELECTING A MACROBLOCK MODE IN A VIDEO ENCODER, filed on the same date and commonly owned with the present application, the entirety of which is hereby incorporated by reference herein.

Background of the Invention

Field of the Invention

The invention generally relates to video encoding techniques. In particular, the invention relates to adaptive filtering of DCT coefficients.

Description of the Related Art

A variety of digital video compression techniques have arisen to transmit or to store a video signal with a lower data rate or with less storage space. Such video compression techniques include international standards, such as H.261, H.263, H.263+, H.263++, H.264, MPEG-1, MPEG-2, MPEG-4, and MPEG-7. These compression techniques achieve relatively high compression ratios by discrete cosine transform (DCT) techniques and motion compensation (MC) techniques, among others. Such video compression techniques permit video data streams to be efficiently carried across a variety of digital networks, such as wireless cellular telephony networks, computer networks, cable networks, via satellite, and the like, and to be efficiently stored on storage mediums such as hard disks, optical disks, Video Compact Discs (VCDs), digital video discs (DVDs), and the like. The encoded data streams are decoded by a video decoder that is compatible with the syntax of the encoded data stream.

For relatively high image quality, video encoding can consume a relatively large amount of data. However, the communication networks that carry the video data can limit the data rate that is available for encoding. For example, a data channel in a direct broadcast satellite (DBS) system or a data channel in a digital cable television network typically carries data at a relatively constant bit rate (CBR) for a programming channel. In addition, a storage medium, such as the storage capacity of a disk, can also place a constraint on the number of bits available to encode images.

As a result, a video encoding process often trades off image quality against the number of bits used to compress the images. Moreover, video encoding can be relatively complex. For example, where implemented in software, the video encoding process can consume relatively many CPU cycles. Further, the time constraints applied to an encoding process when video is encoded in real time can limit the complexity with which encoding is performed, thereby limiting the picture quality that can be attained.

One conventional method for rate control and quantization control for an encoding process is described in Chapter 10 of Test Model 5 (TM5) from the MPEG Software Simulation Group (MSSG). TM5 suffers from a number of shortcomings. An example of such a shortcoming is that TM5 does not guarantee compliance with the Video Buffer Verifier (VBV) requirement. As a result, overrunning and underrunning of a decoder buffer can occur, which undesirably results in the freezing of a sequence of pictures and the loss of data.

Summary of the Invention

The invention is related to methods and apparatus that provide selective filtering of discrete cosine transform (DCT) coefficients. Advantageously, filtering of the DCT coefficients is efficiently performed in the frequency domain, rather than the processing intensive pixel domain (time domain). The DCT filtering is performed "in-loop" to the DCT encoding and not in a preprocessing approach that is independent to encoding loop. The DCT filtering advantageously reduces the number of bits used to encode a picture, which can preserve compliance with occupancy levels for buffer models while improving picture quality over a conventional technique to preserve bits, such as an increase in the value of the quantization parameter QP.

One embodiment of the invention is a method of efficiently compressing video including: selectively low-pass filtering DCT coefficients of a macroblock in the frequency domain; and quantizing the low-pass filtered DCT coefficients.

One embodiment of the invention is a video encoder that efficiently compresses video including: a means for selectively low-pass filtering DCT coefficients of a macroblock in the frequency domain; and a means for quantizing the low-pass filtered DCT coefficients.

One embodiment of the invention is a computer program embodied in a tangible medium including: a module with instructions for selectively low-pass filtering DCT coefficients of a macroblock in the frequency domain; and a module with instructions for quantizing the low-pass filtered DCT coefficients.

One embodiment of the invention is a circuit for video encoding including: a circuit configured to selectively low-pass filter DCT coefficients of a macroblock in the frequency domain; and a circuit configured to quantize the low-pass filtered DCT coefficients. In one embodiment, the circuit is embodied in a video encoder.

Brief Description of the Drawings

These and other features of the invention will now be described with reference to the drawings summarized below. These drawings and the associated description are provided to illustrate preferred embodiments of the invention and are not intended to limit the scope of the invention.

Figure 1 illustrates an example of a sequence of pictures.

Figure 2 illustrates an example of an encoding environment in which an embodiment of the invention can be used.

Figure 3 illustrates an example of decoding environments, which can include a decoder buffer.

Figure 4 is a block diagram that generally illustrates the relationship between an encoder, a decoder, data buffers, and a constant-bit-rate data channel.

Figure 5 is a chart that generally illustrates buffer occupancy as a function of time, as data is provided to a buffer at a constant bit rate while the data is consumed by the decoder at a variable bit rate.

Figure 2 illustrates an example of an encoding environment in which an embodiment of the invention can be used.

Figure 3 illustrates an example of decoding environments, which can include a decoder buffer.

Figure 4 is a block diagram that generally illustrates the relationship between an encoder, a decoder, data buffers, and a constant-bit-rate data channel.

Figure 5 is a chart that generally illustrates buffer occupancy as a function of time, as data is provided to a buffer at a constant bit rate while the data is consumed by the decoder at a variable bit rate.

Figure 6 consists of Figures 6A and 6B and is a flowchart that generally illustrates rate control and quantization control in a video encoder.

Figure 7 is a flowchart that generally illustrates a process for adjusting a targeted bit allocation based at least in part on an occupancy level of a virtual buffer.

Figure 8A is a flowchart that generally illustrates a sequence of processing macroblocks according to the prior art.

Figure 8B is a flowchart that generally illustrates a sequence of processing macroblocks according to one embodiment.

Figure 9A is a flowchart that generally illustrates a process for stabilizing the encoding process from the deleterious effects of bit stuffing.

Figure 9B is a flowchart that generally illustrates a process for resetting virtual buffer occupancy levels upon the detection of an irregularity in a final buffer occupancy level.

Figure 10A illustrates examples of groups of pictures (GOPs).

Figure 10B is a flowchart that generally illustrates a process for resetting encoding parameters upon the detection of a scene change within a group of pictures (GOI').

Figure 11 is a flowchart that generally illustrates a process for the selective skipping of data in a video encoder to reduce or eliminate the occurrence of decoder buffer underrun.

Figure 12 is a flowchart that generally illustrates a process for selective DCT filtering.

Figure 17 is a flowchart that generally illustrates a process for selecting a mode for a macroblock.

Figure 18 is another flowchart that generally illustrates a process for selecting a mode for a macroblock.

Detailed Description of Preferred Embodiments

Although this invention will be described in terms of certain preferred embodiments, other embodiments that are apparent to those of ordinary skill in the art, including embodiments that do not provide all of the benefits and features set forth herein, are also within the scope of this invention. Accordingly, the scope of the invention is defined only by reference to the appended claims.

Figure 1 illustrates a sequence of pictures 102. While embodiments of the invention are described in the context of MPEG-2 and pictures, the principles and advantages described herein are also applicable to other video standards including H.261, H.263, H.264, MPEG-1, and MPEG-4, as well as video standards yet to be developed. The term "picture" will be used herein and encompasses pictures, images, frames, visual object planes (VOPs), and the like. A video sequence includes multiple video images usually taken at periodic intervals. The rate at which the pictures of frames are displayed is referred to as the picture late or frame rate. The pictures in a sequence of pictures can correspond to either interlaced images or to non-interlaced images, i.e., progressive images. In an interlaced image, each image is made of two separate fields, which are interlaced together to create the image. No such interlacing is performed in a non-interlaced or progressive image.

The sequence of pictures 102 can correspond to a movie or other presentation. It will be understood that the sequence of pictures 102 can be of finite, duration, such as with a movie, or can be of unbound duration, such as for a media channel in a direct broadcast satellite (DBS) system. An example of a direct broadcast satellite (DBS) system is known as DIRECTV®. As shown in Figure 1, the pictures in the sequence of pictures 102 are grouped into units known as groups of pictures such as the illustrated, first group of pictures 104. A first picture 106 of the first group of pictures 104 corresponds to an I-picture. The other pictures in the group of pictures can correspond to P-pictures or to B-pictures.

In MPEG-2, a picture is further divided into smaller units known as macroblocks. It will be understood that in other video standards, such as MPEG-4, a picture can be further divided into other units, such as visual object planes (VOPs). Returning now to MPEG-2, an I-picture is a picture in which all macroblocks are intra coded, such that an image can be constructed without data from another picture. A P-picture is a picture in which all the macroblocks are either intra coded or forward predictively coded. The macroblocks for a P-picture can be encoded or decoded based on data for the picture itself, i.e., intra coded, or based on data from a picture that is earlier in the sequence of pictures, i.e., forward predictively coded. A B-picture is a picture in which the macroblocks can be intra coded, forward predictively coded, backward predictively coded, or a combination of forward and backward predictively coded, i.e., interpolated. During an encoding and/or a decoding process for a sequence of pictures, the B-pictures will typically be encoded and/or decoded after surrounding I-pictures and/or P-pictures are encoded and/or decoded. An advantage of using predictively-coded macroblocks over intra-coded macroblocks is that the number of bits used to encode predictively-coded macroblocks can be dramatically less than the number of bits used to encode intra-coded macroblocks.

The macroblocks include sections for storing luminance (brightness) components and sections for storing chrominance (color) components. It will be understood by one of ordinary skill in the art that the video data stream can also include corresponding audio information, which is also encoded and decoded.

Figure 2 illustrates an example of an encoding environment in which an embodiment of the invention can be used. A source for unencoded video 202 provides the unencoded video as an input to an encoder 204. The source for unencoded video 202 can be embodied by a vast range of devices, such as, but not limited to, video cameras, sampled video tape, sampled films, computer-generated sources, and the like. The source for unencoded video 202 can even include a decoder that decodes encoded video data. The source for unencoded video 202 can be external to the encoder 204 or can be incorporated in the same hardware as the encoder 204. In another example, the source for unencoded video 202 is a receiver for analog broadcast TV signals that samples the analog images for storage in a digital video recorder, such as a set-top box known as TiVo®.

The encoder 204 can also be embodied in a variety of forms. For example, the encoder 204 can be embodied by dedicated hardware, such as in an application specific integrated circuit (ASIC), by software executing in dedicated hardware, or by software executing in a general-purpose computer. The software can include instructions that are embodied in a tangible medium, such as a hard disk or optical disk. In addition, the encoder 204 can be used with other encoders to provide multiple encoded channels for use in direct broadcast satellite (DBS) systems, digital cable networks, and the like. For example, the encoded output of the encoder 204 is provided as an input to a server 206 together with the encoded outputs of other encoders as illustrated in Figure 2. The server 206 can be used to store the encoded sequence in mass storage 208, in optical disks such as a DVD 210 for DVD authoring applications, Video CD (VCD), and the like. The server 206 can also provide the data from the encoded sequence to a decoder via an uplink 212 to a satellite 214 for a direct broadcast satellite (DBS) system, to the Internet 216 for streaming of the encoded sequence to remote users, and the like. It will be understood that an encoded sequence can be distributed in a variety of other mediums including local area networks (LANs), other types of wide area networks (WANs), wireless networks, terrestrial digital broadcasts of television signals, cellular telephone networks, dial-up networks, peer-to-peer networks, and the like. In one embodiment, the encoder 204 encodes the sequence of pictures in real time. In another embodiment, the encoder 204 encodes the sequence of pictures asynchronously. Other environments in which the encoder 204 can be incorporated include digital video recorders, digital video cameras, dedicated hardware video encoders and the like.

Figure 3 illustrates an example of decoding environments, which include decoder buffers that are modeled during the encoding process by a Video Buffer Verifier (VBV) buffer. An encoded sequence of pictures can be decoded and viewed in a wide variety of environments. Such environments include reception of direct broadcast satellite (DBS) signals via satellite dishes 302 and set top boxes, playback by digital video recorders, playback through a DVD player 304, reception of terrestrial digital broadcasts, and the like. For example, a television set 306 can be used to view the images, but it will be understood that a variety of display devices can be used.

For example, a personal computer 308, a laptop computer 310, a cell phone 312, and the like can also be used to view the encoded images. In one embodiment, these devices are configured to receive the video images via the Internet 216. The Internet 216 can be accessed via a variety of networks, such as wired networks and wireless networks.

Figure 4 is a block diagram that generally illustrates the relationship between an encoder 402, an encoder buffer 404, a decoder 406, a decoder buffer 408, and a constant-bit-rate data channel 410. In another embodiment, the bit rate of the constant-bit-rate data channel can vary slightly from channel-to-channel depending on a dynamic allocation of data rates among multiplexed data channels. For the purposes of this application, this nearly constant bit rate with a slight variation in data rate that can occur as a result of a dynamic allocation of data rate among multiplexed data channels will be considered as a constant bit rate. For example, the encoder 402 can correspond to an encoder for a programming channel in a direct broadcast satellite (DBS) system, and the decoder 406 can correspond to a decoder in a set-top box that receives direct broadcast satellite (DBS) signals. The skilled practitioner will appreciate that the data rate of the constant-bit-rate data channel 410 for actual video data may be less than the data rate of the constant-bit-rate data channel 410 itself because some of the actual transmission data may be occupied for overhead purposes, such as for error correction and for packaging of data. The skilled practitioner will appreciate that the methods described herein are directly applicable to constant-bit-rate encoding, as described in the MPEG standard document, but also to variable-bit-rate encoding. For the case of variable bit-rate, the transmission bit rate can be described in terms of a long-term average over a time period that can be a few seconds, a few minutes, a few hours, or any other suitable time-interval, together with a maximal bit rate that can be used to provide data to a decoder buffer. Data can be provided from the channel to the decoder buffer at the maximal bit rate until the decoder buffer is full; at that point, the data channel waits for decoding of the next picture, which will remove some data from the decoder buffer, and then transfer of data from the channel to the decoder buffer resumes. The term "bit rate" used hereafter can be either some constant bit rate or a long-term average of variable bit rate encoding. In one embodiment of a constant bit rate encoder, the encoder produces a data stream with a relatively constant bit rate over a group of pictures.

For strearning applications such as a direct broadcast satellite (DBS) system or for recording of live broadcasts such as in a home digital video recorder, the encoder 402 receives and encodes the video images in real time. The output of the encoder 402 can correspond to a variable bit rate (VBR) output 412. The variable bit rate (VBR) output 412 of the encoder 402 is temporarily stored in the encoder buffer 404. A function of the encoder buffer 404 and the decoder buffer 408 is to hold data temporarily such that data can be stored and retrieved at different data rates. It should be noted that the encoder buffer 404 and the decoder buffer 408 do not need to be matched, and that the encoder buffer 404 is a different buffer than a video buffer verifier (VBV) buffer, which is used by the encoder 402 to model the occupancy of the decoder buffer 408 during the encoding process.

The encoder buffer 404 can be implemented in dedicated memory or can be efficiently implemented by sharing system memory, such as the existing system memory of a personal computer. Where the memory used for the encoder buffer 404 is shared, the encoder buffer 404 can be termed a "virtual buffer." It will be understood that larger memories, such as mass storage, can also be used to store video data streams and portions thereof.

The encoder buffer 404 buffers the relatively short-term fluctuations of the variable bit rate (VBR) output 412 of the encoder 402 such that the encoded data can be provided to the decoder 406 via the constant-bit-rate data channel 410. Similarly, the decoder buffer 408 can be used to receive the encoded data at the relatively constant bit rate of the constant-bit-rate data channel 410 and provide the encoded data to the decoder 406 as needed, which can be at a variable bit rate. The decoder buffer 408 can also be implemented in dedicated memory or in a shared memory, such as the system memory of a personal computer. Where implemented in a shared memory, the decoder buffer 408 can also correspond to a virtual buffer.

The MPEG standards specify a size for the decoder buffer 408. The size of the decoder buffer 408 is specified such that an MPEG-compliant data stream can be reliably decoded by a standard decoder. In the MPEG-2 standard, which for example is used in the encoding of a DVD, the buffer size specified is about 224 kB. In the MPEG-1 standard, which for example is used in the encoding of a video compact disc (VCD), the buffer size is specified to be about 40 kB. It will be understood by one of ordinary skill in the art that the actual size of the encoder buffer 404 and/or the decoder buffer 408 can be determined by a hardware designer or by a software developer by varying from the standard.

Although it will be understood that the actual size of the decoder buffer 408 can vary from standard, there exist practical limitations that affect the size and occupancy of the decoder buffer 408. When the size of the decoder buffer 408 is increased, this can correspondingly increase the delay encountered when a sequence is selected and playback is initiated. For example, when a user changes the channel of a direct broadcast satellite (DBS) set-top box or skips forwards or backwards while viewing a DVD, the retrieved data is stored in the decoder buffer 408 before it is retrieved by the decoder 406 for playback. When the decoder buffer 408 is of a relatively large size, this can result in an infuriatingly long delay between selection of a sequence and playback of the sequence. Moreover, as will be described later in connection with Figure 5, the encoded data can specify when playback is to commence, such that playback can begin before the decoder buffer 408 is completely full of data.

In one embodiment, playback of a sequence begins upon the earlier of two conditions. A first condition is a time specified by the MPEG data stream. A parameter that is carried in the MPEG data stream known as <i>vbv-delay</i> provides an indication of the length of time that data for a sequence should be buffered in the decoder buffer 408 before the initiation of playback by the decoder 406. The <i>vbv-delay</i> parameter corresponds to a 16-bit number that ranges from 0 to 65,535. The value for the <i>vbv-delay</i> parameter is counted down by the decoder 406 by a 90 kHz clock signal such that the amount of time delay specified by the <i>vbv-delay</i> parameter corresponds to the value divided by 90,000. For example, the maximum value for the <i>vbv-delay</i> of 65,535 thereby corresponds to a time delay of about 728 milliseconds (mS). It will be understood that the <i>vbv-delay</i> can initiate playback of the sequence at a time other than when the decoder buffer 408 is full so that even if the decoder buffer 408 is relatively large, the occupancy of the decoder buffer 408 can be relatively low.

A second condition corresponds to the filling of the decoder buffer 408. It will be understood that if data continues to be provided to the decoder buffer 408 after the decoder buffer 408 has filled and has not been emptied, that some of the data stored in the decoder buffer 408 will typically be lost. To prevent the loss of data, the decoder 406 can initiate playback at a time earlier than the time specified by the <i>vbv-delay</i> parameter. For example, when the size of the decoder buffer 408 corresponds to the specified 224kB buffer size, bit-rates that exceed 2.52 Mega bits per second (Mbps) can fill the decoder buffer 408 in less time than the maximum time delay specified by the <i>vbv-delay</i> parameter.

The concept of the VBV buffer in the MPEG specification is intended to constrain the MPEG data stream such that decoding of the data stream does not result in an underrun or an overrun of the decoder buffer 408. It will be understood that the VBV buffer model does not have to be an actual buffer and does not actually have to store data. However, despite the existence of the VBV buffer concept, the video encoding techniques taught in MPEG's Test Model 5 (TM5) do not guarantee VBV compliance, and buffer underrun and overrun can occur.

Buffer underrun of the decoder buffer 408 occurs when the decoder buffer 408 runs out of data. This can occur when the bit rate of the constant-bit-rate data channel 410 is less than the bit rate at which data is consumed by the decoder 406 for a relatively long period of time. This occurs when the encoder 402 has used too many bits to encode the sequence relative to a specified bit rate. A visible artifact of buffer underrunning in the decoder buffer 408 is a temporary freeze in the sequence of pictures.

Buffer overrun of the decoder buffer 408 occurs when the decoder buffer 408 receives more data than it can store. This can occur when the bit rate of the constant-bit-rate data channel 410 exceeds the bit rate consumed by the decoder 406 for a relatively long period of time. This occurs when the encoder 402 has used too few bits to encode the sequence relative to the specified bit rate. As a result, the decoder buffer 408 is unable to store all of the data that is provided from the constant-bit-rate data channel 410, which can result in a loss of data. This type of buffer overrun can be prevented by "bit stuffing," which is the sending of data that is not used by the decoder 406 so that the number of bits used by the decoder 406 matches with the number of bits sent by the constant-bit-rate data channel 410 over a relatively long period of time. However, bit stuffing can introduce other problems as described in greater detail later in connection with Figures 9A and 9B.

The VBV buffer model concept is used by the encoder 402 in an attempt to produce a video data stream that will preferably not result in buffer underrun or overrun in the decoder buffer 408. In one embodiment, the occupancy levels of the VBV buffer model are monitored to produce a video data stream that does not result in buffer underrun or overrun in the decoder buffer 408. It should be noted that overrun and underrun in the encoder buffer 404 and in the decoder buffer 408 are not the same. For example, the conditions that result in a buffer underrun in the decoder buffer 408, i.e., an encoded bit rate that exceeds the bit rate of the constant-bit-rate data channel 410 for a sustained period of time, can also result in buffer overrun in the encoder buffer 404. Further, the conditions that result in a buffer overrun in the decoder buffer 408, i.e., an encoded bit rate that is surpassed by the bit rate of the constant-bit-rate data channel 410 for a sustained period of time, can also result in a buffer underrun in the encoder buffer 404.

Figure 5 is a chart that generally illustrates decoder buffer occupancy as data is provided to a decoder buffer at a constant bit rate while data is consumed by a decoder at a variable bit rate. In a conventional system based on MPEG TM5, the data stream provided to the decoder disadvantageously does not guarantee that the decoder buffer is prevented from buffer underrun or overrun conditions. In the illustrated example, the data is provided to the decoder buffer at a constant bit rate and the decoder uses the data to display the video in real time.

Time (t) 502 is indicated along a horizontal axis. Increasing time is indicated towards the right. Decoder buffer occupancy 504 is indicated along a vertical axis. In the beginning, the decoder buffer is empty. A maximum level for the buffer is represented by a B_MAX 528 level. An encoder desirably produces a data stream that maintains the data in the buffer below the B_MAX 528 level and above an empty level For example, the decoder buffer can be flushed in response to a skip within a program, in response to changing the selected channel in a direct broadcast satellite (DBS) system or in a digital cable television network, and the like. The decoder monitors the received data for a system clock reference (SCR), as indicated by SCR(0) 506. The system clock reference (SCR) is a time stamp for a reference clock that is embedded into the bit stream by the encoder and is used by the decoder to synchronize time with the time stamps for video information that are also embedded in the bit stream. The time stamps indicate when video information should be decoded, indicate when the video should be displayed, and also permit the synchronization of visual and audio samples.

An example of a picture type pattern that is commonly used in real-time video encoding is a presentation order with a repeating pattern of IBBPBBPBBPBBPBB. Despite the fact that I-pictures consume relatively large amounts of data, the periodic use of I-pictures is helpful for example, to permit a picture to be displayed in a relatively short period of time after a channel change in a DBS system.

The picture presentation or display order can vary from the picture encoding and decoding order. B-pictures depend on surrounding I- or P-pictures and not from other B-pictures, so that I- or P-pictures occurring after a B-picture in a presentation order will often be encoded, transmitted, and decoded prior to the encoding, transmitting, and decoding of the B-picture. For example, the relatively small portion of the sequence illustrated in Figure 5 includes data for pictures in the order of IPBBP, as a P-picture from which the B-pictures depend is typically encoded and decoded prior to the encoding and decoding of the B-pictures, even though the pictures may be displayed in an order of IBBPBBPBBPBBPBB. It will be understood that audio data in the video presentation will typically not be ordered out of sequence. Table I summarizes the activity of the decoder with respect to time. For clarity, the illustrated GOP will be described as having only the IPBBP pictures and it will be understood that GOPs will typically include more than the five pictures described in connection with Figure 5. <tables id="tabl0001" num="0001"><table frame="all"><title>Table I.</title><tgroup cols="2" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="78.75mm" /><colspec colnum="2" colname="col2" colwidth="78.75mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">time</entry><entry namest="col2" nameend="col2" align="left">activity</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center">&lt; T₀</entry><entry namest="col2" nameend="col2" align="left">data accumulates in the buffer</entry></row><row><entry namest="col1" nameend="col1" align="center">T₀</entry><entry namest="col2" nameend="col2" align="left">I-picture is decoded</entry></row><row><entry namest="col1" nameend="col1" align="center">T₁</entry><entry namest="col2" nameend="col2" align="left">I-picture is presented, first P-picture is decoded</entry></row><row><entry namest="col1" nameend="col1" align="center">T₂</entry><entry namest="col2" nameend="col2" align="left">first B-picture is decoded and presented</entry></row><row><entry namest="col1" nameend="col1" align="center">T₃</entry><entry namest="col2" nameend="col2" align="left">second B-picture is decoded and presented</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">T₄</entry><entry namest="col2" nameend="col2" align="left">first P-picture is presented, second P-picture is decoded</entry></row></tbody></tgroup></table></tables>

In one embodiment, the decoder buffer ignores data until a picture header with a presentation time stamp (PTS) for an I-frame is detected. This time is indicated by a time TTS₀(0) 508 in Figure 5. This bypassing of data prevents the buffering of data for part of a picture or frame or the buffering of data that cannot be decoded by itself. After the time TTS₀(0) 508, the decoder buffer begins to accumulate data as indicated by the ramp R₀ 510.

For a time period τ₀(0) 512, the decoder buffer accumulates the data before the decoder begins using the data. This time period τ₀(0) 512 is also known as a preloading delay. Along the top of Figure 5 are references for time that are spaced approximately evenly apart with a picture period equal to the inverse of the frame rate or inverse of the picture rate (1/R_f) 514. As will be described later, the location in time for the pictures can be indicated by time stamps for the corresponding pictures. At a time T₀ 516, the decoder retrieves an amount of data corresponding to the first picture of a group of pictures (GOP), which is an I-picture. The data stream specifies the time to decode the I-picture in a decoding time stamp (DTS), which is shown as a time stamp DTS₀(0) 518 and specifies the time T₀ 516.

The retrieval of data corresponding to the I-picture is indicated by the relatively sharp decrease 520 in decoder buffer occupancy. For clarity, the extraction of data from the decoder buffer is drawn in Figure 5 as occurring instantaneously, but it will be understood by one of ordinary skill in the art that a relatively small amount of time can be used to retrieve the data. Typically, I-pictures will consume a relatively large amount of data, P-pictures will consume a relatively smaller amount of data, and B-pictures will consume a relatively small amount of data. However, the skilled practitioner will appreciate that intra macroblocks, which consume a relatively large amount of data, can be present in P-pictures and in B-pictures, as well as in I-pictures, such that P-pictures and B-pictures can also consume relatively large amounts of data. The I-picture that is decoded at the time T₀ 516 is not yet displayed at the time T₀ 516, as a presentation time stamp PTS₀(1) 522 specifies presentation at a time T₁ 524.

At the time T₁ 524, the decoder displays the picture corresponding to the I-picture that was decoded at the time T₀ 516. The time period PTS_OFFSET 526 illustrates the delay from the start of accumulating data in the decoder buffer for the selected sequence to the presentation of the first picture. A decoding time stamp DTS₀(1) 530 instructs the decoder to decode the first P-picture in the sequence at the time T₁ 524. The extraction of data from the decoder buffer is illustrated by a decrease 532 in buffer occupancy. In between the time T₀ 516 to the time T₁ 524, the decoder buffer accumulates additional data as shown by a ramp 534. A presentation time stamp PTS₀(4) 536 instructs the decoder to display the first P-picture at a time T₄ 538. In this example, the first P-picture is decoded earlier than it is presented such that the B-pictures, which can include backward predictively, forward predictively, or even bi-directionally predictively coded macroblocks, can be decoded.

At a time T₂ 540, the decoder decodes and displays the first B-picture as specified by a presentation time stamp PTS₀(2) 542. No decoding time stamp (DTS) is present because both the decoding and presenting occur at the same time period. It will be understood that in actual decoders, there can be a relatively small delay between the decoding and the displaying to account for computation time and other latencies. The amount of data that is typically used by a B-picture is relatively small as illustrated by a relatively small decrease 550 in decoder buffer occupancy for the first B-picture. It will be understood, however, that B-pictures can also include intra macroblocks that can consume a relatively large amount of data.

At a time T₃ 546, the decoder decodes and displays the second B-picture as specified by a presentation time stamp PTS₀(3) 548.

At the time T₄ 538, the decoder displays the first P-picture that was originally decoded at the time T₁ 524. At the time T₄ 538, the decoder also decodes a second P-picture as specified by the second P-picture's decoding time stamp DTS₀(4) 554. The second P-picture will be presented at a later time, as specified by a presentation time stamp (not shown). The decoder continues to decode and to present other pictures. For example, at a time T₅ 544, the decoder may decode and present a B-frame, depending on what is specified by the data stream.

<u>Rate Control and Quantization Control Process</u>

Figure 6 is a flowchart that generally illustrates a rate control and quantization control process in a video encoder. It will be appreciated by the skilled practitioner that the illustrated process can be modified in a variety of ways without departing from the spirit and scope of the invention. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like. In another embodiment, selected portions of the illustrated process are replaced with processes from a rate control and quantization control process as disclosed in Chapter 10 of Test Model 5. The rate at which bits are consumed to encode pictures affects the occupancy of the decoder buffer during encoding. As illustrated by brackets in Figure 6, portions of the process are related to bit allocation, to rate control, and to adaptive quantization. Bit allocation relates to estimating the number of bits that should be used to encode the picture to be encoded. Rate control relates to determining the reference quantization parameter <i>Q</i>_<i>j</i> that should be used to encode a macroblock. Adaptive quantization relates to analyzing the spatial activity in the macroblocks in order to modify the reference quantization parameter <i>Q</i>_<i>j</i> and calculate the value of the quantization parameter <i>mquant</i>_<i>j</i> that is used to quantize a macroblock.

The process begins at a state 602, where the process receives its first group of pictures. It will be understood that in one embodiment, the process may retrieve only a portion of the first group of pictures in the state 602 and retrieve remaining portions of the first group of pictures later. In the illustrated process, the pictures are grouped into groups of pictures before the pictures are processed by the rate control and quantization control process. A group of pictures starts with an I-picture and can include other pictures. Typically, but not necessarily, the other pictures in the group of pictures are related to the I-picture. The process advances from the state 602 to a state 604.

In the state 604, the process receives the mode or type of encoding that is to be applied to the pictures in the group of pictures. In the illustrated rate control and quantization control process, the decision as to which mode or type of encoding is to be used for each picture in the group of pictures is made before the pictures are processed by the rate control and quantization control process. For example, the group of pictures described earlier in connection with Figure 5 have types IPBBP. The process advances from the state 604 to a state 606.

In the state 606, the process determines the number of P-pictures <i>N</i>_<i>p</i> and the number of B-pictures <i>N</i>_<i>b</i> in the group of pictures to be encoded. For example, in the group of pictures with types IPBBP, there are two P-pictures and there are two B-pictures to be encoded such that a value for <i>N</i>_<i>p</i> is 2 and a value for <i>N</i>_<i>b</i> is also 2. There is no need to track the number of I-pictures remaining, as the only I-picture in a group of pictures is the first picture. The process advances from the state 606 to a state 608.

In the state 608, the process initializes values for complexity estimators <i>X</i>_<i>i</i><i>, X</i>_<i>p</i><i>,</i> and <i>X</i>_<i>b</i> and for the remaining number of bits <i>R</i> allocated to the group of pictures that is to be encoded. In one embodiment, the process initializes the values for the complexity estimators <i>X</i>_<i>i</i><i>, X</i>_<i>p</i><i>,</i> and <i>X</i>_<i>b</i> according to Equations 1-3.<maths id="math0001" num="(Eq. 1)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">X</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext> = </mtext><mfrac><mrow><mtext>160·</mtext><mtext mathvariant="italic">bit_rate</mtext></mrow><mrow><mtext>115</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0001.tif" /></maths><maths id="math0002" num="(Eq. 2)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">X</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><mtext> = </mtext><mfrac><mrow><mtext>60·</mtext><mtext mathvariant="italic">bit_rate</mtext></mrow><mrow><mtext>115</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0002.tif" /></maths><maths id="math0003" num="(Eq. 3)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">X</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msub><mtext> = </mtext><mfrac><mrow><mtext>42·</mtext><mtext mathvariant="italic">bit_rate</mtext></mrow><mrow><mtext>115</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0003.tif" /></maths>

In Equations 1-3, the variable <i>bit_rate</i> corresponds to the relatively constant bit rate (in bits per second) of the data channel, such as the constant-bit-rate data channel 410 described earlier in connection with Figure 4. In another embodiment, bit_rate corresponds to the average or desired average bit rate of a variable bit rate channel. In yet another embodiment, <i>bit_rate</i> corresponds to a piece-wise constant bit rate value of a variable bit rate channel.

In one embodiment, the initial value <i>R</i>₀ for the remaining number of bits <i>R</i> at the start of the sequence, i.e., the initial value of <i>R</i> before encoding of the first group of pictures, is expressed in Equation 4 as <i>R</i>₀. At the start of the sequence, there is no previous group of pictures and as a result, there is no carryover in the remaining number of bits from a previous group of pictures. Further updates to the value for the remaining number of bits <i>R</i> will be described later in connection with Equations 27 and 28.<maths id="math0004" num="(Eq. 4)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">R</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></msub><mtext> = </mtext><mtext mathvariant="italic">G</mtext></mrow></math><img file="EP1515564A2_D0004.tif" /></maths><maths id="math0005" num="(Eq. 5)"><math display="block"><mrow><mtext mathvariant="italic">G</mtext><mtext> = </mtext><mfrac><mrow><mtext mathvariant="italic">bit_rate</mtext><mtext>·</mtext><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext mathvariant="italic">picture_rate</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0005.tif" /></maths>

The variable <i>G</i> represents the number of bits that can be transferred by the data channel in an amount of time corresponding to the length of the presentation time for the group of pictures. This amount of time varies with the number of pictures in the group of pictures. In Equation 5, the variable <i>bit_rate</i> is in bits per second, the value of <i>N</i> corresponds to the number of pictures in the group of pictures (of all types), and the variable <i>picture</i>_<i>rate</i> is in pictures or frames per second. The process then advances from the state 608 to a state 610.

In the state 610, the process calculates an initial target number of bits <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i><i>,</i> i.e., an initial target bit allocation, for the picture that is to be encoded. It should be noted that the pictures in a group of pictures will typically be encoded out of sequence when B-pictures are encoded. In one embodiment, the rate control and quantization control process calculates the initial target bit allocation for the picture according to the equation from Equations 6-8 for the corresponding picture type that is to be encoded.<maths id="math0006" num=""><img file="EP1515564A2_D0006.tif" /></maths><maths id="math0007" num=""><img file="EP1515564A2_D0007.tif" /></maths><maths id="math0008" num=""><img file="EP1515564A2_D0008.tif" /></maths>

In Equation 6, <i>T</i>_<i>i</i> corresponds to the target bit allocation for the next picture to be encoded when the picture is the I-picture that starts a group of pictures, and <i>T</i>_<i>i</i><i> is</i> determined by the higher of the two expressions in the brackets. In Equation 7, <i>T</i>_<i>p</i> corresponds to the target bit allocation for the next picture to be encoded when the next picture is a P-picture. In Equation 8, <i>T</i>_<i>b</i> corresponds to the target bit allocation for the picture when the picture is a B-picture. The values of the ''universal constants" <i>K</i>_<i>p</i> and <i>K</i>_<i>b</i> depend on the quantization matrices that are used to encode the pictures. It will be understood that the values for <i>K</i>_<i>p</i> and <i>K</i>_<i>b</i> can vary. In one embodiment, the values for <i>K</i>_<i>p</i> and <i>K</i>_<i>b</i> are 1.0 and 1.4, respectively. In another embodiment, the value of these constants can be changed according to the characteristics of the encoded pictures, such as amount and type of motion, texture, color and image detail.

In one embodiment of the rate control and quantization control process, the process further adjusts the target bit allocation <i>T</i>_{<i>(i,p,b)</i>} from the initial target bit allocation depending on the projected buffer occupancy of the decoder buffer as will be described in greater detail later in connection with Figure 7.

When the process has determined the target bit allocation for the next picture to be encoded, the process advances from the state 610 to a state 612. Also, the bits allocated to a picture are further allocated among the macroblocks of the picture. This macroblock bit allocation can be calculated by conventional techniques, such as techniques described in TM5, or by the techniques described herein in greater detail later in connection with a state 614. In addition, various orders or sequences in which a picture can advantageously be processed when encoded into macroblocks will be described in greater detail later in connection with Figures 8A and 8B.

In the state 612, the process sets initial values for virtual buffer fullness. In one embodiment, there is a virtual buffer for each picture type. The variables <i>d</i><maths id="math0009" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0009.tif" /></maths>, <i>d</i><maths id="math0010" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0010.tif" /></maths>, and <i>d</i><maths id="math0011" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0011.tif" /></maths> represent the virtual buffer fullness for I-pictures, for P-pictures, and for B-pictures, respectively. The variable <i>j</i> represents the number of the macroblock that is being encoded and starts at a value of 1. A value of 0 for <i>j</i> represents the initial condition. The virtual buffer fullness, i.e., the values of <i>d</i><maths id="math0012" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0012.tif" /></maths>, <i>d</i><maths id="math0013" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0013.tif" /></maths>, and <i>d</i><maths id="math0014" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0014.tif" /></maths>, correspond to the virtual buffer fullness prior to encoding the <i>j</i>-th macroblock such that the virtual buffer fullness corresponds to the fullness at macroblock (<i>j</i>-1).<maths id="math0015" num="(Eq. 9)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup><mtext> = 10·</mtext><mfrac><mrow><mtext mathvariant="italic">r</mtext></mrow><mrow><mtext>31</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0015.tif" /></maths><maths id="math0016" num="(Eq. 10)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">K</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><mtext>·</mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup></mrow></math><img file="EP1515564A2_D0016.tif" /></maths><maths id="math0017" num="(Eq. 11)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">K</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msub><mtext>·</mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup></mrow></math><img file="EP1515564A2_D0017.tif" /></maths>

One example of a computation for the value of the reaction parameter <i>r</i> that appears in Equation 9 is expressed by Equation 12. It will be understood by one of ordinary skill in the art that other formulas for the calculation of the reaction parameter <i>r</i> can also be used.<maths id="math0018" num="(Eq. 12)"><math display="block"><mrow><mtext mathvariant="italic">r</mtext><mtext> = 2·</mtext><mfrac><mrow><mtext mathvariant="italic">bit_rate</mtext></mrow><mrow><mtext mathvariant="italic">picture_rate</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0018.tif" /></maths>

With respect to Equations 10 and 11, <i>K</i>_<i>p</i> and <i>K</i>_<i>b</i> correspond to the "universal constants" described earlier in connection with Equations 6-8. The process can advance from the state 612 to the state 614 or can skip to a state 616 as will be described in connection with the state 614.

The process can also include a macroblock mode decision 622 to determine whether a macroblock should be encoded as Intra, Inter_No_MC, and Inter_MC, and the like. It will be understood that the types modes that are available can depend on a variety of factors, such as the type of picture, whether the picture is interlaced or progressive. The macroblock mode decision can be executed in parallel or in series with the states 616, 619, 621. One embodiment of the macroblock mode decision that advantageously uses a coding cost for motion vectors in the mode decision will be described in greater detail later in connection with Figure 17. The macroblock mode decision is provided as an input to the state 623.

In the state 614, the process updates the calculations for virtual buffer fullness, i,e., the value for <i>d</i><maths id="math0019" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0019.tif" /></maths>, <i>d</i><maths id="math0020" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0020.tif" /></maths>, or <i>d</i><maths id="math0021" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0021.tif" /></maths>. The value <i>d</i><maths id="math0022" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0022.tif" /></maths>, <i>d</i><maths id="math0023" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0023.tif" /></maths>, or <i>d</i><maths id="math0024" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0024.tif" /></maths> that is updated depends on the picture type, e.g., the <i>d</i><maths id="math0025" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0025.tif" /></maths> value is updated when an I-picture is encoded. The process updates the calculations for the virtual buffer fullness to account for the bits used to encode the macroblock. The update to the virtual buffer fullness should correspond to the technique used to allocate the bits among the macroblocks of a picture. For example, where TM5 is followed, the allocation of bits within the macroblocks of a picture can be approximately linear, i.e., constant. In one embodiment, the bits are also advantageously allocated among macroblocks based on the relative motion of a macroblock within a picture (for P-pictures and B-pictures), rather than an estimate of the relative motion.

Equations 13a, 14a, and 15a generically describe the update to the calculations for virtual buffer fullness.<maths id="math0026" num="(Eq. 13a)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup><mtext> = </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup><mtext>+</mtext><msub><mrow><mtext mathvariant="italic">B</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></msub><mtext>-</mtext><msubsup><mrow><mtext mathvariant="italic">TMB</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup></mrow></math><img file="EP1515564A2_D0026.tif" /></maths><maths id="math0027" num="(Eq. 14a)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup><mtext> = </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup><mtext>+</mtext><msub><mrow><mtext mathvariant="italic">B</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></msub><mtext>-</mtext><msubsup><mrow><mtext mathvariant="italic">TMB</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup></mrow></math><img file="EP1515564A2_D0027.tif" /></maths><maths id="math0028" num="(Eq. 15a)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup><mtext> = </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup><mtext>+</mtext><msub><mrow><mtext mathvariant="italic">B</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></msub><mtext>-</mtext><msubsup><mrow><mtext mathvariant="italic">TMB</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup></mrow></math><img file="EP1515564A2_D0028.tif" /></maths>

The variable <i>B</i>_<i>j</i> corresponds to the number of bits that have already been used to encode the macroblocks in the picture that is being encoded, including the bits used in macroblocks <i>j</i> such that the variable <i>B</i>_<i>j</i>_-1 corresponds to the number of bits that have been used to encode the macroblocks up to but not including the <i>j</i>-th macroblock. The variables <i>TMB</i><maths id="math0029" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0029.tif" /></maths>, <i>TMB</i><maths id="math0030" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0030.tif" /></maths>, and <i>TMB</i><maths id="math0031" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0031.tif" /></maths> correspond to the bits allocated to encode the macroblocks up to but not including the <i>j</i>-th macroblock.

Equations 13b, 14b, and 15b express calculations for virtual buffer fullness, i.e., values for <i>d</i><maths id="math0032" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0032.tif" /></maths>, <i>d</i><maths id="math0033" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0033.tif" /></maths>, or <i>d</i><maths id="math0034" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0034.tif" /></maths>, as used in the process described by TM5, Disadvantageously, the TM5 process allocates bits within a picture without regard to motion of macroblocks such that macroblocks that should have bits allocated variably to accommodate rapid motion, such as the macroblocks that encode the movement of an athlete, have the same bits allocated as macroblocks that are relatively easy to encode.<maths id="math0035" num=""><img file="EP1515564A2_D0035.tif" /></maths><maths id="math0036" num=""><img file="EP1515564A2_D0036.tif" /></maths><maths id="math0037" num=""><img file="EP1515564A2_D0037.tif" /></maths>

In one embodiment, the updated values are expressed by Equations 13c, 14c, and 15c. The use of Equations 13c, 14c, and 15c permit the allocation of bits to macroblocks within a picture to be advantageously allocated based on the motion activity of a macroblock within a picture. Advantageously, such allocation can permit the bits of a picture to be allocated to macroblocks based on a computation of the relative motion of the macroblock rather than a constant amount or an estimate of the motion. The variable allocation of bits among the macroblocks of a picture will be described in greater detail later in connection with Figures 8A and 8B.<maths id="math0038" num=""><img file="EP1515564A2_D0038.tif" /></maths><maths id="math0039" num=""><img file="EP1515564A2_D0039.tif" /></maths><maths id="math0040" num=""><img file="EP1515564A2_D0040.tif" /></maths>

The variable <i>MACT</i> represents the sum of the motion activity of all of the macroblocks as expressed in Equation 16. The variable <i>Mact_sum</i>_<i>j-1</i> corresponds to the sum of the motion activity of all of the macroblocks in the picture that have been encoded, i.e., the macroblocks up to but not including macroblock <i>j</i>, as expressed in Equation 17.<maths id="math0041" num=""><img file="EP1515564A2_D0041.tif" /></maths><maths id="math0042" num=""><img file="EP1515564A2_D0042.tif" /></maths>

In Equation 16, the parameter <i>MB_cnt</i> corresponds to the number of macroblocks in the picture and the variable <i>Mact</i>_<i>k</i> corresponds to the motion activity measure of the luminance of the <i>k</i>-th macroblock. A variety of techniques can be used to compute the motion activity measure such as variance computations and sum of absolute difference computations.

In another embodiment, the updated values for the occupancy of the virtual buffers <i>d</i><maths id="math0043" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0043.tif" /></maths>, <i>d</i><maths id="math0044" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0044.tif" /></maths>, or <i>d</i><maths id="math0045" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0045.tif" /></maths> are calculated based on the corresponding equations for updated virtual buffer occupancy described in Chapter 10 of the TM5 model from MPEG.

In another embodiment, the updated values for the occupancy of the virtual buffers <i>d</i><maths id="math0046" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0046.tif" /></maths>, <i>d</i><maths id="math0047" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0047.tif" /></maths>, or <i>d</i><maths id="math0048" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0048.tif" /></maths> are calculated based on Equations 13d, 14d, and 15d. <chemistry id="chem0001" num="0001"><img file="EP1515564A2_D0049.tif" /></chemistry><chemistry id="chem0002" num="0002"><img file="EP1515564A2_D0050.tif" /></chemistry><chemistry id="chem0003" num="0003"><img file="EP1515564A2_D0051.tif" /></chemistry>

In Equations 13d, 14d, and 15d, α_<i>i</i>, α_<i>p</i>, and α_<i>b</i> correspond to weighting factors that can range from about 0 to about 1. These weighting factors α_<i>i</i>, α_<i>p</i>, and α_<i>b</i> permit the allocation of bits to macroblocks within a picture to be advantageously allocated based on a combination of the relatively equal proportioning from TM5 and the proportioning based on motion activity described earlier in connection with Equations 13c, 14c, and 15c. This combined allocation can advantageously compensate for bits that are relatively evenly allocated, such as bits for overhead. The values for the weighting factors α_<i>i</i>, α_<i>p</i>, and α_<i>b</i> can vary widely within the range of about 0 to about 1. In one embodiment, the weighting factors α_<i>i</i>, α_<i>p</i>, and <b>α</b>_<i>b</i> range from about 0 to about 0.5. For example, sample values for these weighting factors can correspond values such as 0.2, 0.3, 0.4 and 0.5. Other values within the range of about 0 to about 1 will be readily determined by one of ordinary skill in the art. One embodiment of the video encoder permits a user to configure the values for the weighting factors α_<i>i</i>, α_<i>p</i>, and α_<i>b</i>.

The values for the occupancy of the virtual buffers <i>d</i><maths id="math0049" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0052.tif" /></maths>, <i>d</i><maths id="math0050" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0053.tif" /></maths>, or <i>d</i><maths id="math0051" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0054.tif" /></maths> are computed for each macroblock in the picture. It will be understood, however, that the value for the first macroblock, i.e., <i>d</i><maths id="math0052" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>1</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0055.tif" /></maths>, <i>d</i><maths id="math0053" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>1</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0056.tif" /></maths>, or <i>d</i><maths id="math0054" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>1</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0057.tif" /></maths>, is the same as the initial values set in the state 612 such that the state 614 can be skipped for the first macroblook. The process advances from the state 614 to the state 616.

In the state 616, the process computes the reference quantization parameter <i>Q</i>_<i>j</i> that is to be used to quantize macroblock <i>j</i>. Equation 18 expresses a computation for the reference quantization parameter <i>Q</i>_<i>j</i><i>.</i> The process advances from the state 616 to a state 619.<maths id="math0055" num=""><img file="EP1515564A2_D0058.tif" /></maths>

In the state 619, the process computes the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> for the macroblocks. In one embodiment, the process computes the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> in accordance with the TM5 process and Equations 19a, 19b, 21a, 22, and 23a. Disadvantageously, the computation of the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> via TM5 allocates bits to macroblocks within a picture based only on spatial activity (texture) and does not take motion into consideration. In addition, as will be explained in greater detail later in connection with Equation 23a, the TM5 process disadvantageously uses an inappropriate value in the computation of an average of the spatial activity measures <i>Savg_act</i>_<i>j</i> due to limitations in the processing sequence, which is explained in greater detail later in connection with Figures 8A and 8B.

In another embodiment, the process computes the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> in accordance with Equations 20a, 21b, 21c, 22, and 23b. The combination of the motion activity measure used for computation of the reference quantization parameter <i>Q</i>_<i>j</i> with the modulation effect achieved through the normalized spatial activity measure advantageously permits bits to be allocated within a picture to macroblocks not only based on spatial activity (texture), but also based on motion. This can dramatically improve a picture. For example, when only spatial activity is used, areas of a picture with rapid motion, such as an area corresponding to an athlete's legs in a sporting event, are typically allocated relatively few bits, which results in visual artifacts such as a ''blocky'' appearance. This happens because areas of pictures with rapid motion typically exhibit relatively high spatial activity (high texture), and are then allocated relatively few bits. In addition, as will be described later in connection with Equation 23b, one embodiment further uses the actual values for spatial activity measures, which advantageously results in a better match between targeted bits and actually encoded bits, thereby decreasing the likelihood of buffer overrun or buffer underrun.

In the state 619, the activity corresponds to spatial activity within the picture to determine the texture of the picture. A variety of techniques can be used to compute the spatial activity. For example, the process can compute the spatial activity in accordance with the techniques disclosed in Chapter 10 of Test Model 5 or in accordance with new techniques that are described herein. Equation 19a illustrates a computation for the spatial activity of a macroblock <i>j</i> from luminance frame-organized sub-blocks and field-organized sub-blocks as set forth in Chapter 10 of Test Model 5. The intra picture spatial activity of the <i>j</i>-th macroblock, i.e., the texture, can be computed using Equation 19b, which corresponds to the computation that is used in TM5.<maths id="math0056" num=" (Eq. 19a)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">act</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub><mtext> = 1+</mtext><mtext mathvariant="italic">min</mtext><mtext>(</mtext><msub><mrow><mtext mathvariant="italic">vblk</mtext></mrow><mrow><mtext>1</mtext></mrow></msub><mtext>,</mtext><msub><mrow><mtext mathvariant="italic">vblk</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><mtext>,...,</mtext><msub><mrow><mtext mathvariant="italic">vblk</mtext></mrow><mrow><mtext>8</mtext></mrow></msub><mtext>)</mtext></mrow></math><img file="EP1515564A2_D0059.tif" /></maths><maths id="math0057" num=""><img file="EP1515564A2_D0060.tif" /></maths>

A formula for computing the value of <i>P_mean</i>_<i>n</i> is expressed later in Equation 21a. The values for <i>P</i><maths id="math0058" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0061.tif" /></maths> correspond to the sample values from pixels in the <i>n</i>-th original 8 by 8 sub-block. Disadvantageously, the computation expressed in Equation 19b is relatively complicated and CPU intensive to compute, which can make real-time encoding difficult with relatively slow general purpose CPUs, such as microprocessors. Equation 19b computes the spatial activity via computation of a variance, which is referred to as L2-norm. This can be a drawback when video encoding is performed in real time and with full resolution and picture rates. As a result, real time video encoding is typically performed in conventional systems with dedicated hardware. Although dedicated hardware video encoders can process video at relatively high speeds, dedicated hardware is relatively more expensive, less supportable, and harder to upgrade than a software solution that can be executed by a general-purpose electronic device, such as a personal computer. Thus, video encoding techniques that can efficiently process video can advantageously permit a general-purpose electronic device to encode video in real time.

Equation 20a illustrates a computation for the spatial activity of macroblock <i>j</i> according to one embodiment. Another embodiment uses sums of absolute differences (instead of sum of squares of differences) as illustrated in Equations 19a and 19b to compute the spatial activity of macroblock <i>j</i>. Equation 20b illustrates a computation for the motion activity of macroblock <i>j</i> according to one embodiment.<maths id="math0059" num=""><img file="EP1515564A2_D0062.tif" /></maths><maths id="math0060" num=""><img file="EP1515564A2_D0063.tif" /></maths>

In Equation 20a, the <i>P</i><maths id="math0061" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext>j</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0064.tif" /></maths> values correspond to original luminance data. In Equation 20b, the <i>P</i><maths id="math0062" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext>j</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0065.tif" /></maths> values correspond to either original luminance data or to motion-compensated luminance data depending on the type of macroblock. The <i>P</i><maths id="math0063" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0066.tif" /></maths> values correspond to sample values for the <i>j</i>-th 16 by 16 original luminance, data when the macroblock is an intra macroblock. When the macroblock is an inter macroblock, the <i>P</i><maths id="math0064" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0067.tif" /></maths> values correspond to 16 by 16 motion compensated luminance data. A formula for computing the value of <i>P_mean</i>_<i>j</i> is expressed later in Equation 21b and 21c.

Moreover, the computations expressed in Equations 20a and 20b can advantageously permit a general-purpose electronic device to perform full picture rate and relatively high resolution video encoding using the described rate control and quantization control process in real time using software. It will be understood that the computations expressed in Equations 20a and 20b can also be used in non-real time applications and in dedicated hardware. One embodiment of a video encoding process, which was implemented in software and executed by an Intel® Pentium® 4 processor with a 3 GHz clock speed, efficiently and advantageously encoded a PAL, a SECAM, or an NTSC video data stream with a full picture rate and with full resolution (720 x 480 pixels) in real time.

The computations expressed in Equations 20a and 20b compute the sum of absolute differences (SAD), which is also known as an L1-norm calculation. Although the computation of the SAD can also be relatively complex, selected processors or CPUs include a specific instruction that permits the computation of the SAD in a relatively efficient manner. In one embodiment, the general-purpose electronic device corresponds to a personal computer with a CPU that is compatible with the Streaming Single Instruction/Multiple Data (SIMD) Extensions (SSE) instruction set from Intel Corporation. In another embodiment, the CPU of the general-purpose electronic device is compatible with an instruction that is the same as or is similar to the "PSADBW" instruction for packed sum of absolute differences (PSAD) of the SSE instruction set. Examples of CPUs that are compatible with some or all of the SSE instruction set include the Intel® Pentium® III processor, the Intel® Pentium® 4 processor, the Intel<b>®</b> Xeon™ processor, the Intel<b>®</b> Centrino™ processor, selected versions of the Intel® Celeron® processor, selected versions of the AMD Athlon™ processor, selected versions of the AMD Duron™ processor, and the AMD Opteron^TM processor. It will be understood that future CPUs that are currently in development or have yet to be developed can also be compatible with the SSE instruction set. It will also be understood that new instruction sets can be included in new processors and these new instruction sets can remain compatible with the SSE instruction set.

Equation 21a expresses a calculation for sample values as used in Equation 19b. Equations 21b and 21c express calculations for sample values as used in Equations 20a and 20b.<maths id="math0065" num=""><img file="EP1515564A2_D0068.tif" /></maths><maths id="math0066" num=""><img file="EP1515564A2_D0069.tif" /></maths><maths id="math0067" num="(Eq. 21c)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">P_mean</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub><mtext> = </mtext><mtext mathvariant="italic">0</mtext></mrow></math><img file="EP1515564A2_D0070.tif" /></maths>

In one embodiment, the process performs a computation for the average of the sample values in the <i>n</i>-th original 8 by 8 sub-block <i>P_mean</i>_<i>n</i> according to TM5 as expressed by Equation 21a. In another embodiment, the process computes the computation for the average of sample values <i>P_mean</i>_<i>j</i> via Equations 21b and 21c. Advantageously, Equations 21b and 21c combine spatial activity (texture) computations and motion estimation computations. Equation 21b is used when the macroblock corresponds to an intra macroblock. Equation 21c is used when the macroblock corresponds to an inter macroblock.

Equation 22 expresses a computation for the normalized spatial activity measures <i>N_Sact</i>_<i>j</i>. The normalized spatial activity measures <i>N_Sact</i>_<i>j</i> are used in a state 621 to compute the quantization that is applied to the discrete cosine transform (DCT) coefficients.<maths id="math0068" num="(Eq. 22)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">N_Sact</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub><mtext> = </mtext><mfrac><mrow><mtext>(2·</mtext><msub><mrow><mtext mathvariant="italic">Sact</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub><mtext>)+</mtext><mtext mathvariant="italic">Savg_act</mtext></mrow><mrow><msub><mrow><mtext mathvariant="italic">Sact</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub><mtext>+(2·</mtext><mtext mathvariant="italic">Savg_act</mtext><mtext>)</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0071.tif" /></maths>

As expressed in Equation 22, the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> for <i>the j-th</i> macroblock are computed from the spatial activity measure <i>Sact</i>_<i>j</i> for the macroblock and from an average of the spatial activity measures <i>Savg_ act.</i> The average of the spatial activity measures <i>Savg_act</i> can be computed by Equation 23a or by Equation 23b.<maths id="math0069" num=""><img file="EP1515564A2_D0072.tif" /></maths>

The computation expressed in Equation 23a represents the computation described in TM5 and uses the spatial activity measures <i>Sact</i>_<i>j</i> from the previous picture and not from the present picture. As a result, conventional encoders that comply with TM5 compute the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> expressed in Equation 22 relatively inaccurately. When a value for the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> is calculated via Equation 23a, the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> represents an estimate for normalization, rather than an actual calculation for normalization. The estimate provided in Equation 23a is particularly poor when the scene has changed from the previous picture to the current picture. As taught in TM5, a value of 400 can be used to initialize the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> for the first picture when the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> is computed from the previous picture.

Encoding via the process described in TM5 uses the previous picture for the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> because the processing sequence described in TM5 processes macroblocks one-by-one as the TM5 process encodes each macroblock, such that a value for the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> is not available at the time of the computation and use of the value for the normalized spatial activity measures <i>N_Sact</i>_<i>j</i><i>.</i> Further details of an alternate processing sequence will be described in greater detail later in connection with Figures 8A and 8B. The computation expressed in Equation 23b represents an improvement over the TM5-based computation expressed in Equation 23a.<maths id="math0070" num=""><img file="EP1515564A2_D0073.tif" /></maths>

In one embodiment, the sequence of processing of macroblocks is advantageously rearranged as will be described later in connection with Figures 8A and 8B. This rearrangement permits the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> to be computed from the spatial activity measures <i>Sact</i>_<i>j</i> of the macroblocks in the current picture such that the value for the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> is actually normalized rather than estimated. This advantageously permits the data to be relatively predictably quantized such that the amount of data used to encode a picture more accurately follows the targeted amount of data. This further advantageously reduces and/or eliminates irregularities and distortions to the values for the variables <i>d</i><maths id="math0071" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0074.tif" /></maths>, <i>d</i><maths id="math0072" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0075.tif" /></maths>, and <i>d</i><maths id="math0073" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0076.tif" /></maths> that represent the virtual buffer fullness for I-pictures, for P-pictures, and for B-pictures, respectively. In addition, it should be noted that the computation for the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> expressed in Equation 23b does not need to be initialized with an arbitrary value, such as a value of 400, because the actual average is advantageously computed from the spatial activity measures <i>Sact</i>_<i>j</i> of the picture that is currently being encoded. The process advances from the state 619 to the state 621. Advantageously, this permits calculation of actual motion activity measures, needed for the calculation of virtual buffer fullness status, as shown in Equations 13-17.

In the state 621, the process computes the quantization parameter <i>mquant</i>_<i>j</i><i>.</i> The quantization parameter <i>mquant</i>_<i>j</i> is used to quantize the encoded macroblock <i>j</i>. It will be understood that the quantization parameter <i>mquant</i>_<i>j</i> can be used in the state 621 or can be stored and used later. Equation 23 expresses a computation for the quantization parameter <i>mquant</i>_<i>j</i>.<maths id="math0074" num="(Eq. 23)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">mquant</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">Q</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub><mtext>·</mtext><msub><mrow><mtext mathvariant="italic">N_Sact</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0077.tif" /></maths>

In Equation 23, <i>Q</i>_<i>j</i> corresponds to the reference quantization parameter described earlier in connection with Equation 18 and <i>N_act</i>_<i>j</i> corresponds to the normalized spatial activity measures <i>N_Sact</i>_<i>j</i> described earlier in connection with Equation 22. In one embodiment, the process further inspects the computed quantization parameter <i>mquant</i>_<i>j</i> and limits its value to prevent undesirable clipping of a resulting quantized level <i>QAC</i>(<i>i,j</i>)<i>.</i> For example, where one embodiment of the process is used to encode video according to the MPEG-1 standard, the process detects that the calculated value for the quantization parameter <i>mquant</i>_<i>j</i> corresponds to 2, and automatically substitutes a value of 4. The quantization parameter <i>mquant</i>_<i>j</i> is later used in the macroblock encoding process to generate values for the quantized level <i>QAC</i>(<i>i,j</i>). However, in MPEG-1, a value for the quantized level <i>QAC</i>(<i>i</i>,<i>j</i>) is clipped to the range between -255 and 255 to fit within 8 bits. This clipping of data can result in visible artifacts, which can advantageously be avoided by limiting the value of a quantization parameter <i>mquant</i>_<i>j</i> to a value that prevents the clipping of the resulting quantized level, thereby advantageously improving picture quality.

In one embodiment, the process can further reset values for occupancy of virtual buffers (<i>d</i><maths id="math0075" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0078.tif" /></maths>, <i>d</i><maths id="math0076" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0079.tif" /></maths>, and <i>d</i><maths id="math0077" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0080.tif" /></maths>) and for the quantization parameter <i>mquant</i>_<i>j</i> in response to selected stimuli as will be described in greater detail later in connection with Figure 9A. The process advances from the state 621 to a state 623.

In the state 623, the process encodes the <i>j</i>-th macroblock. The process encodes the <i>j</i>-th macroblock using the quantization parameter <i>mquant</i>_<i>j</i> computed earlier in the state 616. The encoding techniques can include, for example, the computation of discrete cosine transforms, motion vectors, and the like. In one embodiment, the process can selectively skip the encoding of macroblocks in B-pictures as will be described in greater detail later in connection with Figure 11. The process advances from advances from the state 623 to a decision block 625.

In the decision block 625, the process determines whether all the macroblocks in the picture have bean processed by encoding in the state 616 or by skipping as will be described in connection with Figure 11. The process proceeds from the decision block 625 to a state 627 when the process has completed the encoding or skipping processing of the macroblocks in the picture. Otherwise, the process returns from the decision block 625 to the state 614 to continue to process the next macroblock.

In the state 627, the process stores the final occupancy value of the virtual buffers as an initial condition for encoding of the next picture of the same type. For example, the final, occupancy value for the relevant virtual buffer of the present frame, i.e., the value for <i>d</i><maths id="math0078" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0081.tif" /></maths>, <i>d</i><maths id="math0079" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0082.tif" /></maths>, or <i>d</i><maths id="math0080" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0083.tif" /></maths> when <i>j</i> is equal to <i>MB_cnt,</i> is saved so that it can be used as a starting value for <i>d</i><maths id="math0081" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext>i</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0084.tif" /></maths>, <i>d</i><maths id="math0082" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0085.tif" /></maths>, or <i>d</i><maths id="math0083" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0086.tif" /></maths>, respectively, for the next picture of the same type. In some circumstances, the number of bits used for encoding can be relatively low for a sustained period of time so that bit or byte stuffing is used to increase the number of bits used in encoding. This prevents a buffer overrun condition in the decoder buffer. However, the use of bit stuffing can undesirably distort the occupancy value in the corresponding virtual buffer, which can then result in instability in the encoder. In one embodiment, the rate control and quantization control process includes one or more techniques that advantageously ameliorate against the effects of bit stuffing. Examples of such techniques, will be described in greater detail later in connection with Figures 9A and 9B. The process advances from the state 627 to a decision block 630.

In the decision block 630, the illustrated process has completed the processing for the picture and determines whether the picture that was processed corresponds to the last picture in the group of pictures (GOP). This can be accomplished by monitoring the values remaining in the number of P-pictures <i>N</i>_<i>p</i> and the number of B-pictures <i>N</i>_<i>b</i> described earlier in connection with the state 606. The process proceeds from the decision block 630 to a state 632 when them are pictures that remain to be processed in the group of pictures. Otherwise, i.e., when the process has completed processing of the group of pictures, the process proceeds from the decision block 630 to a decision block 634.

In the state 632, the process updates the appropriate value in the number of P-pictures <i>N</i>_<i>p</i> or the number of B-pictures <i>N</i>_<i>b</i> and advances to a state 636 to initiate the processing of the next picture in the group of pictures. It will be understood that the next picture to be processed may not be the next picture to be displayed because of possible recordering of pictures during encoding.

In the state 636, the process updates the corresponding complexity estimators <i>X</i>_<i>i</i><i>, X</i>_<i>p</i><i>,</i> and <i>X</i>_<i>b</i> based on the picture that just been encoded. For example, if an I-picture had just been encoded, the process updates the complexity estimator <i>X</i>_<i>i</i> for the I-pictures as expressed in Equation 24. If the picture that had just been encoded was a P-picture or was a B-picture, the process updates the corresponding complexity estimator <i>X</i>_<i>p</i> or X_<i>b</i>, respectively, as expressed in Equation 25 and in Equation 26.<maths id="math0084" num="(Eq. 24)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">X</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">S</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic">Q</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0087.tif" /></maths><maths id="math0085" num="(Eq. 25)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">X</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">S</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic">Q</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0088.tif" /></maths><maths id="math0086" num="(Eq. 26)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">X</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">S</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic">Q</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0089.tif" /></maths>

In Equations 24, 25, and 26, the value of <i>S</i>_<i>i</i>, <i>S</i>_<i>p</i><i>,</i> or <i>S</i>_<i>b</i> corresponds to the number of bits generated or used to encode the picture for a picture of type I-picture, P-picture, or B-picture, respectively. The value of <i>Q</i>_<i>i</i>, <i>Q</i>_<i>p</i>, and <i>Q</i>_<i>b</i> corresponds to the average of the values for the quantization parameter <i>mquant</i>_<i>j</i> that were used to quantize the macroblocks in the picture. The process advances from the state 636 to a state 638.

In the state 638, the process updates the remaining number of bits <i>R</i> allocated to the group of pictures. The update to the remaining number of bits <i>R</i> allocated to the group of pictures depends on whether the next picture to be encoded is a picture from the existing group of pictures or whether the next picture to be encoded is the first picture in a new group of pictures. Both Equations 27 and 28 are used when the next picture to be processed is the first picture in a new group of pictures. When the next picture to be processed is another picture in the same group of pictures as the previously processed picture, then only Equation 27 is used. It will be understood that Equations 27 and 28 represent assignment statements for the value of <i>R</i>, such that a new value for <i>R</i> is represented to the left of the "=" sign and a previous value for <i>R</i> is represented to the right of the "=" sign.<maths id="math0087" num="(Eq. 27)"><math display="block"><mrow><mtext mathvariant="italic">R</mtext><mtext> = </mtext><mtext mathvariant="italic">R</mtext><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">S</mtext></mrow><mrow><mtext>(</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>,</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>,</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>)</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0090.tif" /></maths><maths id="math0088" num="(Eq. 28)"><math display="block"><mrow><mtext mathvariant="italic">R</mtext><mtext> = </mtext><mtext mathvariant="italic">G</mtext><mtext>+</mtext><mtext mathvariant="italic">R</mtext></mrow></math><img file="EP1515564A2_D0091.tif" /></maths>

In Equation 27, the process computes the new value for the remaining number of bits <i>R</i> allocated to the group of pictures by taking the previous value for <i>R</i> and subtracting the number of bits <i>S</i>₍_<i>i</i>_,_<i>p</i>_,_<i>b</i>₎ that had been used to encode the picture that had just been encoded. The number of bits <i>S</i>₍_<i>i</i>_,_<i>p</i>_,_<i>b</i>₎ that had been used to encode the picture is also used to calculate the VBV buffer model occupancy as will be described in greater detail later in connection with Figure 7. The computation expressed in Equation 27 is performed for each picture after it has been encoded. When the picture that has just been encoded is the last picture in a group of pictures such that the next picture to be encoded is the first picture in a new group of pictures, the computation expressed in Equation 27 is further nested with the computation expressed in Equation 28. In Equation 28, the process adds to a remaining amount in <i>R</i>, which can be positive or negative, a value of <i>G.</i> The variable <i>G</i> was described earlier in connection with Equation 5. The value of <i>G</i> is based on the new group of pictures to be encoded and corresponds to the number of bits that can be transferred by the data channel in the amount of time corresponding to the length of the presentation time for the new group of pictures. The process returns from the state 638 to the state 610 to continue to the video encoding process as described earlier.

Returning now to the decision block 634, at this point in the process, the process has completed the encoding of a picture that was the last picture in a group of pictures. In the decision block 634, the process determines whether it has completed with the encoding of the video sequence. It will be understood that the process can be used to encode video of practically indefinite duration, such as broadcast video, and can continue to encode video endlessly. The process proceeds from the decision block 634 to a state 640 when there is another group of pictures to be processed. Otherwise, the process ends.

In the state 640, the process receives the next group of pictures. It will be understood that in another embodiment, the process may retrieve only a portion of the next group of pictures in the state 640 and retrieve remaining portions later. In one embodiment, the state 640 is relatively similar to the state 602. The process advances from the state 640 to a state 642.

In the state 642, the process receives the mode or type of encoding that is to be applied to the pictures in the group of pictures. In the illustrated rate control and quantization control process, the decision as to which mode or type of encoding is to be used for each picture in the group of pictures is made before the pictures are processed by the rate control and quantization control process. In one embodiment, the state 642 is relatively similar to the state 604. The process advances from the state 642 to a state 644.

In the state 644, the process determines the number of P-picture <i>N</i>_<i>p</i> and the number of B-pictures <i>N</i>_<i>b</i> in the next group of pictures to be encoded. In one embodiment, the state 644 is relatively similar to the state 606. The process advances from the state 644 to the state 636, which was described in greater detail earlier, to continue with the encoding process.

<u>Control With VBV Buffer Model Occupancy Levels</u>

Figure 7 is a flowchart that generally illustrates a process for adjusting a targeted bit allocation based on an occupancy level of a virtual buffer. To illustrate the operation of the process, the process will be described in connection with MPEG-1 and MPEG-2 video encoding so that the virtual buffer corresponds to the video buffer verifier (VBV) buffer model. The VBV buffer model is a conceptual model that is used by the encoder to model the buffer occupancy levels in a decoder. It will be apparent to one of ordinary skill in the art that other buffer models can be used with other video encoding standards. Monitoring of VBV buffer model levels will be described now in greater detail before further discussion of Figure 7.

As described earlier in connection with Figure 4, the VBV buffer model anticipates or predicts buffer levels in the decoder buffer. The occupancy level of the decoder buffer is approximately inverse to the occupancy level of the encoder buffer, such that a relatively high occupancy level in the VBV buffer model indicates that relatively few bits are being used to encode the video sequence, and a relatively low occupancy level in the VBV buffer model indicates that relatively many bits are being used to encode the video sequence.

The occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer model is computed and monitored. In one embodiment, the occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer model is compared to a predetermined threshold, and the encoding can be adapted in response to the comparison as will be described in greater detail later in connection with Figure 11. In another embodiment, the occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer model is used to adaptively adjust a target number of bits <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> for a picture to be encoded. A computation for the occupancy level <i>V</i>_{<i>status</i>} is expressed in Equation 29.<maths id="math0089" num="(Eq. 29)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub><mtext> - </mtext><msub><mrow><mtext mathvariant="italic">S</mtext></mrow><mrow><mtext>(</mtext><mtext mathvariant="italic">i</mtext><mtext>,</mtext><mtext mathvariant="italic">p</mtext><mtext>,</mtext><mtext mathvariant="italic">b</mtext><mtext>)</mtext></mrow></msub><mtext> + </mtext><mfrac><mrow><mtext mathvariant="italic">bit_rate</mtext></mrow><mrow><mtext mathvariant="italic">picture_rate</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0092.tif" /></maths>

Equation 29 represents an assignment statement for the value of the occupancy level <i>V</i>_{<i>status</i>}. A new value for the occupancy level <i>V</i>_{<i>status</i>} is represented at the left of the "=" sign, and a previous value for the occupancy level <i>V</i>_{<i>status</i>} is represented to the right of the "=" sign. In one embodiment, the value of the occupancy level <i>V</i>_{<i>status</i>} is initialized to a target value for the VBV buffer model. An example of a target value is 7/8's of the full capacity of the VBV buffer model. In another embodiment, the value of <i>V</i>_{<i>status</i>} is initialized to a buffer occupancy that corresponds to a specified VBV-delay value. Other initialization values can be readily determined by one of ordinary skill in the art.

In Equation 29, the occupancy of the VBV buffer model is computed as follows. The number of bits <i>S</i>₍_<i>i,p,b</i>₎ that had been used to encode the picture just encoded is subtracted from the previous value for the occupancy level <i>V</i>_{<i>status</i>}<i>,</i> and the number of bits that would be transmitted in the time period corresponding to a "frame" or picture is added to the value for the occupancy level <i>V</i>_{<i>status</i>}<i>.</i> As illustrated in Equation 29, the number of bits that would be transmitted in the frame is equal to bit rate times the inverse of the frame rate. The computation expressed in Equation 29 is adapted to update the occupancy level <i>V</i>_{<i>status</i>} for each picture processed. In another embodiment, the expression is modified to update the occupancy level <i>V</i>_{<i>status</i>} for less than each picture, such as every other picture.

As will be described later in connection with Figure 7, one embodiment of the process compares the target number of bits for a picture <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> to a threshold <i>T</i>_<i>mid</i>, and adjusts the target number of bits <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i><i>,</i> in response to the comparison. This advantageously assists the video encoder to produce a data stream that is compliant with VBV to protect against buffer underrun or buffer overrun in the decoder.

One embodiment uses five parameters related to VBV buffer model occupancy levels for control. It will be understood that in other embodiments, fewer than five parameters or more than five parameters can also be used. The parameters can vary in a very broad range and can include fixed parameters, variable parameters, adaptable parameters, user-customizable parameters, and the like. In one embodiment, the following parameters are used (in decreasing order of occupancy): <i>V</i>_<i>high</i>, <i>V</i>_{<i>target</i>}<i>, V</i>_<i>mid</i><i>, V</i>_<i>low</i>, and <i>V</i>_{<i>critical</i>}.

<i>V</i>_<i>high</i> corresponds to a relatively high value for the occupancy of the VBV buffer model. In one embodiment, the process strives to control encoding such that the occupancy of the VBV buffer model is maintained below <i>V</i>_<i>high</i>.

<i>V</i>_{<i>target</i>} corresponds to an occupancy level for the VBV buffer model that is desired. In one embodiment, the desired buffer occupancy level <i>V</i>_{<i>target</i>} can be configured by a user.

<i>V</i>_<i>mid</i> corresponds to an occupancy level that is about half of the capacity of the VBV buffer model.

<i>V</i>_<i>low</i> corresponds to a relatively low value for the occupancy of the VBV buffer model. In one embodiment, the process strives to control encoding such that the occupancy of the VBV buffer model is maintained above <i>V</i>_<i>low</i>.

<i>V</i>_{<i>critical</i>} corresponds to an even lower occupancy level than <i>V</i>_<i>low</i>_. In one embodiment, when the occupancy of the VBV buffer model falls below <i>V</i>_{<i>critical</i>}, the process proceeds to skip macroblocks in B-pictures as will be described in greater detail later in connection with Figure 11.

Table II illustrates sample values for threshold levels. Other suitable values will be readily determined by one of ordinary skill in the art. <tables id="tabl0002" num="0002"><table frame="all"><title>Table II</title><tgroup cols="2" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="78.75mm" /><colspec colnum="2" colname="col2" colwidth="78.75mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Threshold</entry><entry namest="col2" nameend="col2" align="center">Sample Value</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center"><i>V</i>_<i>high</i></entry><entry namest="col2" nameend="col2" align="center">about 63/64 of VBV buffer model size</entry></row><row><entry namest="col1" nameend="col1" align="center"><i>V</i>_{<i>target</i>}</entry><entry namest="col2" nameend="col2" align="center">about 7/8 of VBV buffer model size</entry></row><row><entry namest="col1" nameend="col1" align="center"><i>V</i>_<i>mid</i></entry><entry namest="col2" nameend="col2" align="center">about 1/2 of VBV buffer model size</entry></row><row><entry namest="col1" nameend="col1" align="center"><i>V</i>_<i>low</i></entry><entry namest="col2" nameend="col2" align="center">about 3/8 of VBV buffer model size</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center"><i>V</i>_{<i>critical</i>}</entry><entry namest="col2" nameend="col2" align="center">about 1/4 of VBV buffer model size</entry></row></tbody></tgroup></table></tables>

The sample values listed in Table II are advantageously scaled to the VBV buffer model size. As described in greater detail earlier in connection with Figure 4, the VBV buffer model size is approximately 224 kB for MPEG-2 and is approximately 40 kB for MPBG-1. It will be understood by one of ordinary skill in the art that the size of a virtual buffer model, such as the VBV buffer model for MPEG-1 and MPEG-2, can vary according with the video encoding standard used and the application scenario.

Returning now to Figure 7, the process illustrated in Figure 7 adjusts a targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> for a picture based at least in part on the occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer model. In one embodiment, the process illustrated in Figure 7 is incorporated in the state 610 of the process illustrated in Figure 6. The process can start at an optional decision block 710, where the process compares the value of the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> (generically written as <i>T</i>_{<i>(i,p,b)</i>} in Figure 7) to one or more target thresholds, such as to <i>T</i>_<i>mid</i> or to <i>T</i>_<i>high</i><i>.</i> For example, the target threshold <i>T</i>_<i>mid</i> can be selected such that the adjustment process is invoked when the VBV buffer model occupancy level is relatively low. In another example, the target threshold <i>T</i>_<i>high</i> can be selected such that the adjustment process is invoked when the VBV buffer model occupancy is relatively high. In one embodiment, only one of the target thresholds <i>T</i>_<i>mid</i> or <i>T</i>_<i>high</i> is used, in another embodiment, both target thresholds are used, and in yet another embodiment, the optional decision block 710 is not present and neither target threshold is used. In the illustrated embodiment, the adjustment process is invoked in response to the VBV buffer model occupancy level and to the number of bits allocated to the picture to be encoded. The computation of the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> can be performed as described earlier in connection with the state 610 and Equations 6, 7, and 8 of Figure 6. Equation 30a expresses a sample computation for the target threshold <i>T</i>_<i>mid</i>. Equation 30b expresses a sample computation for the target threshold <i>T</i>_<i>high</i>.<maths id="math0090" num="(Eq. 30a)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">T</mtext></mrow><mrow><mtext mathvariant="italic">mid</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">mid</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0093.tif" /></maths><maths id="math0091" num="(Eq. 30b)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">T</mtext></mrow><mrow><mtext mathvariant="italic">high</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">high</mtext></mrow></msub><mtext>+</mtext><mfrac><mrow><mtext mathvariant="italic">bit_rate</mtext></mrow><mrow><mtext mathvariant="italic">picture_rate</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0094.tif" /></maths>

The illustrated embodiment of the process proceeds from the optional decision block 710 to a state 720 when the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> exceeds the target threshold <i>T</i>_<i>mid</i> or when the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>, or T</i>_<i>b</i> is less than the target threshold <i>T</i>_<i>high</i>. It will be understood that in another embodiment or configuration, where the optional decision block 710 is not present, the process can start at the state 720. When the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> exceeds the target threshold <i>T</i>_<i>mid</i><i>,</i> the VBV buffer model occupancy is relatively low. In the illustrated embodiment, the target threshold <i>T</i>_<i>mid</i>, is selected such that the adjustment to the targeted bit allocation occurs when a picture is allocated enough bits such that, without adjustment, the VBV buffer model occupancy would fall or would stay below <i>V</i>_<i>mid</i>. Other thresholds will be readily determined by one of ordinary skill in the art.

When the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> does not exceed the target threshold <i>T</i>_<i>mid</i> and the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> is not less than the target threshold <i>T</i>_<i>high</i>, the illustrated process proceeds from the optional decision block 710 to a decision block 730. It will be understood that where the optional decision block 710 is not present or is not used, the process can begin at the state 720, which then proceeds to the decision block 730. In another embodiment, when the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> does not exceed the target threshold <i>T</i>_<i>mid</i> and the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> is not less than the target threshold <i>T</i>_<i>high</i>, the process proceeds to end from the optional decision block 710, such as, for example, by proceeding to the state 612 of the process described in connection with Figure 6. In the illustrated optional decision block 710, the comparison uses the same target thresholds <i>T</i>_<i>mid</i> and/or <i>T</i>_<i>high</i> for I-pictures, for P-pictures, and for B-pictures. In another embodiment, the target thresholds <i>T</i>_<i>mid</i> and/or <i>T</i>_<i>high</i> varies depending on the picture type.

In the state 720, which is entered when the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> exceeds the target threshold <i>T</i>_<i>mid</i><i>,</i> or when the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> is less than the target threshold <i>T</i>_<i>high</i>, the process adjusts the value of the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> to reduce the number of bits allocated to the picture. In another embodiment, the process starts at the state 720. For example, one embodiment of the process is configurable by a user such that the process does not have the optional decision block 710 and instead, starts at the state 720. For example, the adjustment to the <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> can be configured to decrease the number of bits. Advantageously, when fewer bits are used to encode a picture, the VBV buffer model occupancy level, and correspondingly, a decoder's buffer occupancy level, can increase. Equation 31 illustrates a general formula for the adjustment.<maths id="math0092" num="(Eq. 31)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">T</mtext></mrow><mrow><mtext>(</mtext><mtext mathvariant="italic">i</mtext><mtext>,</mtext><mtext mathvariant="italic">p</mtext><mtext>,</mtext><mtext mathvariant="italic">b</mtext><mtext>)</mtext></mrow></msub><mtext> = α·</mtext><msub><mrow><mtext mathvariant="italic">T</mtext></mrow><mrow><mtext>(</mtext><mtext mathvariant="italic">i</mtext><mtext>,</mtext><mtext mathvariant="italic">p</mtext><mtext>,</mtext><mtext mathvariant="italic">b</mtext><mtext>)</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0095.tif" /></maths>

In Equation 31, the adjustment factor α can be less than unity such that the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i>, or <i>T</i>_<i>b</i> after adjustment is smaller than originally calculated. In one embodiment, the adjustment factor α can also correspond to values greater than unity such that the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> after adjustment is larger than originally calculated. For clarity, the adjustment of Equation 31 illustrates an adjustment to a separately calculated targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i>, or <i>T</i>_<i>b</i><i>.</i> However, it will be understood that the adjustment can also be incorporated in the initial calculation of the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>P</i><i>,</i> or <i>T</i>_<i>b</i>. It will be understood that Equation 31 corresponds to an assignment statement such that the value to the right of the "=" corresponds to the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> before adjustment, and the value to the left of the "=" corresponds to the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> after adjustment. Equation 32 expresses a sample computation for the adjustment factor α.<maths id="math0093" num="(Eq. 32)"><math display="block"><mrow><mtext>α = 1+</mtext><mfrac><mrow><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">target</mtext></mrow></msub></mrow><mrow><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">high</mtext></mrow></msub><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">low</mtext></mrow></msub></mrow></mfrac></mrow></math><img file="EP1515564A2_D0096.tif" /></maths>

As illustrated in Equation 32, the adjustment factor α is less than unity when <i>V</i>_{<i>status</i>} is less than <i>V</i>_{<i>target</i>}, and the adjustment factor α is greater than unity when <i>V</i>_{<i>status</i>} is greater than <i>V</i>_{<i>target</i>}. A net effect of the adjustment expressed in Equation 31 is to trend the occupancy level of the VBV buffer model to the desired occupancy level <i>V</i>_{<i>target</i>}.

It should be noted that when the targeted bit allocation T_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> exceeds the target threshold <i>T</i>_<i>mid</i> in the optional decision block 710, the value for the VBV buffer model occupancy <i>V</i>_{<i>status</i>} will typically be less than the value for the desired VBV occupancy level <i>V</i>_{<i>target</i>} such that adjustment factor α is less than unity. Advantageously, the targeted bit allocation can be reduced by an amount related to how much below the VBV buffer model occupancy <i>V</i>_{<i>status</i>} is from the desired VBV occupancy level <i>V</i>_{<i>target</i>}<i>.</i> When the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> is less than the target threshold <i>T</i>_<i>high</i>, the value for the VBV buffer model occupancy <i>V</i>_{<i>status</i>} will typically be higher than the value for the desired VBV occupancy level <i>V</i>_{<i>target</i>} such that adjustment factor α is greater than unity. Advantageously, the targeted bit allocation can be increased by an amount related to how much above the VBV buffer model occupancy <i>V</i>_{<i>status</i>} is from the desired VBV occupancy level <i>V</i>_{<i>target</i>}. The process advances from the state 720 to the decision block 730.

In the decision block 730, the process determines whether the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i><i>,</i> with or without adjustment by the state 720, falls within specified limits. These limits can advantageously be used to prevent a value for the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> from resulting in buffer underrun or buffer overrun. These limits can be predetermined or can advantageously be adapted to the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> and the VBV buffer model occupancy level <i>V</i>_{<i>status</i>}<i>.</i> When the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> falls outside the limits, the process proceeds from the decision block 730 to a state 740 to bind the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> to the limits. Otherwise, the process ends without further adjustment to the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i><i>.</i>

Equation 33 illustrates a sample computation for an upper limit <i>T</i>_max for the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i><i>.</i> Equation 34 illustrates a sample computation for a lower limit <i>T</i>_<i>min</i> for the targeted bit allocation <i>T</i>_<i>i</i><i>, T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i><i>.</i><maths id="math0094" num="(Eq. 33)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">T</mtext></mrow><mrow><mtext mathvariant="italic">max</mtext></mrow></msub><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">low</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0097.tif" /></maths><maths id="math0095" num=""><img file="EP1515564A2_D0098.tif" /></maths>

It will be understood that when the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> exceeds the upper limit <i>T</i>_<i>max</i>, the targeted bit allocation T_<i>i</i>, <i>T</i>_<i>p</i><i>,</i> or <i>T</i>_<i>b</i> is reassigned the value of the upper limit <i>T</i>_<i>max</i>, and when the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> is below the lower limit <i>T</i>_<i>min</i>, the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> is reassigned the value of the lower limit <i>T</i>_<i>min</i><i>.</i>

The application of the upper limit <i>T</i>_<i>max</i> expressed in Equation 33 advantageously limits a relatively high value for the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>_, or <i>T</i>_<i>b</i> such that the VBV buffer model occupancy level stays above the lower desired occupancy limit level <i>V</i>_<i>low</i> for the VBV buffer model. The application of the lower limit <i>T</i>_<i>min</i> expressed in Equation 34 advantageously limits a relatively low value for the targeted bit allocation <i>T</i>_<i>i</i>, T_<i>p</i>, or <i>T</i>_<i>b</i> such that the buffer occupancy level stays below the upper desired occupancy limit level <i>V</i>_<i>high</i>, even after the accumulating data over time at the constant bit rate of the data channel. The lower limit <i>T</i>_<i>min</i> corresponds to the higher of the quantities separated by the comma in the expression. Other values for the upper limit <i>T</i>_<i>max</i> and for the lower limit <i>T</i>_<i>min</i> will be readily determined by one of ordinary skill in the art. It will be understood that the targeted bit allocation <i>T</i>_<i>i</i>, <i>T</i>_<i>p</i>, or <i>T</i>_<i>b</i> represents a target for the encoder to achieve and that there may be relatively small variances from the target and the number of bits actually used to encode a picture such that the buffer occupancy level <i>V</i>_{<i>status</i>} may still deviate slightly from the desired occupancy limit levels <i>V</i>_<i>low</i> and <i>V</i>_<i>high.</i>

After processing in the state 740, the adjustment process ends. For example, where the adjustment process depicted in Figure 7 is incorporated in the state 610 of the rate control and quantization control process illustrated in Figure 6, the process can continue processing from the state 610.

It will be appreciated by the skilled practitioner that the illustrated process can be modified in a variety of ways without departing from the spirit and scope of the invention. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like. For example, in one embodiment, the optional decision block 710 is not present. In another embodiment, the decision block 730 and the state 740 are optional and need not be present.

<u>Macroblock Processing Sequence</u>

Figure 8A is a flowchart that generally illustrates a sequence of processing macroblocks according to the prior art. Figure 8B is a flowchart that generally illustrates a sequence of processing macroblocks according to one embodiment. The processing sequence illustrated in Figure 8B advantageously permits the spatial activity and/or motion activity for the macroblocks of a picture to be calculated such that actual values can be used in computations of sums and averages as opposed to estimates of sums and averages from computations of a prior picture.

The conventional sequence depicted in Figure 8A starts at a state 802. In the state 802, the process performs a computation for spatial activity (texture) and/or for motion estimation for a single macroblock. The process advances from the state 802 to a state 804.

In the state 804, the process uses the computation of spatial activity and/or motion estimation to perform a discrete cosine transformation (DCT) of the macroblock. The computation of spatial activity is typically normalized with a total value of spatial activity. However, at this point in the process, the computations for spatial activity have not been completed for the picture that is being encoded. As a result, an estimate from a previous picture is used. For example, the total spatial activity from the prior picture is borrowed to compute an average. In another example, motion estimation from a previous picture can also be borrowed. Whether or not these estimates are close to the actual values is a matter of chance. When there is a scene change between the prior picture and the picture that is being encoded, the estimates can be quite inaccurate. These inaccuracies can impair picture quality and lead to mismatches between the number of bits targeted for encoding of the picture and the number of bits actually used to encode the picture. These variances in the number of bits consumed to encode a picture can disadvantageously lead to butter underrun or to buffer overrun. The process advances from the state 804 to a state 806.

In the state 806, the process performs variable length coding (VLC) for the DCT coefficients of the macroblock. The VLC compresses the DCT coefficients. The process advances from the state 806 to a decision block 808.

In the decision block 808, the process determines whether it has completed encoding all the macroblocks in the picture. The process returns from the decision block 808 to the state 802 when there are macroblocks remaining to be encoded. Otherwise, the process proceeds to end until restarted.

A rearranged sequence according to one embodiment is depicted in Figure 8b and starts at a state 852. In the state 852, the process performs computations for spatial activity and/or motion estimation for all the macroblocks in the picture that is being encoded. This advantageously permits sums and averages of the spatial activities and/or motion estimates to be advantageously computed with actual numbers and not with estimates, and is further advantageously accurate even with a scene change before the picture that is presently encoded. In another example of advantages, in TM5, an average of the spatial activity measures <i>Savg_act</i>_<i>j</i> of 400 is used for the first picture as a "guess" of the measure. By processing the spatial activity of all the macroblocks before the spatial activities are used, the average of the spatial activity measures <i>Savg_act</i>_<i>j</i> can be directly computed and a speculative "guess" can advantageously be avoided.

Further advantageously, the use of actual sums and averages permits the actual number of bits used to encode a picture to match with the targeted bit allocation with relatively higher accuracy. This advantageously decreases the chances, of undesirable buffer underrun or buffer overrun and can increase picture quality. In one embodiment, the actual motion estimation for a macroblock is used to allocate bits among the macroblocks such that macroblocks with relatively high motion are allocated a relatively high number of bits. By contrast, in a conventional system with macroblock by macroblock processing, the bits for macroblocks are typically allocated among macroblocks by the relative motion of the macroblock in a prior picture, which may or may not be accurate. The process advances from the state 852 to a state 854.

In the state 854, the process performs the DCT computations for all of the macroblocks in the picture. The process advances from the state 854 to a state 856.

In the state 856, the process performs VLC for the DCT coefficients of all of the macroblocks in the picture. The process then ends until restarted.

In another embodiment, the process performs the computation of spatial activity and/or motion estimation for all the macroblocks as described in connection with the state 852, but then loops repetitively around a state to perform DCT computations and another state to perform VLC for macroblocks until processing of the macroblocks of the picture is complete.

<u>Bit Stuffing</u>

Bit stuffing or byte stuffing is a technique that is commonly used by an encoder to protect against generating a data stream that would otherwise lead to a decoder buffer overrun. When the number of bits that is used to encode a picture is relatively low for a sustained period of time, the decoder retrieves data from the decoder buffer at a slower rate than the rate at which the data channel adds data to the decoder buffer. When this accumulation of data continues for a sustained period of time such that the decoder buffer fills to capacity, data carried by the data channel can be lost. An example of a sequence of pictures that can be relatively highly compressed such that bit stuffing may be invoked is a sequence of pictures, where each picture is virtually completely black. To address this disparity in data rates such that buffer overrun does not occur, the encoder embeds data in the data stream that is not used, but consumes space. This process is known as bit stuffing.

Bit stuffing can be implemented in a variety of places in an encoding process. In one embodiment, bit stuffing is implemented when appropriate after the state 632 and before the state 636 in the encoding process described in connection with Figure 6. In one embodiment, the encoding process invokes bit stuffing when the occupancy of the VBV buffer model attains a predetermined level, such as the <i>V</i>_<i>high</i> level described earlier in connection with Figure 7. In one embodiment, bit stuffing is invoked when the VBV buffer model occupancy is about 63/64 of the capacity of the VBV buffer model.

Though beneficial to resolving decoder buffer overrun problems, bit stuffing can introduce other problems to the encoding process. The inclusion of bits used in bit stuffing can also be an undesirable solution. The addition of bits used in bit stuffing in a computation for the number of bits used to encode a picture <i>S</i>₍_<i>i</i>_,_<i>p</i>_,_<i>b</i>₎ can indicate to the encoder that more bits are being used to encode the pictures than were initially targeted. This can further be interpreted as an indication to encode pictures with reduced quality to decrease the number of bits used to encode pictures. Over a period of time, this can lead to an oven further decrease in the number of bits used to encode the pictures, with proportionally even more bits used in bit stuffing. With relatively many bits used in bit stuffing, relatively few bits remain to actually encode the pictures, which then reduces the quality of the encoded pictures over time.

Figure 9A illustrates a process that advantageously stabilizes the encoding process, thereby reducing or eliminating the tendency for bit staffing to destabilize an encoding process and the tendency for the picture quality to degrade over time. As will be described later, the process depicted in Figure 9A can be implemented in a variety of locations within an encoding process.

It will be appreciated by the skilled practitioner that the illustrated process can be modified in a variety of ways without departing from the spirit and scope of the invention. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like. The process can begin at a decision block 902 or at a decision block 904. In one embodiment, only one of the decision block 902 or the decision block 904 is present in the process. In the illustrated embodiment, both the decision block 902 and the decision block 904 are present in the process. For example, the process can start at the decision block 902 prior to the encoding of a picture, and the process can start at the decision block 904 after the encoding of a picture. For example, the start of process of Figure 9A at the decision block 902 can be incorporated after the state 612 and before the state 614 of the rate control and quantization control process described in connection with Figure 6. In another example, the start of the process of Figure 9A at the decision block 904 can be incorporated at the state 627 of the process of Figure 6.

In the decision block 902, the process determines whether there has been a scene change between the picture that is being encoded and the previous picture encoded. The determination of a scene change can be performed prior to the encoding of a picture. In one embodiment, the decision block 902 is optional. A variety of methods can be used to determine whether there has been a scene change. In one embodiment, the process reuses the results of a computation that is used to encode the picture, such as the results of a sum of absolute differences (SAD) measurement. In one embodiment, scene change detection varies according to the picture type. In one embodiment, for I-pictures, the average spatial activity <i>Sact_avg</i> for the current picture is compared to the corresponding previous average spatial activity. For example, when the current activity is at least 2 times or less than half that of the previous I-picture, a scene change is detected. Other factors that can be used, such as 3 times and 1/3, 4 times and 1/4 or a combination of these will be readily determined by one of ordinary skill in the art. In addition, one embodiment imposes an additional criterion for a minimum number of pictures to pass since the previous scene change has been declared in order to declare a new scene change. For P-pictures, the average of motion activity can be used instead of the average spatial activity to detect a scene change, together with a relative comparison factor such as (2, 1/2), (3, 1/3), (4, 1/4) and the like. To increase the robustness of the decision, one embodiment further uses a minimum average motion activity measure for the current P picture, since average motion activity by itself can indicate relatively high motion, which can be attributed to a scene change. For example, values of minimum average motion activity measure in the range of about 1000 to about 4000 can be used to indicate relatively high motion

The process proceeds from the decision block 902 to end such as, for example, by entering the state 614 when the process determines that there has been no scene change. In addition, it will be understood that there may be other portions of the encoding process which determine whether there has been a scene change, and where applicable, a previous determination can be reused in the decision block 902 by inspection of the state of a flag or semaphore indicating whether there has been a scene change. When the process determines that there has been a scene change, the process proceeds from the decision block to a sub-process 906.

In the decision block 904, the process determines whether the encoding process is in a critical state. In an alternate embodiment of the process, only one of the decision block 902 or the decision block 904 is present, and the other is optional. Where the decision block 904 is present in the process, the monitoring of the occupancy of the VBV buffer model can be invoked after the encoding of a picture. The criteria for determining that the encoding process is in a critical state can vary in a very broad range. In one embodiment, the critical state corresponds to when bit stuffing is performed by the encoding process when a value for the quantization parameter <i>mquant</i>_<i>j</i> is not relatively low, such as not at its lowest possible value. The value for the quantization parameter <i>mquant</i>_<i>j</i> that will correspond to relatively low values, such as the lowest possible value, will vary according to the syntax of the encoding standard. The process proceeds from the decision block 904 to the sub-process 906 when the occupancy of the VBV buffer model is determined to be in the critical state. Otherwise, the process proceeds to end such as, for example, by entering the state 627 of the process described in connection with Figure 6.

In the sub-process 906, the process normalizes the virtual buffer occupancy values for the initial conditions as represented by the variables <i>d</i><maths id="math0096" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0099.tif" /></maths>, <i>d</i><maths id="math0097" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0100.tif" /></maths>, and <i>d</i><maths id="math0098" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0101.tif" /></maths> described earlier in connection with the state 612. The normalized values can be computed by a variety of techniques. In the illustrated sub-process 906, the normalized values depend on the occupancy level of the VBV buffer model. The illustrated sub-process 906 includes a state 908, a decision block 910, a state 912, and a state 914.

In the state 908, one embodiment of the process calculates values for a <i>sum</i> and a <i>delta</i> as set forth in Equations 35 and 36a or 36b.<maths id="math0099" num="(Eq. 35)"><math display="block"><mrow><mtext mathvariant="italic">sum</mtext><mtext> = </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup><mtext> + </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup><mtext> + </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup></mrow></math><img file="EP1515564A2_D0102.tif" /></maths><maths id="math0100" num="(Eq. 36a) "><math display="block"><mrow><mtext mathvariant="italic">delta</mtext><mtext> = </mtext><mtext mathvariant="italic">vbv_buffer_size</mtext><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0103.tif" /></maths><maths id="math0101" num="(Eq. 36b)"><math display="block"><mrow><mtext mathvariant="italic">delta</mtext><mtext> = </mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">initial</mtext></mrow></msub><mtext>-</mtext><msub><mrow><mtext mathvariant="italic">V</mtext></mrow><mrow><mtext mathvariant="italic">status</mtext></mrow></msub></mrow></math><img file="EP1515564A2_D0104.tif" /></maths>

For Equation 35, the values for the virtual buffer occupancy levels for the initial conditions can be obtained by application of Equations 9, 10, and 11 as described in greater detail earlier in connection with the state 612 of Figure 6. As illustrated in Equations 36a and 36b, <i>delta</i> increases with a decreasing occupancy level in a buffer model. In Equation 36a, the variable <i>vbv_buffer_size</i> relates to the capacity of the VBV buffer model that is used for encoding, In Equation 36b, the variable <i>V</i>_{<i>initial</i>} relates to an initialization value for the occupancy level of the VBV buffer model. In one embodiment, the value of <i>V</i>_{<i>initial</i>} is about 7/8's of the capacity of the VBV buffer model. In another embodiment, instead of <i>V</i>_{<i>initial</i>}_,the process can use a target occupancy level such as <i>V</i>_{<i>target</i>}<i>,</i> but it should be noted that the initialization value and the target occupancy can be the same value. In another embodiment, <i>delta</i> can be based on a different quantity related to the size of the buffer model subtracted by the occupancy level of the buffer model. The size or capacity of the VBV buffer model can vary according to the standard that is used for encoding. For example, as described earlier in connection with Figure 4, the MPEG-1 and the MPEG-2 encoding standards specify a VBV buffer size or about 40 kB and about 224 kB, respectively. Other standards can specify amounts of memory capacity for the VBV buffer model. The process advances from the state 908 to the decision block 910.

In the decision block 910, the process determines whether the value for <i>sum</i> is less than the value for a predetermined threshold <i>T</i>_<i>norm</i><i>.</i> The value of the predetermined threshold <i>T</i>_<i>norm</i> should correspond to some value that indicates a usable range. For example, one such value for the predetermined threshold <i>T</i>_<i>norm</i> is zero. Other values will be readily determined by one of ordinary skill in the art. The process proceeds from the decision block 910 to the state 912 when the value for <i>sum</i> is less than the value <i>T</i>_<i>norm</i>. Otherwise, the process proceeds from the decision block 910 to the state 914.

The value for <i>delta</i> corresponds to the unoccupied space in the VBV buffer model for Equation 36a or to the discrepancy between the initial VBV buffer model status and the current VBV buffer model status in Equation 36b. It will be understood that other comparisons can be made between the sum of the virtual buffer levels and the unoccupied levels. For example, in another embodiment, a less than or equal to comparison can be made, an offset can be included, etc.

In the state 912, one embodiment of the process reassigns the virtual buffer occupancy values for the initial conditions <i>d</i><maths id="math0102" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0105.tif" /></maths><i>, d</i><maths id="math0103" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0106.tif" /></maths>, and <i>d</i><maths id="math0104" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0107.tif" /></maths> with normalized values according to Equations 37, 38, and 39.<maths id="math0105" num="(Eq. 37)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup><mtext> = </mtext><mtext mathvariant="italic">delta</mtext><mtext>·</mtext><msup><mrow><mtext mathvariant="italic">fr</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msup></mrow></math><img file="EP1515564A2_D0108.tif" /></maths><maths id="math0106" num="(Eq. 38)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup><mtext> = </mtext><mtext mathvariant="italic">delta</mtext><mtext>·</mtext><msup><mrow><mtext mathvariant="italic">fr</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msup></mrow></math><img file="EP1515564A2_D0109.tif" /></maths><maths id="math0107" num="(Eq. 39)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup><mtext> = </mtext><mtext mathvariant="italic">delta</mtext><mtext>·</mtext><msup><mrow><mtext mathvariant="italic">fr</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msup></mrow></math><img file="EP1515564A2_D0110.tif" /></maths>

In Equations 37, 38, and 39, the value for delta can be calculated from Equation 36, and the values for <i>fr</i>^<i>i</i>, <i>fr</i>^<i>p</i>, and <i>fr</i>^<i>b</i> can vary in a very broad range. The values for <i>fr</i>^<i>i</i><i>, fr</i>^<i>p</i><i>,</i> and <i>fr</i>^<i>b</i> will typically range between 0 and 1 and can be the same value or different values. Further, in one embodiment, the values for <i>fr</i>^<i>i</i><i>, fr</i>^<i>p</i>, and <i>fr</i>^<i>b</i> are selected such that they sum to a value of approximately 1, such as the value of 1. In one embodiment, the values for <i>fr</i>^<i>i</i>, <i>fr</i>^<i>p</i>, and <i>fr</i>^<i>b</i> correspond to about 5/17, about 5/17, and about 7/17, respectively. Other values for <i>fr</i>^<i>i</i>, <i>fr</i>^<i>p</i>, and <i>fr</i>^<i>b</i> will be readily determined by one of ordinary skill in the art. The process can then end by, for example, entering the state 614 of the process described in connection with Figure 6.

Returning to the state 914, at this point in the process, the process has determined that the value <i>for sum</i> is not less than the value for <i>T</i>_<i>norm</i>. In the state 914, one embodiment of the process reassigns the values of the virtual buffer occupancy variables for the initial conditions <i>d</i><maths id="math0108" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0111.tif" /></maths>, <i>d</i><maths id="math0109" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0112.tif" /></maths>, and <i>d</i><maths id="math0110" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0113.tif" /></maths> with normalized values according to Equations 40, 41, and 42.<maths id="math0111" num="(Eq. 40)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup><mtext> = </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msubsup><mtext>·</mtext><mfrac><mrow><mtext mathvariant="italic">delta</mtext></mrow><mrow><mtext mathvariant="italic">sum</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0114.tif" /></maths><maths id="math0112" num="(Eq. 41)"><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup><mtext> = </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msubsup><mtext>·</mtext><mfrac><mrow><mtext mathvariant="italic">delta</mtext></mrow><mrow><mtext mathvariant="italic">sum</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0115.tif" /></maths><maths id="math0113" num="(Eq. 42) "><math display="block"><mrow><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup><mtext> = </mtext><msubsup><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">b</mtext></mrow></msubsup><mtext>·</mtext><mfrac><mrow><mtext mathvariant="italic">delta</mtext></mrow><mrow><mtext mathvariant="italic">sum</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0116.tif" /></maths>

Equations 40, 41, and 42 correspond to assignment statements for the values of the virtual buffer occupancy variables for the initial conditions <i>d</i><maths id="math0114" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0117.tif" /></maths>, <i>d</i><maths id="math0115" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0118.tif" /></maths>, and <i>d</i><maths id="math0116" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0119.tif" /></maths>. The values to the right of the "=" correspond to the values before adjustment, and the values to the left of the "=" correspond to the values after adjustment. It will be observed that when the value for <i>delta</i> and the value for <i>sum</i> are approximately the same, that relatively little adjustment to the values occurs. When the value for <i>sum</i> is relatively high compared to the value for <i>delta,</i> the values of the virtual buffer occupancy variables for the initial conditions <i>d</i><maths id="math0117" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0120.tif" /></maths>, <i>d</i><maths id="math0118" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0121.tif" /></maths>, and <i>d</i><maths id="math0119" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0122.tif" /></maths> are reduced proportionally. It should also be noted that relatively small values can also be added to the value of <i>sum</i> used in Equations 40-42 to prevent division by zero problems. After adjustment, the process ends by, for example, proceeding to the state 614 of the process described earlier in connection with Figure 6.

Figure 9B is a flowchart that generally illustrates a process for resetting virtual buffer occupancy levels upon the detection of an irregularity in a final buffer occupancy level. The process for resetting can be incorporated into encoding processes, such as in the state 627 of the rate control and quantization control process described earlier in connection with Figure 6.

The process begins at a decision block 952. As explained earlier in connection with the state 627 of the rate control and quantization control process described in connection with Figure 6, the final occupancy (fullness) of the applicable virtual buffer, i.e., the value of <i>d</i><maths id="math0120" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0123.tif" /></maths>, <i>d</i><maths id="math0121" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0124.tif" /></maths>, or <i>d</i><maths id="math0122" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0125.tif" /></maths>, where <i>j</i> = <i>MB_cnt,</i> can be used as the initial condition for the encoding of the next picture of the same type, i.e., as the value for <i>d</i><maths id="math0123" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0126.tif" /></maths>, <i>d</i><maths id="math0124" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0127.tif" /></maths>, or <i>d</i><maths id="math0125" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext>0</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0128.tif" /></maths> for the picture of the same type (I, P, or B). When encoding via the process described in TM5, the final occupancy of the applicable virtual buffer, i.e., the value of <i>d</i><maths id="math0126" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0129.tif" /></maths>, <i>d</i><maths id="math0127" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0130.tif" /></maths>, or <i>d</i><maths id="math0128" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0131.tif" /></maths>, is always used as the initial condition for the encoding of the next picture of the same type. However, the final occupancy of the applicable virtual buffer is not always an appropriate value to use.

In the decision block 952, the process determines whether the final occupancy of the applicable virtual buffer, i.e., the value of <i>d</i><maths id="math0129" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0132.tif" /></maths>, <i>d</i><maths id="math0130" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0133.tif" /></maths>, or <i>d</i><maths id="math0131" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0134.tif" /></maths>, is appropriate to use. In one embodiment, the appropriateness of a value is determined by whether the value is physically possible. A virtual buffer models a physical buffer. A physical buffer can be empty, can be partially occupied with data, or can be fully occupied with data. However, a physical buffer cannot hold a negative amount of data. To distinguish between physically attainable values and non-physically attainable values, one embodiment of the process compares the value for the final occupancy of the applicable virtual buffer to a predetermined threshold <i>tr.</i>

In one embodiment, the value of <i>ir</i> is zero to distinguish between a physically attainable buffer occupancy and a buffer occupancy that is not physically attainable. In one embodiment, a value that is relatively close to zero is used. Although the value of <i>tr</i> can correspond to a range of values, including values near to zero such as one, two, three, etc., the value of <i>tr</i> should not permit a negative value for the final occupancy to be deemed appropriate. It will be understood that when the value used for <i>tr</i> is zero, the process can distinguish between physically attainable values and non-physically attainable values by inspecting the sign, i.e., positive or negative, associated with the value of the final occupancy of the applicable virtual buffer. It will also be understood that when integer comparisons are made, a comparison using an inequality such as greater than negative one, i.e., &gt; -1, can also be used, such that a value for <i>tr</i> can correspond to -1. The process proceeds from the decision block 952 to a state 954 when the final occupancy value is not appropriate to use as an initial condition for the next picture of the same type. Otherwise, the process proceeds from the decision block 952 to a state 956.

In the state 954, the process resets the final buffer occupancy value for the picture type that had just been encoded <i>d</i><maths id="math0132" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0135.tif" /></maths>, <i>d</i><maths id="math0133" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0136.tif" /></maths>, or <i>d</i><maths id="math0134" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0137.tif" /></maths>, where <i>j</i> = <i>MB_cnt,</i> to an appropriate value, such as a physically attainable value. Appropriate values can include any value from zero to the capacity of the applicable virtual buffer. In one embodiment, the final buffer occupancy value is reset to a relatively low value that is near zero, such as zero itself. The process can advance from the state 954 to an optional state 958, or the process can advance from the state 954 to the state 956.

In the optional state 958, the process normalizes the virtual buffer occupancy values <i>d</i><maths id="math0135" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0138.tif" /></maths>, <i>d</i><maths id="math0136" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0139.tif" /></maths>, and <i>d</i><maths id="math0137" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0140.tif" /></maths>. In the prior state 954, the process had corrected for a non-physically attainable value in the virtual occupancy value <i>d</i><maths id="math0138" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0141.tif" /></maths>, <i>d</i><maths id="math0139" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0142.tif" /></maths>, or <i>d</i><maths id="math0140" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0143.tif" /></maths>, that applies to the type of picture that was encoded. For example, the process can take the prior negative value of the applicable virtual occupancy value <i>d</i><maths id="math0141" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0144.tif" /></maths>, <i>d</i><maths id="math0142" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0145.tif" /></maths>, or <i>d</i><maths id="math0143" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0146.tif" /></maths> and allocate the negative value to the remaining virtual occupancy values such that the sum of the virtual occupancy values <i>d</i><maths id="math0144" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">i</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0147.tif" /></maths>, <i>d</i><maths id="math0145" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0148.tif" /></maths>, and <i>d</i><maths id="math0146" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">b</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></mfrac></mrow></math><img file="EP1515564A2_D0149.tif" /></maths> sums to zero. For example, in one embodiment, the process adds half of the negative value to each of the two other virtual occupancy values. The process advances from the optional state 958 to the state 956.

In the state 956, the process stores the final virtual buffer occupancy value as reset by the state 954 or unmodified via the decision block 952 and ends. The process can end by, for example, proceeding to the state 619 of the rate control and quantization control process described earlier in connection with Figure 6.

<u>Scene Change Within a Group of Pictures</u>

Figure 10A illustrates examples of groups of pictures. Scene changes between pictures of a sequence can exist within a group of pictures. Scene changes arc relatively commonly encountered in a sequence of pictures. The scene changes can result from a change in camera shots, a switching between programs, a switch to a commercial, an edit, and the like. With a scene change, the macroblocks of a present picture bear little or no relation to the macroblocks of a previous picture, so that the macroblocks of the present picture will typically be intra coded, rather than predictively coded. Since an I-picture includes only intra-coded macroblocks, scene changes are readily accommodated with I-pictures.

Although pictures corresponding to scene changes are preferably coded with I-pictures, the structure of a group of pictures, i.e., the sequence of picture types, can be predetermined in some systems or outside of the control of the encoder. For example, one direct broadcast satellite (DBS) system has a predetermined pattern of I-pictures, P-pictures, and B-pictures that is followed by the encoder. As a result, scene changes can occur in B. pictures or in P-pictures. A conventional encoder can accommodate scene changes in B-pictures by referencing the predictive macroblocks of the B-picture to an I-picture or to a P-picture that is later in time.

A scene change in a P-picture can be problematic. A P-picture can include intra-coded macroblocks and can include predictivoly-coded macroblocks. However, a P-picture cannot reference a picture that is later in time, so that the scene change will typically be encoded using only intra-coded macroblocks. In substance, a scene change P-picture in a conventional encoder is an I-picture, but with the bit allocation and the header information of a P-picture. In a conventional encoder, a P-picture is allocated fewer bits than an I-picture so that the picture quality of a scene change P-picture is noticeably worse than for an I-picture. Other pictures, such as B-pictures and other P-pictures, can be predictively coded from the P-picture with the scene change, thereby disadvantageously propagating the relatively low picture quality of the scene change P-picture.

As described earlier in connection with Figures 1 and 5, the pictures of a sequence are arranged into groups of pictures. A group starts with an I-picture and ends with the picture immediately prior to a subsequent I-picture. The pictures within a group of pictures can be arranged in a different order for presentation and for encoding. For example, a first group of pictures 1002 in a presentation order is illustrated in Figure 10A. An I-picture 1004 for a next group of pictures is also shown in Figure 10A.

The pictures of a sequence can be rearranged from the presentation order when encoding and decoding. For example, the first group of pictures 1002 can be rearranged to a second group of pictures 1010, whore the group is a first group of a sequence, and can be rearranged to a third group of pictures 1020, where the group is an ongoing part of the sequence. The second group of pictures 1010 and the third group of pictures 1020 are illustrated in encoding order. The end of the second group of pictures 1010 occurs when an I-picture 1012 from another group is encountered. Due to the reordering, two B-pictures 1014, 1016 that were originally in the first group of pictures 1002 in the presentation order are now no longer in the group of pictures as rearranged for encoding. With respect to the process described in connection with Figure 10B, a group of pictures relates to a group in an encoding order.

The third group of pictures 1020 will be used to describe the process illustrated in Figure 10B. The third group of pictures 1020 includes two pictures 1022, 1024 that will be presented before the I-picture 1026 of the third group of pictures 1020. In the illustrated example, a scene change occurs in the third group of pictures 1020 at a P-picture 1030 within the third group of pictures 1020. The process described in Figure 10B advantageously recognizes the scene change and reallocates the remaining bits for the remaining pictures 1032 in the third group of pictures 1020 to improve picture quality.

Figure 10B is a flowchart that generally illustrates a process for resetting encoding parameters upon the detection of a scene change within a group of pictures (GOP). In the illustrated embodiment of the process, the encoding order is used to describe the grouping of groups of pictures.

The process illustrated in Figure 10B identifies scene-change P-pictures and advantageously reallocates bits within the remaining pictures of the group of pictures without changing the underlying structure of the group of pictures. The process advantageously allocates relatively more bits to the scene change P-picture, thereby improving picture quality. The illustrated process can be incorporated into the rate control and quantization control process described earlier in connection with Figure 6. For example, the process of Figure 10B can be incorporated before the state 610 of Figure 6. The skilled practitioner will appreciate that the illustrated process can be modified in a variety of ways without departing from the spirit and scope of the invention. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like.

The process begins at a decision block 1052. In the decision block 1052, the process determines whether there has been a scene change or a relatively sudden increase in an amount of motion in a picture. The scene change can be determined by a variety of techniques. In one embodiment, the process makes use of computations of picture comparisons that are already available. For example, one embodiment of the process uses a sum of absolute differences (SAD) measurement. The SAD measurement can be compared to a predetermined value, to a moving average, or to both to determine a scene change. For example, a SAD measurement that exceeds a predetermined level, or a SAD measurement that exceeds double the moving average of the SAD can be used to detect a scene change. Advantageously, the SAD measurement can detect a scene change or a sudden increase in an amount of motion in a picture. It will be understood that there may be another portion of the encoding process that also monitors for a scene change, and in one embodiment, the results of another scene change detection is reused in the decision block 1052. The process proceeds from the decision block 1052 to a decision block 1054 when a scene change is detected. Otherwise, the process proceeds to end, such as, for example, entering the state 610 of the rate control and quantization control process described earlier in connection with Figure 6.

In the decision block 1054, the process determines whether the type of the picture to be encoded corresponds to the P-type. In another embodiment, the order of the decision block 1052 and the decision block 1054 are interchanged from that shown in Figure 10B. The process proceeds from the decision block 1054 to a state 1056 when the picture is to be encoded as a P-picture. Otherwise, the process proceeds to end by, for example, entering the state 610 of the rate control and quantization control process described earlier in connection with Figure 6.

In the state 1056, the process reallocates bits among the remaining pictures of the group of pictures. Using the third group of pictures 1020 of Figure 10A as an example, when a scene change is detected at the P-picture 1030, the remaining bits <i>R</i> are advantageously reallocated among the remaining pictures 1032. In one embodiment, the process encodes the remaining pictures 1032 as though the P-picture 1030 is an I-picture, but without altering the structure of the group of pictures by not changing the type of picture of the P-picture 1030.

The process for encoding the P-picture 1030 as though it is an I-picture can be performed in a number of ways. For example, one embodiment of the process effectively decrements the number of P-pictures <i>N</i>_<i>p</i> to be encoded before the P-picture with the scene change is encoded, and uses the decremented value of <i>N</i>_<i>P</i> in Equation 6 to generate a targeted bit allocation. Equation 6, which is used in a conventional system only to calculate a targeted bit allocation <i>T</i>_<i>i</i> for a I-picture, can be used by the process of Figure 10B to calculate a targeted bit allocation for the P-picture with the scene change. Equation 43 illustrates an expression of such a targeted bit allocation, expresses as <i>T</i>_<i>p</i>.<maths id="math0147" num=""><img file="EP1515564A2_D0150.tif" /></maths>

This advantageously allocates to the P-picture a relatively large number of bits, such that the P-picture with the scene change can encode the scene change with relatively high quality. Equations 7 and 8 can then be used for the subsequent encoding of P-pictures and B-pictures that remain to be encoded in the group of pictures. Optionally, the process can further reset the values for the complexity estimators <i>X</i>_<i>i</i><i>, X</i>_<i>p,</i> and <i>X</i>_<i>b</i> in response to the scene change by, for example, applying Equations 1-3 described earlier in connection with the state 608 of the rate control and quantization control process of Figure 6. The process then ends by, for example, proceeding to the state 610 of the rate control and quantization control process. It will be understood that the process described in connection with Figures 10A and 10B can be repeated when there is more than one scene change in a group of pictures.

<u>Selective Skipping of Macroblocks in B-Pictures</u>

Figure 11 is a flowchart that generally illustrates a process for the selective skipping of data in a video encoder. This selective skipping of data advantageously permits the video encoder, to maintain relatively good bit rate control even in relatively extreme conditions. The selective skipping of data permits the video encoder to produce encoded data streams that advantageously reduce or eliminate relatively low occupancy levels in a decoder buffer, such as decoder buffer underrun. Decoder buffer underun can occur when the playback bit rate exceeds the relatively constant bit rate of the data channel for a sustained period of time such that the decoder buffer runs out of data. Decoder buffer underrun is quite undesirable and results in a discontinuity such as a pause in the presentation.

Even without an occurrence of decoder buffer underrun, data streams that result in relatively low decoder buffer occupancy levels can be undesirable. As explained earlier in connection with Figure 4, a buffer model, such as the VBV buffer model, is typically used in an encoding process to model the occupancy levels of a decoder buffer. When a conventional encoder determines that the occupancy level of the buffer model is dangerously low, the conventional encoder can severely compromise picture quality in order to conserve encoding bits and maintain bit rate control. The effects of relatively low VBV buffer model occupancy levels is noticeable in the severely degraded quality of macroblocks.

The process generally illustrated by the flowchart of Figure 11 advantageously skips the encoding of selected macroblocks when relatively low buffer model occupancy levels are detected, thereby maintaining relatively good bit rate control by decreasing the number of bits used to encode the pictures in a manner that does not impact picture quality as severely as conventional techniques. In one example, the process illustrated in Figure 11 can be incorporated in the state 623 of the rate control and quantization control process described earlier in connection with Figure 6. The skilled practitioner will appreciate that the illustrated process can be modified in a variety of ways without departing from the spirit and scope of the invention. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like.

The process starts at a decision block 1102, where the process determines whether the picture designated to be encoded corresponds to a B-picture. B-pictures can be encoded with macroblocks that are predictively coded based on macroblocks from other pictures (I-pictures or P-pictures) that are earlier in time or later in time in the presentation order. However, during the encoding process, the pictures (I-pictures or P-pictures) that are used to encode a B-picture are encoded prior to the encoding of the B-picture. The process proceeds from the decision block 1102 to a decision block 1104 when the picture to be encoded is a B-picture. Otherwise, the process proceeds to end, by, for example, returning to the state 623 of the process described earlier in connection with Figure 6.

In the decision block 1104, the process determines whether the VBV buffer occupancy level is relatively low. During the encoding process, a relatively large number of bits may have already been consumed in the encoding of the pictures from which a B-picture is to be encoded. In some circumstances, this consumption of data can lead to a low VBV buffer occupancy level. For example, the process can monitor the occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer model, which was described earlier in connection with Figure 7, and compare the occupancy level <i>V</i>_{<i>status</i>} to a predetermined threshold, such as to <i>V</i>_{<i>critical</i>}<i>.</i> The comparison can be made in a variety of points in the encoding process. In one embodiment, the comparison is made after a picture has been encoded and after the VBV buffer model occupancy level has been determined, such as after the state 638 or after the state 610 of the rate control and quantization control process described earlier in connection with Figure 6. In one embodiment, the comparison is advantageously made before any of the macroblocks in the picture have been encoded, thereby advantageously preserving the ability to skip all of the macroblocks in the picture when desired to conserve a relatively large amount of bits.

In one example, <i>V</i>_{<i>critical</i>} is set to about 1/4 of the capacity of the VBV buffer model. It should be noted that the capacity of the VBV buffer model or similar buffer model can vary with the encoding standard. It will be understood that an appropriate value for <i>V</i>_{<i>critical</i>} can be selected from within a broad range. For example, other values such as 1/16, 1/8, 1/10, and 3/16 of the capacity of the VBV buffer model can also be used. Other values will be readily determined by one of ordinary skill in the art. In one embodiment, the process permits the setting of <i>V</i>_{<i>critical</i>} to be configured by a user. The process proceeds from the decision block 1104 to a state 1106 when the occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer-model falls below the predetermined threshold. Otherwise, the process proceeds from the decision block 1104 to a state 1108.

In the state 1106, the process skips macroblocks in the B-picture. In one embodiment, all the macroblocks are skipped. In another embodiment, selected macroblocks are skipped. The number of macroblocks skipped can be based on, for example, the occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer. Data for an "encoded" B-picture is still formed, but with relatively little data for the skipped macroblocks. In the encoding process, a bit or flag in the data stream indicates a skipped macroblock. For example, in a technique known as "direct mode," a flag indicates that the skipped macroblock is to be interpolated during decoding between the macroblocks of a prior and a later (in presentation time) I- or P-picture. Another flag indicates that the skipped macroblock is to be copied from a macroblock in a prior in presentation time I- or P-picture. Yet another flag indicates that the skipped macroblock is to be copied from a macroblock in a later in presentation time I- or P-picture. The skipping of macroblocks can advantageously encode a B-picture in relatively few bits. In one example, a B-picture for MPEG-2 with all the macroblocks skipped can advantageously be encoded using only about 300 bits. After the skipping of macroblocks for the B-picture is complete, the process ends by, for example, returning to the state 623 of the process described earlier in connection with Figure 6.

In the state 1108, the process has determined that the occupancy level <i>V</i>_{<i>status</i>} of the VBV buffer is not relatively low, and the process encodes the macroblocks in the B-picture. After the encoding of the macroblocks for the B-picture is complete, the process ends by, for example, returning to the state 623 of Figure 6. It will be understood that the decisions embodied in the decision block 1102 and/or the decision block 1104 can be performed at a different point in the process of Figure 6 than the state 1106 or the state 1108.

<u>Adaptive I, P-Frame and B-Frame DCT Filtering</u>

An MPEG or other video encoder can encounter video sequences that are relatively difficult to compress at relatively low bit rates. This situation can be avoided by using variable bit-rate compression, where the encoder raises the instantaneous bit rate for these difficult to encode scenes. However, constant bit-rate compression techniques, which are encountered in Video Compact Disk (VCD), in digital TV broadcasting (including satellite, cable, and over the air), and the like, an accommodating increase in the bit rate is usually not available as VBV buffer model compliance constrains available the number of bits available to encode pictures. Instead, quality suffers. For example, conventional encoders increase the value of the quantization parameter QP, which then results in visible compression artifacts. Examples of compression artifacts that can be visually observed include blockiness and jerkiness in these difficult to encode video scenes.

One process described earlier in connection with Figure 11 preserves compliance with VBV buffer requirements and reasonable picture quality by selectively skipping the encoding of macroblocks in B-pictures in response to VBV buffer model occupancy levels. The process described in Figures 12 and 13 can be used in combination with or independently of the process described earlier in connection with Figure 11.

In the process of Figures 12 and 13, the process advantageously selectively and/or adaptively filters discrete cosine transform (DCT) coefficients to reduce the number of bits needed to encode pictures. The process can adaptively filter the DCT coefficients in response to VBV buffer model occupancy levels and to observed quantization parameter levels. The selective filtering advantageously improves the tradeoff between the number of bits used to encode a picture and the quality of the picture in situations where encoding bits are limited, and VBV buffer model compliance or similar buffer model compliance is desired. Such filtering of DCT coefficients differs from the filtering provided in a conventional, quantization table. The contents of a quantization table are typically fixed during encoding and are communicated in the bitstream such that the encoder and the decoder can use the same quantization table in a closed-loop manner. The filtering of the DCT coefficients described herein relates to a selective "open-loop" filtering of DCT coefficients only in the encoder. Advantageously, no compensating adjustments are needed in the decoder.

Selective DCT altering will be generally described in the context of 8 x 8 image blocks. These 8 × 8 image blocks are used in MPEG1, in MPEG2, and in MPEG4. The skilled practitioner will appreciate that the DCT filtering techniques will also be applicable to other video compression standards, such as to H.264, where the block size is 4 x4.

Figure 12 is a flowchart that generally illustrates a process for selective DCT filtering. During the encoding process, the encoder performs a motion search 1210, performs motion compensation 1220, and proceeds to compute DCT coefficients 1230. In one embodiment, the process then selectively filters 1240 the DCT coefficients and/or selectively limits QP values 1250 to relatively low values. It will be understood that such filtering 1240 and limiting or bounding of QP values 1250 can be selectively applied in response to VBV buffer model occupancy levels and/or to the detection of relatively high QP values. While relatively high QP values can reduce the number of bits used to encode data, high QP values dramatically reduce picture quality by increasing picture blockiness. The process then proceeds to quantize the DCT coefficients 1260. When altered and limited, the process quantizes the filtered DCT coefficients with the adjusted QP values. It will be understood that when VBV buffer model occupancy levels are relatively high, that the process can select not to filter the DCT coefficients and not to alter QP values. As will be described later in connection with Figure 13, one embodiment of the process also varies the strength of the filtering in response to VBV buffer model occupancy levels. Prior to describing the process of Figure 13, examples of filtering techniques in the frequency domain will first be described.

In the frequency domain, <i>ω</i>_<i>z</i> and <i>ω</i>_<i>y</i> denote the frequency domain variables along the horizontal and vertical directions after a 2-D Discrete Cosine Transform (DCT) of an 8 x 8 block of image data or residual error following motion compensation. In this frequency domain, values <i>of ω</i>_<i>x</i> = 0 and <i>ω</i>_<i>y</i> =0 correspond to the DC coefficient, i.e., the average value of the 8 x 8 block of image data or residual error, while values of <i>ω</i>_<i>x</i> =7 and ω_<i>y</i> = 7 correspond to the highest frequency details of the 8x8 block of image data or residual error. It will be understood that for a 4 x 4 block of image data, values of ω_<i>x</i> =3, ω_<i>y</i> = 3 correspond to the highest frequency details.

Human vision and perception is relatively more sensitive to low frequencies and is relatively less sensitive to relatively high frequencies. At the same time, relatively many video images have less energy in high frequencies compared to that in low frequencies. Nevertheless, when video information is compressed by quantization of DCT coefficients, and especially when the Quantizer scale assumes high values (implying large quantization error), the residual error of high-detail frames has significant energy in the high frequency region. This results in these pictures requiring a significant amount of bits in order to be compressed, even at the highest Quantizer scale value.

In the process that will be described later in connection with Figure 13, such difficult to encode scenes are detected and a low pass filter is selectively applied to image blocks during encoding. When applied, filtering is provided after performing motion search, after motion compensation, and after DCT computation, but before quantization. In this manner, high frequency coefficients are sacrificed (their value is reduced or even set to zero) and thus spatial resolution is somewhat reduced, especially in high-detail portions of a video picture. However, the overall balance in image quality is significantly improved. In one embodiment, a non-separable pyramid-shaped low-pass filter is used. "Pyramid" refers to the sloping shape of the filter response as it varies from low frequency (from DC) to high frequency (max AC). Of course, other filter shapes that can be used can be readily determined by one of ordinary skill in the art. In one embodiment, the pyramid-shaped filter depends on a positive valued parameter, <i>s</i> ≥ 1, and one form can be expressed in Equation 44.<maths id="math0148" num="(Eq. 44)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><msub><mrow><mtext>(ω</mtext></mrow><mrow><mtext mathvariant="italic">x</mtext></mrow></msub><msub><mrow><mtext>,ω</mtext></mrow><mrow><mtext mathvariant="italic">y</mtext></mrow></msub><mtext>) = </mtext><mfrac><mrow><mtext>max{0,</mtext><mtext mathvariant="italic">s</mtext><msub><mrow><mtext>-ω</mtext></mrow><mrow><mtext mathvariant="italic">x</mtext></mrow></msub><msub><mrow><mtext>-ω</mtext></mrow><mrow><mtext mathvariant="italic">y</mtext></mrow></msub><mtext>}</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac><mtext> , 0 ≤ </mtext><msub><mrow><mtext mathvariant="italic">ω</mtext></mrow><mrow><mtext mathvariant="italic">x</mtext></mrow></msub><mtext>,</mtext><msub><mrow><mtext mathvariant="italic">ω</mtext></mrow><mrow><mtext mathvariant="italic">y</mtext></mrow></msub><mtext> ≤ 7</mtext></mrow></math><img file="EP1515564A2_D0151.tif" /></maths>

It will be understood that the range for the frequency variables will depend on the size of the image block defined in the applicable encoding standard. The inverse of <i>s</i>, i.e., (1/<i>s</i>), relates to the strength of the filter. In one embodiment, filter strength (1/<i>s</i>) can take on a value between 0 and 1. Note that when the strength of the filter (1/<i>s</i>) is zero, i.e., <i>s</i> → ∞, the response <i>H</i>_<i>s</i> has the constant value = 1, which means that there is no filtering (DCT coefficients are not changed). When the strength of the filter (1/<i>s</i>) is relatively high, <i>s</i> = 1, and <i>H</i>_<i>s</i> has the constant value of 0 everywhere except when <i>ω</i>_<i>x</i><i>= ω</i>_<i>y</i> = 0 (DC coefficient), In this limiting case, application of the filter effectively down-samples the video picture by a factor of 8 in both the horizontal and the vertical direction.

The shape of the filter can vary with the strength parameters. In the illustrated examples, the strengths (1/<i>s</i>) described correspond to 1/32 (weak), 1/16 (medium) and 1/8 (strong). Tables III, IV, and V illustrate one example of a shape for these varying filter strengths. Graphs corresponding to the filters of Tables III, IV, and V are shown in Figures 14, 15, and 16, respectively. It will be understood by the skilled practitioner that many variations are possible. Both the shape of the filter can be varied and the strength of the filter can be varied. It will also be understood that the number of filters of different strength can be varied. For example, in other embodiments, more than three different filters can be used or fewer than three filters. <tables id="tabl0003" num="0003"><img file="EP1515564A2_D0152.tif" /></tables><tables id="tabl0004" num="0004"><img file="EP1515564A2_D0153.tif" /></tables><tables id="tabl0005" num="0005"><img file="EP1515564A2_D0154.tif" /></tables>

In Tables III, IV, and V, the DC DCT coefficient (ω_<i>x</i> = 0 and ω_<i>y</i> = 0) is in the upper left. The horizontal frequency variable ω_<i>x</i> increases to the right, and the vertical frequency variable ω_<i>y</i> increases in the downward direction. Other strengths and shapes will be readily determined by one of ordinary skill in the art.

It should be noted that in the illustrated example, the filter weight uses the values of 9/16 (18/32) (weak), 1/8 (2/16) (medium) and 0 (strong), respectively, for the three filter strengths at the highest frequency DCT coefficient location, AC(7,7), while maintaining the value of 1 at the DC location (0,0). It should be noted that the filter should be determined such that the DC coefficient is not changed. Filter values for other DCT coefficients are located on a plane that connects these points, such that the higher the filter strength, the steeper the plane inclination is. Of course, other variations will be readily determined by one of ordinary skill in the art and can include shapes with curves.

In one embodiment, the variable <i>s</i> is selected to be a power of 2 (such as 1/8, 1/6, 1/32, etc) such that division can be efficiently accomplished by relatively fast bit shifting operations rather than complex division operations. However, it will be understood that the strength of the filter can assume other positive values between 0 and 1. Further advantageously, relatively many general purpose processors support the execution of multiple variable multiplication operations and division operations using binary shifts, such as the processors that support a Multimedia Extension (MMX) instruction set or the Single Instruction Multiple Data (SIMD), described earlier in connection with Figure 6. This power of 2 utilization greatly simplifies overall implementation on these and similar architecture, and increases processing speed such that video encoding can be performed in real time. For example, the filtering process can advantageously be implemented with relatively negligible computational overhead, and in one example, was approximately 1%.

As will be described in greater detail later in connection with Figure 13, the DCT filtering can be applied to the entire video sequence, adaptively on a case by case basis for a picture, on a macroblock-by-macroblock basis, or a combination of the three. It will be understood that the low-pass filter can be configured to always apply, such as, for example, in a dedicated hardware encoder, but that the filter response can be selected such that the low-pass filter has no effect thereby effectively disabling the filter. A number of factors can be used to whether to apply the DCT filtering and the strength of DCT altering should it be applied. In one embodiment, state variables that are typically already computed arc advantageously used to make the decisions such that additional processor overhead and/or additional hardware circuitry is relatively low. For example, in one embodiment, the DCT filtering is selected based on observations of the behavior of the following two parameters: VBV buffer model occupancy and average running QP of current frame. The VBV buffer model was described in greater detail earlier in connection with Figure 7. Advantageously, the theoretical occupancy level of the VBV buffer model or similar buffer model is already maintained by a video encoder, such as an MPEG video encoder.

The average running quantization parameter QP is also a state variable that is typically maintained in a video encoder. While many variations exist to calculate a running average, for example, how many samples are used in the running average, whether the running average is unevenly weighted, etc., many video encoders track an average value for the QP to monitor video quality. A running average QP that is relatively high, such as a QP that is close to an upper bound for the QP, e.g., close to 31, indicates relatively low quality encoding with a relatively blocky picture. By contrast, a relatively low average running QP, e.g., an average close to a lower bound such as 1, indicates that the encoder is encoding with relatively high video quality end without relatively much blockiness. In one embodiment, the number of pictures (<i>N</i>) typically used to calculate a moving or running average QP is in the range 2-30.

In one embodiment, in response to the VBV buffer model status and the average running QP, a tradeoff is made between (a) using DCT filtering and using a lower QP value or (b) not performing DCT altering and using a higher QP value. It will be understood that (b) can correspond to conventional encoding techniques.

In one embodiment, when the encoder applies DCT filtering, another decision is made to determine the strength or magnitude of filtering. As will be understood by the skilled practitioner, the number of filter strengths that can be selected by the encoder can vary in a broad range, such as 2, 3, 4 or more filter strengths. In the illustrated embodiment, with Tables III, IV, and V, the encoder selects among 3 filter strengths (1/32="weak", 1/16="medium" and 1/8="strong") with the corresponding filter coefficient matrices. Many variations on the filter strengths are possible.

In another example of filter coefficients, the amount of filtering performed by the filter can be varied by adjusting the frequency response of the filter as illustrated in Tables VI, VII, and VIII. The amount of filtering can thus be varied even if the strength (1/<i>s</i>) of the filter stays the same. In the filter responses described in Tables VI, VII, and VIII, the strength (1/<i>s</i>) of the filters is 1/16 for each filter. <tables id="tabl0006" num="0006"><img file="EP1515564A2_D0155.tif" /></tables><tables id="tabl0007" num="0007"><img file="EP1515564A2_D0156.tif" /></tables><tables id="tabl0008" num="0008"><img file="EP1515564A2_D0157.tif" /></tables>

The filtering operation involves a simple scalar multiplication between the DCT coefficient and the coefficients listed previously. Many processors support instructions that perform multiplication of multiple variables in parallel. An example of such an instruction for a processor that supports the SSE instruction set or the MMX instruction set is an instruction for packed multiply, "PMUL." Advantageously, the division operation can correspond to an efficient right bit-shifting operation as long as the factor is a power of 2. A process for adaptively selects DCT filtering will now be described.

Figure 13 is a flowchart that generally illustrates an example of a process for adaptively selecting DCT filtering in a video encoder. It will be appreciated by the skilled practitioner that the illustrated process can be modified in a variety of ways without departing from the spirit and scope of the invention. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like.

The process starts at a state 1302, where the process retrieves the occupancy level for the VBV buffer model, which is typically updated prior to encoding of the picture. Advantageously, the occupancy level of the buffer model is already calculated in an encoding process. It will also be understood that the process does not have to retrieve the occupancy level until the occupancy level is used, but the data retrieve is shown in the state 1302 for clarity. The process advances from the state 1302 to a state 1304.

In the state 1304, the process calculates or retrieves the running QP average, which is also known as a "moving average." In one embodiment, the running average is reused from an existing running average. In another embodiment, the running average is separately calculated. In yet another embodiment, a new running average for QP is calculated from an existing running average and a recent running average to weight the running average as expressed in Equation 45.<maths id="math0149" num="(Eq. 45)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">QP</mtext></mrow><mrow><mtext mathvariant="italic">x_avg</mtext></mrow></msub><mtext> = ½*(</mtext><msub><mrow><mtext mathvariant="italic">QP</mtext></mrow><mrow><mtext mathvariant="italic">run</mtext></mrow></msub><mtext>+</mtext><msub><mrow><mtext mathvariant="italic">QP</mtext></mrow><mrow><mtext mathvariant="italic">x_prev</mtext></mrow></msub><mtext>)</mtext></mrow></math><img file="EP1515564A2_D0158.tif" /></maths>

In Equation 45, <i>QP</i>_<i>run</i> corresponds to an average running <i>QP</i> retrieved from a system state variable, and <i>QP</i>_{<i>x_prev</i>} corresponds to the QP of the previous picture of the same type (I, P, or B). The result of Equation 45, <i>QP</i>_{<i>x_avg</i>} can then be used in a comparison with a selected threshold, QP threshold of filtering (denoted as <i>QP</i>_{<i>flt_thr</i>}<i>).</i> The process advances from the state 1304 to a decision block 1306.

In the decision block 1306, the process compares the running average QP to a threshold, such as to a predetermined threshold. In one embodiment, <i>QP</i>_{<i>flt_thr</i>} is selected such that <i>QP</i>_{<i>flt_thr</i>} corresponds to a video quality threshold for an average QP, such as <i>QP</i>_{<i>x_avg</i>}, that indicates that blockiness in the video is likely to be apparent. It will be understood by one of ordinary skill in the art that the threshold can vary in a broad range and can depend on environmental conditions such as the resolution of the video, the frame rate of the video, and the contraints on the bit rate. In one embodiment, the process uses a smaller threshold for lower resolution video than for higher resolution value. In one embodiment, the process uses a threshold of <i>QP</i>_{<i>flt_thr</i>} = 6 for VCD-size video (352x240) or smaller resolutions. For DVD, i.e., NTSC (720x480), or similar size video, a value or <i>QP</i>_{<i>flt_thr</i>} = 14 can advantageously be used. Smaller resolution video, e.g., VCD, can be more sensitive to video blockiness because lower resolution video has a larger actual pixel size than higher resolution video. Other values can also be used, and still other values can be readily determined by one of ordinary skill in the art for different coding standards (MPEG4/H.264) or for different video frame sizes and frame rates.

In the illustrated process, the process proceeds from the decision block 1306 to a state 1308 when the running average exceeds the threshold (<i>QP</i>_{<i>x_avg</i>} &gt; <i>QP</i>_{<i>flt_thr</i>}). Otherwise, the process proceeds from the decision block 1306 to a state 1312.

In the state 1308, the process sets a flag to indicate to the a decision block 1322 to filter all the macroblocks of the picture in a state 1324. It will be understood that variations of the process are possible, and in another embodiment of the process, fewer than all the macroblocks are filtered in response to the detection of the running average exceeding the threshold. Returning now to the illustrated embodiment, where all macroblocks are selected to be filtered in response to the running average exceeding the threshold, the process advances from the state 1308 to a state 1310.

In the state 1310, the process selects a filter strength to apply to the DCT coefficients. As described earlier, the affect of the filter can vary depending on the frequency response of the filter and on the strength (1/<i>s</i>) of the filter. In the illustrated process, the VBV buffer model occupancy level retrieved in the state 1302 is used to determine the filter strength. In one embodiment, where the initial and long-term target for VBV buffer model occupancy is about 7/8 of the capacity of the VBV buffer model (7/8 of vbv_buffer_size), the following criteria is used to select the strength of the filter. A goal of 7/8 of the VBV buffer model capacity is a representative goal a video encoder. It will be understood that the criteria can vary in a wide range and can vary depending on the number of filter strengths from which the encoder selects and based on different goals and/or threshold for VBV buffer model occupancy.

In one embodiment, the lower the VBV buffer model occupancy, the stronger the strength of the applied filter. In one embodiment, where VBV_cur denotes VBV buffer model occupancy of the current picture or frame the filter strength is selected as follows. DCT filtering strength is set to weak when (VBV_cur &gt; 6/8*vbv_buffer_size). Below the threshold of 6/8*vbv_buffer_size, DCT filtering strength is set to medium if (VBV_cur &gt; 3/8*vbv_buffer_size). Below the threshold of 3/8*vbv_buffer_size, DCT filtering strength is set to strong. The process advances from the state 1310 to a state 1320.

Returning now to the decision block 1306, when the running average is less than or equal to the threshold, (<i>QP</i>_{<i>x_avg</i>} &lt;= <i>QP</i>_{<i>flt_thr</i>}), the process proceeds to the state 1312, where selected macroblocks can be filtered. In one embodiment, the process determines that should filtering be applied to a selected macroblock, that the filtering will be at a relatively weak strength such as the weak filter strength described earlier in connection with Table III. The process advances from the state 1312 to the state 1320.

In the state 1320, the process calculates the quantization parameter for a macroblock. The state 1320 can correspond to the start of a loop for processing the macroblocks of a picture. Various techniques can be used to calculated the quantization parameter (QP). In one embodiment, the QP is calculated using standard techniques described in TM5 from MPEG. In another embodiment, other techniques are used, such as the QP computation techniques described earlier in connection with Figure 6. In a TM5-type of rate control, the quantization parameter (QP) of a particular macroblock (MB) <i>i</i> is determined by the virtual buffer status and spatial activity of the macroblock. If the bit allocation of the previous MB is surpassed, i.e., too many bits were consumed, the TM5-rate control can compensate for this by assigning a higher QP value to a subsequent macroblock (MB).

It should be noted that the TM5-type of rate control (among others) uses a method it calls "adaptive quantization" to assign a relatively smaller QP to a macroblock in a flat region (low texture) and a relatively higher QP for a macroblock in a busy or high-texture region. As a result, relatively many macroblocks are disadvantageously and consistently assigned relatively high QP values that lead to visually unpleasant artifacts such as blockiness. As will be described later, one embodiment of the process advantageously reduces the relatively high QP values to decrease the blockiness, while performing DCT filtering to reduce the number of bits consumed in the encoding process to comply with VBV butter model constraints. The process advances from the state 1320 to the decision block 1322.

In the decision block 1322, the process determines whether to apply the filtering to all the macroblocks or to a selected macroblock. In the illustrated process, the process monitors the status of the flag set in the state 1308. When all the macroblocks are to be filtered, the process proceeds from the decision block 1322 to the state 1324. Otherwise, the process proceeds from the decision block 1322 to a decision block 1328.

In the state 1324, the process applies the selected DCT alter to the DCT coefficients. The number of bits is reduced by filtering by increasing the number of zeroes in the data, thereby decreasing the amount of data to be compressed. For example, the presence of additional zeroes can advantageously increase the number of zeroes encountered consecutively, which can be represented by a compact run length. The process advances from the state 1324 to a state 1326.

In the state 1326, the process places an upper bound on the QP values to alleviate blockiness. It has been observed that the blocky effect is usually more visible in an intra-macroblock than in an inter-macroblock (including forward, backward, and interpolated modes) for the same value of QP used. In one embodiment, a smaller QP bound is advantageously used for intra-macroblocks than for inter-macroblocks. An upper bound for an intra-macroblock and an upper bound for an inter-macroblock are denoted by <i>QP</i>_<i>intra</i>_{_}_<i>thr</i> and <i>QP</i>_{<i>inter_thr</i>}, respectively. In one embodiment, these bounds are adaptively selected according to the occupancy of the VBV buffer model according to Equation 46.<maths id="math0150" num=""><img file="EP1515564A2_D0159.tif" /></maths>

For example, if the current VBV buffer model occupancy level is between about 4/8 and 5/6 of the capacity of the VBV buffer model, then an upper bound for the QP is selected to be 14 and 20, respectively, for intra-macroblocks and for inter macroblocks. Other values for bounds for QP, that is, other values for <i>QP</i>_{<i>intra_thr</i>} and <i>QP</i>_{<i>inter_thr</i>} can readily be determined by one of ordinary skill in the art. The upper bound is applied to the QP calculated in the state 1320. When the calculated QP from the state 1320 is larger than the given bound, (QP_{intra_thr}, QP_{inter_thr}), the associated QP bound is used. The process advances from from the state 1326 to a state 1330, where the macroblock is encoded.

Returning now to the decision block 1328, at this point in the process, the process has determined that application of the DCT filtering of the state 1324 and the possible QP adjustment of the state 1326 is determined for a macroblock on a case by case basis. In one embodiment, the process proceeds from the decision block 1328 to the DCT filtering state 1324 and to the QP adjustment state when the running QP exceeds the thresholds described earlier in connection with Equation 46. When the running QP does not exceed the threshold, the process does not apply DCT filtering and does not adjust the QP and proceeds to the state 1330.

In the state 1330, the process encodes the macroblock. The encoding can be unfiltered via entry to the state 1330 from the decision block 1328, or filtered via entry of the state 1330 from the state 1326. The process advances from the state 1330 to a decision block 1332.

In the decision block 1332, the process determines whether it has finished encoding all the macroblocks in the picture. When there remain macroblocks to be encoded, the process returns to the state 1320 to continue processing. Otherwise, the process ends and can be restarted as desired for the encoding of a subsequent frame.

<u>Macroblock Mode Decision</u>

Figure 17 is a flowchart that generally illustrates a process for selecting a mode for a macroblock. Conventional video encoding techniques inadequately determine the encoding mode for a macroblock. One embodiment according to the invention advantageously includes the coding cost for motion vectors into the mode decision, thereby enhancing the quality of the selection of the mode. One embodiment further uses an L1 norm in the decision, thereby advantageously reducing the computational complexity of taking the coding cost for motion vectors into the mode decision.

In a state 1710, the process performs a motion search. To determine the appropriate coding mode for a certain macroblock, a conventional encoder can calculate the sum of squares, which is also known as the L2-norm, as a measure for the residual error after motion search for each coding mode of the macroblock (Inter with motion compensation, Inter with zero motion vector, Field-inter with motion compensation etc.). The sum of squares is then compared to a sum of squares of the original pixel values. In a conventional system, the minimum sum of squares indicates the optimal coding mode.

One disadvantage to these sum of squares calculations is that the sum of squares calculations are relatively computationally expensive, and slow down the encoding process. For example, it has been observed that this type of mode-decision sum of squares calculation can consume up to about 10% of the overall encoding complexity of MPEG compression.

In a state 1720, the process computes or retrieves data for a sum of absolute differences (SAD) for the motion search. In one embodiment of the invention, a sum of absolute values, also known as L1-norm, of the residual error is used as the measure for mode decision. Further advantageously, the sum of absolute values of the residual error is actually equal to the sum of absolute differences (SAD) that is used during motion search to determine the best candidate macroblock for prediction. Accordingly, except for the L1-norm of the original pixels, the L1-norm of the residual error is readily available to the encoder without further computation. Even where calculated, the L1-norm calculation is significantly simpler and takes fewer CPU cycles to calculate compared to an L2-norm calculation, since no multiplication is required to generate the L1-norm. In addition, selected processors directly support useful instructions as described earlier in connection with Figure 6.

Another disadvantage to the conventional approach to mode decision is that the conventional mode decision is determined purely by the distortion measure, i.e., the mode decision selects the mode with the lowest distortion. However, each of the modes are not equal in terms of consumed bits. For example, macroblock modes without motion vectors can be significantly smaller than other modes. As a result, the mode selected by conventional approaches can select a mode that does not provide relatively low distortion per bits consumed.

In many situations, a mode with a slightly larger distortion with a smaller Differential Motion Vector (DMV) or less motion vectors (the value of DMV will determine the used bits for coding this motion vector) can have better rate-distortion performance than a mode that exhibits the lowest distortion. As an example of the DMV, if the motion vector (MV) for a particular MB is (4,3) and the MV predictor for this MB is (3,6), then the DMV is (4-3,3-6)=(1, -3). In this case, the value of DMV to use for the modified SAD is |1|+|-3| = 4.

In a state 1730, the process compensates for a coding cost for the motion vectors in the SAD computation by adjusting <i>SAD</i>_<i>ORG</i> to <i>SAD</i>_<i>MOD</i><i>.</i> One embodiment uses a relatively simple decision rule to consider both rate of DMVs and their associated distortions. In one embodiment, since the decision rule is highly related to the picture and motion compensation (MC) type, the decision rule is selected according to whether a picture is B-picture or P-picture and whether the picture uses field prediction or frame prediction (for interlaced video and for progressive video). The actual value of the DMV, expressed in units of half-pixel, can be used for this purpose. The sum of the absolute values of the two components (horizontal and vertical) can be used in the value the following formulae for the decision rule.

In one embodiment, the cost associated with DMVs is translated into an equivalent SAD, such that the SAD of various modes can be more appropriately compared. In one embodiment, the DMV associated with each mode is first calculated, then DMV modified SADs of each mode are calculated, and then these modified SADs are used for the mode decision. For example, for a P-picture, the following rules identified in Rule 1 are used. Other rules will incorporating the principles and advantages described herein will be readily determined by one of ordinary skill in the art.

In the following formula, <i>SAD</i>_<i>mod</i> corresponds to the SAD value after DMV translation and used for mode decision, while <i>SAD</i>_<i>org</i> is the SAD value obtained from motion estimation. It will be understood that the rules expressed below can be readily modified to accommodate an L2-norm computation as well.

P-Picture Progressive Sequence

For these macroblocks (MBs), a MB can be encoded in one of three types: Intra, Inter_No_MC, and Inter_MC. Rule 1: <ul id="ul0001" list-style="none" compact="compact"><li>A. <i>Inter_MC SAD</i> is modified as: <i>SAD</i>_<i>mod</i>(Inter_MC) = <i>SAD</i>_<i>org</i> + min((DMV+1)*4, 32)</li><li>B. Inter_No_MC is kept as original: <i>SAD</i>_<i>mod</i>(Inter_No_MC) <i>= SAD</i>_<i>org.</i></li><li>C. Intra MB is modified as <i>SAD</i>_<i>mod</i>(intra) <i>= SAD</i>_<i>org</i><i> -</i>128<i>.</i></li></ul>

P frame - interlaced sequence

For these macroblocks, a MB can be encoded in one of four types: Intra, Inter_No_MC, Inter_MG_frame and Inter_MC_field. Inter_MC_field mode uses two motion vectors, such that there are two DMVs correspondingly. Rule 2: <ul id="ul0002" list-style="none" compact="compact"><li>A. <i>Inter_MC_frame SAD</i> is modified as: <i>SAD</i>_<i>mod</i>(Inter_MC_frame)= <i>SAD</i>_<i>org</i> + min((DMV+1)*4, 32)</li><li>B. <i>Inter_MC_field SAD</i> is modified as:<maths id="math0151" num=""><img file="EP1515564A2_D0160.tif" /></maths></li><li>C. Inter_No MC is kept as original: SAD_mod(Inter_No_MC) = SAD_org.</li><li>D. Intra MB is modified as SAD_mod(Intra) = SAD_org - 128.</li></ul>

<u>B frame - progressive sequence</u>

For these macroblocks, a MB can be encoded in one of four types: Intra, forward, backward and interpolated modes. Rule 3: <ul id="ul0003" list-style="none" compact="compact"><li>A. Forward SAD is modified as: <i>SAD</i>_<i>mod</i>(Forward) = <i>SAD</i>_<i>org</i> + min((DMV+1)*4,32)</li><li>B. Backward SAD is modified as: <i>SAD</i>_<i>mod</i>(Backward) <i>= SAD</i>_<i>org</i><i> +</i> min((DMV+1)*4, 32)</li><li>C. Interpolated SAD is modified as:<maths id="math0152" num=""><img file="EP1515564A2_D0161.tif" /></maths> since it uses two motion vectors;</li><li>D. Intra MB is modified as <i>SAD</i>_<i>mod</i>(Intra) = <i>SAD</i>_<i>org</i>-128.</li></ul>

B frame - interlaced sequence

For these macroblocks, a MB can be encoded in one of seven types: Intra, forward, forward_field, backward, backward_field, interpolated and interpolated_field modes. <ul id="ul0004" list-style="none"><li>A. SAD of forward mode is modified as: <i>SAD</i>_<i>mod</i>(forward) <i>= SAD</i>_<i>org</i> + min((DMV+1)*4, 32)</li><li>B. SAD of forward field mode is modified as:<maths id="math0153" num=""><img file="EP1515564A2_D0162.tif" /></maths> since it uses two motion vectors</li><li>C. SAD of backward mode is modified as: <i>SAD</i>_<i>mod</i>(backward) <i>= SAD</i>_<i>org</i> + min((DMV+1)*4, 32)</li><li>D. SAD of backward field mode is modified as:<maths id="math0154" num=""><img file="EP1515564A2_D0163.tif" /></maths> since it uses two motion vectors</li><li>E. SAD of interpolated frame mode is modified as:<maths id="math0155" num=""><img file="EP1515564A2_D0164.tif" /></maths> since it uses two motion vectors</li><li>F. SAD of interpolated field mods is modified as:<maths id="math0156" num=""><img file="EP1515564A2_D0165.tif" /></maths> since it uses four motion vectors</li><li>G. Intra MB is modified as <i>SAD</i>_<i>mod</i>(Intra) = <i>SAD</i>_<i>org</i><i> -</i> 128.</li></ul>

In a state 1740, the process selects the mode for the macroblock. After the SAD calculations are translated and compared in accordance with the appropriate rule, one embodiment of the process selects the mode with the lowest SAD after translation. Advantageously, experimental results indicate that using the L1-norm and modified formulas for coding mode decision works better than the traditional mode decision that uses the L2-norm by an average of 0.4dB in PSNR (peak signal-to-noise ratio), which represents a relatively significant quality improvement. In addition, the improvement in quality can also be accompanied by faster processing where the L1-norm is used rather than the L2-norm.

Figure 18 is another flowchart that generally illustrates a process for selecting a mode for a macroblock. In a state 1802, motion estimation for a frame or picture is performed. The motion estimation is provided to a state 1804 to calculate differential motion vectors and provided to 1810 to adjust SAD calculations. In the state 1804, the differential motion vectors are calculated. It will be understood that the differential motion vectors depend on prior motion vectors, data from which is provided from 1806. In a state 1808, translated SAD values are computed. In a state 1812, the translated SAD values are compared, and the macroblook mode is selected. In one embodiment, the mode selected corresponds to the mode with the lowest overall SAD. The selected mode is stored in 1814. Via state 1816, additional macroblocks can be processed.

Various embodiments of the invention have been described above. Although this invention has been described with reference to these specific embodiments, the descriptions are intended to be illustrative of the invention and are not intended to be limiting. Various modifications and applications may occur to those skilled in the art without departing from the true spirit and scope of the invention as defined in the appended claims.