Abstract: A Hadamard transform-based image compression method includes performing a Hadamard transform on 2k pixel values according to a product of a 2k×2k stage Hadamard matrix and a 2k×2k adjustment matrix to generate 2k conversion values, where k is a positive integer and at least one of the 2k conversion values is zero. The adjustment matrix satisfies a condition that: when the 2k pixel values are divided into G pixel groups each comprising 2k/G adjacent pixels values and the adjustment matrix is multiplied with a first 2k×1 matrix formed by the 2k pixel values to transform the first 2k×1 matrix to a second 2k×1 matrix, each pixel value of the first matrix is transformed to an average of a pixel group comprising the pixel value to form the second 2k×1 matrix.

Abstract: This image feature extraction device extracts, from an image, an image feature that makes it possible to adjust the balance between identification capability and robustness, which are the scales of the capability of determining identity of images. This image feature extraction device executes hierarchical quantization to calculate quantization indexes of a plurality of hierarchies in accordance with a previously defined hierarchical quantization method for each quantization target region of an image, and outputs a hierarchical quantization index code, which is an encoding allowing unique specification of the quantization indexes of the respective hierarchies of each quantization target region.

Abstract: Provided is a rate-distortion optimizing apparatus and method for encoding a depth image. The rate-distortion optimizing apparatus may reduce a resolution in an area that does not include an edge that significantly affects image synthesis, and may use a high quantization parameter and thus, may provide a high compression performance.

Abstract: Chroma values in image data may be sub-sampled, thereby obtaining sub-sampled chroma values. The sub-sampled chroma values may be compressed, thereby obtaining compressed, sub-sampled chroma values. Luma values in the image data may be compressed, thereby obtaining sub-sampled luma values. Edge information for the luma values that are discarded as part of the luma sub-sampling operation may be determined.

Abstract: An image encoding device includes: a first encoding unit for encoding image data using a fixed-quantizing parameter to calculate a generated code amount; a second encoding unit for encoding the image data using multiple different quantizing parameters for each of the quantizing parameters as the image data of an intra picture to calculate a generated code amount; a code amount control unit for determining a quantizing parameter by predicting a quantizing parameter for realizing a target generated code amount, and a generated code amount when employing this quantizing parameter based on the generated code amount calculated at the first encoding unit, and correcting this predicted generated code amount according to the generated code amount calculated at the second encoding unit so as to realize the target generated code amount; and a third encoding unit for encoding the image data using the quantizing parameter determined at the code amount control unit.

Abstract: An exemplary embodiment of the invention relates to a method of using pattern vectors for image coding and decoding. The method comprises converting a block of image data into a set of transform coefficients, quantizing the transform coefficients such that a number of the coefficients become zero, constructing a single entity or bit vector indicating which coefficients are non-zero, coding the single entity or bit vector as an integer using an adaptive, semi-adaptive or non-adaptive arithmetic coder, coding the values of the coefficients in any fixed order, using an adaptive, semi-adaptive or non-adaptive arithmetic coder, or some other coder, and coding all coefficients except the zero coefficients. The system and method of decoding data relate to the corresponding hardware and process steps performed by the decoder when decoding a bitstream coded as described herein.

Abstract: A data compression system and a data compression method using the same are provided. The data compression method includes acquiring original data from a memory and performs image processing and quantization on the original data to transform the original data into a quantization matrix. The data compression method then transforms the quantization matrix into a digital sequence based on a coding table and compares the data volume of the digital sequence and a target volume to generate a volume difference. The data compression method transforms the digital sequence into an inverse quantization matrix based on the volume difference and then transforms the inverse quantization matrix into a modified digital sequence based on the volume difference. The data compression method repeats the processes until the data volume of the digital sequence is substantially equal to a target volume or within an acceptable range of the target volume.

Abstract: The invention relates to a scalable video (de)coding method for wireless transmission of high definition television signals. Scalable means that the bitstream contains successively smaller quality refinements and that the bitstream can be truncated. The video images are divided in slices, and each slice is divided in blocks of 8×8 pixels. For each block, an optimal encoding method is chosen. Depending on whether the block is found to contain natural or synthetic image content, transform coding (DCT) or graphic coding is applied. Because the different encoding modes have different properties as regards picture quality, the bitstream format has to enable the encoder to very flexibly choose which bits to send first. The bitstream format in accordance with the invention consists of a multitude of scans (31-34) through the coded data of a series of individual blocks, e.g. a slice. In each scan, the encoder decides whether it will include data for natural blocks (BS1,BS2), for synthetic blocks (BS0,BS1), or both.

Abstract: The image signature extraction device includes an extraction unit and a generation unit. The extraction unit extracts region features from respective sub-regions in an image in accordance with a plurality of pairs of sub-regions in the image, the pairs of sub-regions including at least one pair of sub-regions in which both a combination of shapes of two sub-regions of the pair and relative position between the two sub-regions of the pair differ from those of at least one of other pairs of sub-regions. The generation unit generates an image signature to be used for identifying the image based on the extracted region features of the respective sub-regions, using, for at least one pair of sub-regions, a method different from that used for another pair of sub-regions.

Abstract: The disclosure is directed to decoder-side region-of-interest (ROI) video processing. A video decoder determines whether ROI assistance information is available. If not, the decoder defaults to decoder-side ROI processing. The decoder-side ROI processing may estimate the reliability of ROI extraction in the bitstream domain. If ROI reliability is favorable, the decoder applies bitstream domain ROI extraction. If ROI reliability is unfavorable, the decoder applies pixel domain ROI extraction. The decoder may apply different ROI extraction processes for intra-coded (I) and inter-coded (P or B) data. The decoder may use color-based ROI generation for intra-coded data, and coded block pattern (CBP)-based ROI generation for inter-coded data. ROI refinement may involve shape-based refinement for intra-coded data, and motion- and color-based refinement for inter-coded data.

Abstract: A technique of approximating exponential transformations such as gamma correction is disclosed that achieves high resolution without requiring relatively large RAMs for lookup tables or specialized DSP processors. The technique includes the acts of scaling the pixel values according to their values, wherein smaller pixel values are scaled with larger scale factors and larger pixel values are scaled with smaller scale factors; quantizing the scaled pixel values; looking up the quantized pixel values in a lookup table to provide lookup values; and scaling the lookup values responsive to their scale factors to provide the gamma-corrected pixel values.

Abstract: Quantization for oversampled signals with an error minimization searches based upon clusters of possible sampling vectors where the clusters have minimal correlation and thereby decrease reconstruction error as a function of oversampling (redundancy) ratio.

Abstract: Provided is a video processing technique capable of carrying out noise reduction processing and image quality correction using a configuration that is typically used in decoding processing. A video processing device according to the present invention counts the number of blocks in which a quantization parameter in video exceeds a predetermined threshold value and calculates a noise amount in the video based on the count result. Further, an amount by which the noise is to be reduced is adjusted in accordance with the calculated noise amount.

Abstract: An image processing apparatus comprises a dither processing device that applies dither processing to input image data to express halftone using line screens by increasing an area rate of the input image data and a controller that decreases the number of line screens and maintains a prescribed dropout width between the neighboring line screens when the area rate of the input image data increases and the dropout width falls below a prescribed level.

Abstract: The present technology relates to an image processing apparatus and a method capable of performing a quantization process or an inverse quantization process more suitable for contents of an image. A lossless decoding unit 202 decodes coded data read from an accumulation buffer 201 at a predetermined timing. A sub macroblock inverse quantization unit 221 obtains a quantization value for each sub macroblock by using a quantization parameter supplied from an inverse quantization unit 203 and returns the same to the inverse quantization unit 203. The inverse quantization unit 203 inversely quantizes a quantization coefficient obtained by decoding by the lossless decoding unit 202 by using the quantization value for each sub macroblock supplied from the sub macroblock inverse quantization unit 221. The present technology may be applied to the image processing apparatus, for example.

Abstract: A video processor is described, which is useful for implementing a quantization process, in compliance with the H.264 standard. The video processor includes an input, for receiving a block of image data. The image data is loaded into an internal register. In response to receiving a SIMD instruction, a quantizer, which incorporates the quantization lookup tables associated with the H.264 standard in its associated hardware, makes necessary high-level quantization decisions. In response to receiving another SIMD instruction, the quantizer uses those high-level quantization decisions to retrieve specific values from the quantization lookup tables.

Abstract: Hierarchical data in which image data that represents an image at different resolutions is arranged according to the resolution comprises three types of data including a header, index blocks, and tile images. The header defines a plurality of areas produced by dividing the pyramidal hierarchical structure in the virtual space in which the hierarchical data is generated. A pointer pointing to one of the index blocks is set in each area. The index blocks are generated for the respective areas in the structure defined by the header. A pointer pointing to one of the tile images is defined for a position in the images in a plurality of layers belonging to each area. The images are image data actually used to render an image.

Abstract: An embodiment of the present disclosure relates to system comprises an encoding device. Said encoding device comprises a compression unit, a quantizer, a bit estimator, a bit rate encoder and a variable length encoder. An embodiment also is a method of encoding. Said method estimates a number of bits to encode a macroblock after compressing the data stream. Then the estimated bit encoded by a bit rate encoder and further quantized by the quantizer to get the final encoded bit stream. The number of bits required to encode a macroblock is estimated after the quantization process and before the encoding process. The macroblock bit estimator estimates the number of bits required to encode a particular macroblock depending on the quantized AC coefficients of that macroblock and the quantized AC coefficients of the neighboring frames normalized at a macroblock level.

Abstract: A geometric transformation parameter computing unit computes a geometric transformation parameter which represents the geometric transformation of an image from the previous frame to the current frame, and calculates the level of reliability in that geometric transformation parameter. A super-resolution image prediction unit generates a prediction of a super-resolution image in the current frame by transforming a super-resolution image in the previous frame on the basis of the geometric transformation parameter. A super-resolution image generation unit calculates a low-resolution image in the current frame from the prediction result of the super-resolution image in the current frame by a simulation, calculates a difference between a low-resolution image, which is an input image for the current frame, and the simulation result, and calculates a weighted mean between a result of upsampling the difference and the prediction result of the super-resolution image in the current frame.

Abstract: A method and apparatus is disclosed herein for image processing. In one embodiment, the method comprises performing an analysis corresponding to a sequence of drawing commands that create a bit-map when executed and generating a set of image segments based on the analysis corresponding to the sequence of drawing commands.

Abstract: An image processor that achieves reduction in delay amount, in comparison with code amount control GOP by GOP or frame by frame.

Abstract: An image compression device which compresses image data, including: a first quantization unit which performs a quantization mode 1 to quantize pixel values using two values A1 and B1 (A1<B1), in one range defined by A1 and B1; a second quantization unit which performs a quantization mode 2 to quantize the pixel values using two values A2 and B2 (A2>B2), in two ranges defined by A2 and B2; and a compressed data generation unit which generates compressed data including a value A, a value B, and quantized values of the pixel values quantized in a selected quantization mode, wherein the compressed data generation unit generates the compressed data using: A1 and B1 as A and B, respectively, when the quantization mode 1 is selected; and A2 and B2 as A and B, respectively, when the quantization mode 2 is selected.

Abstract: An image coding apparatus includes a first coding unit that discretely selects quantization parameters of a first range to perform calculation of generated code amounts corresponding to the selected quantization parameters, a second coding unit that performs calculation of generated code amounts corresponding to quantization parameters of a second range, a code amount control unit that decides deciding a temporary quantization parameter corresponding to a target code amount by calculating generated code amounts through an interpolation process for quantization parameters not selected by the first coding unit, and by comparing the generated code amounts corresponding to the selected quantization parameters and the generated code amounts calculated through the interpolation process with the target code amount, and decides an optimal quantization parameter corresponding to the target code amount by comparing the generated code amounts calculated by the second coding unit with the target code amount.

Abstract: A video transmission method is provided, which includes receiving state information from at least one mobile terminal that intends to perform a video stream service through a wireless network, determining a size of an image by selecting a specified spatial layer bit stream on the basis of the state information of the mobile terminal from a plurality of spatial layer bit streams generated at different bit rates during encoding of the bit stream, selecting a specified time and an SNR layer bit stream by increasing or decreasing time of the image and a layer position of the SNR layer bit stream on the basis of network parameters included in the state information of the mobile terminal, and transmitting the bit stream generated by extracting the specified layer bit stream of the selected layer to the mobile terminal.

Abstract: A method for scanning MacroBlocks in video compression and selecting alternative sized Large Macroblocks accordingly. The scanning pattern is divided into scanning fragments with a size corresponding to different possible Large Macroblocks. This allows for varying the size of the selected Macroblocks, based on minimizing distortion and/or bit rate consumption.

Abstract: The method and apparatus for offline video coding, as described herein, calculates per-frame QP offset contribution from the amount of temporal masking effect at a frame, and then properly combines the calculated per-frame QP offset contribution with the original QP offset contribution from the frame type. The resulting frame-level QP offset accounts for both the frame type and temporal masking effect, and hence, is more comprehensive.

Abstract: Hierarchical data in which image data that represents an image at different resolutions is arranged according to the resolution comprises three types of data including a header, index blocks, and tile images. The header defines a plurality of areas produced by dividing the pyramidal hierarchical structure in the virtual space in which the hierarchical data is generated. A pointer pointing to one of the index blocks is set in each area. The index blocks are generated for the respective areas in the structure defined by the header. A pointer pointing to one of the tile images is defined for a position in the images in a plurality of layers belonging to each area. The images are image data actually used to render an image.

Abstract: An apparatus capable of dividing an m-value image into a plurality of divided images and performing quantization into an n-value image (2?n<m) for each divided image includes a first quantization unit for quantizing a first region in the divided image similarly to a region to be joined, and a second quantization unit for sequentially quantizing a second region in the divided image including the first region. If the second quantization unit quantizes the first region, parameters for the quantization processing is corrected using a quantization result in the first quantization unit such that the quantization result approaches the quantization result in the first quantization unit.

Abstract: A Method and apparatus for encoding and decoding a multi-view image are provided. The method of encoding a multi-view image includes determining whether each of pictures included in multi-view image sequences is a reference picture referred to by other pictures included in the multi-view image sequences for inter-view prediction, and encoding the pictures using at least one of inter-view prediction and temporal prediction based on the determination result, thereby efficiently encoding and decoding the multi-view image at high speed.

Abstract: Examples disclosed herein relate to compressing an image by resizing an image and compressing the resized image based on frequency content. A processor may resize an image to a target size if the pixel area of the image is greater than the sum of the target pixel area plus a resizing tolerance. The processor may compress the image using a first data removal rule for a portion of the image of a first frequency range and using a second data removal rule for a portion of the image of a second frequency range.

Abstract: Various systems, methods, and programs embodied in computer readable media are provided for calibration of at least one half-tone density in a printer. In one approach, a method is provided comprising the steps of acquiring a plurality of half-tone density values from a respective plurality of test patches generated on a belt in the printer over a period of time, each of the test patches embodying an intended half-tone density, generating a mathematically smoothed half-tone density value from the half-tone density values, and calibrating a half-tone density in the printer based upon the mathematically smoothed half-tone density value.

Abstract: Image data is divided into blocks each of a 2×2 pixel size, and color-reduction processing is performed for the target block based on color data and attribute data of respective pixels forming the target block. A pattern flag indicating the layout pattern of color data contained in the target block is specified by comparing the color data of the respective pixels in the target block having undergone the color-reduction processing. Color data corresponding to a pixel at a position defined in advance in the block having undergone the color-reduction processing is extracted as color data of the first color. When it is determined that the number of colors in the block is one of two to four, color data of the second to fourth colors are extracted. The pattern flag, the color data of the first color of the block, and those of the second to fourth colors of the block are output.

Abstract: The present technique relates to image processing devices and methods for enabling more appropriate removals of block distortions. When the difference between the quantization parameter QPc of a current region C and the quantization parameter QPN of a neighboring region N is determined to be larger than a predetermined threshold value, a deblocking filter adjusts the deblocking filtering operation so that stronger filtering is performed on a boundary between the current region and the neighboring region. This disclosure can be applied to image processing devices, for example.

Abstract: A wavelet coefficient quantization method using a human visual model in an image compression process is provided, which is particularly suitable for remote sensing image compression. A wavelet-domain visual quantization model is obtained through experiments based on human visual characteristics, so as to reflect the relation between distortion of wavelet coefficient blocks and human visual characteristics. The model includes a luminance component, a masking component and a frequency component, where the luminance component is calculated by low frequency coefficients after the kth level wavelet transform, the masking component is calculated by high frequency coefficients of the second and third levels, and the frequency component is calculated by a statistical method. The method may be used in combination with any mainstream wavelet compression method such as EZW, SPIHT or EBCOT.

Abstract: System and method for converting source image data to tile data by (a) selecting a source image set, (b) computing a scaling value for the source image set, (c) selecting a base scale for a tile set to be created based on the scaling value, (d) establishing the tile set geographic bounds of the tile set, (e) converting the tile set geographic bounds, (f) for each source image from each source image set (i) determining source image geographic bounds of the source image, (ii) if there is an intersection between the source image geographic bounds and the tile set geographic bounds, (1) loading the source image from a LRU cache, if possible, (2) if the source image is not in the LRU cache, loading the source image into the LRU cache, (3) extracting image data from the source image at the intersection, (4) scaling the image data based on the base scale, (5) storing the scaled image data to a tile storage mechanism, (g) clearing the LRU cache, and (h) repeating steps (a) through (g) for each source image set.

Abstract: A method for transcoding from an MPEG-2 format to a VC-1 format is disclosed. The method generally comprises the steps of (A) decoding an input video stream in the MPEG-2 format to generate a picture; (B) determining a mode indicator for the picture; and (C) coding the picture into an output video stream in the VC-1 format using one of (i) a VC-1 field mode coding and (ii) a VC-1 frame mode coding as determined from the mode indicator.

Abstract: An image decoding apparatus for decoding a bit stream includes a decoding unit that decodes the bit stream and generates a chroma component of quantized coefficients. In addition, the image decoding apparatus includes a setting unit that sets a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation that adds a weight parameter. In addition, the image decoding apparatus includes a dequantization unit that performs dequantization on the chroma component of quantized coefficients using the chroma quantization parameter. Further, the image decoding apparatus includes a transform unit that performs an inverse orthogonal transform.

Abstract: Disclosed is an apparatus for decoding motion information in merge mode for reconstructing a moving picture signal coded at a low data rate while maintaining a high quality of an image. The apparatus for decoding motion information in merge mode discloses the position of a merge mode candidate and the configuration of a candidate in order to predict motion information in merge mode efficiently. Furthermore, a merge candidate indicated by the merge index of a current block can be efficiently reconstructed irrespective of a network environment by adaptively generating a merge candidate based on the number of valid merge candidate.

Abstract: First and second codewords are determined, based on first feature vector components of the image elements in an image block, as representations of a first and second component value. Third and fourth codewords are determined, based on second vector components, as representations of a third and fourth component value. First N1 and second N2 resolution numbers are selected based on the relation of a distribution of the first vector components and a distribution of the second vector components. N1 additional component values are generated based on the first and second component values and N2 additional component values are generated based on the third and fourth component values. Component indices indicative of the generated component values are then provided for the different image elements.

Abstract: A Method and apparatus for encoding and decoding a multi-view image are provided. The method of encoding a multi-view image includes determining whether each of pictures included in multi-view image sequences is a reference picture referred to by other pictures included in the multi-view image sequences for inter-view prediction, and encoding the pictures using at least one of inter-view prediction and temporal prediction based on the determination result, thereby efficiently encoding and decoding the multi-view image at high speed.

Abstract: Embodiments of the present invention include systems and methods for processing and coding image data. In one embodiment, image data is coded using a first image coding process. If a bit rate constraint is satisfied, the image data is output. If the bit rate constraint is not satisfied, the image data is coded using a second different coding process. In one embodiment, the second coding process is a layered coding process. In another embodiment, if the constraint is satisfied, quantization data may be included in the output, and may be coded using layered coding. Variable length coding processes and hardware implementations are further disclosed for efficient image processing.

Abstract: A codec includes an encoder having a quantization level generator that defines a quantization level specific to a block of values (e.g., transform coefficients), a quantizer that quantizes the block of transform coefficients according to the block-specific quantization level, a run-length encoder, and an entropy encoder. The quantization level is defined to result in at least a predetermined number (k) of quantized coefficients having a predetermined value. The amount of data compression by the encoder is proportional to (k). The codec also includes a decoder having entropy and run-length decoding sections whose throughputs are proportional to (k). The decoder takes advantage of this increased throughput by further decoding coefficients in parallel using a plurality of decoding channels. Methods for encoding and decoding data are also disclosed. The invention is well-suited to quantization, entropy, and/or run-length-based codecs, such as JPEG.

Abstract: Image data is divided into blocks each of a 2×2 pixel size, and color-reduction processing is performed for the target block based on color data and attribute data of respective pixels forming the target block. A pattern flag indicating the layout pattern of color data contained in the target block is specified by comparing the color data of the respective pixels in the target block having undergone the color-reduction processing. Color data corresponding to a pixel at a position defined in advance in the block having undergone the color-reduction processing is extracted as color data of the first color. When it is determined that the number of colors in the block is one of two to four, color data of the second to fourth colors are extracted. The pattern flag, the color data of the first color of the block, and those of the second to fourth colors of the block are output.

Abstract: A decoding method decodes a bit stream in an image decoding apparatus. The method includes decoding, in a decoding unit in the image decoding apparatus, the bit stream, and generating a luma component of quantized coefficients and a chroma component of quantized coefficients. The method also includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the luma component of quantized coefficients and the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation.

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

Abstract: An image decoding apparatus for decoding a bit stream includes a decoding unit that decodes the bit stream and generates a chroma component of quantized coefficients. The image decoding apparatus also includes a dequantization unit that performs a dequantization on the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation. Further, the image decoding apparatus includes a transform unit that performs an inverse orthogonal transform.

Abstract: To reduce artifacts caused by quantization errors in image compression systems, an offset is added to quantized samples at low frequency sections of a macroblock. A decoder uses the offset after decoding to bring the decoded sample closer to the original pre-encoded and pre-quantized sample, thereby compensating for quantization errors.

Abstract: A method and system for generating a cartoon are provided. The method includes receiving a digital image for processing at a server. The method includes executing a color structure coding procedure to produce a color-reduced interim image. The method includes generating a sketch from the digital image with a Difference of Gaussian procedure. The method includes combining the color-reduced interim image and the sketch into a processed cartoon.

Abstract: An image processing apparatus includes a quantizer configured to quantize orthogonal transform coefficients of the difference in block units between a coding target picture and a prediction image, a predictor configured to conduct parallax prediction utilizing correlations between the coding target picture and a picture whose view differs from the coding target picture, and a quantization controller configured to determine a protected area that protects image quality from the parallax prediction results, and reduce the quantization step size of the quantizer for quantization of the protected area.

Abstract: Architecture that employs texture sensitive temporal filtering to reuse motion estimation information in a realtime encoder. The temporal filter is applied for classified static areas. The architecture reuses the motion estimation results on motion vectors, cost estimates (e.g., sum of absolute difference (SAD)), and edge awareness texture information to apply the temporal filter on the current picture. Filtering can be applied at the pixel level, block level or macroblock level.