Abstract: In a process and unit for gradual decoding, archiving and graphic display of progressively decoded image data, time intervals between the time points of consecutive decoding steps, during which network users receive ever more refined image resolution when downloading image data from a central network server to the client computer using transferred and decoded partial data quantities ?Li as preview images, are generated with abbreviated time spans that are optimized with respect to minimization of system usage by the decoding system. For this purpose, the receiving data rates for transfer of the individual partial data quantities, which are taken into account through improvements generated by the individual decoding steps of a quality metric showing the degree of image resolution and the temporary usage of the decoding system upon determination of the decoding time points.

Abstract: A method of image and video compression including data re-ordering to improve the performance of the core compression algorithm. In the inventive method, pixel values of at least part of an image are examined and then re-ordered into a new order that has greater compactability than the original pixel order. The re-ordered pixel values are then compressed, e.g., by block transform. In the particular case of a compression scheme employing a block transform, the inventive method reduces the complexity of the transform coefficients, resulting in more efficient compression. The method may be added to existing compression algorithms with only minor modifications to the bitstream and decoder architecture.

Abstract: Systems and methods thereof for processing data are described. First information associated with encoded data is parsed. The first information describes an ordering of the encoded data. The encoded data is placed in a data packet using the first information. The data packet is organized into contiguous data segments that are delineated by truncation points that allow a transcoder to transcode the encoded data without using the first information.

Abstract: In a parallel computation of a Hough transform of an array of input data values, the transform space of the Hough transform is partitioned dynamically or statically into a number of sub-spaces. Each sub-space of the transform is stored in a sub-space of memory locations. Data values from the array of input data values are passed to a plurality of processors, each processor associated dynamically or statically with a sub-space of memory locations. Each processor, acting in parallel with the other processors, updates constituent elements of the Hough transform stored in the associated sub-space memory locations dependent upon the input data value.

Abstract: A method for estimating quality of images compressed with a transformation based compression method. The estimation method uses estimated errors generated by quantization to obtain an image quality indicator and does not require use of a reference image. The estimation method includes calculating a probability of at least one specific quantized transformation coefficient value for at least all coefficients representing one identical two-dimensional frequency, and estimating identifying parameters of at least one probability density function of non-quantized coefficient values from the quantized coefficient value probabilities, with a type of probability density function being preset. The estimation method further includes calculating an image quality indicator from errors introduced by quantization, which are derived from probability density function parameters and quantization parameters.

Abstract: A video encoding system is provided including analyzing a picture; providing transforms; selecting a transform from the transforms by comparing a luminance characteristic of the picture with a human visual system texture criterion of the picture; and applying the transform for encoding and displaying the picture.

Abstract: A method and apparatus for storing bitplanes of coefficients in a reduced size memory is disclosed. In one embodiment, a method for encoding coefficients comprises applying one or more wavelet transforms to generate multiple coefficients and storing N bitplanes of each of the multiple coefficients in a first memory having multiple rows. Each of the multiple coefficients has a bit length greater than N bits, and each storage location in each of the rows stores a bit of either a more significant bitplane of the coefficients or a less significant bitplane of the coefficients. The storing of N bitplanes includes storing an indication for each row of the rows to indicate a location in each row at which bits of more significant bitplanes have started to be stored and after which bits of the multiple coefficients of the less significant bitplanes are no longer stored.

Abstract: A method of reconstructing a phase of a radiation wave field including determining a representative measure of an intensity variation of the radiation wave field on a selected surface extending globally from one end to another of the radiation wave field, determining a representative measure of the intensity of the radiation wave field on the selected surface, transforming the representative measure of the intensity variation to produce a first representation of integral transform and to apply to the first representation of integral transform a first filter and producing a first representation of modified integral transform, applying a first function of the first representation of integral transform to the first representation of modified integral transform and producing an untransformed representation, applying a correction based on the measure of intensity on the selected surface to the untransformed representation, transforming the untransformed corrected representation to produce a second representation o

Abstract: According to some embodiments, systems, methods, and apparatus are provided to load video data into a hardware accelerator that is not adapted to receive interlace frames, wherein the video data comprises interlace frames, configure the hardware accelerator to receive interlace frames, and de-block the video data via the hardware accelerator.

Abstract: There is disclosed image predictive coding apparatus and method, image predictive decoding apparatus and method, and recording medium which stores therein the image predictive coding method or the image predictive decoding method, of which the transform efficiency is remarkably improved in comparison with the prior art.

Abstract: An image processing apparatus and method for decompressing compressed image data is described. In one embodiment, the image processing apparatus decompresses compressed image data that is obtained by dividing an original image into blocks and compressing each block. The apparatus may comprise a decompression unit to decompress the compressed image data to provide an image which is a collection of the respective blocks, and a smoothing unit to perform a smoothing operation on the decompressed image to control the smoothing effect applied to the image based on distance from a block boundary and based on an edge amount.

Abstract: A technique for eliminating the division in decoding a predicted DC coefficient includes calculating and storing the values of 1//DC_scalar in a table. This allows one to convert a division into a multiplication.

Abstract: This invention is a method for inverse Wavelet transform using a breadth-first output data calculation which uses input data to calculate at least one output data for each iteration of a software loop even if the same input data is used in a later iteration for calculating other output data. This reduces data movement between memory and the data processor core thus reducing the possibility of cache misses and memory stalls due to access conflicts. The input data and computed output data are preferably stored as subwords packed within data words in memory. In inverse Wavelet transformation this method performs vertical spatial frequency expansion and horizontal spatial frequency expansion for each level of Wavelet encoding. This invention arranges data flow providing a more efficient use of memory bandwidth and cache space than other known methods.

Abstract: A data encoding method. First, a data array comprising a plurality of elements is stored in a memory. The number of elements unequal to a predetermined value is counted while elements of the array are stored in the memory. Then, a control module reads elements from the data array, and determines whether the number of read elements unequal to the predetermined value is equal to the counted number. When the number of read elements unequal to the predetermined value is equal to the counted number, the control module stops reading elements from the data array.

Abstract: A JPEG2000 compressed image is transcoded to a lower bit-rate or lower resolution, or both, without having to decompress the initial JPEG2000 image and then recompress it to a lower bit-rate and/or resolution. Instead, arithmetic decoding is performed only to the nearest higher bit-rate layer, up to the desired resolution, before performing rate-distortion optimization to produce the transcoded image.

Abstract: A data transformation device including a pre-processing unit, a calculating unit and a post-processing unit is disclosed. The pre-processing unit performs a first pre-process with received image data to generate pre-processed image data, and performs a second pre-process with received result data to generate pre-processed result data. The calculating unit generates first calculated data and second calculated data according to the pre-processed image data and the pre-processed result data, by both a first calculating component and a second calculating component respectively. The post-processing unit performs a first post-process to generate the result data according to the first calculating data, and performs a second post-process to generate the image data according to the second calculating data.

Abstract: Datawords encoded using a first-order Reed-Muller code are decoded using a Fast Hadamard Transform (FHT). Where the dataword is known to comprise a number of unused bits at one end, the soft decisions of the codeword are reordered. Majority polling is then performed on groups of the soft decisions to produce a series of soft decisions which make up a new codeword. The new codeword is then decoded using an FHT of lower order than the FHT applicable to the originally received codeword.

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. The image processing apparatus may also include an address generator for generating a common read/write address for the line buffer memory.

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 for encoding video with a two-dimensional (2D) transform separable to two one-dimensional (1D) transforms. The method receives an array of values for a sub-section of an image, performs a first 1D-transform of the array, transposes the resulting array, and performs a second 1D-transform of the array resulting from the transpose. The method, without performing another transpose, generates a data stream using a transposed scan order based on the values of the array resulting from the second transform. A method for decoding video encoded by a 2D transform, which separable to two 1D transforms. The method receives a data stream containing encoded values for an image, parses out the values into an array using a transposed scan order, performs a first 1D-inverse transform on the array, transposes the resulting array, and performs a second 1D-inverse transform of the array resulting from the transpose to produce a decoded output.

Abstract: The disclosure relates to encoding and decoding of digital data, and in particular to lossless arithmetic encoding and decoding of digital data representing audio, image or video data. A probability density function used for lossless arithmetic encoding of digital data is controlled by employing one or more parameters that changes over the set of data to be encoded. A parametric model in the form of an envelope function describes the spread of quantization indices derived from the data in a transform domain. By transmitting the one or more parameters together with the arithmetically encoded data, a receiving decoder may decode the data by exploiting the same parametric model as used by the encoder.

Abstract: An encoding process and a recompression process of encoded data are disclosed that appropriately select low-order bit planes and low-order sub bit planes, codes corresponding to which are not to be output. The low-order bit planes and low-order sub bit planes are selected based on an inverse value of the square root of the subband gain of inverse wavelet transform, such that the selected low-order bit planes and low-order sub bit planes are not encoded, or alternatively, are encoded, but later discarded during packet generation.

Abstract: A method, system, and data structure for the scaling down of data is provided. At least two blocks of transformed data samples representing at least two blocks of original data samples are received. One of at least two tables of constants is selected wherein each table of constants is capable of reducing the number of transformed data samples by a different factor. The constants taken from the selected table are applied to the at least two blocks of transformed data samples to produce one block of transformed data samples representing one block of final data samples. The data is processed one dimension at a time by multiplying the data in one dimension with selected constants taken from previously developed tables corresponding to the desired scale down factor. Scaling down by different factors in each dimension as well as scaling down in one dimension and scaling up in the other dimension may be achieved.

Abstract: A digital media content (e.g., image, video, audio, etc.) encoder/decoder employs a spatially varying parameter to condition the application of an overlap pre-process and post-process to adjacent transform block edges for the spatial-domain lapped transform. This conditional application of the lapped transform to sub-blocks of the digital media can be signaled on an edge, block, macro-block or other granularity. Further, a restriction on use of the conditional lapped transform based on a frame-level quantization or other bit-rate related parameter minimizes the signaling overhead impact at low bit-rates of coding.

Abstract: An image region discrimination section in an image processing section, a characteristic signal calculation result obtained by hardware is subjected to macro-scoped correction and macro-discrimination by a processor. Further, in the image region discrimination section, a resolution and a signal bit number of a characteristic signals are decreased, the resultant characteristic signals is stored in a memory, and both a macro-discrimination result and the characteristic signals are synthesized to produce a final discrimination signal.

Abstract: When encoding into block units an image in which halftone images and character/line images are mixed, a substitution value substituting for pixels in which pixels of a character/line image exist is made a value whereby occurrence of quantization errors of direct current components after frequency conversion is substantially zero, and thus block distortion of images when decoding is minimized. Therefore, a blocking unit inputs images in 8×8 pixel blocks. An acquisition unit acquires pixel data of character/line images as acquisition color information and acquires identification information identifying character/line image pixel positions. A substitution unit substitutes pixel data acquired as character/line images in image data of input blocks with a substitution value determined based on pixel data having halftone attributes.

Abstract: In an image encoder is provided, including a to-be-encoded object prediction unit which counts quantization coefficients which are newly made significant, for example, when each bit plane is encoded, on the basis of quantization coefficient for each bit plane in all code blocks to provide a feature amount, estimates the number of generated codes on the basis of the feature amount, and adds the estimated number of codes in a predetermined order. When an initial target number of codes is reached, the to-be-encoded object prediction unit stops the addition, and supplies the entropy encoder with information on the bit planes having the quantization coefficients thereof been added as to-be-encoded object information. In this entropy encoder, only the quantization coefficient in the bit planes represented by the to-be-encoded object information, is processed by three types of encoding passes while truncating the quantization coefficients of the other bit planes.

Abstract: A block decoding method and system capable of decoding and outputting data in a longitudinal direction, which obtains a start address in an input compressed datastream for each block of a decompressed image by a pre-scanned compressed datastream such that the system can obtain 90°-rotated blocks by performing a Huffman decoding in a longitudinal direction, a 90°-rotated zigzag arrangement, an inverse quantization and an IDCT. Since the decoding direction is identical to the output direction of a printer, only a desired column of blocks of the decompressed image is temporarily stored for output and accordingly required memory size is relatively reduce.

Abstract: The invention is directed to a method and apparatus for reducing the bandwidth required to transmit image data to a display device. It is contemplated that the image data represents a plurality of pixels defining an image for display on the display device, and that the image data is transmitted in a data stream with the data being in a predetermined order of pixel components. The method comprises the steps of receiving the image data from the data stream, and transforming the image data as it is received by selectively storing some of the image data in a memory for access by the display device and discarding other of the image data.

Abstract: The invention concerns a method for encoding at least a source image using a hierarchical mesh defining at least two nested spaces corresponding each to a decomposition level of said meshing, which consists, at least at a decomposition level n (except the first decomposition level), in delivering only image coefficients expressed in a base of functions defined in a space orthogonal to the space corresponding to the preceding decomposition level n?1, said functions being selected so that said image coefficients enable to optimize for said decomposition level n the data already transmitted for the preceding decomposition level n?1, so as to produce a reconstructed image, representing said source image, with optimized restoration quality for said decomposition level n.

Abstract: An image processing apparatus supporting both discrete wavelet transform and discrete cosine transform with reduced hardware resources. The image processing apparatus is composed of an input unit receiving a plurality of pixel data, a controlling unit selecting a desired transform from among discrete wavelet transform and discrete cosine transform, and providing a plurality of coefficients depending on the desired transform, and a processing unit which processes the pixel data using the plurality of coefficients to achieve the desired transform.

Abstract: This invention controls the code generation quantity adaptively with respect to the pattern of images and changes in the images, etc., so as to alleviate degradation in image quality, and to effectively reduce the spatial redundancy in order to provide a margin in the code quantity and to improve the overall image quality. An adaptive filter has a coefficient table memory that holds N coefficient tables, filter coefficients F1, F2 . . . FN that provide different filtering characteristics, a filter coefficient selecting 46 for selecting one filter coefficient Fk from filter coefficient tables and filter calculating unit performing prescribed calculations on the DCT coefficients using the selected filter coefficient FK.

Abstract: An image coding apparatus is provided with a unit operable to scan a two-dimensional array of quantized coefficients into scanned quantized coefficients, the scanning being performed from a low frequency component toward a high frequency component; a unit operable to convert the scanned quantized coefficients into a run value and a level value, the run value indicating the number of continuous quantized coefficients, each having a zero value, and the level value indicating a value of a quantized coefficient having a non-zero value; a unit operable to code the run value; and a unit operable to code the level value, wherein the coding of the run value is performed, from a high frequency component toward a low frequency component, in accordance with information that represents a total number of uncoded quantized coefficients which have not been coded.

Abstract: Even in the case of coding the input image by dividing into tiles, a fine image quality adjustment is possible based on the characteristic of each tile. The input image signal is transformed to the coded data through the tile dividing unit 102, the wavelet transforming unit 103, and the entropy coding unit 106, and is stored in the code memory 107. In parallel to this processing, the distortion calculating unit 108 calculates the distortion in each coding pass of each code block, and stores it in the distortion memory 109. On the other hand, the complex tile deciding unit 111 decides whether a particular tile is the complex tile or not. The tile classifying memory 112 stores the decision output. A distortion data outputted from the distortion memory 109 is outputted to the multiplier 110, the multiplier 110 multiplies the distortion data by the weight coefficient selected by the weight coefficient selecting unit 113.

Abstract: An image compressing apparatus divides an image into plural tiles, decomposes each tile into plural sub band by frequency conversion, and conducts bit plane encoding of each sub band for each encoding unit, wherein the image compressing apparatus includes a code discarding unit selectively discarding a code obtained by the bit plane encoding for each encoding unit, and wherein the code discarding unit includes a discard amount setting unit that makes generally even the amount of code discarding in the encoding units that are in mutually adjacent relationship across a tile boundary.

Abstract: Method and apparatus for encoding image data is described. In an example, a memory stores bit-planes associated with the image data. Each of the bit-planes is partitioned into data units. A bit modeler communicates with the memory and produces modeled data in response to each of the data units for each of the bit-planes. An arithmetic coder communicates with the bit modeler and produces a coded data in response to each of the modeled data produced by the bit-modeler. In another example, the bit-modeler processes at least two of the bit-planes in parallel.

Abstract: A system and method perform video data compression in a manner that limits the need for external memory access. Accordingly, the operational frequency of the local data bus is reduced and power consumption is therefore minimized. In this manner, the present invention is especially amenable to use in mobile systems.

Abstract: A method of image compression with wavelet transforms applied locally rather than globally by image component partitioning into independently transformed macroblocks plus overlapping data for filter length compensation.

Abstract: An image processing apparatus includes: a table generation unit that generates a table in which a coefficient set including predetermined weighting coefficients and pixels contained in a resolution converted image are related to each other on the basis of a size of an input image and a size of a resolution converted image; a coefficient selecting unit that selects a coefficient set to be applied for a calculation of a pixel value in the resolution converted image out of plural coefficient sets on the basis of a table generated by the table generation unit; and a pixel value calculating unit that calculates pixel values to be used in the resolution converted image resulting from the resolution conversion of the input image on the basis of the coefficient set selected by the coefficient selecting unit and plural pixel values contained in the input image.

Abstract: A method is disclosed herein for compressing spectral data corresponding to an image comprising a plurality of pixels. The method includes the step of creating a set of potential endmembers. A first plurality of the potential endmembers are identified as a first set of endmembers based upon their respective correlations with a first spectral signature of a first of the plurality of pixels. The first pixel is then represented as a combination of the first set of endmembers. Processing of the image preferably continues by identifying a second plurality of the potential endmembers as a second set of endmembers based upon their respective correlations with a second spectral signature of a second of the plurality of pixels. The second pixel is then represented as a combination of the second set of endmembers.

Abstract: An image processing apparatus for decoding a compressed image data, the image data being divided to a plurality of tiles, each of which is a basic unit of process in encoding or decoding process, said apparatus comprising: a detector which detects an existence status of ROI within said compressed image data based on a frequency transform coefficient of said tile for every tile; a determiner which determines whether each tile is a ROI tile composed of only ROI, a non-ROI tile composed of only non-ROI, or a ROI boundary tile composed of ROI and non-ROI based on said existence status of ROI detected by said detector; a processor which shifts only frequency transform coefficient of said ROI within each tile to lower bit side for said ROI tile and said non-ROI tile determined by said determiner, and which shifts frequency transform coefficients of both ROI and non-ROI within each tile to lower bit side.

Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients which are obtained by quantizing frequency components of an image signal to a variable length coding process by using a run value Run that indicates the number of successive zero coefficients and a level value Lev that indicates a value of a non-zero coefficient following the zero coefficients.

Abstract: In response to a partial codestream truncation command, a partial codestream truncation process unit temporarily truncates a code line of encoded data. The partial codestream truncation process unit can also temporarily truncate the code line frame by frame. In response to an undo command, a restoration process unit restores the encoded data that has temporarily truncated code line. The temporarily truncated frames are included in a group of frames of the moving image. In response to an undo releasing command, a code line discarding unit discards the temporarily truncated code line or frames. The encoded data has a form of JPEG2000 or Motion-JPEG2000.

Abstract: The present invention relates to an apparatus and method for generating mosaic images, wherein photographed content is displayed as a still image by a digital TV display or video monitor for an extended period of time. The apparatus of the present invention includes an animation analyzer for output of a motion vector of an input image, a coefficient calculator for calculating transformation and warping coefficients, a means for offsetting illumination differences, and storage for mosaic images. The present invention can advantageously be used for calculating a more accurate transformation coefficient, thereby generating mosaic images with minimal distortion.

Abstract: An apparatus for generating an encrypted data stream representing an audio and/or video signal comprises an encoder for encoding an input signal to generate a data stream with a predefined data stream syntax as output signal. The apparatus further comprises an encryption means coupled with the decoder in order to influence encoder internal data and/or the output signal of the encoder in a uniquely reversible manner based on a key such that the generated encrypted data stream comprises payload information differing from payload information of a data stream that would be generated by the apparatus without the presence of an encryption means and that the generated encrypted data stream comprises the predefined data stream syntax.

Abstract: An image processing apparatus includes an image compression device which performs a discrete wavelet transform of pixel values for each rectangular portion to produce wavelet coefficients, and performs a hierarchical compression coding of the wavelet coefficients for each rectangular portion so that a codestream is produced. A codestream transform device is provided to reduce an amount of code data in the codestream. The codestream transform device comprises a syntax analysis unit which analyzes header information of each rectangular portion in the codestream. A comparison unit determines a similarity of pixel values between a current frame and a preceding frame in the codestream based on a result of the analysis. A codestream generating unit deletes code data of a corresponding rectangular portion of the current frame when the similarity is larger than a given threshold value.

Abstract: A method of compressing a current image of a sequence of images is disclosed. Firstly, the current image is transformed with a predetermined transform such as the DWT to provide a set of transform coefficients (step 2202). The method then retrieves (step 2303), for at least one transform coefficient of a current image, a predetermined number of bits, preferably two, of a corresponding transform coefficient of a previously compressed image of the sequence. The corresponding transform coefficient is truncated at a truncation bitplane and the retrieved bits are the least significant bits of the truncated corresponding transform coefficient. The transform coefficient of the current image is set to a new value that is a function of the retrieved bits (step 2306) and bits of the transform coefficients of the current image are stored for use in compressing one or more subsequent images of the sequence (step 2208).

Abstract: An image processing method, having the steps of: transforming color image signals representing an original image into a luminance signal and color difference signals; transforming the luminance signal and the color difference signals separately into multi-resolution signals of the level 1 to the level N; applying an inverse multi-resolution transform to the color difference multi-resolution signals, after suppressing the high-frequency components of the level 1 of the color difference multi-resolution signals; applying an inverse multi-resolution transform processing to the luminance multi-resolution signals, after applying a coring processing using a condition for each level different from other levels to the high-frequency signals of each level of the luminance multi-resolution signals; transforming the processed luminance signal and the processed color difference signals into a set of processed color image signals.

Abstract: An efficient lapped transform useable in digital media codecs is realized using a reversible 2-dimensional overlap operator for pre/post filtering that is applied on a staggered grid relative to a core transform. The 2-dimensional lapped operator is based on a separably applied 1-dimensional reversible lapped operator, which is re-arranged as a sequence of elementary transforms in interleaved stages on subsets of points of the respective block and further implemented in lifting steps for computational efficiency. The interleaved stages include applying rotation and scaling stages between initial and final stages involving a normalized 2×2 Hadamard transform.

Abstract: There are provided a moving image coding apparatus and moving image decoding apparatus which allow efficient decoding of an interlaced image from the coded data of a progressive image, and methods for the apparatuses. Noninterlaced moving image data is input from a moving image data input unit (101). Two consecutive frames are discriminated by a switch (102). A line interleaving unit (103) then generates new image data by alternately arranging the line data of the respective frames upon changing the order. A discrete wavelet transform unit (104) performs two-dimensional discrete wavelet transform for this image data to decompose it into seven subbands. Each subband is then coded.