Abstract: A video encoding apparatus is provided with a resolution converting section, an encoding section, and a transmitting section. The resolution converting section enlarges or reduces a binary picture which represents the shape of an object. The encoding section encodes a binary picture reduced by the resolution converting section. The reduction ratio used by the resolution converting section is encoded, and the transmitting section transmits this encoded reduction ratio along with encoded data on the binary picture. The amount of encoded data produced from the encoding section is controlled by changing the enlargement/reduction ratio used by the resolution converting section.

Abstract: In an image encoder (1), a quantizer (11) makes a quantization-step size set for each of low-frequency subbands whose resolution level belongs to a predetermined resolution level coincide with a quantization-step size set for each subband to encode an original image having the resolution level as it is. A low-pass rate controller (17) provides a rate control for the bit rate of arithmetic code D16 in all code blocks in a low-frequency subband to be less than a predetermined target bit rate. A high-pass rate controller (18) provides such a rate control that the bit rate of arithmetic code D17 in all code blocks in other subbands than the low-frequency subbands will be less than a target bit rate, that is, a bit rate resulted from subtraction of a bit rate D18 having actually occurred in the low-frequency subbands from a final target bit rate.

Abstract: An image information coding apparatus codes an input image signal in a manner optimized on the basis of the visual characteristics. In quantization, an input image signal is divided into blocks, an orthogonal transform is performed on a block-by-block basis, and resultant orthogonal transform coefficients are quantized. A quantizer includes a weighter for, in the quantization, performing weighting on each component of the orthogonal transform coefficients by means of an addition operation on a parameter specifying one of elements of a series of numbers arranged in accordance with a predetermined rule in correspondence with quantization step sizes.

Abstract: Implementing a two-dimensional inverse discrete cosine transform function includes executing two one-dimensional inverse discrete cosine transforming functions. Each of the one-dimensional functions is controlled to operate on a matrix of coefficients in either of two different directions.

Abstract: An interframe wavelet video coding (IWVC) method by which an average temporal distance (ATD) is minimized is provided. The IWVC method comprises receiving a group-of-frames and decomposing the group-of-frames into difference frames and first average frames between the frames in a first forward temporal direction and a backward temporal direction, wavelet-decomposing the first difference frames and the first average frames, and quantizing coefficients resulting from the wavelet-decomposition to generate a bitstream. The IWVC method provides improved video coding performance.

Abstract: Image data is separated into two components having elements arranged in a checkered pattern. A dummy setting component is obtained of the signal value occurring at the hole position of the first component, which is dummy-set corresponding to the direction of signal change of the first component. The dummy setting component is subtracted from the second component to obtain a difference component, which is the high-frequency component. By performing weighted addition on the signal value occurring at the hole position of component 1 and the signal value of the difference component, an addition dummy setting is obtained, and is then added to component 2 to obtain the low-frequency component. By repeatedly subjecting the low frequency-component to this processing, the image data can be transformed into the high-frequency components and the low-frequency components of a plurality of frequency bands.

Abstract: A method and apparatus for performing compression and/or decompression is described. In one embodiment, the present invention comprises a system having a buffer, a wavelet transform unit, and a coder. The wavelet transform unit has an input coupled to the buffer to perform a wavelet transform on pixels stored therein and to generate coefficients at an output. The coder is coupled to the wavelet transform unit to code the transformed pixels received from the buffer.

Abstract: According to the present invention, methods and apparatus 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: Method of compressing a digital image signal in which a first quantization step set, which is unique for a given segment, is determined so that the number of bits needed to encode the quantized data corresponding to this segment is greater than a target value. This first quantization step set then being modified, as a priority, for the blocks of the segment for which the gain, in the course of this modification, on the reduction of the number of bits needed to encode the quantized data corresponding to the segment to which it belongs, is the highest. This modification is carried out, on as many blocks as is necessary for the number of bits of this segment to be less than or equal to the target value. Device to implement this method.

Abstract: Wavelet coding of partially-masked image information may be made faster by either of two embodiments of the present invention. In a first embodiment, quick convergence is obtained by performing wavelet encoding in stages, each stage associated with a predetermined wavelet scale. By advancing the stages from finest scale to coarsest scale, coefficients of masked wavelets are identifies early in the coding process. In a second embodiment, quick convergence is obtained by introducing overshoot techniques when masked coefficients are identified, modified and image data is reconstructed therefrom.

Abstract: A method and apparatus for efficiently encoding images using a set of non-orthogonal basis functions, thereby allowing reduction of file size, shorter transmission time, and improved accuracy. The non-orthogonal basis functions include homogenous color basis functions, luminance-encoding basis functions that have luminance edges and chromatic basis functions that exhibit color opponency. Some of the basis functions are non-orthogonal with respect to each other. Using these basis functions, a source vector is calculated to provide a number of coefficients, each coefficient associated with one basis function. The source vector is compressed by selecting a subset of the calculated coefficients, thereby providing an encoded vector. Because the method is highly efficient, the image data is substantially represented by a small number of coefficients. In some embodiments, the non-orthogonal basis functions include two or more classes. A wavelet approach can also be utilized.

Abstract: A method for segmenting an image is disclosed wherein a fractal map of the image is generated by estimating the fractal dimension of each pixel in the image. The image is segmented by thresholding the fractal map of the image.

Abstract: An image compression system and method is described, which makes use of the symmetry found in faces and heads to perform the compression. The image is divided along the line of symmetry, and pairs of corresponding pixels on the two divided sides are determined. A weighted average and a weighted variance of the pixel values of the pairs is computed, and is used to encode the image. A transform such as the Karhunen-Loeve transform is used to compute the weighted averages and variances.

Abstract: A volume data encoder with high encoding efficiency is provided. The object of the coding is volume data which contains a plurality of tomogram planes output from a CT and an MRI. A header analysis unit separates each plane image into header information and pixel information. A header compression unit compresses the separated header information. On the other hand, a two-dimensional transform unit conducts frequency decomposition on the pixel information. A skip portion detection and table generation unit detects skip portions that are the same in all coefficients in a z-direction, and stores them in a table. A one-dimensional transform unit conducts one-dimensional transform on the pixel information for coefficients except the skip portions. A unit block division unit divides each subband into unit blocks. An entropy encoding unit determines a parameter for entropy encoding according to statistical properties of all coefficients in all unit blocks included in each class.

Abstract: A graphical data-compressor for compressing received arbitrary graphical data for subsequent transmission; where the graphical data-compressor comprises an input for receiving the received arbitrary graphical data, the input being linked to an analyzer for analysis of the received arbitrary graphical data into constituent geometrical parts, the analyzer being linked to an analytic scene describer, for description of said constituent geometrical parts as an analytic description of the received arbitrary graphical data, the analytic scene describer being linked to a transmitter, the transmitter being for transmission of the analytic description.

Abstract: The invention of the present application provides data compression and archival features for data that has previously been transformed and compressed. In a first aspect of the present invention, compressed data that has previously been transformed and compressed is received, and coefficients in the compressed data are selected and discarded to reduce the amount of storage space required by the compressed data. In another aspect, the compressed data has previously been sub-sampled by a wavelet transform, and wavelet coefficients in the compressed data are selected and discarded. In another aspect, wavelet coefficients in the compressed data are dequantized, wavelet coefficients in the compressed data having less value for the data are selected, and the wavelet coefficients are requantized so as to cause more loss of data for the selected coefficients to reduce the amount of storage space required by the compressed data.

Abstract: A set of one and two-dimensional transforms is constructed subject to certain range limited constraints to provide a computationally efficient transform implementation, such as for use in image and video coding. The constraints can include that the transform has a scaled integer implementation, provides perfect or near perfect reconstruction, has a DCT-like basis, is limited to coefficient within a range for representation in n-bits (e.g., n is 16 bits), has basis functions that are close in norm, and provides sufficient headroom for overflow of the range. A set of transforms is constructed with this procedure having an implementation within a 16-bit integer range for efficient computation using integer matrix multiplication operations.

Abstract: A method of and an apparatus for encoding and decoding using transformation bases of a yet higher efficiency. In a method for encoding an object signal in compliance with a transformation rule, a signal correlating to the object signal is obtained, and a transformation base that forms the transformation rule is derived based on a characteristic of the obtained reference signal. The object signal is transformed and encoded in compliance with the transformation rule based on the derived transformation base. Accordingly, the object signal is transformed in compliance with the transformation rule based on the transformation base derived from the characteristic of the reference signal. Since the reference signal is correlated to the object signal, the transformation base derived from the characteristic matches the feature of the object signal.

Abstract: Motion estimation for interframe coding of digital video is performed by matching blocks of transform coefficients representing a frame to be predicted with a phase-allocated array of coefficients representing a reference frame.

Abstract: A subband processing apparatus useful for wavelet conversion and compression-decompression operations includes a plurality of memories and a plurality of analytic filter banks. The plurality of memories store an input signal in a way such that the input signal is divided into a plurality of regional signals to correspond to the plurality of memories. The plurality of analytic filter banks analyzes in parallel the regional signals. Each analytic filter bank is configured to be in a one-to-one relationship with one of the plurality of memories. In this apparatus, each of the plurality of memories stores a corresponding regional signal and at least one other signal copied from the leading and trailing portions of other stored regional signals. Reverse processing is provided to synthesize a signal from a plurality of analyzed subband signals.

Abstract: Provided are a method of and an system for coding a grouped zerotree wavelet image having high coding efficiency regardless of the scale of a wavelet transform. According to an embodiment of the present invention, a method of coding an input image to a bitstream by using a zerotree wavelet transform, the method comprises merging a plurality of adjacent zerotrees, and coding the merged zerotrees to one symbol and outputting the symbol. The method further comprises transforming the input image to a wavelet domain having a plurality of wavelet coefficients via the zerotree wavelet transform, and generating the plurality of adjacent zerotrees each having the plurality of wavelet coefficients.

Abstract: A method for performing a motion estimation combined with a Walsh-Hadamard transform algorithm. In image frame, which includes a pixel array to display an image object, the method includes fetching a current image pixel content C and a reference image pixel content R. A Walsh-Hadamard transform algorithm is used to transform the current image pixel content C and the reference image pixel content R, so that a WHT SAD(i, j), WSAD(i,j) is computed to serve as a matching criterion.

Abstract: Apparatus and methods for performing a Fourier transform mechanically, using an array of one or more resonators. By tuning the resonators so that their natural frequencies correspond to harmonics of an input signal, the vibration of the resonators in response to the input signal may be measured to provide phase and amplitude information that is equivalent to the Fourier coefficients of the input signal. Preferably, the resonators are microelectromechanical (MEMS) resonators. Using MEMS resonators, the Fourier transform of a signal can be determined using substantially less power than would be consumed by a digital signal processor (DSP) or microprocessor performing similar calculations. MEMS resonator-based apparatus and methods according to various embodiments may be used for applications including compression and image processing.

Abstract: An inputted digital signal of a first format (DV video signal) is restored to a variable-length code by having its framing cancelled by a de-framing section 11, then decoded by a variable-length decoding (VLD) section 12, inversely quantized by an inverse quantizing (IQ) section 13, and inversely weighted by an inverse weighting (IW) section 14. Then, required resolution conversion in the orthogonal transform domain (frequency domain) is carried out on the inversely weighted video signal by a resolution converting section 16. After that, the video signal having the resolution converted is weighted by a weighting (W) section 18, then quantized by a quantizing (Q) section 19, coded by variable-length coding by a variable-length coding (VLC) section 20, and outputted as a digital signal of a second format (MPEG video signal).

Abstract: An inputted digital signal of a first format (DV video signal) is restored to a variable-length code by having its framing cancelled by a de-framing section 11, then decoded by a variable-length decoding (VLD) section 12, inversely quantized by an inverse quantizing (IQ) section 13, and inversely weighted by an inverse weighting (IW) section 14. Then, required resolution conversion in the orthogonal transform domain (frequency domain) is carried out on the inversely weighted video signal by a resolution converting section 16. After that, the video signal having the resolution converted is weighted by a weighting (W) section 18, then quantized by a quantizing (Q) section 19, coded by variable-length coding by a variable-length coding (VLC) section 20, and outputted as a digital signal of a second format (MPEG video signal).

Abstract: In image data coding and decoding processing, in order to improve efficiency by processing a plurality of factors in one cycle as long as possible, the factors are rearranged, in coding or decoding processing, in a predetermined scan sequence such that significant factors and 0s are paired. In addition, an appropriate scan sequence is selected in accordance with the distribution state of frequencies to further improve the efficiency.

Abstract: A method for generating a first plurality of output data values and the matrix factors used to generate an approximation to an image processing transform is disclosed. The first plurality of output data values are generated by transforming a plurality of input data values using a computer and applying a modified transform stored in a modified transformation matrix to the plurality of input data values. The plurality of input data values are stored in a generated matrix, and at least one data value in this matrix is rearranged using a permutation operation and modified by applying a linear combination of the unmodified values to the at least one data value. The modified transform is an approximation to a known transform stored in a transformation matrix that is used to generate a second plurality of output data values, the first plurality of output values approximating the second plurality of output data values.

Abstract: Disclosed is an image display device in a digital TV that is capable of carrying out the conversion into various kinds of resolution by using single bit map data in the digital TV. The image display device includes: a data processing part for executing bit map conversion, compression, restoration and format-conversion for text data; a memory for storing the bit map data obtained according to the bit map conversion and compression in the data processing part and image data inputted from an arbitrary receiving part, the receiving part receiving one of digital image data and analog image data; an image outputting part for reading the image data from the memory; and a display processing part for mixing the image data read from the image outputting part and the bit map data converted in format from the data processing part.

Abstract: A compression and decompression system in which a reversible wavelet filter are used to generates coefficients from input data, such as image data. The reversible wavelet filter is an efficient transform implemented with integer arithmetic that has exact reconstruction. The present invention uses the reversible wavelet filter in a lossless system (or lossy system) in which an embedded codestream is generated from the coefficients produced by the filter. An entropy coder performs entropy coding on the embedded codestream to produce the compressed data stream.

Abstract: An optimal scanning method for coding/decoding an image signal is provided. In a method of coding an image signal through a discrete cosine transform, at least one is selected among a plurality of reference blocks. A scanning order in which to scan blocks to be coded of the reference blocks is generated and the blocks to be coded are scanned in the order of the generated scanning order. The at least one selected reference block is temporally or spatially adjacent to the block to be coded. When the blocks to be coded are scanned, probabilities that non-zero coefficients occur are obtained from the at least one selected reference block, and the scanning order is determined in descending order starting from the highest probability. Here, the scanning order is generated to be a zigzag scanning order if the probabilities are identical. The optimal scanning method increases signal compression efficiency.

Abstract: A method of processing an encoded digital signal comprising a set of data obtained by encoding a set of original data representing physical quantities, and a set of information representing the original data and parameters used during the encoding. The method includes receiving an initial request for obtaining a selected part of the digital signal,determining at least one quantity of data representing the selected part of the digital signal as a function of the set of information and of the initial request, and providing at least one value of this determined quantity of data.

Abstract: A method and an apparatus to encode a series of quantized coefficients of a transform of a block of image data. The transform is such that 0 is the most likely coefficient amplitude and 1 is the next most likely coefficient amplitude. The method includes forming symbols (called events) from the series of quantized transform coefficients. An event is a run of none or more zero-valued coefficients followed by a run of one of a predefined set of sequences, each sequence in the set being either a single coefficient of amplitude greater than one, or a sequence of 1's and 0's starting with a coefficient of amplitude 1. The method includes forming a codeword for each formed event. Relatively short codewords are formed to represent events that are relatively more likely to occur, and relatively long codewords are formed to represent events that are relatively less likely to occur.

Abstract: A compressed-code generating method that is used for compressing information on characters including numerical data, sound and images, and a compressed-code expanding method that is used for restoring and expanding the compressed code generated by using the compressed-code generating method to the original information. Bit strings {y}1 and {y}2 are obtained respectively from a bit string {y} of information to be compressed. A reversible loop that exists in chaos is operated to these obtained bit strings, thereby to execute a reversible compression/expansion of the information using the chaos.

Abstract: Without repeating compression/decompression operations, an editing process such as rotation can be executed using first compression data, and second compression data, whose compression ratio is increased, can be stored in a hard disk drive.

Abstract: In a process of resolving the two-dimensional orthogonal transformation into the one-dimension orthogonal transformations in a horizontal direction and a vertical direction, with respect to each signal vector within the block memory to be orthogonal-transformed in a vertical direction orthogonal transforming unit after having been orthogonal-transformed in a horizontal direction orthogonal transforming unit, a power calculating unit calculates the power of each signal vector, a threshold obtaining unit requires a threshold enabling the quantized coefficient signal to take a value other than zero, and a value comparing unit compares the both powers.

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: The present invention relates to regulating the quality and/or bitrate of content within mixed content video when the video is compressed subject to a bitrate constraint. For example, a screen capture encoder encodes palletized content within a frame of screen capture video. Subject to an overall bitrate constraint, the encoder then allocates bits for continuous tone content within the frame. By controlling the allocation of bits used to encode the continuous tone content, the encoder regulates bitrate for the continuous tone content. This in turn can allow the encoder to regulate spatial quality and/or overall temporal quality for the video. In one scenario, for screen capture video encoded to a (relatively) constant overall bitrate, the screen capture encoder reduces the bitrate (and quality) of the continuous tone content, instead spending bits to increase the overall frame rate of the video.

Abstract: This invention solves problems due to employing error degraded data in digital processing. It particularly solves multi-generation problems wherein transform data degrade during each inverse transform and forward transform cycle even without any processing due to the rounding and clipping errors. It provides methods, systems and devices for reduced-error processing of transform-coded data. After inverse transformation of transform data, high-precision numbers are manipulated. The converting to integers and clipping to an allowed range steps are executed at any stage in the manipulation to obtain integer representation of the inverse transformed data such as for displaying of the data. However, further processing including forward transforming back to the transform domain is executed on the high-precision numbers. Thus, the rounding and clipping errors are not present in the processed data.

Abstract: A transform coefficient block of a frequency domain representation of a digital image is processed by performing scans on at least three different regions of the block.

Abstract: A device and method for embedding plural kinds of additional information or multiple bits of additional information into one picture is provided. A region information generating step generates region information to specify at least two regions in the real picture spatial or frequency space corresponding to the picture data, a coefficient sequence generating step sets at least two coefficient sequences, which are different from each other, a watermark pattern generating step allocates the coefficient sequences to each divided region to generate watermark patterns, and an embedding step embeds digital watermark information by changing the picture data using the watermark patterns.

Abstract: The present invention provides a method and apparatus that transforms input signals X0, X1, X2, X3 using a 4-point Hadamard transform matrix, and of the resulting transformation data, rounds up the LSB of the first transformed data and rounds down the LSB of the remaining odd-numbered data. When restoring the data to its original state the rounding is executed after a Hadamard inverse transformation is performed, thereby restoring the data to its original state X0, X1, X2, X3.

Abstract: It is an object of the present invention to prevent an image distortion from occurring by using a line memory of small memory capacity. For example, an image is decomposed into strip regions 12, and each strip region 12 is filtered together with certain excess data 14 from a neighboring strip region 12 to prevent an image distortion from occurring at the boundary between the strip regions 12 while executing band decomposition on the strip region 12 which is smaller in size than the entire image with a smaller line memory. In the band decomposition, a line memory which supports band decomposition of, for example, 3 decomposition levels is repeatedly and recursively used, whereby band decomposition of deeper decomposition levels is executed without any problems. In this manner, line-based wavelet transform for deeper decomposition levels is executed with a small line memory. Also reverse wavelet transform is executed in the similar manner.

Abstract: A dictionary based accelerated method of lossless compression and encryption of data with a small statistical redundancy. The sequence of the least distances obtained between every input numerical sample and the samples of the several dictionaries, produced by random number generators, and statistical compression is further applied. The process is accelerated utilizing a packed content addressable memory (CAM) for dictionary and input samples. CAM is scanned for a marking bit indicating a presence of a dictionary sample to find the least distance. CAM is packed and loaded with successful ranges of the amplitudes of both dictionary and input samples to reduce an address space and to accelerate the process of compression further. The least distances are founded for an unique alphabet of the input sequence, and the results are merged with an original input to accelerate the process of compression further.

Abstract: An image coding method using wavelet decomposition and coding clusters of four-children coefficients bitplane-wise including value-bits for significance and refinement, and tree-bits for tree structure significance.

Abstract: A method and apparatus for performing compression and/or decompression is described. In one embodiment, the present invention comprises a system having a buffer, a wavelet transform unit, and a coder. The wavelet transform unit has an input coupled to the buffer to perform a wavelet transform on pixels stored therein and to generate coefficients at an output. The coder is coupled to the wavelet transform unit to code the transformed pixels received from the buffer.

Abstract: A method and apparatus for eliminating flicker by quantizing values based on previous quantization is described. In one embodiment, the method comprises encoding a first coefficient value in a first frame of a motion sequence and subsequently setting a second coefficient in a second frame of the motion sequence and in the same position as the first coefficient to be within a predetermined closeness with the value of the first coefficient.

Abstract: An encoder (300) selects (702, 1302, 1304,1306,1308) one or more subsets of spatially or temporally correlated transformed data coefficients, on the basis of the significance of each subset in representing the data. The encoder (300) and a complementary decoder (400) may be applied to wavelet transform encoded images (500). The encoder (300) may be implemented on a wireless to Internet gateway server (108), in order to reduce byte size of encoded images (500) sent through a wireless network (112), and reduce the amount of processing that must be performed by a wireless device (118) to decode an image or other data. The decoder (400) and/or encoder (300) may be implemented on the wireless device (118).

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 system and method for processing mosaiced images utilizes a compression-aware demosaicing process that takes into consideration a subsequent compression process. The compression-aware demosaicing process is performed using a compression-considered demosaicing operator that incorporates a color space conversion operator and a frequency-based transformation operator, which are typically associated with the compression process. Consequently, the overall efficiency of the system and method is significantly increased. Furthermore, the compression-aware demosaicing process produces artifacts that complement the artifacts produced by the subsequent compression process such that the artifacts are less visible in the final color images, which increases the quality of the final color images.

Abstract: The use of the undefined low-order four bits of an 8-bit watermark is defined and, when contents are reproduced, a predetermined operation is performed according to the information stored in the low-order four bits. That is, a watermark is added to an original image to create an image with the watermark inserted. When the contents are reproduced, the watermark is detected in the image and, based on the information stored in the low-order four bits of the detected watermark, a predetermined operation, for example, access to a web site on the Internet, is performed.