Abstract: The invention is related to methods and apparatus that encode redundant motion vectors for predictive-coded visual object planes (P-VOPs) to increase the robustness of transmitted video signals. One embodiment provides the redundant motion vectors in a user data video packet of an MPEG-4 compliant bitstream, which thereby allows the enhanced bitstream to remain compliant with MPEG-4 syntax and backwards compatible with MPEG-4 decoders. The enhanced bitstreams allow a video decoder to display a video with a better picture and relatively less error and error propagation when portions of the bitstream are disturbed or corrupted by interference, delays, and the like.

Abstract: A method for an improved QSS (bit allocator) algorithm is disclosed. The disclosed method is capable of greatly improving determination time; thereby, improving the efficiency of converting a signal from an audio format to an MP3 format. The starting point of the QSS determination for a present frame (N) is the QSS of a previous frame (N?1). This starting point provides for improved efficiency for determining actual QSS of frame N as QSS[N?1] will be closer to QSS[N] than an arbitrary starting point. Thus, fewer iterations are required to determine QSS[N] as compared to conventional encoders. The algorithm of the present is more efficient than conventional methods in that it makes use of the fact that audio signal statistics usually do not change abruptly during the period of one audio frame to another.

Abstract: The present invention is related to error resilient video encoding. A first instruction to intracode a first frame is received. In response to the first instruction, the first frame is intracoded. In addition, a second sequentially consecutive frame is intracoded as a result of the first instruction to intracode the first frame.

Abstract: The invention is related to methods and apparatus that conceal errors in images of a corrupted video bitstream. One embodiment conceals errors in a missing or corrupted intra-coded macroblock by linearly interpolating data from other macroblocks that correspond to portions of the image above and below the missing or corrupted macroblock. One embodiment can utilize substitute motion vectors for a missing or corrupted predictive-coded macroblock. Another embodiment doubles the received motion vectors and references the doubled motion vectors to a previous-previous frame. Another embodiment adaptively selects which concealment or reconstruction technique is applied according to projected error estimates. Another embodiment conceals errors by replacing corrupted or missing data by combining concealment data in a weighted sum to reduce an estimated error.

Abstract: A system and method for processing a video signal to make the corresponding image suitable for display on a progressive display device, i.e., a computer monitor, is disclosed. The processing system includes a video display module which is capable of processing an image frame based on the content of the frame information itself, or the values of the pixels that comprise the frame.

Abstract: The present invention is related to video encoding. In an embodiment, a sequence of frames is received. For each frame in at least a portion of the sequence of frames, a corresponding mean of absolute differences value weighted by a temporal parameter between frames bracketing said each frame is calculated. At least partly based on the corresponding mean of absolute differences value weighted by a temporal parameter, a first frame in the sequence of frames is skipped.

Abstract: A method for encoding of media files to embed a data segment and time restriction information into the media file in order to restrict the time period when decoding and processing of the embedded data segment can be performed is described. The media file is capable of being decoded for playback as a media stream. It also includes a method for decoding the data segment as the encoded media file is reproduced as a media stream only during a specified time period as compared to the current time of day and/or date when the media stream is being played back. The restrictions preferably include a time tag specifying the start of a time period for reproducing the data segment or a time tag specifying the end of the time period, or both, in which case the time tags specify the start and end of the time period. The reproducing of the data segment includes subsequent processing for enabling the data to be displayed to a user.

Abstract: The invention is related to methods and apparatus that provide improved video encoding. 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.

Abstract: The present invention is related to video encoding. In an embodiment, a bit budget is calculated for a first scene. In addition, bit budgets for corresponding frames, including at least a first frame, within the first scene are determined. Optionally, bit budgets corresponding to macroblocks within the first frame are also determined.

Abstract: The invention is related to methods and apparatus that recover usable video data from partially corrupted data. Embodiments inspect corrupted data packets and identify the location or locations of an error, whether the corrupted data packet contains data expected to be error-free, and whether the error-free data should be used. Decoding of a packet in both the forward direction and the backward direction can be used to locate a position of an error. Intra-coded macroblocks can also be recovered. A decoder can elect to use or to drop an intra-coded macroblock recovered from a corrupted data packet according to further criteria that is applied to the recovered intra-coded macroblock. One embodiment inspects video bitstream data that has been encoded with an optional data partitioning feature enabled, and retrieves specified data in areas of a corrupted packet that are expected to be free from error.

Abstract: A system for improving the speed of the video encoding process by decreasing the number of cycles to perform the quantization. The disclosed system achieves the improvement through use of parallel processor such as one having a Single Instruction, Multiple Data (SIMD) architecture. Concurrent processing during one instruction cycle is accomplished, thereby leading overall to the use of fewer instruction cycles. In the preferred embodiment, an MMX instruction set is used for executing four quantization in parallel. The disclosed system also achieves a higher precision of the quantization during the encoding of video signals with the SIMD architecture by using a larger multiplier and larger shift factor.

Abstract: A system and corresponding method for adjusting the brightness and color of MPEG encoded video images. A digital versatile disk player capable of decoding a previously encoded MPEG video signal and adjusting the brightness and color of the entire previously encoded MPEG video signal based on a subset of information contained in the encoded input signal. The brightness and color adjustments are performed while the encoded MPEG video signal is in the frequency (dct) domain before motion compensation is performed. The digital versatile disk player also determines whether the particular block to be decoded is of a predetermined type and decodes such block accordingly.

Abstract: In an MPEG audio encoder, a sign and an absolute value calculation are performed outside of the quantization inner loop, thereby reducing redundant calculations. The stored sign and absolute values can also be used in the frame packing block, also increasing processing efficiency. Thus, the present invention improves the performance of an MPEG audio encoder.

Abstract: A system and method, for remote display and control of an audio/video data stream from a capture device, e.g., a TV capture card, audio/visual capture card or digital camera capture card in a PC. In an exemplary embodiment there are some components of a software DVR player executing on at least one client device and other components on at least one server device. Users can view and/or control the audio/video data from a server device, having a capture device, on client devices located anywhere as long as they are connected to the server through a network. In addition, a server device with a capture device can support display of the video data at multiple client devices at the same time.

Abstract: A fast code length search method for determining the length of a code in a codebook, wherein the method is especially suited for MPEG-compliant audio encoding. A code length table is created which stores pre-calculated code lengths, including any sign bits and linear extension bits necessary, for data value pairs or quadruples. In one embodiment, two code length tables are created, one for determining the code lengths of the codes used for the ones region, and a second code length table for the big values region. When a code length determination is made, the value is simply read from the table, instead of being calculated each time.

Abstract: A fast codebook search method for finding an optimal Huffman codebook from a group of Huffman codebooks, wherein the method is especially suited for MPEG-compliant audio encoding. In order to select an optimal codebook from among candidate codebooks for a given sub-region, a bit difference table is created, which for any given data pair contains a bit difference value. The bit difference value is the difference between the number of bits needed for a given data pair (or quadruple) in a first candidate codebook and a second candidate codebook [N bits−M bits]. By summing all such bit difference values for the data samples in a given sub-region, a quick determination can be made as to which codebook would encode the sub-region using the fewest bits (based on the size and/or sign of the sum(s)). For sub-regions having three candidate codebooks, two bit difference sums are calculated.