Abstract: A system and method uses the capabilities of a geometry shader unit within the multi-threaded graphics processor to offload data compression computations from a central processing unit (CPU), reduce the memory needed to store image data, and reduce the bandwidth needed to transfer image data between graphics processors and between a graphics processor and a system memory. The multi-threaded graphics processor is also configured to perform decompression of the variable length compressed data using the geometry shader unit.

Abstract: An image processing device configured to compress image data to be used for printing with a plurality of compression levels having different compression rates includes a former stage compression unit, a storing unit and a latter stage compression unit. The latter stage compression unit is configured, after the former stage compression unit finishes compressing all of the areas, to recompress each of areas of a latest compression level at the moment being different from a compression level stored in the storing unit with the latest compression level.

Abstract: To resize a compressed image, first and second scaling parameters P and Q are determined in accordance with the block numbers L and M and the scaling ratio L/M or M/L. A non-uniform, or uneven, sampling in the DCT domain is then applied to coefficients of successive blocks in the compressed image in accordance with the scaling parameters. In an embodiment, P blocks are sampled and transformed from a given block length to |P| according to a |P|-point IDCT, while Q blocks are sampled and transformed from a given block length to |Q| according to a |Q|-point IDCT. The non-uniformly sampled and transformed pixel domain samples are then regrouped into a predetermined block size and transformed back to generate the DCT coefficient of the compressed image. The proposed method significantly reduces the computational complexity compared with other DCT domain arbitrary ratio image resizing approach.

Abstract: Down-sampling of an image may be performed in the DCT domain. Transform matrices are obtained for down-sampling a DCT image of size M×N to a down-sampled DCT image of size I×J. The transform matrices may be used to down-sample the DCT image directly in the DCT domain. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. The transform matrices are selected by solving an optimization problem, leading to transform matrices which achieve a desired trade-off between the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method.

Abstract: A variable guilloche includes at least two guilloche curves, printed in a common space and having at least one point of overlap. The at least two curves are plotted from equations having variables corresponding to a specified data string of steganographic information.

Abstract: In accordance with the present disclosure, there is provided a method for compensating tones on a compressed digital image data. The method comprises generating the compressed digital image from an input digital image data using a wavelet-based compression method; recovering a low resolution version of the input digital image data from the compressed digital image data by partially decompressing the compressed digital image; applying compensating tone reproduction curves (TRC) to the low resolution version of the input digital image data to generate a compensated low resolution image; re-compressing the image using the compensated low resolution image; and, subsequently decompressing all of the compensated pixel arrays to produce decompressed compensated image data.

Abstract: The invention concerns a method for processing images, texture pattern blocks representative of a typical texture of the images being stored in a memory, the method comprising the following steps: transforming the pixel grey levels of a current block into a current block of frequency coefficients using a predefined transform; building up a merger block, each frequency coefficient positioned at a defined place of the merger block being equal either to the frequency coefficient positioned at the same place of the current block, or to the frequency coefficient positioned at the same place of a texture pattern block among the texture pattern blocks stored in the memory; selecting a merger block according to a predefined function (J); and replacing in the image the current block by the selected merger block. The invention also concerns an electronic device for processing the corresponding images.

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: A variable data addition method and system are disclosed herein. The method includes generating an original image, and defining at least one sub-section of the original image to transform individually. A reversible transformation is applied to the defined at least one sub-section, thereby altering the original image to form an altered image that is non-readable until an inverse of the reversible transformation is applied to the altered image.

Abstract: An image encoding method for encoding an image in an image encoding apparatus. The encoding method includes: performing, in a quantization unit in the image encoding apparatus, quantization on a chroma component of transform coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation that adds a weight parameter; encoding, in an encoding unit in the image encoding apparatus, a chroma component of quantized coefficients and generating a bit stream; and transferring the bit stream and the weight parameter.

Abstract: A discrete cosine transformation circuit comprising a pipeline with a memory stage and an arithmetic stage. The arithmetic stage comprises first and second arithmetic logic units (ALU). Each of the ALUs receives from the memory a set of image data, performs a first calculation on the set of image data and outputs calculation result thereof in a first clock cycle. A path in the circuit directs the result to the memory stage, such that at least one ALU can selectively receive the result from the path in a clock cycle subsequent to the first clock cycle.

Abstract: A visual summary of the image sequences is generated, displaying at least one image from a plurality of the image sequences. Color correction is applied to a feature in one of the displayed images and images comprising at least one feature being close to the color corrected feature according to a distance criterion are selected, displayed, and color correction, based on the color correction to the feature, is applied to the features in the selected images. An apparatus is also provided.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: An image compression method and a device thereof are provided. In the image compression method, a block image having a plurality of pixels is received. In the block image, an adjusted value of a first pixel is compared with a threshold value, and the adjusted value of the first pixel is accordingly quantized as a first parameter value or a second parameter value so as to obtain a quantized value of the first pixel. Next, an error value between the adjusted value of the first pixel and the quantized value of the first pixel is distributed to at least one second pixel adjacent to the first pixel according to an error diffusion kernel. The first pixel and the second pixel are respectively one of the above pixels. Therefore, the quality of the compressed image is improved and the influence of the blocking effect is reduced.

Abstract: An image information decoding method for decoding a bit stream in an image decoding apparatus. The decoding process includes decoding, in a decoding unit in the image decoding apparatus, the bit stream and generating a chroma component of quantized coefficients; and performing, in a dequantization unit in the image decoding apparatus, 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.

Abstract: Techniques are generally described to determine whether a JPEG image has undergone two compressions. Probabilities can be computed for the first digits of quantized DCT (discrete cosine transform) coefficients from a set of AC (alternate current) modes to detect or determine whether the JPEG image has undergone two compressions. The set of AC modes may include a predetermined number of distinguishable AC modes where a distinguishable AC mode may be an AC mode in which a second quantization step (QS2) is not an integer multiple of the first quantization step (QS1). Classifiers may be created during a training process, and later may be used to assist in determining whether a suspect JPEG image has undergone two compressions. When the classifiers support a multi-classification system, described detection techniques may also be arranged to determine a primary quality factor for the double compressed JPEG image.

Abstract: A system and method uses the capabilities of a geometry shader unit within the multi-threaded graphics processor to offload data compression computations from a central processing unit (CPU), reduce the memory needed to store image data, and reduce the bandwidth needed to transfer image data between graphics processors and between a graphics processor and a system memory.

Abstract: In this image processing device, an image processing portion 102 performs a predetermined pre-processing on first image data and outputs it as second image data. A judging portion 104 that judges the degree of importance of the first image data on the basis of the characteristics of a subject that is included in the first image data. A reducing portion 105 reduces the data amount of the second image data in accordance with that degree of importance and outputs it as third image data. According to this image processing device, by reducing the data amount of the second image data in accordance with the degree of importance of the first image data, it is possible to achieve greater reductions in the data amount as the degree of importance decreases. As a result, it is possible to more efficiently reduce the power consumption and time required when transferring image data after data reduction.

Abstract: An image decoding apparatus includes a memory, a detecting part which receives data of a plurality of macroblocks included in an image and detects whether or not a first macroblock included in the plurality of macroblocks has an intra-block, and a control part which writes a DCT coefficient of the first macroblock into the memory when the detecting part determines that the first macroblock has the intra-block, and does not write the DCT coefficient of the first macroblock into the memory when the detecting part determines that the first macroblock has no intra-block.

Abstract: A dimensionality reduction method and system for efficient color transform compression is disclosed. A multi-dimensional color transform with an n-dimensional input color space can be received. A projection operator can be derived and applied to the n-dimensional input color space to form a k-dimensional input color space. A functional approximation can be designed to the n-dimensional input color space and can be evaluated on the k-dimensional input color space to form an m-dimensional output color space. The projection operator and the approximation function can be combined to form a compressed transform by mapping the n-dimensional input color space to m-dimensional output color space. Such an approach provides a significant reduction in size of the color profile with respect to storage and speeds-up real-time computation.

Abstract: A method and apparatus for improved video bandwidth resolution in DFT-based spectrum analysis is disclosed. A first embodiment comprises an emulation of a continuous range of video bandwidths in DFT-based spectrum analysis using overlapping resolution bandwidth frames. A second embodiment utilizes frame weighting to reduce the standard deviation in the spectrum of noise signal to emulate a corresponding standard deviation of a specified video bandwidth.

Abstract: Noise filtering data compression removes noise differences from successive frames in a video signal. This is accommodated by accessing successive frames corresponding to a video signal. Frequency domain representations, for example first row and first column coefficients in the quantized DCT result matrix, are used to determine whether the block in the current frame should be considered identical to the corresponding block in the previous frame. If such is the case, the block data is rendered identical such as by overwriting one for the other. This removes any noise differential between the corresponding blocks from the successive frames.

Abstract: An image recognition apparatus includes an image recognition unit, an evaluation value calculation unit, and a motion extraction unit. The image recognition unit uses motion vectors that are generated in the course of coding image data into MPEG format data or in the course of decoding the MPEG coded data by the evaluation value calculation unit and the motion extraction unit as well as two dimensional DCT coefficients and encode information such as picture types and block types for generating the evaluation values that represent feature of the image. The apparatus further includes an update unit for recognizing the object in the image based on the determination rules for a unit of macro block. The apparatus can thus accurately detect the motion of the object based on the evaluation values derived from DCT coefficients even when generation of the motion vectors is difficult.

Abstract: According to one embodiment, an inverse discrete cosine transforming apparatus includes an inverse scan module, an inverse quantization module, a coefficient selector and an inverse discrete cosine transform module. The inverse scan module arrays a plurality of coefficients constituting decoded variable length data generated from bit stream of coded data in a predetermined scan order to generate inverse scan data. An inverse quantization module performs an inverse quantization on the inverse scan data to generate a discrete cosine transform coefficient. The coefficient selector generates an extending signal for each scan data. The inverse discrete cosine transform module performs an inverse discrete cosine transform on the discrete cosine transform coefficient based on the extending signal to generate decoded image data.

Abstract: An image processing apparatus and method providing a high speed pipeline structure having a low level of complexity is described. The image processing apparatus includes a memory configured to store a plurality of data in a plurality of memory locations, where an ordinally specified data is in a corresponding ordinal memory location.

Abstract: Down-sampling of an image may be performed in the DCT domain. Transform matrices are obtained for down-sampling a DCT image of size M×N to a down-sampled DCT image of size I×J. The transform matrices may be used to down-sample the DCT image directly in the DCT domain. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. The transform matrices are selected by solving an optimization problem, leading to transform matrices which achieve a desired trade-off between the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method.

Abstract: Down-sampling of an image may be performed in the DCT domain. A multiple layered network is used to select transform matrices for down-sampling a DCT image of size M×N to a DCT image of size I×J. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. A learning with forgetting algorithm is used to apply a decay to the elements of the transform matrix and select a transform matrices which solve an optimization problem. The optimization problem is a function of the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method.

Abstract: A method and system for arbitrary resizing of a compressed image in the discrete cosine transform (DCT) domain. First and second scaling parameters P and Q are determined in accordance with the block numbers L and M and the scaling ratio L/M or M/L. A non-uniform, or uneven, sampling in the DCT domain is then applied to coefficients of successive blocks in the compressed image in accordance with the scaling parameters. In an embodiment, P blocks are sampled and transformed from a given block length to |P| according to a |P|-point IDCT, while Q blocks are sampled and transformed from a given block length to |Q| according to a |Q|-point IDCT. The non-uniformly sampled and transformed pixel domain samples are then regrouped into a predetermined block size and transformed back to generate the DCT coefficient of the compressed image. The proposed method significantly reduces the computational complexity compared with other DCT domain arbitrary ratio image resizing approach.

Abstract: An image processor includes a quantization unit receiving first data before quantization and outputting second data after quantization, a prediction unit obtaining a difference value between the second data and third data being prediction data and outputting the difference value as fourth data, and an encoding unit encoding the fourth data. The quantization unit includes a first processing unit dividing the first data by a quantization coefficient, so as to obtain fifth data including a fraction as a result of division and a second processing unit rounding up or rounding off the fraction such that a value of the fourth data becomes smaller based on comparison between the third data and the fifth data, so as to obtain the second data.

Abstract: In a first input step from outside to an image processor, a signal input unit inputs to a pre-filter a first part of first luminance signals inputted from outside, which is a part to be processed by the pre-filter in the first input step, and stores a remaining second part of the first luminance signals in the memory unit. In a second input step following the first input step, the signal input unit inputs to the pre-filter the second part of the first luminance signals read from the memory unit and a first part of second luminance signals inputted from outside, which is a part to be processed by the pre-filter in the second input step, and stores a remaining second part of the second luminance signals in the memory unit.

Abstract: An image processing device, which includes: an original reception unit that receives an original image; a dot image generation unit that generates, on the basis of additive information to be added to the original image, a dot image in which a plurality of dots each formed by one or more pixels are arranged; a state alteration unit that, when any of the dots in the dot image is determined to be not extractable, alters a state of the non-extractable dot on the basis of a relationship between a position on the dot image generated by the dot image generation unit and a corresponding position on the original image; and a composite image generation unit that generates a composite image by superimposing, on the original image, the dot image having the state of the non-extractable dot altered by the state alteration unit.

Abstract: A method of spatial domain video enhancement/up-scaling including transforming the video input from the temporal domain to a K×K matrix of spatial domain coefficients; multiplying each spatial domain coefficient by corresponding elements of a K×K enhancement matrix to obtain enhanced spatial domain coefficients; depositing the enhanced spatial domain coefficients in the upper left K×K corner of a zero padded 2K×2K inverse transform matrix and inversely transforming them to scale the enhanced spatial domain coefficients and convert them back to video output temporal domain elements and a method of spatial domain video enhancement/down-scaling including transforming the video input from the temporal domain to a 2K×2K matrix of spatial domain coefficients; multiplying the upper left K×K corner of the 2K×2K matrix of spatial domain coefficients by the corresponding elements of a K×K enhancement matrix to obtain enhanced spatial domain coefficients; inversely transforming the K×K enhanced spatial domain coefficien

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: Provided are methods and apparatuses for converting a lower bit-plane image, and methods and apparatuses for inverse-converting the lower bit-plane image, which increase the correlation of the lower bit-plane image. According to the method of converting a lower bit-plane image, pixels of the lower bit-plane image are sequentially added or subtracted so as to generate a converted lower bit-plane image. Accordingly, the lower bit-plane image has higher regularity, and thus the efficiency of image processing using the lower bit-plane image is improved.

Abstract: In a method of encoding and encoder a method step is performed in which the scan order of a set of image region modeling coefficients is established on the basis of information of set of image region modeling coefficients preceding said set of image region modeling coefficients, and said set of image region modeling coefficients subsequently undergoes a scan ordering.

Abstract: Techniques are generally described for detecting double JPEG compression in images. Example detection techniques of double JPEG compression may include receiving JPEG images for analysis and extracting 2-dimensional (2-D) arrays of JPEG coefficients from the images. 2-D difference arrays may be generated from the array of JPEG coefficients, with the entries in the difference array reflecting relative changes in values of pairs of entries in the array of JPEG coefficients. The detection techniques also model the difference arrays using random processes, and evaluate whether the random processes reveal statistical artifacts in the JPEG images. These statistical artifacts result from double JPEG impression performed on the JPEG images.

Abstract: Inverse transforms used in video and image compression/decompression, such as DCT/IDCT used in MPEG-2 and MPEG-4, or the integer transforms used in H.264, are usually calculated with fast algorithms, which only take advantage of the symmetry existing in the transform matrix but ignores the peculiarities in the input data. While these kind of fast algorithms can apply to both forward and inverse transforms, they tend to be inefficient in calculating inverse transforms. In inverse transforms, most of the coefficients become zero after quantization, this invention takes advantage of this fact to further simplify the general fast algorithm and speed up the calculation.

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: Provided is a method for performing hierarchical B picture-based coding on a video sequence using the structure of adaptively divided group of pictures (GOP). The method includes the steps of, for each predefined 2N frame-sized group of pictures (GOP) of the video sequence, (a) encoding the 2N frame-sized GOP of the video sequence based on each of the different GOP sizes from the maximum size, 2N, to the minimum size, 2M (M is an integer between 1 and N) and obtaining different values between frames reconstructed after the encoding is performed and frames after the hierarchical B-picture prediction is performed, based on each of the different GOP sizes; (b) selecting at least one sub-GOP based on the difference values obtained by encoding the 2N frame-sized GOP of the video sequence based on each of the different GOP sizes; and (c) generating a bitstream by encoding the 2N-frame-sized GOP based on the at least one selected sub-GOP.

Abstract: A track-side fault detection system, includes a central station and at least one field station at the track side, with the field station including a control apparatus and at least two cameras. The cameras shoot a train when said train passes by and send the shot image data to the control apparatus. The control apparatus performs image processing of the image data of the cameras using a built-in GPU and sends the processed image data to the central station via a network. The central station detects a fault of the train according to the image data from the control apparatus of the field station. With the TFDS, the image data processing capability and efficiency can be significantly improved and the installation costs at the field stations can be significantly reduced.

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

Abstract: An image processing method is provided. The image processing method includes obtaining a least significant bit (LSB) associated with a pixel block. Further, two bits are reduced from a bit number of each of the pixels of the pixel block. Thereafter whether to carry the pixel or not is determined according to the LSB. When the LSB is 01 or 11, the carry manners of each pixel of the pixel block in two consecutive frames are asymmetric one to another. Further, under the conditions of when the LSB is 01 and 11, respectively, the carry manners of the pixels of the pixel block mutually compensate. Therefore, the display performance of a display is improved.

Abstract: A system and method for updating a display unit remotely located from a computing system are described. The method includes copying display information from a video buffer of a computing device executing an application to generate a display update, calculating a size of the display update, and determining an amount of available bandwidth of a network connecting the computing device and the display unit. The method also includes calculating a time period required to communicate the display update from the computing device to the display unit, transmitting the display update to the display; and repeating the method after the time period has elapsed.

Abstract: A method for decoding a binary image at a high speed, wherein blocks having same pixel values are decoded in clock units, such that a decoding speed increases. The method includes: determining whether a predetermined number of sequential pixels corresponds to any one of a white_run, a black_run, and a combined_run; and if the predetermined number of sequential pixels corresponds to any one of the white_run, the black_run, and the combined_run, decoding the sequential pixels in a block per clock unit.

Abstract: A method and device that uses transform matrices to down-sample a DCT image directly in the DCT domain. The transform matrices have been selected to minimize an optimization problem which is a function of the visual quality of down-sampled images obtained using the matrices and the computational complexity associated with using the transform matrices. The transform matrices comprise a row transform matrix and a column transform matrix. A down-sampled image is produced by determining an intermediary matrix as the product of the DCT image and one of either the row transform matrix or the column transform matrix and then determining the down-sampled image as the product of the intermediary matrix and the transform matrix not already used to determine the intermediary matrix.

Abstract: The invention relates to a bit-plane coding method of signals, for example, an image or video signal in the DCT transform domain. The bit planes of the DCT blocks are transmitted bit-plane by bit-plane in order of significance. As each plane contains more signal energy than the lower significant layers together, the resulting bit-stream is scalable in the sense that it may be truncated at any position. The later the bitstream is truncated, the smaller the residual error when the image is reconstructed. For each bit plane, a zone or partition of bit plane is created that encompasses all the non-zero bits of the DCT coefficients in that bit plane. The partition is created in accordance with a strategy that is selected from a number of options in dependence of the content of the overall signal and/or the actual bit plane. A different zoning strategy may be used for natural images than for graphic content, and the strategy may vary from bitplane to bitplane.

Abstract: Disclosed are an image-encoding apparatus and an image-decoding apparatus for efficiently transmitting a large capacity image. The image encoding apparatus separates an input image into pixel units to generate real images of a first region and of a second region, performs a predictive filtering process on the real image of the first region to generate a predictive image of the second region, and differentiates the predictive image of the second region from the real image of the second region to thereby efficiently reduce the volume of data prior to encoding the input image.

Abstract: Adjacent blocks are identified in an image. Coding parameters for the adjacent blocks are identified. Deblock filtering between the identified adjacent blocks is skipped if the coding parameters for the identified adjacent blocks are similar and not skipped if the coding parameters for the identified adjacent blocks are substantially different.

Abstract: A method of image compression includes significance switching of DCT coefficients in block-based embedded DCT procedures. Bitwise digitized DCT coefficients are passed through successive significance sweeps of the whole image from the most significant down to the least significant coefficient bit planes. With each new sweep, newly significant coefficients may appear within a block, and block-masking is used to transmit the addresses of those newly significant coefficients. An off-mask may also be used. The invention further relates to a hardware or software-based image encoder.

Abstract: The present invention relates to a method for eliminating a blocking effect in a compressed video signal signal. The method of the invention includes: the encoding step of eliminating a blocking effect by compensating the motion of a signal compressed in block unit to be transmitted; the decoding step of restoring the motion compensated video signal to the original video signal by reducing the prediction residual between the motion compensated video signal and the original video signal and the blocking effect; and the post-filtering step of performing post-filtering in a blocking elimination filter in order to eliminate a blocking effect and ring effect remained in the compensated signal. The equation for obtaining the original pixel is made simple by eliminating the remaining blocking effect and ring effect using a loop/post filter.