Abstract: An image signal processing apparatus for quantizing an inputted moving image signal according to a quantization step so that a code amount of one frame becomes a target code amount, and for variable-length-coding the quantized moving image signal, in which a minimum value of the quantization step is determined for each frame, and the quantization step is determined so as not to be less than the minimum value.

Abstract: Methods and apparatus are described for management of traffic comprising a statistical shaper having a plurality of inputs each for receiving a data stream and a plurality of outputs forming a variable rate bit streams; a multiplexer which combines the bit streams to form an output stream; a modulation stage which is operable to use one or more of a plurality of different modulation schemes to modulate the bit streams onto an output bearer; and, a controller which is operable to control the amount of data arriving at the modulation stage. The controller performs rate control of the data arriving at the modulation stage so that the rate of data output in the output stream from the modulator stage is within a predetermined limit for the transmission channel. For example if the modulation rate for any one bitstream changes, this would alter the rate of data transmission after the modulation stage except that excess data is stored in buffers.

Abstract: A sound encoder multiplexes a plurality of codes into a sound code in an order determined by a multiplexing order determination unit (12), and a sound decoder demultiplexes the sound code into a plurality of codes one by one in an order determined by a demultiplexing order determination unit (14).

Abstract: A moving image encoding method of encoding a moving image while switching between variable-length encoding schemes. In this method, a continuous unit to be continuously reproduced is determined (S5201), a stream is generated by encoding the moving image without switching between variable-length encoding schemes in the continuous unit (S5202), and management information is generated that includes a first flag information indicating that a variable-length encoding scheme is fixed in the continuous unit (S5204, and S5205).

Abstract: A sound encoder multiplexes a plurality of codes into a sound code in an order determined by a multiplexing order determination unit (12), and a sound decoder demultiplexes the sound code into a plurality of codes one by one in an order determined by a demultiplexing order determination unit (14).

Abstract: To provide an image coding apparatus that can reduce arithmetic processing and scale down an LSI circuit. An image coding apparatus (100) includes an intermediate stream generating unit (130) generating an intermediate stream, by generating an intermediate code from image data, coding header information among coding conditions for image coding, and synthesizing the generated intermediate code and the coded header information, and a coded stream generating unit (134) outputting a coded stream, by performing variable length coding on the intermediate code included in the intermediate stream to generate coded image data, and synthesizing the generated coded image data and the header information.

Abstract: A variable length coding method is comprised of: a coefficient value scanning step in which an RL sequence generation unit 203, a reordering unit 202, and a binarization unit 203 scan coefficient values within a block in a predetermined scanning order starting at a higher-frequency component toward a lower-frequency component; and an arithmetic coding step in which an arithmetic coding unit 205 and a table storage unit 204 perform arithmetic coding on the absolute values of the coefficient values according to the scanning order used in the coefficient value scanning step, by switching between probability tables 1˜4 for use, wherein, in the arithmetic coding step, a probability table to be used is switched to another probability table in one direction, when the arithmetic-coded absolute values of the coefficient values include an absolute value exceeding a predetermined threshold value.

Abstract: Non-encoded data for a macroblock of an image frame is accessed. A cost to intra-encode the macroblock is computed using at least a portion of the non-encoded data in place of reconstructed image data from another macroblock of the image frame. The cost can be compared against the cost to inter-encode the first macroblock in order to select how the first macroblock is to be encoded.

Abstract: Described tools and techniques relate to signaling for DC coefficients at small quantization step sizes. The techniques and tools can be used in combination or independently. For example, a tool such as a video encoder or decoder processes a VLC that indicates a DC differential for a DC coefficient, a FLC that indicates a value refinement for the DC differential, and a third code that indicates the sign for the DC differential. Even with the small quantization step sizes, the tool uses a VLC table with DC differentials for DC coefficients above the small quantization step sizes. The FLCs for DC differentials have lengths that vary depending on quantization step size.

Abstract: A multi-scanner scans a signal according to several different patterns. A scanning pattern selector determines which scanning pattern produced the most efficient coding result, for example, for runlength coding, and outputs a coded signal, coded most efficiently, and a selection signal which identifies the scanning pattern found to be most efficient.

Abstract: Entropy coding and decoding techniques are described, which may be implemented separately or in combination. For example, a video encoder uses two-layer run level coding to reduce bitrate for frequency transform coefficients in a quick and efficient manner, and a video decoder uses corresponding two-layer run level decoding. This two-layer coding/decoding can be generalized to more than two layers of run level coding/decoding. The video encoder and decoder exploit common patterns in run level information to reduce code table size and create opportunities for early termination of decoding. Using zoned Huffman code tables helps limit overall table size while still providing a level of adaptivity in encoding and decoding. Using embedded Huffman code tables allows the encoder and decoder to reuse codes for 8×8, 8×4, 4×8, and 4×4 blocks.

Abstract: A multi-scanner scans a signal according to several different patterns. A scanning pattern selector determines which scanning pattern produced the most efficient coding result, for example, for runlength coding, and outputs a coded signal, coded most efficiently, and a selection signal which identifies the scanning pattern found to be most efficient.

Abstract: In a code amount estimating method, when encoding quantized values of coefficients of a larger-sized orthogonal transformation than an orthogonal transformation size assigned to a variable length encoding table, the quantized values are rearranged in a one-dimensional form, so as to obtain run-level sets. The number of groups is computed based on a proportion between an orthogonal transformation area corresponding to the orthogonal transformation size assigned to the variable length encoding table and an orthogonal transformation area for an encoding target. The Run-Level sets are classified into groups having the number of groups. Each Run is divided by the number of groups, and the obtained quotient is set as Run. A code length of each Run-Level set in each group is determined by referring to the variable length encoding table. The amount of generated code is estimated to be the total sum of the code lengths of all groups.

Abstract: A method and system for minimizing bus traffic in a video decoder is disclosed. A method and system for processing a portion of a reference picture includes designating the reference picture, selecting a display picture within the reference picture, transmitting a display picture size, and sending a display picture offset. A method and system for compressing IDCT coefficients corresponding to a macroblock, the macroblock having a plurality of blocks, includes locating each non-zero IDCT coefficient corresponding to one of the plurality of blocks, assigning an index to the non-zero IDCT coefficient, the index designating a location within the one of the plurality of blocks, packing the non-zero IDCT coefficient in little endian format, and specifying a terminator bit corresponding to the non-zero coefficient, the terminator bit indicating the end of all non-zero IDCT coefficients for the one of the plurality of blocks.

Abstract: A frame coding unit generates individual picture signal information from a moving picture signal, and outputs a frame code value which is a numeric value to be obtained as a result of coding picture signal information of each frame. A variable length coding unit decomposes the frame code value into unit frame code values which are basic units of coding, converts the unit frame code values into frame code words using only a single code table, and constructs a frame stream by combining the converted frame code words. A multiplexing unit multiplexes a header stream which is constructed through a method equivalent to a conventional method and the frame stream, and constructs a picture coded signal.

Abstract: A VLC data transfer interface is presented that allows digital data to be packed and assembled according to a format selectable from a number of formats while the data is being transferred to a desired destination.

Abstract: Subject matter includes exemplary methods of reversible diffusion-based compression and an exemplary compression engine. In one implementation, a reversible diffusion function is applied to decrease high spatial frequency pixel values in an image or a prediction error image residue and to smooth variances between adjacent pixel values. An exemplary reversible diffusion function can increase data compression without loss of high frequency information yet operate with online encoders and decoders that lack significant processing power. An exemplary method transforms the data to make the data more amenable to compression schemes that utilize entropy transforms as an intermediate processing step, for example, prior to Huffman coding.

Abstract: A method and apparatus for video coding for reducing memory size and external memory access bandwidth in video coding, wherein the method compresses a reference frame prior to storing the reference frame to memory.

Abstract: A system and process for compressing and decompressing multiple video streams depicting substantially the same dynamic scene from different viewpoints that from a grid of viewpoints. Each frame in each contemporaneous set of video frames of the multiple streams is represented by at least a two layers—a main layer and a boundary layer. Compression of the main layers involves first designating one or more of these layers in each set of contemporaneous frames as keyframes. For each set of contemporaneous frames in time sequence order, the main layer of each keyframe is compressed using an inter-frame compression technique. In addition, the main layer of each non-keyframe within the frame set under consideration is compressed using a spatial prediction compression technique. Finally, the boundary layers of each frame in the current frame set are each compressed using an intra-frame compression technique. Decompression is generally the reverse of the compression process.

Abstract: For the binary representation of a description corresponding to an extended description scheme, the same principles as in the MPEG-7 binary format could in principle be used, however, the resulting binary format is different from the binary format of the original MPEG-7 description scheme, even for the identical parts of both description schemes. Means and method are provided for user or application specific extension of the binary format, where the binary format of that part of the description schemes, which is common to both the original MPEG-7 description scheme and the extended description scheme, is preserved.

Abstract: A method for decoding a bitstream is disclosed. The method generally comprises the steps of (A) generating a first signal and a second signal by parsing a common slice in the bitstream, (B) generating a third signal by entropy decoding the first signal, and (C) generating a video signal by combining the second signal and the third signal.

Abstract: A video stream encoding apparatus and method therefore is herein described. The video stream encoding apparatus includes a divider for dividing a frame in a video stream into a plurality of processing units, each processing unit including a plurality of macro-blocks; and an encoder for encoding the plurality of macro-blocks in each processing unit in parallel. The same quantization parameters are used for respective macro-blocks in the same processing unit in the quantization of the encoder. By the apparatus and the method of the invention, dependencies between macro-blocks are broken, and the precision of high rate controlling is kept while encoding the respective macro-blocks in parallel.

Abstract: A multi-scanner scans a signal according to several different patterns. A scanning pattern selector determines which scanning pattern produced the most efficient coding result, for example, for runlength coding, and outputs a coded signal, coded most efficiently, and a selection signal which identifies the scanning pattern found to be most efficient.

Abstract: A method for decoding a stream of encoded video data is disclosed. The video stream includes partitions that have been compressed using lossless encoding. Each partition includes rows that have also been encoded using intra-frame or inter-frame encoding, for example. During the decoding process, two or more of the partitions are entropy decoded on two or more processors in parallel, except that partitions containing adjacent rows in the frame are decoded with an offset so that at least a portion of the output of the entropy decoding of one partition can be used as input in the entropy and intra/inter-frame decoding of the other.

Abstract: Decoding systems and methods are disclosed. In a particular embodiment, a video decoder system includes a first decoding path and a second decoding path configured to decode at a slower average rate than the first decoding path. The video decoder system includes a dynamic switch configured to provide a first portion of the encoded video signal to the first decoding path or to the second decoding path. The dynamic switch is further configured to provide a subsequent portion of the encoded video signal to the first decoding path or to the second decoding path in response to a value of a decoding metric associated with decode processing of the first portion.

Abstract: Techniques and tools for encoding and decoding data values that are hierarchically organized are presented. For example, an encoder encodes data as a set that has a hierarchy of subsets with set symbols. In the encoding, the encoder evaluates the data values of the set and selectively encodes a symbol combination code that indicates the set symbols of multiple subsets of the set. Then, for each of the multiple subsets considered as a new set, the encoder selectively repeats the evaluating, selective encoding and selective repetition for the new set. In corresponding decoding, a decoder decodes data encoded as a set that has a hierarchy of subsets with set symbols. In some implementations, the encoding and decoding are adaptive and use a symbol alphabet with nested elements.

Abstract: A method and apparatus for variable accuracy inter-picture timing specification for digital video encoding is disclosed. Specifically, the present invention discloses a system that allows the relative timing of nearby video pictures to be encoded in a very efficient manner. In one embodiment, the display time difference between a current video picture and a nearby video picture is determined. The display time difference is then encoded into a digital representation of the video picture. In a preferred embodiment, the nearby video picture is the most recently transmitted stored picture. For coding efficiency, the display time difference may be encoded using a variable length coding system or arithmetic coding. In an alternate embodiment, the display time difference is encoded as a power of two to reduce the number of bits transmitted.

Abstract: Subtitling aims at the presentation of text information and graphical data, encoded as pixel bitmaps. The size of subtitle bitmaps may exceed video frame dimensions, so that only portions are displayed at a time. The bitmaps are a separate layer lying above the video, e.g. for synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels. An advanced adaptation for bitmap encoding for HDTV, e.g. 1920.times.1280 pixels per frame as defined for the Blu-ray Disc Prerecorded format, providing optimized compression results for such subtitling bitmaps, is achieved by a four-stage run length encoding. Shorter or longer sequences of pixels of a preferred color, e.g. transparent, are encoded using the second or third shortest code words, while single pixels of different color are encoded using the shortest code words, and sequences of pixels of equal color use the third or fourth shortest code words.

Abstract: A single-instruction multiple-data processor comprises at least two multiply-accumulator units and associated coefficient memories and data memories. Coefficient memory addresses are formed from a base address and data samples stored in the data memories.

Abstract: A frame coding unit generates individual picture signal information from a moving picture signal, and outputs a frame code value which is a numeric value to be obtained as a result of coding picture signal information of each frame. A variable length coding unit decomposes the frame code value into unit frame code values which are basic units of coding, converts the unit frame code values into frame code words using only a single code table, and constructs a frame stream by combining the converted frame code words. A multiplexing unit multiplexes a header stream which is constructed through a method equivalent to a conventional method and the frame stream, and constructs a picture coded signal.

Abstract: In an integrated satellite receiver, improved header acquisition techniques are described for quickly locating a header symbol sequence in a data stream substantially implemented on a single CMOS integrated circuit. To identify the location of a header symbol sequence in a data stream, a selected header acquisition technique employs a real time correlator followed by an accumulator. Once accumulation over a predetermined number of frames is finished, the largest or maximum value among the accumulated correlator values is identified. If the maximum value exceeds a threshold, it will be declared as a peak and the address associated is the peak timing.

Abstract: A method for transcoding between video streams using different entropy coding, comprising the steps of (A) decoding a first video stream using a first set of entropy codes, and (B) generating a second video stream by entropy encoding the decoded first video stream using a second set of entropy codes. The first set of entropy codes and the second set of entropy codes are configured to represent all valid coefficient values of the first video stream.

Abstract: A moving image encoding method of encoding a moving image while switching between variable-length encoding schemes. In this method, a continuous unit to be continuously reproduced is determined (S5201), a stream is generated by encoding the moving image without switching between variable-length encoding schemes in the continuous unit (S5202), and management information is generated that includes a first flag information indicating that a variable-length encoding scheme is fixed in the continuous unit (S5204, and S5205).

Abstract: An apparatus for encoding a sequence of samples of an audio signal, with each sample within the sequence having an original position, includes a sorter for sorting the samples depending on their sizes, in order to obtain a sorted sequence of samples, with each sample having a sorting position within the sorted sequence. Furthermore, the apparatus has an encoder for encoding the sorted samples and information on a relation between the original and sorting positions of the samples.

Abstract: The techniques and mechanisms described herein are directed to a system for stylizing video, such as interactively transforming video to a cartoon-like style. Briefly stated, the techniques include determining a set of volumetric objects within a video, each volumetric object being a segment. Mean shift video segmentation may be used for this step. With that segmentation information, the technique further includes indicating on a limited number of keyframes of the video how segments should be merged into a semantic region. Finally, a contiguous volume is created by interpolating between keyframes by a mean shift constrained interpolation technique to propagate the semantic regions between keyframes.

Abstract: A technique for rearranging an input data stream for LZ data compression system to achieve a higher data compression. In one example embodiment, this is achieved by receiving an input data stream of a sequence of data blocks. Each of the received data blocks is then compared with each of a predetermined number of previously processed data blocks. One or more match locations and their associated match lengths for each of the data blocks are determined as a function of the comparison. An affinity array is then formed, such that each element in the affinity array comprises an affinity number based on the one or more match locations and their associated match lengths. The sequence of data blocks in the input data stream is then rearranged using the affinity array to form a new data stream. The new data stream is then encoded to achieve the higher data compression.

Abstract: Methods and systems for processing video are disclosed. The method may include performing by one or more processors and/or circuits on a chip, receiving packetized data within an encoded video stream. An identifier may be determined within the received packetized data that defines one of a plurality of encoding types associated with packets in the encoded video stream. A decoding process may be selected from a plurality of decoding processes based on the determined identifier. The plurality of decoding processes may include a fixed length coding (FLC) process, a variable length coding (VLC) process and/or a context adaptive binary arithmetic coding (CABAC) process. At least a portion of the received packetized data in the encoded video stream may be decoded on the chip, utilizing the selected decoding process. A start code may be determined within the received packetized data that separates packets within the encoded video stream.

Abstract: A method for transcoding between videostreams using different entropy coding, comprising the steps of (A) decoding a first videostream using a first set of entropy codes, and (B) generating a second videostream by entropy encoding the decoded first videostream using a second set of entropy codes. The first set of entropy codes and the second set of entropy codes are configured to represent all valid coefficient values of the first videostream.

Abstract: A method and system including an improved generalized reference decoder that operates according to any number of sets of rate and buffer parameters for a given bit stream. Each set characterizes a leaky bucket model and contains three parameters representing the transmission bit rate, buffer size, and initial decoder buffer fullness. An encoder provides at least two sets of these parameters, whereby the decoder selects one or interpolates between them to operate at any desired peak bit rate, buffer size or delay. The generalized reference decoder may select the smallest buffer size and corresponding delay that decodes the bit stream without buffer underflow or overflow, or alternatively may select and operate at the minimum required peak transmission rate, or something between both. In practice, the buffer size, delay and/or the peak transmission rate can be reduced by significant factors, and/or the signal-to-noise ratio (SNR) can be increased.

Abstract: According to one aspect of the present invention, a method and apparatus is provided in which input data (e.g., input video data) is encoded in accordance with a first coding standard (e.g., MPEG-4) to generate encoded data. The input data is also encoded based on a reconstruction of the input data to generate encoded side information associated with the input data. The encoded data are transmitted to a destination (e.g., a decoding subsystem) over a first channel and the encoded side information are transmitted to the destination over a second channel. The encoded data and the encoded side information are decoded and combined at the destination to generate output data.

Abstract: For the purpose of coding or decoding motion information in a picture with a small overhead, a coding method of performing compression coding of a moving picture by motion compensated prediction is configured to have a motion compensated prediction step (processing by motion detector 2, motion compensator 5, spatial predictor 9, etc.) of performing the motion compensated prediction while assigning one or more motion vectors (e.g., up to two motion vectors) in units of sub-blocks obtained by sub-dividing each of macroblocks resulting from division of each frame of the moving picture; and an assignment information coding step (processing by variable length encoder 23 and others) of outputting information about an assignment situation of the one or more motion vectors to the sub-blocks in a multiplexed form on a bitstream.

Abstract: The variable length decoder has a memory device including a plurality of lookup tables, and sequentially decodes codewords of variable-length codes using the memory device. The decoded values corresponding to the codewords and control information pieces are stored in the lookup tables. In decoding one codeword, one lookup table is selected from among the plurality of lookup tables. In the decode, one decoded value corresponding to the one codeword, and a control information piece for selecting a next lookup table depending on the decoded value and used for a next decode are produced from the selected lookup table in response to the one codeword in parallel.

Abstract: A reproduction apparatus for successively decoding and reproducing a plurality of picture data, comprising a reproduction memory and a decoder for successively decoding the plurality of picture data in an order in accordance with a designated reproduction direction, writing the decoding results in the reproduction memory, and reproducing and outputting the decoding results read from the reproduction memory, the decoder holding the storage of the decoding results in the reproduction memory even after the decoding results stored in the reproduction memory are no longer used when continuing reproduction in the designated reproduction direction and, when receiving as input a reversal command of the reproduction direction, performing the reproduction and output using the decoding results already stored in the reproduction memory before the input of the reversal command.

Abstract: A model-based rate control mechanism involves the percentage of less probable symbols (LPS). The mechanism is first described in the context of bi-level video and subsequently extended for multi-level video by applying it to individual bit planes thereof. A model parameter represents a relationship between an LPS reduction ratio and a bit-count reduction ratio. The model parameter thusly facilitates transforming a targeted bit-count into an LPS reduction ratio. The LPS reduction ratio can be attained by adjusting a threshold band half-width wherein LPS pixels within the threshold band are converted to more probable symbols (MPSs). In a described implementation, a threshold band half-width is set so as to achieve a desired LPS reduction ratio. The desired LPS reduction ratio is determined based on a desired bit-count reduction ratio and the model parameter. The desired bit-count reduction ratio is determined using a bit plane complexity value and a targeted bit-count.

Abstract: A method for concatenating MPEG-4 or H.263 segments is provided. The method includes extracting and comparing the VOL or picture header information of each segment. If the two segments have the same VOL or picture header information, the method merges the two segments directly by appending one segment to another to form a new bit stream. If the two segments have the different resolution, the method completely decodes and re-encodes the segments and then merges the segments. Otherwise the method takes the VOL or picture header information of one segment as reference to produce the new bit stream. The method parses the other segment frame at a time, re-encapsulates it according to the reference VOL or picture header information, and appends it to the one segment. During the process, the method only uses VLD to parse the other segment without using the tools of DCT, IDCT, ME, and MC.

Abstract: A decoder decodes skipped macroblocks of an interlaced frame. Skipped macroblocks use exactly one motion vector and have no motion vector differential information, and lack residual information. The skipped macroblock signal indicates one-motion-vector coding. The skipped macroblock signal can be a compressed bitplane (in a selected bitplane coding mode) sent at frame layer in a bitstream, or an individual bit sent at macroblock layer. In another aspect, an encoder jointly encodes motion compensation type and field/frame coding type for a macroblock in an interlaced P-frame. The encoder also can jointly encode other information for the macroblock (e.g., the presence of a differential motion vector). A decoder decodes a joint code (e.g., a variable length code in a variable length code table) to obtain both motion compensation type and field/frame coding type (and potentially other information) for the macroblock.

Abstract: This disclosure describes rate control techniques that can improve video encoding. In particular, the described rate control techniques exploit relationships between the number of bits encoded per frame and the number of non-zero coefficients of the video blocks after quantization. The number of number of non-zero coefficients of the video blocks after quantization is referred to as rho (?). The value of ? is generally proportional to the number of bits used in the video encoding. This disclosure utilizes a relationship between ? and a quantization parameter (QP) in order to achieve rate controlled video encoding. More specifically, this disclosure provides techniques for generating a lookup table (LUT) that maps values of ? to different QPs.

Abstract: A method and apparatus for decoding a bitstream.

Abstract: The present invention relates to an encoding system for encoding input video data and a multiplexing system for multiplexing a plurality of encoded streams. More particularly, it proposes a system and method that involve describing, in encoded streams, information on the picture order of input video data, and using the picture order information when generating packetized elementary stream (PES) packets, to prevent delays associated with the PES packet generation. MPEG encoders generate PTS_count and DTS_count based on the information obtained from the number of fields in the input video data and describe the PTS_count and DTS_count data as picture order information in encoded streams. The packetizers for generating packetized elementary stream take out PTS_count and DTS_count described in the encoded streams, generate presentation time stamps and decoding time stamps based on PTS_count and DTS_count, and add these time stamps as PES header data.

Abstract: Techniques and tools for using motion vector block patterns in video encoding and decoding are described. In general, a motion vector block pattern signals the presence or absence of motion vector data for a macroblock with multiple motion vectors. For example, a video decoder decodes variable length codes that represent motion vector block patterns. Each motion vector block pattern has one bit per corresponding luminance motion vector of a macroblock with multiple luminance motion vectors, where the one bit indicates whether or not motion vector data for the corresponding luminance motion vector is signaled. A video encoder performs corresponding encoding.