Abstract: A method for processing an image includes: identifying a group of keypoints in the image; for each keypoint of the group; a) calculating a corresponding descriptor array including a plurality of array elements, each array element storing values taken by a corresponding color gradient histogram of a respective sub-region of the image in the neighborhood of the keypoint; b) generating at least one compressed descriptor array by compressing at least one portion of the descriptor array by vector quantization using a codebook including a plurality of codewords.

Abstract: An image encoding and/or decoding apparatus and method are provided. The image encoding apparatus includes: a transform unit removing spatial redundancy by transforming an original image being input; an allowable noise obtaining unit obtaining an allowable noise from the original image; a quantization parameter determination unit determining a quantization parameter by using the allowable noise; a quantization unit generating a quantized coefficient, by quantizing a transform coefficient provided from the transform unit by using the quantization parameter; and an entropy encoding unit entropy encoding the quantized coefficient to remove statistical redundancy.

Abstract: A method for compressing graphics data comprises selecting z-planes from a plurality of z-planes. The selected z-planes are predictor z-planes. A residual is determined for each sample not covered by one of the predictor z-planes. A sample is covered by one of the predictor z-planes when the predictor z-plane correctly defines a z-value of the sample. A residual comprises a value that is a difference between a predicted z-value provided by one of the predictor z-planes and an actual z-value for the sample. The predictor z-planes and the residuals are stored in a z-buffer.

Abstract: Embodiments of the invention relate to an image or raster compression method that includes receiving pixel data for a raster comprising a two dimensional (2D) array of pixels where each pixel is associated with a data value. The method further includes receiving a user defined parameter defining a maximum error allowable per pixel for a compression algorithm. The raster can be divided into a number of pixel blocks where each pixel can be quantized and bit stuffed based on a number of block statistics including the maximum error allowable. The method further includes executing the compression algorithm wherein for each pixel, where an error caused by the compression algorithm is equal to or less than the maximum error allowable, and encoding the pixel data based on the compression algorithm. In certain embodiments, the compression algorithm is a non-transform compression algorithm.

Abstract: Effective color-aware search of a collection of content associated with one or more images is enabled. Content and/or its associated images may be automatically associated with representative palette colors in a suite of color palettes. Color palettes may be of a variety of types and have a hierarchical structure in which lower levels enable increasingly subtle distinctions between shades of color. Color palette hierarchies may be effectively presented, and appropriate portions emphasized based on associated search result sets. Search result sets may be refined and/or reordered in accordance with color palette selections and/or representative confidences of color palette selections for items at least referenced therein.

Abstract: A method and an apparatus for 3D model compression are described. Correlation among the components of the 3D model are explored and utilized to increase the compression ratio. A principal parameter is selected and examined for determining a sorting dimension. Components are then sorted according to the sorting dimension. The principal parameter values of the sorted components are incrementally encoded. Other parameters are encoded as usual. The corresponding decoder decodes the principal parameter values of the components incrementally and decodes other parameter values as usual. Further an adaptive bit determination algorithm is disclosed to adaptively determine the number of bits assigned to each parameter value based on the value range thereof and the distortion requirements.

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: A method for context-modeling coding information of a video signal for compressing or decompressing the coding information is provided. An initial value of a function for probability coding of coding information of a video signal of an enhanced layer is determined based on coding information of a video signal of a base layer.

Abstract: Provided is a method for assessing image quality using quantization codes, which includes: filtering an original image and a distorted image; generating phase quantization codes from the filtering result; calculating a Hamming difference between the phase quantization code of the original image and the phase quantization code of the distorted image; and assessing image quality of the distorted image by using the calculated Hamming difference. According to the present disclosure, since pixel values of the original image and the distorted image are mapped onto a quantized complex plane and then binary code operation is performed, it is possible to easily implement image quality assessing hardware and also ensure excellent image quality assessing performance.

Abstract: Provided are an adaptive image compression system and method. The adaptive image compression method includes a step of determining, at an adaptive image compression system, characteristics of an image that is to be compressed, a step of determining, at the adaptive image compression system, a quantization scale factor based on the characteristics of the image that is to be compressed, a step of generating an adaptive quantization table corresponding to the image that is to be compressed based on the determined quantization scale factor, and a step of encoding the image that is to be compressed using the generated adaptive quantization table.

Abstract: A binary image downsampling method, including the steps of generating a gray-scale image from a binary image having a background and one or more foreground portions, locating skeleton pixels in the one or more foreground portions, manipulating values of certain foreground pixels in the gray-scale image such that the differences between the values of the skeleton pixels and the background pixels become more significant, downsampling the gray-scale image with the manipulated values of the certain foreground pixels, and generating a downsampled binary image from the downsampled gray-scale image.

Abstract: Systems and methods for generating presentationally-rich email messages having imagery and variable height content entry areas that are compatible across multiple email readers.

Abstract: An encoding method and system using block-based quantization levels. In the encoding method, the encoding system calculates a feature value according to an image characteristic corresponding to a subject block to be quantized, the subject block being included in image information to be compressed, determines a quantization level of the subject block based on the calculated feature value of the subject block, quantizes the subject block with the determined quantization level, and determines a quantization level of at least one block from among blocks included in the image information to be compressed. The quantization level of the at least one block is different from the quantization level of the subject block.

Abstract: Encoders compress 3D images and compensate for decoding error using instance component decoders which decode instance components of the 3D image to generate decoded instance components, error calculation units which compare the decoded instance components with corresponding uncompressed instance components to calculate decoding errors, and determination units which determine if the encoded components pass a verification according to a threshold based on the decoding errors.

Abstract: A video coding device includes a buffer simulation unit that calculates an occupation amount of a virtual buffer to be used for controlling a coding amount, by using, for each picture, (a) a code length of a code that is an intermediate result of compression coding and (b) a code length of a compressed code that is a final result of the compression coding. This means that, for a picture that has not yet processed by an arithmetic coding unit, an occupation amount of the virtual buffer is calculated by using a code length of codes provided from a binarization unit.

Abstract: There is provided an image processing apparatus including a quantization unit that quantizes an image subjected to logarithmic conversion such that a quantization error is focused on a luminance region in which expansion of an error caused due to logarithmic inverse-conversion which is inverse conversion of the logarithmic conversion is relatively small or a luminance region in which no expansion of the error occurs; and an encoding unit that encodes an index image obtained through the quantization by the quantization unit.

Abstract: An encoder for encoding a video stream or an image is described herein. The encoder receives an input video stream and outputs an encoded video stream that can be decoded at a decoder to recover, at least approximately, an instance of the input video stream. The encoder includes an encoding logic reducing a color spectral resolution of the input video stream to a range of colors or color differentials similar to that recognizable by a human eye, whereby an encoding efficiency is increased by the color spectral resolution reducing.

Abstract: An image processor comprises an image pre-processing block and an encoder processing block for processing and encoding an image. The image pre-processing block receives image data and processes it to provide an image comprising image sections which each comprise pixels. For each of the image sections, the pixels are analysed to estimate an indication of the complexity of the image section, and metadata is determined based on the estimated complexity indications of the image sections. The metadata is passed to the encoder processing block which uses it to determine a quantization level for use in encoding the image. The encoder processing block can then encode the image using the determined quantization level. Conveniently, the image pre-processing block 106 processes the image data to provide the image, and therefore has access to the image which it can analyse to determine the metadata without requiring a separate read operation of the image.

Abstract: Implementations of the present disclosure are directed to a method, system, and computer-readable medium for choosing ink colors for a screen printing process. An image to be reproduced with the screen printing process is obtained, and sample pixels within the image are selected. For each sample pixel, if the color of the sample pixel is not similar to an already chosen ink color, neighboring pixels around the sample pixel are identified. When the colors of the sample pixel and its neighboring pixels are similar, an ink color is chosen to be a representative color of the sample pixel and its neighboring pixels.

Abstract: Some aspects of the disclosure relate to a compression technique that can permit determining dynamically a satisfactory quantization matrix based at least on properties intrinsic to a digital object being compressed and a predetermined compression quality criterion, wherein the quantization matrix is associated with a specific space-domain-to-frequency-domain transforms. In one aspect, the compression technique can permit creation of a compressed digital object that can satisfy a predetermined a compression quality criterion.

Abstract: An apparatus for decoding an image includes an encoding information extractor which extracts split information indicating whether to split a coding unit of an upper depth into coding units of deeper depths and skip information indicating whether a prediction mode of a current coding unit is a skip mode, from image data and a decoding unit which determines a split structure of a maximum coding unit, according to the split information so that the maximum coding unit is hierarchically split as a depth increases and determines whether the prediction mode of the current coding unit is the skip mode according to the skip information.

Abstract: Systems and methods for compressing a depthmap are provided. In some aspects, a system includes an encoding module configured to determine a minimum value and a maximum value of a depthmap. The encoding module is further configured to normalize the depthmap based on the minimum value, the maximum value, and an encoding model. The normalized depthmap includes a scalar value for each pixel of the depthmap. The system also includes a compression module configured to compress the normalized depthmap.

Abstract: A statistical value calculation part specifies macroblocks positioned around an object macroblock and calculates a minimum average value of activities of the macroblocks. When images of the macroblocks are flat and the minimum average value is smaller than an activity of the object macroblock, the minimum average value is set as an adjustment value. A correction factor determination part determines a correction factor on the basis of the adjustment value and a factor determination table. By multiplying a reference quantization step value by the correction factor, a quantization step value of the object macroblock is determined. Since the quantization step value reflects a distribution of the activities of the macroblocks, it is possible to suppress a local change of the quantization step value.

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: In an image processing apparatus, an object region is extracted from image data that has been input, and an important region where degradation in image quality is to be reduced is selected with use of a feature quantity of image data of the object region or a peripheral region in a periphery of the object region. Among portions of the input image data, an image data portion outside of the important region is compressed and encoded with use of a first quantization step value, and an image data portion of the important region is compressed and encoded with use of a second quantization step value that is smaller than the first quantization step value.

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: A method, system and computer software product for improving rate-distortion performance while remaining faithful to JPEG/MPEG syntax, involving joint optimization of Huffman tables, quantization step sizes and quantized coefficients of a JPEG/MPEG encoder. This involves finding the optimal coefficient indices in the form of (run, size) pairs. By employing an interative process including this search for optimal coefficient indices, joint improvement of run-length coding, Huffman coding and quantization table selection may be achieved. Additionally, the compression of quantized DC coefficients may also be improved using a trellis-structure.

Abstract: A display system includes: a display device, a transmitting device which generates compressed data by performing a compression process on image data corresponding to a display image, and a driver which drives the display device in response to the compressed data received from the transmitting device. The driver includes: a decompression circuit which generates decompressed data by decompressing the compressed data, an FRC circuit configured to perform an FEC process on the decompressed data to generate display data and a drive circuit which drives the display device in response to the display data. The following relation holds: m2>m3>m1, where m1 is a number of bits of the compressed data per pixel, m2 is a number of bits of the decompressed data per pixel and m3 is a number of bits of the display data per pixel.

Abstract: 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 decodes coded data read from an accumulation buffer at a predetermined timing. A sub macroblock inverse quantization unit obtains a quantization value for each sub macroblock by using a quantization parameter supplied from an inverse quantization unit and returns the same to the inverse quantization unit. The inverse quantization unit inversely quantizes a quantization coefficient obtained by decoding by the lossless decoding unit by using the quantization value for each sub macroblock supplied from the sub macroblock inverse quantization unit.

Abstract: According to one embodiment, an image encoder includes a sorter, a PCM (pulse code modulation) pixel inserter, an encoding unit and an output stream generator. The sorter accepts an input stream comprising a plurality of original pixels included in original image data in a raster scan order and changes arrangement of the original pixels to generate sorted data. The PCM pixel inserter outputs a PCM pixel in accordance with a predetermined PCM pixel insertion interval. The encoding unit conducts difference encoding processing by using the PCM pixel and the sorted data to generate encoded data. The output stream generator inserts the PCM pixel at a PCM insertion position in the encoded data corresponding to a coordinate of the original pixel to generate an output stream.

Abstract: The techniques and arrangements described herein provide for layered compression of depth image data. In some examples, an encoder may partition depth image data into a most significant bit (MSB) layer and a least significant bit (LSB) layer. The encoder may quantize the MSB layer and generate quantization difference data based at least in part on the quantization of the MSB layer. The encoder may apply the quantization difference data to the LSB layer to generate an adjusted LSB layer.

Abstract: A method of deblocking an input signal is disclosed. The method generally includes the steps of (A) calculating a plurality of transform coefficients corresponding to each of a plurality of blocks in the input signal at baseband, (B) calculating a plurality of quantization parameters based on the transform coefficients, at least one of the quantization parameters corresponding to each respective one of the blocks and (C) generating an output signal by deblocking the input signal based on the quantization parameters.

Abstract: A machine may be configured to process an uncompressed image to obtain a set of intermediate images, which may be alternatively known as working images or temporary images. Such a set of intermediate images may be used as input for an image compression algorithm that, when executed by the machine or other compression engine, outputs a compressed version of the uncompressed image. For example, a compression format called “PVRTC,” which may be used on certain portable devices, accepts a set of three intermediate images as input, specifically, one full resolution, low precision version of the original uncompressed image, plus two low resolution, low frequency color versions of the original uncompressed image. A set of intermediate images for such a compression format may be generated by the machine from the original uncompressed image.

Abstract: An image processing method suitable for a printer unit, includes an error diffusion halftoning process arranged for quantizing and diffusing each pixel of an image including a set of subtractive primary colors (C?, M?, Y?), in an image including a quantized printer image including a set of ink drops (DC, DM, DY, Dc, Dm) of respective ink channels to be printed. The method comprises the step of determining, for each pixel, an input variable value (S) representing a measure of solvent quantity that should be ejected by the printer unit for each pixel, the input variable value being computed on the basis of the value of a corresponding pixel of the image including the set of subtractive primary colors (C?, M?, Y?), and of inputting the determined input variable value (S) in the error diffusion halftoning process together with the values of the corresponding pixel. The invention further relates to the apparatus embodying the method.

Abstract: A portable electronic device is provided. The portable electronic device includes a processor for providing encoding data and an LCD module coupled to the processor. The processor includes an encoder for encoding a frame data to generate the encoding data. The LCD module includes a driver and an LCD coupled to the driver. The driver includes a decoder for decoding the encoding data to obtain an image data. The LCD displays the image data.

Abstract: According to one embodiment, an image encode controller includes a chroma component adjuster, a difference generator, a quantizer, an inverse-quantizer, and a variable codeword length encoder. The chroma component adjuster adjusts an original color component in accordance with a quantization coefficient to generate an adjusted chroma component. The difference generator generates a difference pixel component. The quantizer quantizes an output of the difference generator based on the quantization coefficient. The inverse-quantizer inversely quantizes an output of the quantizer based on the quantization coefficient. The variable codeword length encoder performs variable codeword length encoding with respect to an output of the quantizer to generate encoded data.

Abstract: An image coding method includes: (i) determining, for each of one or more associated blocks, whether to add a motion vector of the associated block to a list, and (ii) adding the motion vector of the associated block to the list when determining that the motion vector of the associated block is to be added to the list; selecting, from the list, a motion vector which is to be merged to a current block; and (i) merging the selected motion vector to the current block, and (ii) coding the current block using the merged motion vector as a motion vector of the current block, and in the determining, it is determined that the motion vector of the associated block is not to be added to the list when an associated picture and an associated reference picture match temporally or when a current picture and a current reference picture match temporally.

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 of noise filtering of a digital video sequence is provided that includes computing a motion image for a frame, wherein the motion image includes a motion value for each pixel in the frame, and wherein the motion values are computed as differences between pixel values in a luminance component of the frame and corresponding pixel values in a luminance component of a reference frame, applying a first spatial noise filter to the motion image to obtain a final motion image, computing a blending factor image for the frame, wherein the blending factor image includes a blending factor for each pixel in the frame, and wherein the blending factors are computed based on corresponding motion values in the final motion image, generating a filtered frame, wherein the blending factors are applied to corresponding pixel values in the reference frame and the frame, and outputting the filtered frame.

Abstract: A JPEG decoder having a scaling function includes an inverse discrete cosine transform block, wherein the JPEG decoder selectively performs an inverse discrete cosine transform on a part of pixel data of a macroblock through the inverse discrete cosine transform block and outputs a scaled image file. The JPEG decoder and the scaling method using the JPEG decoder increase a decoding speed, thereby enabling an image to be output in real time, especially when the JPEG decoder and/or the scaling method are applied to a mobile field. Also, the JPEG decoder and the scaling method using the JPEG decoder can achieve an efficient scaling, even without a separate circuit for scaling, thereby reducing a circuit size and the number of components.

Abstract: A computerized method for independent disjoint block-level recompression of a first image generated by independent coding of disjoint blocks in a precursor image, the first image having at least one first quantization matrix associated therewith, the method comprising performing at least one independent disjoint block-level compression operation, using a processor on the first image, thereby to generate a re-compressed second image including generating a new quantization matrix and using the new quantization matrix for the independent disjoint block-level compression, including computing a rounding error created by the quantization process utilizing the new quantization matrix and, if needed, adjusting at least one value of the new quantization matrix to reduce a rounding error created by the quantization process utilizing the new quantization matrix.

Abstract: Encoding data includes: determining multiple patterns for computing one-dimensional transforms over a first array of data elements. Each pattern includes multiple subsets of data elements of the first array. Each subset included in a first pattern has substantially the same number of data elements as each of the other subsets included in the first pattern. Each data element of the first array is included in a single one of the subsets included in the first pattern. At least one subset included in the first pattern consists of data elements that are not in a contiguous sequence along a single dimension. Encoding the data includes: computing, for each pattern, multiple one-dimensional transforms over data elements of respective subsets included in the pattern; selecting a set of transform coefficients from a group of multiple sets of transform coefficients; and encoding the selected set of transform coefficients to represent the first array.

Abstract: The present disclosure relates to an image processing device and a method that can suppress decreases in encoding efficiency. An image processing device of the present disclosure includes: a transform unit that transforms the quantization parameter used in quantization of image data into parameters; and a transmission unit that transmits the parameters generated from the quantization parameter transformed by the transform unit. For example, at the time of encoding of image data, the quantization parameter of the image data is divided by 2 and is transformed into a parameter indicating the quotient and a parameter indicating the remainder, and the parameters are transmitted. The present disclosure can be applied to image processing devices.

Abstract: A method is disclosed. The method includes generating a Continuous Tone Image (CTI) with all pixel values same as a first gray level, generating an initial Half Tone Image (HTI) with all pixel values equal to minimum absorptance level and computing a change in pixel error for a first pixel. The change in pixel error is computed by identifying a first pixel indicated in a valid pixel map, toggling the first pixel with all the possible output states and swapping the first pixel with all neighbor pixels only if the stacking constraint is satisfied, updating the HTI with the maximum error decrease operation and continue to next pixel location till the end criteria is met.

Abstract: A method for progressively encoding image tile data is disclosed. The method may include receiving indication that image tile data is to be updated. The method may further include dividing the image tile data into one or more parts and encoding an initial data part in a first pass. The method may also include transmitting first pass data to a client. The method may then include reintroducing at least a portion of the data removed from the initial data part to form a second data part, encoding the second data part in a second pass, and transmitting the second pass data to the client.

Abstract: Disclosed embodiments are directed to methods, systems, and circuits of generating compact descriptors for transmission over a communications network. A method according to one embodiment includes receiving an uncompressed descriptor, performing zero-thresholding on the uncompressed descriptor to generate a zero-threshold-delimited descriptor, quantizing the zero-threshold-delimited descriptor to generate a quantized descriptor, and coding the quantized descriptor to generate a compact descriptor for transmission over a communications network. The uncompressed and compact descriptors may be 3D descriptors, such as where the uncompressed descriptor is a SHOT descriptor. The operation of coding can be ZeroFlag coding, ExpGolomb coding, or Arithmetic coding, for example.

Abstract: Encoding input data includes: generating a first block of coefficients based on a transform performed on a residual block of data for multiple pixels; generating reference information based on a reference block of data corresponding to the residual block of data; and determining losslessly decodable code values representing the first block of coefficients based on the reference information.

Abstract: A system and method for the identification and analysis of cadence pattern is disclosed. The method uses previous and current fields to generate the difference between the field values. The difference of these values along with the field relations is passed to the state machine to generate the state of the top and bottom fields. Based on the top and bottom state the cadence signature is generated and by using the Fourier analysis the principle frequency of repeated cadence pattern signature sequence is identified. Each of the cadence signatures present in the cadence pattern signature sequence is decoded to calculate the pull-down value of the cadence pattern. The pull down value then gives the actual cadence pattern.

Abstract: A method, system and computer software product for improving rate-distortion performance while remaining faithful to JPEG/MPEG syntax, involving joint optimization of Huffman tables, quantization step sizes and quantized coefficients of a JPEG/MPEG encoder. This involves finding the optimal coefficient indices in the form of (run, size) pairs. By employing an interative process including this search for optimal coefficient indices, joint improvement of run-length coding, Huffman coding and quantization table selection may be achieved. Additionally, the compression of quantized DC coefficients may also be improved using a trellis-structure.

Abstract: Distances between data are encoded by performing a random projection, followed by dithering and scaling, with a fixed scaling for all values. The resulting dithered and scaled projection is quantized using a non-monotonic 1-bit quantizer to form a vector of bits representing the signal. The distance between signals can be approximately calculated from the corresponding vectors of bits by computing the hamming distance of the two vectors of bits. The computation is approximately correct up to a specific distance, determined by the scaling, and not beyond that.