Abstract: Systems and methods are provided for progressive mesh storage and reconstruction using wavelet-encoded height fields. A method for progressive mesh storage includes reading raster height field data, and processing the raster height field data with a discrete wavelet transform to generate wavelet-encoded height fields. In another embodiment, a method for progressive mesh storage includes reading texture map data, and processing the texture map data with a discrete wavelet transform to generate wavelet-encoded texture map fields. A method for reconstructing a progressive mesh from wavelet-encoded height field data includes determining terrain blocks, and a level of detail required for each terrain block, based upon a viewpoint. Triangle strip constructs are generated from vertices of the terrain blocks, and an image is rendered utilizing the triangle strip constructs. Software products that implement these methods are provided.

Abstract: Image pixel intensity data is transformed to a holographic representation of the image. A subset of the holographic representation is modeled. Model parameters constitute a compressed image representation. A two-dimensional Fourier transform can be applied to obtain the holographic image. Modeling includes applying an analysis portion of an adaptive analysis/synthesis prediction methodology to a subset of the holographic representation. Linear prediction can be the adaptive analysis/synthesis prediction methodology. Prior to modeling, one-dimensional Fourier transform can be performed on the holographic representation and the linear prediction is one-dimensional. Model parameters are preferably quantized. Embodiments include determining error between the model and the model's input data. There the compressed image representation the error, which also can be quantized. The subset of the holographic representation can be less than all the representation.

Abstract: There is provided a data compression method for increasing a reduction ratio, while keeping a sufficient characteristic amount, to seek speeding up of processing, the method being for compressing image data in pattern model positioning in image processing of searching out of an image to be searched and positioning a pattern model corresponding to a pre-registered image. The method includes the steps of computing an edge strength image having edge strength information and an edge angle image having edge angle information with respect to each pixel constituting an image; transforming the edge angle image of each pixel into an edge angle bit image expressed by an edge angle bit indicating an angle with a pre-defined fixed width; and compressing the edge angle bit image to create an edge angle bit reduced image by taking a sum with respect to each edge angle bit.

Abstract: This invention provides a technique of easily encoding image data to generate encoded data having high image quality within a target code amount using a small memory capacity by image encoding processing of performing frequency transform and quantization of each pixel block. A frequency transform unit separates image data into low frequency band data and high frequency band data. A coefficient quantizing unit, coefficient encoder, and code amount controller operate to encode the high frequency band data within a predetermined amount. When the encoding processing of the high frequency band data has ended, the quantization parameter of the low frequency band data is set based on the generated code amount of the high frequency band data. A coefficient quantizing unit, coefficient encoder, code amount detector, and quantization parameter updating unit operate to encode the low frequency band data into codes within a low frequency band target code amount.

Abstract: An information source encoding method for encoding a Gaussian integer signal includes the steps of: inputting a signal value sequence of a Gaussian integer signal as an encoding target; transforming signal values included in the input signal value sequence into integer pairs, each having two integers, arranged in the input order; regarding each of the integer pairs as a lattice point on two-dimensional coordinates, and obtaining integer values greater than or equal to zero by performing a two-dimensional-to-one-dimensional mapping in which the shorter the distance from each lattice point to the origin, the smaller the value assigned to the lattice point by the mapping; and encoding the integer values using codes which are used for encoding an information source that follows an exponential distribution.

Abstract: A system for the context-based for the context-based encoding of an input signal includes a domain transform module and a context-based coding module. The domain transform module is operable to convert the input signal into a sequence of transform coefficients c[i]. The context-based coding module includes a bit-plane scanning module, and context modeling module, and a statistical encoding module. The bit-plane scanning module is operable to produce a bit-plane symbol bps [i,bp] for each transform coefficient c[i] and each bit-plane [bp]. The context modeling module is operable to assign one or more context values to each of the received bit plane symbols bps [i,bp]. The statistical coding module is operable to code each of the bit plane symbols bps [i,bp] as a function of one or more of the corresponding context values to produce a context-based encoded symbol stream.

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: An aspect of an image signal transforming method is a method of generating one or more transformed samples from a plurality of input samples, which includes a first transformed sample generating step of performing a first filtering process by a filter, on at least one first input sample (an input sample from a terminal) out of a plurality of first input samples used for generation of a first transformed sample, to generate first filtered data, and performing a first arithmetic process (subtraction by a subtractor) on another first input sample not used for the generation of the first filtered data (an input sample from another terminal), and the first filtered data generated, to generate the first transformed sample.

Abstract: An image processing apparatus includes: a block decompression unit that decompresses, block by block, a compressed code formed of a plurality of blocks into which image data is divided, where the compressed code is encoded block by block; and a rendering control unit that causes a code to be decompressed and rendered on a display unit, where the code corresponds to at least one of the blocks which one is renderable in the rendering region of the display unit.

Abstract: An image processing system that can receive compressed image data corresponding to a representation of an image and process that image data in an order that is independent of the order in which that image data was compressed. A first pass decoding identifies certain information pertaining to the coded units within the compressed image data. Based upon that information, the coded units in the compressed image data may be decoded in an order that is different than the order in which they were encoded, and portions of the image may be rotated by a multiple of 90° independently of other portions of the image, thereby reducing the amount of memory needed to decompress and rotate the compressed image data.

Abstract: A decoding apparatus for decoding an encoded image signal and its control method. The decoding apparatus decodes the encoded image signal and inverse-quantizes decoded information. The apparatus inverse-orthogonal transform an inverse-quantized information to obtain a decoded image signal. A quantization error estimator estimates a maximum square error of the inverse-quantized information and a second inverse-orthogonal transformer inverse-orthogonal transforms the quantization error from the quantization error estimator. An image-quality enhancing signal generator generates an image-quality enhancing signal based on the quantization maximum error and the decoded image signal, and an image synthesizer generates a high-quality image signal by synthesizing the image-quality enhancing signal with the decoded image signal.

Abstract: An aspect of an image signal transforming method is a method of generating one or more transformed samples from a plurality of input samples, which includes a first transformed sample generating step of performing a first filtering process by a filter, on at least one first input sample (an input sample from a terminal) out of a plurality of first input samples used for generation of a first transformed sample, to generate first filtered data, and performing a first arithmetic process (subtraction by a subtractor) on another first input sample not used for the generation of the first filtered data (an input sample from another terminal), and the first filtered data generated, to generate the first transformed sample.

Abstract: To reduce the amount of storage space and computing power required to render image data, particularly building image data, primary and secondary colors may be extracted from the image data. The image data may be re-rendered using only the primary and secondary colors. The re-rendered image may be evaluated for patterns, the patterns thresholded to bi-level data and a Discrete Fourier Transform (DFT), or equivalent, may be performed on the bi-level data. Low order coefficients may be discarded depending on level accuracy desired. DFT coefficients and color data for the primary and secondary colors may then be used to construct an abstraction of the original image data, using data that is, in some cases, three or four orders of magnitude smaller than the original image data.

Abstract: In certain embodiments, to eliminate DC leakage into surrounding AC values, scaling stage within a photo overlap transform operator is modified such that the off-diagonal elements of the associated scaling matrix have the values of 0. In certain embodiments, the on-diagonal scaling matrix are given the values (0.5, 2). In some embodiments, the scaling is performed using a combination of reversible modulo arithmetic and lifting steps. In yet other embodiments, amount of DC leakage is estimated at the encoder, and preprocessing occurs to mitigate amount of leakage, with the bitstream signaling that preprocessing has occurred. A decoder may then read the signal and use the information to mitigate DC leakage.

Abstract: A method and apparatus is disclosed herein for decoding data (e.g., video data) using transforms. In one embodiment, the decoding process comprises scaling a block of coefficients using a scaling factor determined for each coefficient by computing an index for said each coefficient and indexing a look-up table (LUT) using the index. The index is based on a quantization parameter, a size of the block of coefficients, and a position of said each coefficient within the block. The method also comprises applying a transform to the block of scaled coefficients.

Abstract: A video codec of a preferred embodiment is suitable for implementation on a variety of platforms, including platforms where devices require both encoding and decoding engines. Various features of preferred embodiment codecs reduce complexity for operations such as motion determination. Channel resources are allocated in preferred embodiments unequally, with an allocation being determined based upon channel conditions and the error level in a frame being encoded. A decoder of a preferred embodiment, provided with an error frame and motion vector information may conduct decoding with motion compensation. In an example encoder of the invention, a motion estimator identifies motion vectors using a phase plane correlation technique based on phase quantization, where the phase difference between the Fourier transformed version of blocks in a reference frame and a current frame is estimated by dividing the complex plane into sectors and assigning the Fourier domain difference to the sectors.

Abstract: An information processing apparatus is disclosed, including: a receiving part, an extracting part, and a selecting part. The receiving part receives a predetermined image area in the image. The extracting part defines one or more divisions corresponding to the predetermined image area received by the receiving part as a first division group, and extracts codes of the first division group. The selecting part selects whether or not to extract codes of divisions influencing decoding of codes of the first division group with the codes to be extracted by the extracting part.

Abstract: Provided are entropy encoding and decoding methods. The entropy encoding method includes receiving residual coefficients obtained by frequency converting a residual image, determining a first bit string about residual coefficients having nonzero levels from among the received residual coefficients, determining at least one lower bit, including a least significant bit of the first bit string, from the first bit string, and determining a second bit string obtained by bit-shifting the first bit string to the right by the number of lower bits.

Abstract: A system, method, and process for embedding low frequency image details and high frequency image details into a final digital image file. A digital image file is stored with embedded low and high frequency image details that are accessible with a compatible digital image decoder and a non-compatible digital image decoder. Non-compatible digital image decoders access only a compressed low frequency image of the original digital image contained in the final digital image file. Compatible digital image decoders use the embedded high frequency image details contained in the final digital image file to render a high resolution image.

Abstract: The discrete cosine transform (DCT) is mapped to a graphics processing unit (GPU) instead of a central processing unit (CPU). The DCT can be implemented using a shader-based process or a host-based process. A matrix is applied to a set of pixel samples. The samples are processed in either rows or columns first, and then the processing is performed in the opposite direction. The number of times a shader program is changed is minimized by processing all samples that use a particular shader (e.g., the first shader) at the same time (e.g., in sequence).

Abstract: An image processing apparatus includes a first image editing unit, an informing unit, a job supplying unit, and a second image editing unit. The first image editing unit edits a low resolution part of an image in response to a command from another image processing apparatus commanding to conduct an image editing process. The informing unit informs the other image processing apparatus that the image editing process has been completed by the first image editing unit. The job supplying unit supplies a job commanding a high resolution part of the image to be edited. The second image editing unit asynchronously edits the high resolution part of the image at a prescribed time in response to the job supplied from the job supplying unit. The image processing apparatus and the other image processing apparatus may be connected via a network.

Abstract: A determining unit determines whether a background pixel value of image data matches a predetermined comparison value. A replacing unit replaces, when the determining unit determines that the background pixel value does not match the comparison value, a pixel value of a pixel of the image data with a replacing value that is obtained by subtracting the pixel value from a predetermined maximum pixel value. An encoding unit generates encoded data by encoding the image data in which the pixel value is replaced with the replacing value by using a predetermined encoding system.

Abstract: An encoding device has a shape encoding unit and a pattern encoding unit. The shape encoding unit encodes a shape of an image element. The pattern encoding unit encodes a binary pattern of the image element and the shape of the image element is related to the binary pattern of the image element.

Abstract: Provided are an apparatus for encoding an image and an apparatus for decoding an image. The apparatus for encoding the image includes a grouping unit to group transform coefficients according to layers and generate groups, a pattern encoding unit to generate and encode the pattern information of each group by using the quantized transform coefficients existing in the groups of each layer in an order from an upper layer to a lower layer, and a level encoding unit to encode levels of the quantized transform coefficients corresponding to the pattern information of the groups of each layer and generate bitstreams along with the pattern information of the groups of each layer.

Abstract: The present invention concerns the manipulation and especially the filtering of image data in the compressed domain. A method and a device is provided which allows for manipulating image data in the compressed domain transformed from image data in the spatial domain with the help of a wavelet-based transform algorithm. The advantage of the inventive concept is to accelerate the filtering in time, such that underlying constraints in device computational power, storage, memory, and electrical power consumption are applicable for image manipulation/filtering.

Abstract: A compressed transcoded digital image signal is formed from a compressed original digital image signal having digital data organized in blocks. A data block in one of the compressed signals between the compressed transcoded digital image signal and the compressed original digital image signal is selected by identifying the spatial position of the data block in one of the compressed signals. The spatial position of a dual data block corresponding to the selected data block is identified in the non selected compressed signal, having regard to a given geometric transformation applied to this block. The data block belonging to the compressed original signal is decoded and the given geometric transformation is applied to the selected, decoded data block. The geometrically transformed data block is coded and the first, coded data block is inserted in the compressed transcoded image signal at the position of its dual block.

Abstract: An image processing apparatus for converting image data between a raster format and a block format including an image data processor for providing the image data including a luminance component and at least one chrominance component in the raster format, at least two FIFO memories for storing corresponding image data components, a multiplexer for multiplexing the image data components from the at least two FIFO memories, a line buffer memory for storing outputs of the multiplexer linearly, and an image compressor for receiving the image data components in block format in sequence from the unified line buffer memory and compressing the received image data components.

Abstract: According to an embodiment of the invention, a high-speed and high-image-quality image decoding method and apparatus for a compressed signal including plural components or a block code in which different compression systems are combined. In an image decoding method in which compressed data of an image signal including plural components including a resolution component expressed by the n-th power of 2 (where n is an integer equal to or greater than 0) and processed by a frequency conversion system is decoded by inverse frequency conversion of each component, a resolution component of each compressed data for each component is individually set and decoded when decoding resolution at the time of decoding is lower than the highest resolution of the compressed data.

Abstract: A method of spatial domain video enhancement/up-scaling including transforming the video input from the temporal domain to a K×K matrix of spatial domain coefficients; multiplying each spatial domain coefficient by corresponding elements of a K×K enhancement matrix to obtain enhanced spatial domain coefficients; depositing the enhanced spatial domain coefficients in the upper left K×K corner of a zero padded 2K×2K inverse transform matrix and inversely transforming them to scale the enhanced spatial domain coefficients and convert them back to video output temporal domain elements and a method of spatial domain video enhancement/down-scaling including transforming the video input from the temporal domain to a 2K×2K matrix of spatial domain coefficients; multiplying the upper left K×K corner of the 2K×2K matrix of spatial domain coefficients by the corresponding elements of a K×K enhancement matrix to obtain enhanced spatial domain coefficients; inversely transforming the K×K enhanced spatial domain coefficien

Abstract: A method of data compression, for example for image or audio signals, comprises encoding the data using a transform such as a wavelet transform or DCT, and transmitting only a predefined number of the most significant bits for each coefficient. It has been found experimentally that while such a method may marginally decrease the signal to noise ratio, the subjective quality of the received image or audio signal is nevertheless enhanced.

Abstract: A method relates to the of determining a data configuration of a digital signal of an image, the signal having undergone at least one spatio-frequential transformation in at least one resolution level. The method includes determining and configuring steps. The determining step determines at least one minimum rate reduction (Dmin) as a proportion of the total data rate of at least one resolution level of the signal, as a function of a quality mode desired for the signal. The configuring step configures the data of the signal in at least one quality layer defined for at least one resolution level of the signal such that the at least one quality layer so defined corresponds to a given visual quality of the signal, the data making up that at least one quality layer being obtained by a reduction (D) of the total rate of the data of the at least one resolution level of the signal which is greater than or equal to the minimum reduction (Dmin).

Abstract: Methods for embedding digital watermarks in compressed video include perceptual adapting a digital watermark in predicted and non-predicted data based on block activity derived from the compressed video stream, embedding in predicted objects in a video stream having separately compressed video objects, and bit rate control of watermarked video.

Abstract: A dynamically scaled file encoding method and apparatus are disclosed. A file encoding system using JPEG encoding can be configured to produce relatively constant compressed file sizes irrespective of the initial file size and file contents. The system retrieves an initial file or image that is to be compressed and determines a target bit rate corresponding to the compressed file. The target bit rate is used to determine an initial scaling factor. The initial file is encoded using a JPEG encoder having coefficients scaled by the initial scaling factor. The resultant bit rate can be adjusted in a second loop if greater than the desired bit rate. To adjust the bit rate, a recomputed scaling factor is determined from the resultant bit rate. The initial file is then encoded with coefficients scaled by the recomputed scaling factor to achieve a bit rate that is within the target bit rate.

Abstract: A method and apparatus for accelerating the conversion and detecting image data in pixel format into bit-plane format and bit plane format to pixel format for JPEG2000 compression and decompression is disclosed. In one embodiment, a method for encoding coefficients comprises applying one or more wavelet transforms to generate multiple coefficients, converting the pixel coefficients into bit-plane format and detecting zero bit-planes. This causes the image data in pixel to be broken into bit planes and stored in memory. If all the bits in a selected pixel plane are zero, an indication is stored in an N bit memory array corresponding to the N bit planes of the pixel code block that is processed. The indicator bits are useful in speeding up further compression.

Abstract: Embodiments of the invention provide a run length coding instruction for determining output context and decision values. Pixel coefficient bit values are used after wavelet transformation to determine output context (CX) and decision (D) values. The input is comprised of coefficient bit values (bit1, bit2, bit3, bit 4) in accordance with the scan order and the output are CX and D values. The CX and D pairs are processed together by arithmetic encoder to produce compressed data output (CD). CX selects the probability estimate to use during the coding of D.

Abstract: The present invention relates to an information processing apparatus and method which make it possible to transmit image data with high quality and low delay. A wavelet transform unit 101 applies wavelet transform to image data using a reversible filter that performs data transform with a reversible method that completely ensures forward direction and backward direction transform. An entropy coding unit 103 encodes coefficient data using a predetermined entropy coding scheme, with a reversible method that completely ensures forward direction and backward direction transform. The present invention is applicable to, for example, an encoding apparatus or a decoding apparatus.

Abstract: A method and system for applying pipeline architecture to discrete cosine transform and inverse discrete cosine transform. Each of the discrete cosine transform and inverse cosine transform are divided into four phases computed by process elements. Each phase can be designed by adjusting the amount of process elements according the demand of performance.

Abstract: Embodiments of the present invention provide a coding system that codes data according to a pair of coding chains. A first coding chain generates coded video data that can be decoded by itself to represent a source video sequence of a small size, such as a size sufficient to support the real time playback and display features of a video editing application. The second coding chain generates coded video data representing supplementary data, which when decoded in conjunction with the coded video data of the first coding chain, yields the source video sequence for full-size display. The output of the first coding chain may be stored in memory in a file structure that can be accessed independently of the second chain's output and, therefore, it facilitates real time decoding and playback.

Abstract: In a case where a padded orthogonally transformed block obtained by orthogonally transforming a padded image block of 8×8 pixels to which padding data has been added has been recorded as compressed image data, the padded orthogonally transformed block is subjected to an inverse orthogonal transformation to thereby restore the padded image block. Padding data contained in the restored padded image block is replaced with a portion obtained by copying a portion of the original image, thereby generating a modified image block. In a case where the true width of an edge pixel corresponding to an edge among the pixels forming the image block is less than 0.5, the pixel is obtained by adjusting the level of a pixel adjacent to the edge pixel in such a manner that it will have a level conforming to the width and level of the edge pixel.

Abstract: An efficient lapped transform is realized using pre- and post-filters (or reversible overlap operators) that are structured of unit determinant component matrices. The pre- and post-filters are realized as a succession of planar rotational transforms and unit determinant planar scaling transforms. The planar scaling transforms can be implemented using planar shears or lifting steps. Further, the planar rotations and planar shears have an implementation as reversible/lossless operations, giving as a result, a reversible overlap operator.

Abstract: A method of compressed sensing imaging includes acquiring a sparse digital image b, said image comprising a plurality of intensities corresponding to an I-dimensional grid of points, initializing points (x(k), y(k)), wherein x(k) is an element of a first expanded image x defined by b=R??1 x, wherein R is a Fourier transform matrix, ? is a wavelet transform matrix, y(k) is a point in ? ( ? i = 1 l ? ( ? i ? ? - 1 ? x ( k ) ) 2 ) 1 / 2 , ?i is a forward finite difference operator for a ith coordinate, and k is an iteration counter; calculating a first auxiliary variable s(k) from x ( k ) - ? 1 ( ?? ? ? n ? L n * ? y n ( k ) + ? ? ? R * ( R ? ? ? - 1 ? x ( k ) - b ) ) , wherein ?1,? are predetermined positive scalar constants, the sum is over all points n in x, and L* is an adjoint of operator L=(?1, . . .

Abstract: Techniques and mechanisms for performing error minimizing requantization are provided. Quantized coefficients associated with a bitstream are received. It is determined whether the quantized coefficients are associated with an inter macroblock or an intra macroblock. Inter macroblock and intra macroblock formulas minimizing requantization error are applied to determine requantized coefficients.

Abstract: A data transform method comprises a linear transform step of acquiring 16 linear Hadamard transform coefficients by multiplying the 16 pieces of data by an Hadamard transform matrix, an offset step of classifying the 16 linear Hadamard transform coefficients into four groups, each group containing an odd number of coefficients, and adding a predetermined offset value to linear Hadamard transform coefficients in every group, and an integral step of acquiring the lossless Hadamard transform coefficients by truncating decimal fractions down from a decimal point from the linear Hadamard transform coefficients added said predetermined offset value. With this configuration, a 16-point lossless Hadamard transform is implemented using only one rounding process.

Abstract: Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories and compression history indexes across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Abstract: An image encoding/decoding apparatus is provided, including a frequency band division unit for dividing image data into a plurality of frequency bands to generate sub-band coefficients, a sub-band coefficient interpolation unit for interpolating sub-band coefficients outside a region of a shape by using shape information representing a shape of the image data and the sub-band coefficients in the region of the shape, an encoding unit for encoding the interpolated sub-band coefficients to generate encoded data, and a shape information encoding unit for encoding the shape information to generate shape information encoded data.

Abstract: A method of displaying a thumbnail image of the original image of a data file stored in a storage unit on a display unit includes: (a) storing in the storage unit a first compressed code relating to an image for displaying the thumbnail image of the data file, the first compressed code being generated by dividing the image into a plurality of tiles and performing discrete wavelet transform and hierarchical encoding on the pixel values of the image tile by tile; (b) setting the resolution of the thumbnail image in accordance with the format type of the data file; (c) extracting a second compressed code according to the resolution that was set from the first compressed code stored in the storage unit; and (d) displaying the thumbnail image based on the second compressed code that was extracted.

Abstract: Fast transforms that use early aborts and precision refinements are disclosed. When to perform a corrective action is detected based upon testing the incremental calculations of transform coefficients. Corrective action is then performed. The corrective action includes refining the incremental calculations to obtain additional precision and/or aborting the incremental calculations when the resulting numbers are sufficient.

Abstract: In an image coding method of the present invention, after a process such as DCT is performed to digital image data, quantization process is performed, and then, to resultant quantized transform coefficients, variable length coding process is performed with reference to a variable length code table showing how variable length codes are allocated, and in a comparison process between an event derived from the quantized transform coefficients and a reference event included in the variable length code table, transformation process is performed to increase a possibility of performing variable length coding with satisfactory coding efficiency.

Abstract: A method and apparatus for coding an image by using exponential Golomb binarization are provided. The method comprises: performing entropy coding on an input image by performing exponential Golomb binarization using a plurality of predetermined thresholds; measuring a bit rate of a bit stream which is generated by performing the entropy coding using each threshold; and determining an optimal threshold by comparing bit rates with regard to the thresholds.

Abstract: Embodiments of the present invention provide a coding system that codes data according to a pair of coding chains. A first coding chain generates coded video data that can be decoded by itself to represent a source video sequence of a small size, such as a size sufficient to support the real time playback and display features of a video editing application. The second coding chain generates coded video data representing supplementary data, which when decoded in conjunction with the coded video data of the first coding chain, yields the source video sequence for full-size display. The output of the first coding chain may be stored in memory in a file structure that can be accessed independently of the second chain's output and, therefore, it facilitates real time decoding and playback.