WO2004105393A1 - Methods and apparatus for improving video quality in statistical multiplexing. - Google Patents

Methods and apparatus for improving video quality in statistical multiplexing. Download PDF

Info

Publication number
WO2004105393A1
WO2004105393A1 PCT/US2004/015477 US2004015477W WO2004105393A1 WO 2004105393 A1 WO2004105393 A1 WO 2004105393A1 US 2004015477 W US2004015477 W US 2004015477W WO 2004105393 A1 WO2004105393 A1 WO 2004105393A1
Authority
WO
WIPO (PCT)
Prior art keywords
current frame
encoding
frame
current
need parameter
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/US2004/015477
Other languages
French (fr)
Inventor
Siu-Wai Wu
Yong He
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Arris Technology Inc
Original Assignee
General Instrument Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by General Instrument Corp filed Critical General Instrument Corp
Priority to CA2524809A priority Critical patent/CA2524809C/en
Priority to MXPA05012262A priority patent/MXPA05012262A/en
Publication of WO2004105393A1 publication Critical patent/WO2004105393A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/236—Assembling of a multiplex stream, e.g. transport stream, by combining a video stream with other content or additional data, e.g. inserting a URL [Uniform Resource Locator] into a video stream, multiplexing software data into a video stream; Remultiplexing of multiplex streams; Insertion of stuffing bits into the multiplex stream, e.g. to obtain a constant bit-rate; Assembling of a packetised elementary stream
    • H04N21/2365—Multiplexing of several video streams
    • H04N21/23655—Statistical multiplexing, e.g. by controlling the encoder to alter its bitrate to optimize the bandwidth utilization
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/107—Selection of coding mode or of prediction mode between spatial and temporal predictive coding, e.g. picture refresh
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/115—Selection of the code volume for a coding unit prior to coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/117—Filters, e.g. for pre-processing or post-processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H04N19/15—Data rate or code amount at the encoder output by monitoring actual compressed data size at the memory before deciding storage at the transmission buffer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H04N19/152—Data rate or code amount at the encoder output by measuring the fullness of the transmission buffer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/177—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a group of pictures [GOP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
    • H04N19/192—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding the adaptation method, adaptation tool or adaptation type being iterative or recursive
    • H04N19/194—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding the adaptation method, adaptation tool or adaptation type being iterative or recursive involving only two passes

Definitions

  • the present invention relates to the field of digital video compression. More specifically, the present invention relates to a statistical multiplexing algorithm designed to improve video quality.
  • the bit rate demand (i.e. the "need parameter") may be high on a large number of video channels simultaneously.
  • a video channel may not receive the bandwidth it requires to maintain video quality.
  • the encoder for that video channel will be forced into a panic quantization mode to prevent a video buffering verifier (VBV) model from underflowing, resulting in blocky video.
  • VBV video buffering verifier
  • all discrete cosine transformation (DCT) coefficients may be discarded.
  • NBN when the distance from the previous I-frame exceeds a predefined upper bound. If the buffer model does not have sufficient room to hold a normal I-frame, the encoder will be forced into panic quantization mode to avoid NBN underflow.
  • the present invention relates to methods and apparatus for increasing video quality during statistical multiplexing by avoiding a panic quantization mode.
  • the present invention artificially increases the bandwidth need parameter for an encoding channel when the encoder delays encoding of an I-frame due to a buffer constraint, thereby increasing the encoder's share of the total available bandwidth. As the encoder obtains more bandwidth, more room is made available in the buffer model to accommodate the upcoming I-frame, thereby avoiding the panic quantization mode.
  • a method for improving video quality in statistical multiplexing For each encoding channel in a statistical multiplexer, a respective bit rate need parameter is calculated for encoding of a current frame in that encoding channel.
  • a decoder video buffering verifier level (VBV_Fullness) available to each encoding channel is also calculated. It is then determined whether the VBV_Fullness available to each encoding channel is sufficient for encoding the current frame of that encoding channel based on an initial complexity estimate for that current frame. In the event that the VBV_Fullness is determined to be sufficient, the current frame is encoded using the need parameter.
  • the need parameter is scaled by an adaptive panic multiplier and the current frame is encoded using the scaled need parameter.
  • the current frame may be an I-frame.
  • Each need parameter may be generated using look-ahead complexity from first pass encoding of a plurality of frames in a look-ahead pipeline for that encoding channel.
  • the plurality of frames include the current frame.
  • a current Group of Pictures (GOP) length is greater than a normal GOP length.
  • the current GOP length is the number of frames encoded since the last encoded I- frame.
  • the normal GOP length is the preset number of frames between consecutive I- frames. If the current GOP length is less than the normal GOP length, intra-coding of the I- frame may be disabled and the current frame may be encoded using the need parameter. If the current GOP length is greater than the normal GOP length, the bit rate need parameter may be scaled by the panic multiplier and the current frame may be encoded using the scaled need parameter.
  • the VBV_Fullness is determined to be insufficient when: Current Frame NBN JFullness - X*R ⁇ Threshold
  • Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel.
  • the variable R is the number of bits generated by the first pass encoding of the current frame.
  • the variable X is a weighting parameter (with a value between zero and one) corresponding to a minimum bit rate required for encoding the current frame.
  • Current Frame VBV_Fullness corresponds to the number of bits estimated by a VBV buffer for encoding the current frame. In an example implementation, X may be approximately 0.67.
  • the panic multiplier may be a variable which is dependent on an intra-coding status of the current frame and the intra-coding status of at least one previous frame.
  • the panic multiplier may be provided by:
  • Panic Jvlultiplier 1 + f(W) Where f(W) is a positive monotonic non-decreasing function of W (i.e., f(W)>0 and f(W) either increases or remain unchanged when W increases).
  • f(W) Y*W.
  • the variable Y may be a scalar variable within the range of 0 and 1.
  • the variable Y controls the reaction of the need parameter to the buffer level demand.
  • the variable W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame. In an example implementation, Y may be approximately 0.1.
  • f(W) may be implemented as a look up table.
  • the present invention also provides apparatus for improving video quality in statistical multiplexing capable of implementing the method described above.
  • One example embodiment of the present invention includes a first pass encoder for calculating an initial complexity estimate for encoding a current frame.
  • a video buffer verifier is provided for calculating a video buffering verifier level (VBV_Fullness) available to each encoding channel.
  • a second pass encoder is also provided.
  • the second pass encoder is capable of calculating an initial bit rate need parameter for a current frame to be encoded.
  • the second pass encoder is also capable of determining whether the VBV_Fullness, available to each encoding channel, is sufficient for encoding the current frame of that encoding channel based on the initial complexity estimate for that current frame.
  • the current frame is encoded using the need parameter.
  • the need parameter is scaled by an adaptive panic multiplier and the current frame is encoded using the scaled need parameter.
  • the current frame may be an I-frame.
  • a look-ahead pipeline may be provided for buffering a plurality of frames.
  • the second pass encoder may generate the need parameter using look-ahead complexity from first pass encoding of a plurality of frames in the look-ahead pipeline for that encoding channel.
  • the plurality of frames may include the current frame.
  • the second pass encoder may also determine whether a current Group of Pictures (GOP) length is greater than a normal GOP length. If the current GOP length is less than the normal GOP length, the second pass encoder disables intra-coding of the I-frame and encodes the current frame using the need parameter. If the current GOP length is greater than the normal GOP length, the second pass encoder scales the bit rate need parameter by the panic multiplier and encodes the current frame using the scaled need parameter.
  • GOP Group of Pictures
  • the second pass encoder may determine the VBV_Fullness to be insufficient when: Current Frame VBN Fullness - X*R ⁇ Threshold
  • Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel.
  • the variable R is the number of bits generated by the first pass encoding of the current frame.
  • the variable X is a weighting parameter corresponding to a minimum bit rate required for encoding the current frame. X is a positive number smaller than 1.
  • Current Frame NBN_Fullness corresponds to the number of bits estimated by a VBV buffer for encoding the current frame. In an example implementation, X may be approximately 0.67.
  • the panic multiplier may be a variable which is dependent on an intra-coding status of the current frame and the intra-coding status of at least one previous frame. The panic multiplier may be provided by:
  • PanicJVIultiplier 1 + f(W) Where f(W) is a positive monotonic non-decreasing function of W (i.e., f(W)>0 and f(W) either increases or remain unchanged when W increases).
  • f(W) Y*W.
  • the variable Y may be a scalar variable within the range of 0 and 1.
  • the variable Y controls the reaction of the need parameter to the buffer level demand.
  • the variable W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame. In an example implementation, Y may be approximately 0.1.
  • f(W) may be implemented as a look up table.
  • the methods and apparatus of the present invention may be implemented using various combinations of hardware, software, and firmware.
  • the present invention is suitable for use with both high definition television (HDTN) encoders and transcoders and standard definition television (SDTN) encoders and transcoders.
  • HDMI high definition television
  • SDTN standard definition television
  • Figure 1 shows a block diagram of an example embodiment of the present invention.
  • Figure 2 shows a flowchart of an example embodiment of the present invention.
  • a need parameter may be calculated from the complexity estimate for the frame, taking into account the impact of various special events (e.g., scene changes, dissolves, fades, flashes, explosions, jerky motion, and the like).
  • the statistical multiplexing algorithm then assigns an encoding bit rate to the encoder in proportion to the need parameter. Examples of such prior art encoding schemes are disclosed in commonly assigned U.S. patent application number 09/665,373 filed on September 20, 2000, entitled “Method and Apparatus for Determining A Bit Rate Need Parameter in A Statistical Multiplexer” and commonly owned U.S. patent application number 10/183,197 filed on June 25, 2003, entitled “Methods and Apparatus for Statistical Multiplexing During Dual Pass Encoding".
  • the original statistic multiplexing need parameter may be calculated as follows:
  • the Scene Change Multiplier may be used to improve the video quality of flashes, which are often detected as multiple scene changes.
  • the Activity Multiplier may be increased as the activity detected between frames increases.
  • the Low Motion Multiplier may be increased where there is little motion between frames.
  • the Dark Scene Multiplier may be increased to accommodate darker scenes.
  • the Film Multiplier may be increase to accommodate film mode.
  • the video buffering verifier (VBV) available buffer is calculated for the current frame as follows:
  • Vbv_channel_bits is the accumulation of the bit rate over system delay time
  • Current_Fifo_Bits is the bits available in FIFO buffer to be transmitted
  • CurrentJBits sed is the bits used to encode current picture.
  • next frame VBVJFullness Current frame VBVJFullness +
  • Bits_to_be_transmitted is the number of bits to be transmitted from the FIFO buffer during the next frame encoding period
  • Next_Bits_Budget is the estimated bits used for next picture.
  • the need parameter may be generated from a complexity estimated from first pass encoding and various special events impact, such as scene change, dark scene, and flash, etc. There may be no video break-up (i.e., excessive blocking artifacts due to panic quantization) except for the current frame to be encoded as an I-frame (given the low encoding bandwidth assigned), or extremely complex video presented in the rest of the group members.
  • the present invention provides methods and apparatus for improving video quality in statistical multiplexing. More specifically, the present invention provides an improved scheme that takes advantage of VBV buffer estimation and look-ahead complexity from first pass encoding for scaling the need parameter used in statistical multiplexing. In the event that the available bit rate is not enough to handle the complexity of particular picture to be encoded as an I-frame, the present invention provides an adaptive multiplier which is used to scale the need parameter so that more bits are assigned to the encoder, such that none of the statistic multiplexing group members would be broken up.
  • a dual pass encoder 10 in accordance with the invention includes a first pass encoder 15 for calculating an initial complexity estimate for encoding a current video frame.
  • a video buffer verifier 20 is provided for calculating a video buffering verifier level (VBV_Fullness) available to each encoding channel.
  • a second pass encoder 25 is also provided. The second pass encoder 25 is capable of calculating an initial bit rate need parameter for a current frame to be encoded. The need parameter is used by the statmux processor 50 to determine the bit rate for encoding the current frame.
  • statmux processor 50 receives the need parameter from the encoder 10 (e.g., via the master compression controller 40) as well as need parameters 35 from other video channels and allocates the available bandwidth among the video channels.
  • the master compression controller 40 is a processor which controls the second pass encoder 25 in response to the allocated bit rate received from the statmux processor 50.
  • the second pass encoder 25 is also capable of determining whether the VBV_Fullness available to each encoding channel is sufficient for encoding the current frame of that encoding channel based on the initial complexity estimate (e.g., provided by the first pass encoder 15) for that current frame. In the event that the VBVJFullness is determined to be sufficient, the current frame is encoded using the need parameter. In the event that the VBVJFullness is determined to be insufficient, the need parameter is scaled by an adaptive panic multiplier and the current frame is encoded using the scaled need parameter.
  • the current frame may be an I-frame.
  • a look-ahead pipeline may be provided for buffering a plurality of frames.
  • the pre-filtering processor and look-ahead delay 30 delays the video to provide the look-ahead pipeline for use by the second pass encoder 25.
  • the second pass encoder 25 may generate the need parameter using look-ahead complexity from first pass encoding of a plurality of frames in the look- ahead pipeline 30 for that encoding channel.
  • the plurality of frames in the look-ahead pipeline may include the current frame.
  • the second pass encoder 25 may also determine whether a current Group of Pictures (GOP) length is greater than a normal GOP length. If the current GOP length is less than the normal GOP length, the second pass encoder 25 disables intra-coding of the I-frame and encodes the current frame using the need parameter. If the current GOP length is greater than the normal GOP length, the second pass encoder 25 scales the bit rate need parameter by the panic multiplier and encodes the current frame using the scaled need parameter.
  • GOP Group of Pictures
  • the second pass encoder 25 may determine the NBN_Fullness to be insufficient when: Current Frame NBV_Fullness - X*R ⁇ Threshold
  • Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel.
  • the variable R is the number of bits generated by the first pass encoding of the current frame.
  • the variable X is a weighting parameter, of value between 0 and 1, corresponding to a minimum bit rate required for encoding the current frame.
  • Current Frame VBV_Fullness corresponds to the number of bits estimated by a VBV buffer for encoding the current frame. In an example implementation, X may be approximately 0.67.
  • the panic multiplier may be a variable dependent on an intra-coding status of the current frame and at least one previous frame.
  • f(W) is a positive monotonic non-decreasing function of W(i.e., f(W)>0 and f(W) either increases or remain unchanged when W increases).
  • f(W) Y*W.
  • the variable Y may be a scalar variable within the range of 0 and 1.
  • the variable Y controls the reaction of the need parameter to the buffer level demand.
  • the variable W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame. In an example implementation, Y may be approximately 0.1.
  • f(W) may be implemented as a look up table.
  • FIG. 2 is a flowchart illustrating an example method 100 for improving video quality in statistical multiplexing in accordance with the invention.
  • the method 100 occurs for each encoding channel in a statistical multiplexer.
  • the initial complexity estimate is computed by the first pass encoder 15 (step 101).
  • a respective bit rate need parameter is calculated by the second pass encoder 25 for encoding of a current frame (in the example embodiment shown in Figure 2, the current frame is an I-frame) (Step 102).
  • the number of bits generated by the first pass encoder during encoding the current frame is determined (Step 103)
  • a video buffering verifier level (NBNJFullness) available to each encoding channel is then calculated by the video verifier buffer 20 (Step 104).
  • NBNJFullness video buffering verifier level
  • Step 105 It is then determined whether the NBN_FuUness available to each encoding channel is sufficient for encoding the current frame of that encoding channel based on an initial complexity estimate for that current frame (Step 105). In the event that the NBN_Fullness is determined to be sufficient, the current frame is encoded using the need parameter (Step 106). In the event that the NBN_Fullness is determined to be insufficient, it may then be determined whether a current Group of Pictures (GOP) length is greater than a normal GOP length (Step 107). If the current GOP length is less than the normal GOP length, intra- coding of the I-frame may be disabled and the current frame may be encoded using the need parameter (Step 108).
  • GTP Group of Pictures
  • the panic multiplier is computed (as described above in connection with Figure 1) (Step 109).
  • the bit rate need parameter may then be scaled by the panic multiplier and the current frame may be encoded using the scaled need parameter (Step 110).
  • the next frame is processed in the same manner (Step 111).

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The present invention provides methods and apparatus for improving video quality in statistical multiplexing (50). For each encoding channel in a statistical multiplexer (50), a respective bit rate need parameter is calculated for encoding (40) of a current frame. in that encoding channel. A video buffering verifier level (VBV, 20) available to each encoding channel is also calculated. detennining whether the VBV Fullness (20) available to each encoding channel is sufficient for encoding the current frame of that channel based on an initial complexity estimate for that current frame. Scale the parameter by an adaptive panic multiplier if the VBV Fullness to be insufficient and encod the current frame using the scaled parameter.

Description

METHODS AND APPARATUS FOR IMPROVING VIDEO QUALITY IN STATISTICAL MULTIPLEXING
BACKGROUND OF THE INVENTION
The present invention relates to the field of digital video compression. More specifically, the present invention relates to a statistical multiplexing algorithm designed to improve video quality.
In prior art statistical multiplexing schemes with limited group bandwidth, the bit rate demand (i.e. the "need parameter") may be high on a large number of video channels simultaneously. In such an instance, a video channel may not receive the bandwidth it requires to maintain video quality. As a result, the encoder for that video channel will be forced into a panic quantization mode to prevent a video buffering verifier (VBV) model from underflowing, resulting in blocky video. In the panic quantization mode, all discrete cosine transformation (DCT) coefficients may be discarded.
Commonly assigned U.S. patent application number 09/806,390, filed on March 29, 2001 discloses one scheme for avoiding panic quantization mode in certain circumstances. In particular, the encoding of an I-frame is delayed when the VBN model does not have enough capacity to support an intra-coded (I) frame. However, there is a limitation in such a scheme that the I-frames cannot be spaced an infinite distance apart. Therefore, in a practical implementation of the invention described in U.S. patent application number 09/806,390, the encoder is forced to encode an I-frame irregardless of the status of the
NBN when the distance from the previous I-frame exceeds a predefined upper bound. If the buffer model does not have sufficient room to hold a normal I-frame, the encoder will be forced into panic quantization mode to avoid NBN underflow.
It would be advantageous to eliminate any potential for encoding in a panic quantization mode. It would be advantageous to artificially increase the bandwidth need parameter when the encoder delays encoding of an I-frame due to a buffer constraint, thereby increasing the share of bandwidth in that encoding channel.
The methods and apparatus of the present invention provide the foregoing and other advantages. SUMMARY OF THE INVENTION
The present invention relates to methods and apparatus for increasing video quality during statistical multiplexing by avoiding a panic quantization mode. In particular, the present invention artificially increases the bandwidth need parameter for an encoding channel when the encoder delays encoding of an I-frame due to a buffer constraint, thereby increasing the encoder's share of the total available bandwidth. As the encoder obtains more bandwidth, more room is made available in the buffer model to accommodate the upcoming I-frame, thereby avoiding the panic quantization mode.
In an example embodiment of the invention, a method for improving video quality in statistical multiplexing is provided. For each encoding channel in a statistical multiplexer, a respective bit rate need parameter is calculated for encoding of a current frame in that encoding channel. A decoder video buffering verifier level (VBV_Fullness) available to each encoding channel is also calculated. It is then determined whether the VBV_Fullness available to each encoding channel is sufficient for encoding the current frame of that encoding channel based on an initial complexity estimate for that current frame. In the event that the VBV_Fullness is determined to be sufficient, the current frame is encoded using the need parameter. In the event that the VBV_Fullness is determined to be insufficient, the need parameter is scaled by an adaptive panic multiplier and the current frame is encoded using the scaled need parameter. In one example embodiment, the current frame may be an I-frame. Each need parameter may be generated using look-ahead complexity from first pass encoding of a plurality of frames in a look-ahead pipeline for that encoding channel. The plurality of frames include the current frame.
Where the VBNJFullness is determined to be insufficient, it may then be determined whether a current Group of Pictures (GOP) length is greater than a normal GOP length. The current GOP length is the number of frames encoded since the last encoded I- frame. The normal GOP length is the preset number of frames between consecutive I- frames. If the current GOP length is less than the normal GOP length, intra-coding of the I- frame may be disabled and the current frame may be encoded using the need parameter. If the current GOP length is greater than the normal GOP length, the bit rate need parameter may be scaled by the panic multiplier and the current frame may be encoded using the scaled need parameter.
In one example embodiment of the invention, the VBV_Fullness is determined to be insufficient when: Current Frame NBN JFullness - X*R < Threshold
In this equation, Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel. The variable R is the number of bits generated by the first pass encoding of the current frame. The variable X is a weighting parameter (with a value between zero and one) corresponding to a minimum bit rate required for encoding the current frame. Current Frame VBV_Fullness corresponds to the number of bits estimated by a VBV buffer for encoding the current frame. In an example implementation, X may be approximately 0.67.
The panic multiplier may be a variable which is dependent on an intra-coding status of the current frame and the intra-coding status of at least one previous frame. The panic multiplier may be provided by:
Panic Jvlultiplier = 1 + f(W) Where f(W) is a positive monotonic non-decreasing function of W (i.e., f(W)>0 and f(W) either increases or remain unchanged when W increases). In an example implementation, f(W) = Y*W. The variable Y may be a scalar variable within the range of 0 and 1. The variable Y controls the reaction of the need parameter to the buffer level demand. The variable W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame. In an example implementation, Y may be approximately 0.1. The variable W may be defined as W = 0, 1, 2, 3, . . . z, where z is the predetermined number of previous frames which precede the current frame. In another example implementation, f(W) may be implemented as a look up table.
The present invention also provides apparatus for improving video quality in statistical multiplexing capable of implementing the method described above. One example embodiment of the present invention includes a first pass encoder for calculating an initial complexity estimate for encoding a current frame. A video buffer verifier is provided for calculating a video buffering verifier level (VBV_Fullness) available to each encoding channel. A second pass encoder is also provided. The second pass encoder is capable of calculating an initial bit rate need parameter for a current frame to be encoded. The second pass encoder is also capable of determining whether the VBV_Fullness, available to each encoding channel, is sufficient for encoding the current frame of that encoding channel based on the initial complexity estimate for that current frame. In the event that the
NBN_Fullness is deteπnined to be sufficient, the current frame is encoded using the need parameter. In the event that the VBV_Fullness is determined to be insufficient, the need parameter is scaled by an adaptive panic multiplier and the current frame is encoded using the scaled need parameter. In one example embodiment, the current frame may be an I-frame. A look-ahead pipeline may be provided for buffering a plurality of frames. The second pass encoder may generate the need parameter using look-ahead complexity from first pass encoding of a plurality of frames in the look-ahead pipeline for that encoding channel. The plurality of frames may include the current frame. When the second pass encoder determines the VBV_Fullness to be insufficient, the second pass encoder may also determine whether a current Group of Pictures (GOP) length is greater than a normal GOP length. If the current GOP length is less than the normal GOP length, the second pass encoder disables intra-coding of the I-frame and encodes the current frame using the need parameter. If the current GOP length is greater than the normal GOP length, the second pass encoder scales the bit rate need parameter by the panic multiplier and encodes the current frame using the scaled need parameter.
In a further example embodiment of the present invention, the second pass encoder may determine the VBV_Fullness to be insufficient when: Current Frame VBN Fullness - X*R < Threshold In this equation, Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel. The variable R is the number of bits generated by the first pass encoding of the current frame. The variable X is a weighting parameter corresponding to a minimum bit rate required for encoding the current frame. X is a positive number smaller than 1. Current Frame NBN_Fullness corresponds to the number of bits estimated by a VBV buffer for encoding the current frame. In an example implementation, X may be approximately 0.67. The panic multiplier may be a variable which is dependent on an intra-coding status of the current frame and the intra-coding status of at least one previous frame. The panic multiplier may be provided by:
PanicJVIultiplier = 1 + f(W) Where f(W) is a positive monotonic non-decreasing function of W (i.e., f(W)>0 and f(W) either increases or remain unchanged when W increases). In an example implementation, f(W) = Y*W. The variable Y may be a scalar variable within the range of 0 and 1. The variable Y controls the reaction of the need parameter to the buffer level demand. The variable W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame. In an example implementation, Y may be approximately 0.1. The variable W may be defined as W = 0, 1, 2, 3, . . . z, where z is the predetermined number of previous frames which precede the current frame. In another example implementation, f(W) may be implemented as a look up table. The methods and apparatus of the present invention may be implemented using various combinations of hardware, software, and firmware. The present invention is suitable for use with both high definition television (HDTN) encoders and transcoders and standard definition television (SDTN) encoders and transcoders.
BRIEF DESCRIPTION OF THE DRAWINGS
The present invention will hereinafter be described in conjunction with the appended drawing figures, wherein like reference numerals denote like elements, and:
Figure 1 shows a block diagram of an example embodiment of the present invention; and
Figure 2 shows a flowchart of an example embodiment of the present invention.
DETAILED DESCRIPTION
The ensuing detailed description provides exemplary embodiments only, and is not intended to limit the scope, applicability, or configuration of the invention. Rather, the ensuing detailed description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing an embodiment of the invention. It should be understood that various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the invention as set forth in the appended claims.
In prior art statistical multiplexing schemes, a need parameter may be calculated from the complexity estimate for the frame, taking into account the impact of various special events (e.g., scene changes, dissolves, fades, flashes, explosions, jerky motion, and the like). The statistical multiplexing algorithm then assigns an encoding bit rate to the encoder in proportion to the need parameter. Examples of such prior art encoding schemes are disclosed in commonly assigned U.S. patent application number 09/665,373 filed on September 20, 2000, entitled "Method and Apparatus for Determining A Bit Rate Need Parameter in A Statistical Multiplexer" and commonly owned U.S. patent application number 10/183,197 filed on June 25, 2003, entitled "Methods and Apparatus for Statistical Multiplexing During Dual Pass Encoding".
For example, for each video frame, the original statistic multiplexing need parameter may be calculated as follows:
Original_Need_Parameter = SceneChangeMultiplier * Activity Multiplier *
LowMotionMultiplier * DarkSceneMultiplier * FrameRate * FilmMultiplier *
InitialNeedParameter.
The Scene Change Multiplier may be used to improve the video quality of flashes, which are often detected as multiple scene changes. The Activity Multiplier may be increased as the activity detected between frames increases. The Low Motion Multiplier may be increased where there is little motion between frames. The Dark Scene Multiplier may be increased to accommodate darker scenes. The Film Multiplier may be increase to accommodate film mode. For each video frame to be encoded, the video buffering verifier (VBV) available buffer is calculated for the current frame as follows:
Current frame VBV_FuUness = Vbv_channel_bits - Current_Fifo_Bits -
Current_Bits_Used. In this formula, Vbv_channel_bits is the accumulation of the bit rate over system delay time, Current_Fifo_Bits is the bits available in FIFO buffer to be transmitted, and CurrentJBits sed is the bits used to encode current picture.
Based on the Current frame VBV_Fullness and the complexity from first pass encoding, the next frame VBVJFullness can be estimated as follows: Estimated next frame VBV_Fullness = Current frame VBVJFullness +
Bits_to_be_transmitted - Next_Bits_Budget. In this formula, Bits_to_be_transmitted is the number of bits to be transmitted from the FIFO buffer during the next frame encoding period, and Next_Bits_Budget is the estimated bits used for next picture. In such prior art encoding schemes the need parameter may be generated from a complexity estimated from first pass encoding and various special events impact, such as scene change, dark scene, and flash, etc. There may be no video break-up (i.e., excessive blocking artifacts due to panic quantization) except for the current frame to be encoded as an I-frame (given the low encoding bandwidth assigned), or extremely complex video presented in the rest of the group members.
The present invention provides methods and apparatus for improving video quality in statistical multiplexing. More specifically, the present invention provides an improved scheme that takes advantage of VBV buffer estimation and look-ahead complexity from first pass encoding for scaling the need parameter used in statistical multiplexing. In the event that the available bit rate is not enough to handle the complexity of particular picture to be encoded as an I-frame, the present invention provides an adaptive multiplier which is used to scale the need parameter so that more bits are assigned to the encoder, such that none of the statistic multiplexing group members would be broken up.
One example embodiment of the present invention is shown in Figure 1. A dual pass encoder 10 in accordance with the invention includes a first pass encoder 15 for calculating an initial complexity estimate for encoding a current video frame. A video buffer verifier 20 is provided for calculating a video buffering verifier level (VBV_Fullness) available to each encoding channel. A second pass encoder 25 is also provided. The second pass encoder 25 is capable of calculating an initial bit rate need parameter for a current frame to be encoded. The need parameter is used by the statmux processor 50 to determine the bit rate for encoding the current frame. More specifically, the statmux processor 50 receives the need parameter from the encoder 10 (e.g., via the master compression controller 40) as well as need parameters 35 from other video channels and allocates the available bandwidth among the video channels. The master compression controller 40 is a processor which controls the second pass encoder 25 in response to the allocated bit rate received from the statmux processor 50.
The second pass encoder 25 is also capable of determining whether the VBV_Fullness available to each encoding channel is sufficient for encoding the current frame of that encoding channel based on the initial complexity estimate (e.g., provided by the first pass encoder 15) for that current frame. In the event that the VBVJFullness is determined to be sufficient, the current frame is encoded using the need parameter. In the event that the VBVJFullness is determined to be insufficient, the need parameter is scaled by an adaptive panic multiplier and the current frame is encoded using the scaled need parameter.
In one example embodiment, the current frame may be an I-frame. A look-ahead pipeline may be provided for buffering a plurality of frames. The pre-filtering processor and look-ahead delay 30 delays the video to provide the look-ahead pipeline for use by the second pass encoder 25. The second pass encoder 25 may generate the need parameter using look-ahead complexity from first pass encoding of a plurality of frames in the look- ahead pipeline 30 for that encoding channel. The plurality of frames in the look-ahead pipeline may include the current frame.
When the second pass encoder 25 determines the NBN_Fullness to be insufficient, the second pass encoder 25 may also determine whether a current Group of Pictures (GOP) length is greater than a normal GOP length. If the current GOP length is less than the normal GOP length, the second pass encoder 25 disables intra-coding of the I-frame and encodes the current frame using the need parameter. If the current GOP length is greater than the normal GOP length, the second pass encoder 25 scales the bit rate need parameter by the panic multiplier and encodes the current frame using the scaled need parameter.
In another example embodiment of the present invention, the second pass encoder 25 may determine the NBN_Fullness to be insufficient when: Current Frame NBV_Fullness - X*R < Threshold
In this equation, Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel. The variable R is the number of bits generated by the first pass encoding of the current frame. The variable X is a weighting parameter, of value between 0 and 1, corresponding to a minimum bit rate required for encoding the current frame. Current Frame VBV_Fullness corresponds to the number of bits estimated by a VBV buffer for encoding the current frame. In an example implementation, X may be approximately 0.67.
The panic multiplier may be a variable dependent on an intra-coding status of the current frame and at least one previous frame. The panic multiplier may be provided by: Panic_Multiρlier = 1 + f(W)
Where f(W) is a positive monotonic non-decreasing function of W(i.e., f(W)>0 and f(W) either increases or remain unchanged when W increases). In an example implementation, f(W) = Y*W. The variable Y may be a scalar variable within the range of 0 and 1. The variable Y controls the reaction of the need parameter to the buffer level demand. The variable W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame. In an example implementation, Y may be approximately 0.1. The variable W may be defined as W = 0, 1, 2, 3, . . . z, where z is the predetermined number of previous frames. For practical purposes, z may be in the range of between 4 to 15 previous frames. In another example implementation, f(W) may be implemented as a look up table.
Figure 2 is a flowchart illustrating an example method 100 for improving video quality in statistical multiplexing in accordance with the invention. The method 100 occurs for each encoding channel in a statistical multiplexer. The initial complexity estimate is computed by the first pass encoder 15 (step 101). A respective bit rate need parameter is calculated by the second pass encoder 25 for encoding of a current frame (in the example embodiment shown in Figure 2, the current frame is an I-frame) (Step 102). Then the number of bits generated by the first pass encoder during encoding the current frame is determined (Step 103) A video buffering verifier level (NBNJFullness) available to each encoding channel is then calculated by the video verifier buffer 20 (Step 104). It is then determined whether the NBN_FuUness available to each encoding channel is sufficient for encoding the current frame of that encoding channel based on an initial complexity estimate for that current frame (Step 105). In the event that the NBN_Fullness is determined to be sufficient, the current frame is encoded using the need parameter (Step 106). In the event that the NBN_Fullness is determined to be insufficient, it may then be determined whether a current Group of Pictures (GOP) length is greater than a normal GOP length (Step 107). If the current GOP length is less than the normal GOP length, intra- coding of the I-frame may be disabled and the current frame may be encoded using the need parameter (Step 108). If the current GOP length is greater than the normal GOP length, the panic multiplier is computed (as described above in connection with Figure 1) (Step 109). The bit rate need parameter may then be scaled by the panic multiplier and the current frame may be encoded using the scaled need parameter (Step 110). Once the current frame is encoded, the next frame is processed in the same manner (Step 111). It should now be appreciated that the present invention provides advantageous methods and apparatus for improving video quality during statistical multiplexing.
Although the invention has been described in connection with various illustrated embodiments, numerous modifications and adaptations may be made thereto without departing from the spirit and scope of the invention as set forth in the claims.

Claims

What is claimed is:
1. A method for improving video quality in statistical multiplexing, comprising: for each encoding channel in a statistical multiplexer, calculating a respective bit rate need parameter for encoding of a current frame in that encoding channel; for each encoding channel in a statistical multiplexer, calculating a video buffering verifier level (VBV_Fullness) available to each encoding channel; determining whether the VBVJFullness available to each encoding channel is sufficient for encoding said current frame of that encoding channel based on an initial complexity estimate for that current frame; and in the event that the VBVJFullness is determined to be sufficient, encoding said current frame using said need parameter; in the event that the VBNJFullness is determined to be insufficient, scaling said need parameter by an adaptive panic multiplier and encoding said current frame using said scaled need parameter.
2. The method of claim 1, wherein said current frame is an I-frame.
3 The method of claim 2, wherein each need parameter is generated using look-ahead complexity from first pass encoding of a plurality of frames in a look-ahead pipeline for that encoding channel, said plurality of frames including said current frame.
4. The method of claim 3, wherein if the NBN_Fullness is determined to be insufficient, further comprising: determining whether a current Group of Pictures (GOP) length is greater than a normal GOP length; and if said current GOP length is less than said normal GOP length, disabling intra-coding of said I-frame in the event that said NBNJFullness is determined to be insufficient, and encoding said current frame using said need parameter; and if said current GOP length is greater than said normal GOP length, scaling the bit rate need parameter by the panic multiplier in the event that said VBVJFullness is determined to be insufficient, and encoding said current frame using said scaled need parameter.
5. The method of claim 4, wherein said VBVJFullness is determined to be insufficient when:
Current Frame VBVJFullness - X*R < Threshold wherein:
Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel;
R is the number of bits generated by said first pass encoding of said current frame;
X is a weighting parameter corresponding to a minimum bit rate required for encoding said current frame; and
Current Frame VBNJFullness corresponds to the number of bits estimated by a NBN buffer for encoding the current frame.
6. The method of claim 5, wherein X is within a range of 0.5 to 1.
7. The method of claim 5, wherein the panic multiplier is a variable dependent on an'intra- coding status of the current frame and at least one previous frame.
8. The method of claim 7, wherein said panic multiplier is provided by:
Panic JVIultiplier = 1 + f(W) wherein: f(W) is a positive monotonic non-decreasing function of W; and W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame.
9. The method of claim 8, wherein: f(W) = Y*W; and
Y is a scalar variable within the range of 0 and 1.
10. The method of claim 9, wherein Y is approximately 0.1.
11. The method of claim 8, wherein: the value of f(W) is provided by a look up table.
12. The method of claim 8, wherein:
W = 0, 1, 2, 3, . . . z; and
Z is the predetermined number of previous frames.
13. An apparatus for improving video quality in statistical multiplexing, comprising for each encoding channel: a first pass encoder for calculating an initial complexity estimate for encoding a current frame; a video buffer verifier for calculating a video buffering verifier level (NBNJFullness) available to each encoding channel; and a second pass encoder capable of: calculating an initial bit rate need parameter for a current frame to be encoded; determining whether the NBNJFullness available to each encoding channel is sufficient for encoding said current frame of that encoding channel based on the initial complexity estimate for that current frame; in the event that the VBVJFullness is determined to be sufficient, encoding said current frame using said need parameter; and in the event that the VBVJFullness is determined to be insufficient, scaling said need parameter by an adaptive panic multiplier and encoding said current frame using said scaled need parameter.
14. The apparatus of claim 13, wherein said current frame is an I-frame.
15. The apparatus of claim 13, further comprising: a look-ahead pipeline for buffering a plurality of frames; wherein said second pass encoder generates the need parameter using look-ahead complexity from first pass encoding of a plurality of frames in said look-ahead pipeline for that encoding channel, said plurality of frames including said current frame.
16. The apparatus of claim 15, wherein said second pass encoder: determines the VBV_Fullness to be insufficient; determines whether a current Group of Pictures (GOP) length is greater than a normal GOP length; and if said current GOP length is less than said normal GOP length, disables intra-coding of said I-frame, and encodes said current frame using said need parameter; and if said current GOP length is greater than said normal GOP length, scales the bit rate need parameter by the panic multiplier, and encodes said current frame using said scaled need parameter.
17. The apparatus of claim 16, wherein said second pass encoder determines the VBVJFullness to be insufficient when:
Current Frame VBV_Fullness - X*R < Threshold wherein:
Threshold is a number of bits proportionate to bandwidth assigned the current picture on the respective channel;
R is the number of bits generated by said first pass encoding of said current frame;
X is a weighting parameter corresponding to a minimum bit rate required for encoding said current frame; and
Current Frame NBNJFullness corresponds to the number of bits estimated by a NBN buffer for encoding the current frame.
18. The apparatus of claim 17, wherein X is within a range of 0.5 to 1.
19. The apparatus of claim 17, wherein the panic multiplier is a variable dependent on an intra-coding status of the current frame and at least one previous frame.
20. The apparatus of claim 17, wherein said panic multiplier is provided by:
Panic Jvlultiplier = 1 + f(W) wherein: f(W) is a positive monotonic non-decreasing function of W; and W designates a number of previous frames for which intra-coding has been disabled out of a predetermined number of previous frames preceding the current frame.
21. The apparatus of claim 20, wherein: f(W) = Y*W; and
Y is a scalar variable within the range of 0 and 1.
22. The apparatus of claim 21, wherein Y is approximately 0.1.
23. The apparatus of claim 20, wherein: the value of f(W) is provided by a look up table.
24. The apparatus of claim 20, wherein:
W = 0, 1, 2, 3, . . . %; and
Z is the predetermined number of previous frames.
PCT/US2004/015477 2003-05-19 2004-05-18 Methods and apparatus for improving video quality in statistical multiplexing. Ceased WO2004105393A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CA2524809A CA2524809C (en) 2003-05-19 2004-05-18 Methods and apparatus for improving video quality in statistical multiplexing
MXPA05012262A MXPA05012262A (en) 2003-05-19 2004-05-18 Methods and apparatus for improving video quality in statistical multiplexing.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/441,334 2003-05-19
US10/441,334 US7274739B2 (en) 2003-05-19 2003-05-19 Methods and apparatus for improving video quality in statistical multiplexing

Publications (1)

Publication Number Publication Date
WO2004105393A1 true WO2004105393A1 (en) 2004-12-02

Family

ID=33449968

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2004/015477 Ceased WO2004105393A1 (en) 2003-05-19 2004-05-18 Methods and apparatus for improving video quality in statistical multiplexing.

Country Status (5)

Country Link
US (1) US7274739B2 (en)
CA (1) CA2524809C (en)
MX (1) MXPA05012262A (en)
TW (1) TW200509681A (en)
WO (1) WO2004105393A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013096259A3 (en) * 2011-12-19 2013-09-19 Motorola Mobility Llc Method and apparatus for dual pass rate control video encoding
US8948529B1 (en) 2012-10-30 2015-02-03 Google Inc. Multi-pass encoding
US9032467B2 (en) 2011-08-02 2015-05-12 Google Inc. Method and mechanism for efficiently delivering visual data across a network

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2851111B1 (en) * 2003-02-10 2005-07-22 Nextream France DEVICE FOR ENCODING A VIDEO DATA STREAM
US20090150926A1 (en) * 2007-12-06 2009-06-11 General Instrument Corporation Method And Apparatus For Delivering SDV Programming With Targeted Advertising To Selected Groups Of Subscribers
US9307298B2 (en) * 2009-05-29 2016-04-05 Harmonic, Inc. System and method for video statistical multiplexing adapting to internet protocol networks
US9794562B2 (en) * 2009-12-04 2017-10-17 Arris Enterprises, Inc. Generation and detection of private metadata in an encoded video transport stream
US20140086310A1 (en) * 2012-09-21 2014-03-27 Jason D. Tanner Power efficient encoder architecture during static frame or sub-frame detection
US20140112386A1 (en) * 2012-10-22 2014-04-24 General Instrument Corporation Algorithms for determining bitrate for a statistical multiplexing system to account for signal complexity including film mode and gop structural changes
US10097828B2 (en) 2014-12-11 2018-10-09 Intel Corporation Rate control for parallel video encoding
US10516812B2 (en) 2018-04-02 2019-12-24 Intel Corporation Devices and methods for selective display frame fetch

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030058931A1 (en) * 2001-09-24 2003-03-27 Mitsubishi Electric Research Laboratories, Inc. Transcoder for scalable multi-layer constant quality video bitstreams
US6763067B2 (en) * 2000-10-10 2004-07-13 Sarnoff Corporation Rate control for bitstream re-encoding

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5801779A (en) * 1995-12-26 1998-09-01 C-Cube Microsystems, Inc. Rate control with panic mode
US5878166A (en) * 1995-12-26 1999-03-02 C-Cube Microsystems Field frame macroblock encoding decision
US6038256A (en) * 1996-12-31 2000-03-14 C-Cube Microsystems Inc. Statistical multiplexed video encoding using pre-encoding a priori statistics and a priori and a posteriori statistics

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6763067B2 (en) * 2000-10-10 2004-07-13 Sarnoff Corporation Rate control for bitstream re-encoding
US20030058931A1 (en) * 2001-09-24 2003-03-27 Mitsubishi Electric Research Laboratories, Inc. Transcoder for scalable multi-layer constant quality video bitstreams

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9032467B2 (en) 2011-08-02 2015-05-12 Google Inc. Method and mechanism for efficiently delivering visual data across a network
WO2013096259A3 (en) * 2011-12-19 2013-09-19 Motorola Mobility Llc Method and apparatus for dual pass rate control video encoding
US9094684B2 (en) 2011-12-19 2015-07-28 Google Technology Holdings LLC Method for dual pass rate control video encoding
US9516329B2 (en) 2011-12-19 2016-12-06 Google Technology Holdings LLC Method for dual pass rate control video encoding
US9866838B2 (en) 2011-12-19 2018-01-09 Google Technology Holdings LLC Apparatus for dual pass rate control video encoding
US8948529B1 (en) 2012-10-30 2015-02-03 Google Inc. Multi-pass encoding

Also Published As

Publication number Publication date
CA2524809C (en) 2012-06-19
US7274739B2 (en) 2007-09-25
US20040233998A1 (en) 2004-11-25
TW200509681A (en) 2005-03-01
MXPA05012262A (en) 2006-02-10
CA2524809A1 (en) 2004-12-02

Similar Documents

Publication Publication Date Title
US9866838B2 (en) Apparatus for dual pass rate control video encoding
JP4390112B2 (en) Method and apparatus for controlling rate of video sequence and video encoding apparatus
CN100512432C (en) Video data transmission system
KR100927083B1 (en) Quasi-constant-quality rate control with look-ahead
JP3866538B2 (en) Video coding method and apparatus
US6763067B2 (en) Rate control for bitstream re-encoding
US6229849B1 (en) Coding device and method
US20060140267A1 (en) Method and apparatus for providing intra coding frame bit budget
US20080151998A1 (en) Method and Apparatus for Providing Rate Control for Panel-Based Real Time Video Encoder
CN101069432B (en) For the determination method and apparatus of the quantization parameter that video encoder rate controls
JPH1075451A (en) Video data compression apparatus and method
WO2000018137A1 (en) Frame-level rate control for video compression
JP4532980B2 (en) Moving picture coding apparatus and method, computer program, and computer-readable storage medium
CA2524809C (en) Methods and apparatus for improving video quality in statistical multiplexing
EP1157560B1 (en) Bit rate control for video data compression
JP4358215B2 (en) Video encoding apparatus and method
US6226326B1 (en) Coding device and coding method
US20060034369A1 (en) Method and system for parametric video quality equalization in selective re-encoding
JP2001028753A (en) Moving picture coding apparatus and method
US20030174771A1 (en) Method, apparatus, and program for variable bit rate encoding
US20060034522A1 (en) Method and system for equalizing video quality using selective re-encoding
JP3218994B2 (en) Image coding method and apparatus
JP4942208B2 (en) Encoder
JP2001025015A (en) Moving picture coding apparatus and method
KR100949755B1 (en) Method and apparatus for controlling rate of video sequence, video encoding apparatus

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2524809

Country of ref document: CA

WWE Wipo information: entry into national phase

Ref document number: PA/a/2005/012262

Country of ref document: MX

122 Ep: pct application non-entry in european phase