Abstract: A disclosed image processing apparatus divides an image into code-blocks of different levels by a wavelet transform, generates information codes of code-block-related information items related to the code-blocks of the different levels using separate tag trees corresponding to the different levels, and generates code data in which the image is encoded. The image processing apparatus comprises a coordinate generating unit that generates an x coordinate and a y coordinate of each of the code-blocks of each of the levels wherein a unit in an x direction and in a y direction is defined by a size of the individual code-blocks of the corresponding level; and an address generating unit that generates a multiple so a combination value of a bit combination of the y coordinate and the x coordinate of each code-block as an address for storing the information code of the code-block in a first storage unit.

Abstract: Provided are a method and apparatus for image encoding which improves encoding efficiency in accordance with image characteristics by performing prediction in lines and performing a one-dimensional transformation in lines on an input image, and a method and apparatus for image decoding. Encoding efficiency of an image may be improved by generating a prediction sub residual block using neighboring residues and performing a one-dimensional discrete cosine transformation (DCT) on a difference residual block which is a difference between an original sub residual block and the prediction sub residual block.

Abstract: Disclosed herein is an information processing apparatus including: a partial decoder configured to decode a portion of a first code stream representative of coded image data into baseband image data; and an encoder configured to encode the baseband image data from the partial decoder into a second code stream having a format converted from the format of the first code stream, wherein the encoder encodes the baseband image data using a target value for parameters with respect to the second code stream, into the second code stream having the format thereof, and the partial decoder determines the portion to be decoded of the first code stream, using the target value, and decodes the determined portion of the first code stream.

Abstract: A decompression system for DCT-base compressed graphic data with transparent attribute includes a memory to store a compressed graphic data and a compressed mask data; a controller to read the compressed graphic data and the compressed mask data out of the memory; a first decompressor to decompress the compressed graphic data and generate a first color space image signal; a color space transformation device to transform the first color space image signal into a second color space image signal; a special color signal storage to store a plurality of special color signals; a second decompressor to decompress the compressed mask data and generate a select signal; and a first multiplexer to select the second color space image signal or a special color signal to output based on the select signal, wherein each special color signal indicates a different level of transparent attribute.

Abstract: Even in a case where there are a plurality of syntax elements, the invention reduces influence of the number of syntax elements and realizes high-speed encoding. An apparatus comprises N number of codes generation units arranged in parallel, which are configured to generate codes, including one or more codes, based on a transform coefficient; N number of first code concatenation units arranged in parallel, each of which is configured to concatenate the codes, respectively generated by the N number of codes generation units, for generating a code stream; N number of storage units arranged in parallel, each of which is configured to store the N number of code streams inputted from the N number of first code concatenation units; and a second code concatenation unit configured to read each of the code streams, which are stored in the N number of storage units, and concatenate the read code streams.

Abstract: There is provided a method for processing a variable length code encoded image having a plurality of scan lines, wherein each scan line has a number of original code blocks including a differentially encoded parameter. The method includes defining a subarea of the image having parts of a number of the scan lines, extracting the subarea, generating a set of auxiliary code blocks having an auxiliary differentially encoded parameter based on the first differentially encoded parameter of a first code block of a first current scan line in the subarea, and associating the auxiliary code blocks with the subarea. There is also provided an apparatus and a computer program product thereof.

Abstract: The invention relates to a method of encoding an image divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of N by N pixels into a binary stream. It comprises the steps of: —transforming each of the block into a transformed block of coefficients comprising one low frequency coefficient and N2-1 coefficients, called high frequency coefficients, of higher frequencies than the low frequency; —quantizing each coefficient of each of the transformed blocks with a quantizing parameter; —encoding the quantized coefficients into a binary stream. According to the invention, the low frequency coefficients of the transformed blocks are quantized with a same quantizing parameter, called first quantizing parameter.

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: A method for coding a stereoscopic depth. The method includes encoding a signal varied in a non-linear relation to the stereoscopic depth so as to obtain a transformed signal, and decoding the transformed signal using an inverse non-linear transformation so as to reconstruct the stereoscopic depth. The dynamics of the transformed signal for small values of the stereoscopic depth are greater than the dynamics of the transformed signal for large values of the stereoscopic depth.

Abstract: Compression of image data is provided. Image data is accessed, along with depth information for pixels of an image. A distance from a region of focus for pixels of the image is determined, by calculations that use the depth information. A bit rate for compression of the image data is controlled in accordance with the distance from the region of focus, such that more bits are used for pixels closer to the region of focus and fewer bits are used for pixels farther from the region of focus.

Abstract: In an embodiment, a compression unit is provided which may perform compression of images with low latency and relatively little hardware. Similarly, a decompression unit may be provided which may decompress the images with low latency and hardware. In an embodiment, the transmission of compressed coefficients may be performed using less than two passes through the list of coefficients. During the first pass, the most significant coefficients may be transmitted and other significance groups may be identified as linked lists. The linked lists may then be traverse to send the other significance groups. In an embodiment, a color space conversion may be made to permit filtering of fewer color components than might be possible in the source color space.

Abstract: In summary, the present invention provides a method, apparatus and program product for calculating an estimate of the amount of toner coverage required for printing print data defined in a compressed data stream. The estimate is obtained with reduced processing by obtaining coverage data from a partially decompressed formed of the data stream and using this to obtain the coverage estimate, thus removing the need to do a full de-compression of the data stream. For example the coverage data is a count of toned pixels for at least one intensity level.

Abstract: Visually optimized quantization is described herein. Specifically, the visually optimized quantization is for arbitrary block-based transforms such as Mode-Dependent Directional Transform (MDDT). The compression method involves the process of taking a discrete cosine transform of an MDDT basis function, obtaining the frequency weights, and computing the contrast sensitivity function for each of the frequency components. The overall effect of the distortion is calculated by error pooling and the quantization matrix is the inverse proportional of the overall effect.

Abstract: The invention relates to a method for obtaining transformation parameters. A camera motion can be modeled by providing a vector field of motion vectors describing estimated motion vectors, projecting the vector field on at least one axis, and deriving the transformation vector parameters from the projection of the vector fields. As the camera motion can be modeled by way of translation, scale and rotation, the projections of the vector field on the axis can be used.

Abstract: A method for modifying a reference block of a reference image, the method includes transforming the reference block into a first set of coefficients, modifying the first set of coefficients by help of one or more weights and inverse transforming the modified first set of coefficients wherein the weights are determined by help of one or more further pixels of the current image and by help of one or more further reference pixels of the reference image.

Abstract: A method and apparatus is disclosed herein for performing compression with sparse orthonormal transforms. One method includes receiving a block of data; classifying the block of data based on directional structure; selecting one of a plurality of available directional, orthonormal transforms to apply to the block based on results of classifying the block; and applying the selected transform to the block to generate a plurality of coefficients, thereby producing a compressed version of the block.

Abstract: The present technology relates to an image processing device, an image processing method, and a program capable of reducing the amount of processing required for ROT and DCT or inverse DCT and inverse ROT. Image information obtained by decoding an encoded image is dequantized to obtain a low frequency component of the image information, which is obtained by a first orthogonal transform unit, and to obtain a frequency component higher than the low frequency component of the image information, which is obtained by a second orthogonal transform unit. The low frequency component and the high frequency component are subjected to an inverse orthogonal transform according to the same method. The present technology can be applied when encoding and decoding images, for example.

Abstract: The disclosure relates to adjusting intensities of images. The method includes receiving information identifying of a plurality of regions within an image; receiving an intensity adjustment of at least one of the plurality of regions; adjusting the intensities of the at least one plurality of regions based on the received intensity adjustment; interconnecting at least two of the plurality of regions by applying a two-dimensional method; generating intensity adjustments for at least one pixel outside the plurality of regions based on the received intensity adjustment of at least one of the plurality of regions and the interconnection of at least two of the plurality of regions; and applying the generated intensity adjustments to the image.

Abstract: A method compresses an image partitioned into blocks of pixels, for each block the method converts the block to a 2D matrix. The matrix is decomposing into a column matrix and a row matrix, wherein a width of the column matrix is substantially smaller than a height of the column matrix and the height of the row matrix is substantially smaller than the width of the row matrix. The column matrix and the row matrix are compressed, and the compressed matrices are then combined to form a compressed image.

Abstract: With the use of a vector quantization technique, an index image, which is obtained by replacing an image on a block-by-block basis, each block consisting of a predetermined number of pixels, with any of a plurality of different pixel patterns and representing the pixel patterns by index values of the respective pixel patterns, is decoded by referring to a code book containing the pixel patterns and the index values of the pixel patterns in association with each other. When decoding an index image on the block-by-block basis into pixel patterns corresponding to the index values, the pixel pattern of each block is scaled, and additionally pixels near a contour in the pixel pattern after scaling are redrawn based on contour vector information corresponding to the pixel pattern.

Abstract: A method of decoding a video signal is disclosed. The present invention includes determining whether to store a first partial picture when the first partial picture and a first full picture are corresponding to a first temporal point and storing the first partial picture for decoding a second full picture referring to the first partial picture, the second full picture being corresponding to a second temporal point, the second temporal point being located after the first temporal point, wherein a level of the first partial picture on a scalable domain is lower than a level of the second full picture on the scalable domain.

Abstract: A method, system, and apparatus are directed towards computing minimum mean squared error (MMSE) predictive-transform (PT) source coding integrated with subband compression to further improve the performance of low bit rate MMSE PT source coders. A desirable byproduct of the advanced scheme is that the incorporation of joint optimum prediction and transformation from subband to subband is ideally suited to its integration with JPEG2000 to yield even higher compression levels while producing an outstanding objective as well as subjective visual performance.

Abstract: A method for compressing an image includes decomposing the image into one or more regions. A region of the image is selected to be evaluated. The selected region is transformed and quantized if the region does not meet a predetermined compression acceptability criteria. The predetermined compression acceptability criteria may include a specific bit rate, a specific image quality, or combinations thereof. If the region does not meet the predetermined compression acceptability criteria after the region has been transformed and quantized, then the transformation and quantization settings are adjusted and the region is transformed and quantized using the adjusted settings. The region is then encoded when the predetermined compression acceptability criteria has been reached. The encoding may include additional compression stages.

Abstract: Complex image 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 linear prediction methodology to a subset of the holographic representation to obtain an autoregressive model. 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. The subset can be a plurality of complete rows; preferably substantially symmetric about 0 Hz.

Abstract: An encoding method encodes a first image signal of a first view and a second image signal of a second view. The method includes encoding the first image signal to generate a base stream. The method also includes encoding the second image signal to generate a dependent stream, and inserting a dependent delimiter indicating a picture boundary between pictures in the dependent stream at the beginning of a picture in the dependent stream.

Abstract: An image processing device includes a supply unit that supplies a coefficient data group in each sub-band, in which image data of a predetermined number of lines is decomposed for each frequency band by a hierarchical analysis filter process and which includes coefficient data of one line or more in a sub-band of at least a lowest frequency component, a synthesis filter unit that synthesizes the coefficient data group and generates image data in a baseband, a supply control unit that controls the supply unit to supply the coefficient data at such a timing that the synthesis filter unit can generate the image data at a timing corresponding to a horizontal synchronization period, and a synthesis filtering control unit that controls the synthesis filter unit to synthesize the coefficient data group in the predetermined order and generate the image data at a timing corresponding to the horizontal synchronization period.

Abstract: An image processing apparatus includes an extracting unit, a representative-image generating unit and a vector converting unit. The extracting unit extracts pixel blocks from image data. The representative-image generating unit generates representative images from the pixel blocks extracted by the extracting unit, based on a similarity between the pixel blocks. The vector converting unit converts the representative images generated by the representative-image generating unit into vector information.

Abstract: A method and system of transmitting a set of wavelet coefficients, the wavelet coefficients representing an image, comprising: arranging a set of wavelet coefficients into a spatially-oriented tree data structure of groups of wavelet coefficients, determining group significance levels for groups in the tree; computing encoded data associated with a refinement range, the refinement range describing a selection from the group consisting of one of an initial quality level and an incremented quality level, to which an image is encoded, the encoded data describing group significance levels in terms of partial scalar components, the partial scalar components related to the refinement range, the encoded data further describing portions of the set of wavelet coefficients that are within the refinement range; and transmitting the encoded data.

Abstract: In decoding a scalable video signal using a partial picture reference on a temporal domain and a scalable domain, the present invention provides a method including obtaining a first partial picture on a first temporal point, and decoding a full picture referring to the first partial picture, the full picture being on a second temporal point, the second temporal point being located after the first temporal point, wherein a level of the first partial picture on a scalable domain is lower than a level of the full picture on the scalable domain.

Abstract: Encoding image data and mask information to be used for matte images and for image and video matting. Image data and mask information for pixels of the image data in a first representation domain are accessed. The mask information defines background pixels and foreground pixels. The image data in the first representation domain is transformed to a second representation domain. Mask information in the second representation domain is determined by using the mask information in the first representation domain. The image data in the second representation domain is masked by setting image data to zero for background pixels as defined by the determined mask information in the second representation domain. The masked image data in the second representation domain is encoded.

Abstract: An image representation format for representing a digital image comprises: image information stored as a bitstream representing sequential image blocks, each block comprising one or more components, each component comprising one or more data units and each data unit being represented as a Huffman-coded stream of coefficients of basis functions, wherein a zeroth order coefficient is represented as a difference to the previous zeroth order coefficient of the corresponding component, and a block information table, which comprises: indicators to the first coefficient of a specified order of each image block in said bitstream, information indicating the number of bits in the bitstream between adjacent coefficients of said specified order of the image block, and the zeroth order coefficient of at least the first data unit of each component, said zeroth order coefficient being represented in a non-differential form.

Abstract: An image processing apparatus includes: a coefficient calculation unit that calculates a coefficient for converting image data having a predetermined number of pixels to image data having a smaller number of pixels than the predetermined number of pixels, including a coefficient multiplied by an integer power of 2, as a conversion coefficient; a calculation unit that multiplies each pixel value of image data prior to image reduction processing by the conversion coefficient previously calculated by the coefficient calculation unit thereby to calculate each pixel value of the image data subjected to the image reduction processing; and a shift unit that shifts each of the pixel values calculated by the calculation unit by a number of bits to counteract the integer power of 2-multiplied coefficient included in the conversion coefficient.

Abstract: A packetizing method for packetizing a bit stream in a packetizing apparatus. The packetizing method includes encoding, in an encoding unit in the multiplexing apparatus, a chroma component of image data using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation that adds a weight parameter and generating the bit stream. The method further includes packetizing, in a packetizing unit in the packetizing apparatus, the bit stream and generating a packetized stream.

Abstract: A multiplexing method for multiplexing a bit stream in a multiplexing apparatus. The method includes encoding, in an encoding unit in the multiplexing apparatus, a chroma component of image data using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation that adds a weight parameter and generating the bit stream. The method further includes multiplexing, in an multiplexing unit in the multiplexing apparatus, the bit stream and generating a system stream.

Abstract: A method for encoding a source image, wherein the source image includes a set of bitplanes of pixels, is disclosed. For each bitplane in a most to least significant order, the method include obtaining a list of significant pixels (LSP), a list of insignificant pixels (LIP), and a list of insignificant sets (LIS) according to a hierarchical ordering of the source image pixels; synchronizing the LSP, LIP and LIS of the source image with the LSP, LIP and LIS of a key image; constructing a temporary list of insignificant sets (TLIS) for the source image; and applying syndrome encoding to the LSP, LIP, and TLIS of the source image to obtain syndromes corresponding to magnitudes and signs of pixels in the source image, wherein the steps are performed in a processor.

Abstract: In an embodiment, a compression unit is provided which may perform compression of images with low latency and relatively little hardware. Similarly, a decompression unit may be provided which may decompress the images with low latency and hardware. In an embodiment, the transmission of compressed coefficients may be performed using less than two passes through the list of coefficients. During the first pass, the most significant coefficients may be transmitted and other significance groups may be identified as linked lists. The linked lists may then be traverse to send the other significance groups. In an embodiment, a color space conversion may be made to permit filtering of fewer color components than might be possible in the source color space.

Abstract: A sequence of n coefficients is compressed by determining a cost-determined sequence of n coefficient indices represented by a cost-determined sequence of (run, index derivative) pairs under a given quantization table and run-index derivative coding distribution, wherein each sequence of (run, index derivative) pairs defines a corresponding sequence of coefficient indices such that (i) each index in the corresponding sequence of coefficient indices is a digital number, (ii) the corresponding sequence of coefficient indices includes a plurality of values including a special value, and (iii) each (run, index derivative) pair defines a run value representing a number of consecutive indices of the special value, and an index-based value derived from a value of the index following the number of consecutive indices of the special value.

Abstract: Methods for compression of two-dimensional data arrays which are piece-wise smooth in one direction and have oscillating events in the other direction. In one embodiment, a wavelet transform is applied in the piece-wise smooth direction and a local cosine transform (LCT) is applied in the direction with oscillatory events, both producing respective transform coefficients. The LCT coefficients are reordered to mimic a wavelet transform coefficient order, and both wavelet transform and reordered LCT coefficients are quantized and entropy coded to obtain a compressed 2D image. In some embodiments with oscillatory events in both directions, a LCT is applied in both directions and all the LCT coefficients in each direction are reordered before the quantization and entropy coding.

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 sorting unit sorts a plurality of data sets of HP component having been processed by a decoding unit, selectively employing one of a first table corresponding to a first orientation of prediction and a second table corresponding to a second orientation of prediction in accordance with an orientation of prediction of HP component. The sorting unit includes an inverse prediction unit performing inverse prediction on data of LP component inputted from the decoding unit, a processing unit obtaining an orientation of prediction of HP component, based on the data of LP component after inverse prediction by the inverse prediction unit, and a selecting unit selecting one of the first and second tables, based on the orientation of prediction of HP component obtained by the processing unit.

Abstract: An image signal processing apparatus includes: a block division unit inputting an image signal encoded by orthogonal transformation and dividing the image signal into second blocks different from first blocks encoded using the orthogonal transformation; an activity calculation unit calculating an activity of each second block; a re-encoding unit encoding the second blocks using the orthogonal transformation; a re-encoded difference calculation unit calculating difference values between the second blocks and the first blocks; a class determination unit determining a class of each second block on the basis of a distribution of the difference value and the activity; a prediction coefficient generating unit generating a prediction coefficient corresponding to each class; a prediction tap construction unit constructing a prediction tap for calculating a target pixel in each second block; and a predictive operation unit operating the prediction tap and the prediction coefficient to calculate a pixel value of each t

Abstract: An image processing apparatus includes a receiving unit configured to receive image data of program content and genre information relating to the program content, a selection unit configured to select a size selection parameter for causing the genre information received by the receiving unit to be reflected in a block size, a determination unit configured to determine a block size in accordance with the size selection parameter selected by the selection unit, the block size being used for orthogonal transformation, and an orthogonal transformation unit configured to perform orthogonal transformation on the image data received by the receiving unit at the block size determined by the determination unit.

Abstract: A decoding apparatus includes a random number generating section and a decoding section. The random number generating section generates random numbers according to distribution of original data corresponding to respective quantization indexes. The decoding section generates decoded data on a basis of the random numbers generated by the random number generating section.

Abstract: A process and apparatus for lossless data compression including the step of generating characteristic tables for predicted intensities as a function of radius values f(i,j)) on at least one type of preferred axes. Intensity signals of a detector matrix (I(i,j)) are used to implement the invention.

Abstract: A low complexity visual masking method used as part of an image encoding process is described. The method is suitable for use in JPEG2000 image compression systems. Control weights used for rate allocation are generated based on integer order moments of wavelet transformed coefficients corresponding to a codeblock. The novel rate allocation weight generation method can, and in some embodiments is, combined with an apriori rate allocation algorithm, where allocation of bits to different portions of images is controlled as a function of one or more generated weights. The methods and apparatus of the present invention have the effect of increasing errors in busy areas of an image where they tend to be less noticeable and allocating a higher number of bits to less busy areas than some other systems, e.g., systems which attempt to minimize a mean squared error under a constraint of a user selected output rate.

Abstract: An image decoding method is for decoding a bit stream in an image decoding apparatus. The method includes receiving the bit stream and a weight parameter that is added to a luma quantization parameter by an addition operation. The method also includes decoding, in a decoding unit in the image decoding apparatus, the bit stream and generating a chroma component of quantized coefficients. In addition, the method includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the chroma component of quantized coefficients using the chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by the weight parameter.

Abstract: An apparatus for compressing data and optimizing transfer of the compressed data via a wireless link(s) may include a processor and memory storing executable computer code causing the apparatus to at least perform operations including compressing one or more samples of data corresponding to at least one image based in part on generating a plurality of wavelet coefficients. The wavelet coefficients correspond to the sampled data. The computer program code may further cause the apparatus to generate one or more messages including at least one of the wavelet coefficients. Each of the messages may include content denoting that one or more detected errors below a predetermined threshold are insufficient to inhibit reconstruction of the image. The computer program code may further cause the apparatus to enable transmission of the messages to a device(s) via at least one wireless link. Corresponding methods and computer program products are also provided.

Abstract: A variety of methods, devices, systems and arrangements are implemented for processing and coding of video images. According to one such implementation, a method is implemented for encoding a sequence of images. A plurality of orthogonal transforms is implemented on a set of N images, where N is greater than one. The images are linked by motion fields that include sets of respective portions of the images. In particular, the construction of a motion-compensated orthogonal transform is accomplished for the important case where at least one portion of any of the N images—or any part of this portion—is used more than once to motion-compensate other portions of the N images—or parts thereof.

Abstract: The invention relates to an image processing apparatus, method, and program that can more improve coding efficiency. In step S104, a bit shift changing unit (112) shift-changes depth data (D) acquired in step S103 by using a detected bit depth of image data, and adjust a bit depth of the depth data (D) to match a bit depth of the image data. In step S105, an encoding unit (113) encodes the image data and depth data (D). In step S106, a rate control unit (114) controls a rate of each encoding to be performed in step S105 based on a result of encoding of the image data and a result of encoding of the depth data performed in step S105. This curved face is set as a predictive image. The invention can be applied to, for example, an image processing apparatus.

Abstract: An apparatus, system, and method for image processing are disclosed, each of which obtains a mark from image data, detects additional information in the mark, determines whether the mark is detected in the mark to generate a determination result, and controls processing performed by an image processing apparatus with respect to the image data based on the determination result.