Abstract: Embodiments in accordance with the invention provide methods of near lossless data compression based on nonuniform sampling. Alternate embodiments in accordance with the invention improve the compression factor of lossy compression methods by using nonuniform sampling.

Abstract: An apparatus for determining a fake image includes an image-acquiring block for acquiring an image captured by and input from a camera; and a background-learning block for learning a background of the image to create a learning background. Further, the apparatus for determining the fake image includes a face extracting-block for extracting a face region of a person to be authenticated when an input image for authentication is transmitted from the camera; and an inter-background comparing block for comparing a present background of an input image with the learning background. Furthermore, the apparatus for determining the fake image includes a motion information-comparing block for extracting motion information in the face region and the present background to compare the same with each other; and a fake image-determining block for determining whether the input image is faked using the compared results of the motion information and the backgrounds.

Abstract: In one of many possible embodiments, a system for optimizing bit utilization in data encoding is provided. The exemplary system includes a data processing subsystem configured to identify a total number of unique characters within a set of data, which number represents an original base of representation of the set of data. The data processing subsystem is further configured to convert the set of data to a base of representation that is higher than the original base of representation and then encode the base-converted data with a fixed-length encoding scheme.

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 decoding method decodes a base stream generated by encoding a first image signal of a first view and a dependent stream generated by encoding a second image signal of a second view. The method includes detecting, on the basis of a dependent delimiter indicating a picture boundary between pictures in the dependent stream, the picture boundary in the dependent stream configured by inserting the dependent delimiter at the beginning of a picture in the dependent stream. Further, the method includes decoding the base stream and the dependent stream on the basis of the detected picture boundary in the dependent stream.

Abstract: Disclosed are apparatuses, computer readable storage media with instructions that carry out methods, and methods of (a) coding quantized transform coefficients as occur in image compression to form codewords, and (b) decoding a bitstream comprising the codewords. The coding combines a position identifying method to identify the relative position of clusters of consecutive non-zero-valued quantized transform coefficients, an amplitude event identifying method to identify amplitude events in the clusters of non-zero-valued quantized transform coefficients, and a coding method to code the position events, amplitude events, and signs of the amplitudes in the clusters. The coding method is particularly applicable to an ordered series of quantized transform coefficients where clusters are likely-to-occur.

Abstract: Apparatus and methods for coding images geometric vector quantization (GVQ) having an over-complete dictionary which produces a sparse vector of coefficients as it contains large runs of zeros. The sparse encoding is particularly well suited for use with run-length entropy coding techniques. Image blocks are sparse coded using GVQ, with the vector of coefficients converted to RUN-LENGTH symbols, and binarized into a set of binary symbols. At least a portion of the binary symbols are used as contexts which can be selected when performing binary arithmetic coding of the binary coded RUN and LENGTH data to generate a bit stream containing the encoded image that provides enhanced compression.

Abstract: A system and method for redundant transmission is provided. In one embodiment, an input signal S is encoded as a list of fragments. Each fragment includes an index value and a projection value. The index points to an entry in a dictionary of signal elements. A repetition factor is assigned to each fragment based on its importance. After a fragment is added, a reconstructed signal is generated by decoding the list of fragments. Encoding terminates once the reconstructed signal is sufficiently close to the original signal S.

Abstract: A method for determining a scaled color map of a scaled image is described using the transformation of the original color map and the original image only, independently of the scaled image. A number of colors N in the original color map is determined; and provided N>Nmax, all colors in the original color map are reused in the scaled color map. If N<Nmin, the number of colors in the original color map is increased. Otherwise, the scaled color map is formed including: selecting a sub-set of colors in the original color map; increasing a number of colors in the selected sub-set; adding the resulting sub-set with increased number of colors to the original color map; and removing duplicate colors, wherein Nmin and Nmax are respective predetermined minimum and maximum thresholds for a number of colors in the original color map. A corresponding system is also provided.

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

Abstract: The present invention relates to an image signal processing apparatus capable of reproducing the appearance of an image that is displayed on a PDP. In an image processing unit 1, as a process for an image signal so that an image obtained when the image signal is displayed on a display apparatus of a display type other than that of a PDP can look like an image displayed on a PDP display apparatus, at least one of reproducing color shift caused by a moving image which is produced because lighting of RGB is turned on in this order, reproducing a dither pattern to be applied in a space direction, reproducing a dither pattern to be applied in a time direction, reproducing a space between pixel pitches, and reproducing a stripe array is performed. The present invention can be applied to a case where, for example, an image that can look like an image displayed on a PDP is to be displayed on an LCD.

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

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

Abstract: International image or video coding standards uses hybrid coding, wherein a picture is separated into pixel blocks on which predictive coding, transform coding and entropy coding is employed. The transform coding is effective because the prediction error samples are correlated in the frequency domain. However, when the prediction quality is getting better and better, spatial domain coding becomes more effective than transform coding. According to the invention, it is first determined in which corner of a current block the first non-zero amplitude value is located. Based on the related zeros run length value in that block, a pre-defined scan path is selected, i.e. a context-based adaptive scan mode is used.

Abstract: Methods and systems for data compression and decompression in a graphics processing system are provided. For example, in at least one embodiment, a method comprises distributing the graphics data values of a pixel block about zero to minimize redundancy, and the pixel block includes a plurality of quadrants. The method further comprises determining whether to encode the distributed graphics data values, and responsive to a determination to encode the distributed graphics data values, encoding at least one graphics data value of one of the quadrants depending on an encoding indicator. The encoding includes determining an entropy parameter and dividing each positive data value by the entropy parameter yielding an entropy part and a noise part.

Abstract: The present disclosure is directed to methods, systems, and apparatus for improved data compression. In one embodiment, a method is provided that separates image data by color channels and ordered bit planes. The method includes arranging bytes representing pixel values from a source image into corresponding color channels. Bits in each color channel are separated into a plurality of bit planes that are ordered based on significance. Then, the method may combine bits associated with adjacent pixel locations from common bit planes into new bytes. Once the image data is separated in this way, different compression processes are applied to data sets represented in the ordered bit planes.

Abstract: Methods, medium, and machines which compress, enhance, encode, transmit, decode, decompress and display digital video images. Real time compression is achieved by sub-sampling each frame of a video signal, filtering the pixel values, and encoding. Real time transmission is achieved due to high levels of effective compression. Real time decompression is achieved by decoding and decompressing the encoded data to display high quality images. A receiver can alter various setting including, but not limited to, the format for the compression, image size, frame rate, brightness and contrast. In a Doppler improvement aspect of the invention, Doppler velocity scales are incorporated into grayscale compression methods using two bits. Variable formats may be selected and Doppler encoding can be turned on and off based on the image content.

Abstract: A method and system for entropy coding can comprise, in response to detecting a first symbol combination comprising first run information indicating a first number of contiguous zero coefficients is greater than a cut-off-run value, assigning a first codeword to a first symbol combination, wherein the first codeword comprises an escape code from a first-level VLC table; and in response to a second symbol combination comprising second run information indicating a second number of contiguous zero coefficients is less than or equal to the cut-off-run value, assigning a second codeword to the second symbol combination, wherein the second codeword is from the first-level VLC table. The system and method can further comprise collecting coding statistics for a set of candidate symbol combinations and adjusting a mapping between codewords of the first-level VLC table and a subset of the set of candidate symbol combinations based on the coding statistics.

Abstract: An optimized method and system for entropy coding is described. The system may include an input module to receive a digital image, a Discrete Cosine Transform (DCT) module to obtain a plurality of DCT coefficients associated with the digital image, a statistics generator to generate statistics associated with the plurality of DCT coefficients, a placement module to store the generated statistics in the plurality of DCT coefficients and entropy coder to generate uniquely decodable (UD) codes for the plurality of DCT coefficients. The entropy coder may utilize the statistics stored in the plurality of DCT coefficients.

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

Abstract: In the last few years, face expression measurement has been receiving significant attention mainly due to advancements in areas such as face detection, face tracking and face recognition. For face recognition systems, detecting the locations in two-dimension (2D) images where faces are present is a first step to be performed before face expressions can be measured. However, face detection from a 2D image is a challenging task because of variability in imaging conditions, image orientation, pose, presence/absence of facial artefacts facial expression and occlusion. Existing efforts to address the shortcomings of existing face recognition systems deal with technologies for creation of three-dimensional (3D) models of a human subject's face based on a digital photograph of the human subject. However, such technologies are computationally intensive nature and susceptible to errors and hence might not be suitable for deployment.

Abstract: An image coding method for run-length coding (RLC), including quantizing a coefficient string representing a plurality of pixel values to generate a first quantization coefficient string, determining a cutoff quantization coefficient in the first quantization coefficient string, discarding a part of quantization coefficients of the first quantization coefficient string according to the cutoff quantization coefficient, and forming remaining quantization coefficients of the first quantization coefficient string as a second quantization coefficient string, and performing image coding to the second quantization coefficient string with the RLC.

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

Abstract: Provided is an apparatus and a method for inserting additional data into an image file in an electronic device. According to the method, when an event of inserting additional data into the image file occurs, an identification code representing insertion of additional data is recorded in a corresponding header within the image file, and the additional data is added to an end portion of the image file.

Abstract: An output device which outputs pixel data corresponding to a color material used by a printing unit to the printing unit includes an image buffer which stores image data, a generation unit which generates density data corresponding to the color material based on image data read out from the image buffer, a print buffer which stores density data generated by the generation unit, and a conversion unit which converts density data read out from the print buffer into pixel data corresponding to the resolution of the printing unit synchronously with the printing unit.

Abstract: An information source encoding method for encoding a Gaussian integer signal includes the steps of: inputting a signal value sequence of a Gaussian integer signal as an encoding target; transforming signal values included in the input signal value sequence into integer pairs, each having two integers, arranged in the input order; regarding each of the integer pairs as a lattice point on two-dimensional coordinates, and obtaining integer values greater than or equal to zero by performing a two-dimensional-to-one-dimensional mapping in which the shorter the distance from each lattice point to the origin, the smaller the value assigned to the lattice point by the mapping; and encoding the integer values using codes which are used for encoding an information source that follows an exponential distribution.

Abstract: Methods, medium, and handheld, wireless devices which compress, enhance, encode, transmit, decompress and display digital video images in real time. Real time wireless videoconferences connect multiple handheld video devices. Real time compression is achieved by sub-sampling each frame of a video signal, filtering the pixel values, and encoding. Real time transmission is achieved due to high levels of effective compression. Real time decompression is achieved by decoding and decompressing the encoded data to display high quality images. A receiver can alter various setting including but not limited to the format for the compression, image size, frame rate, brightness and contrast. A zoom control can be used select a portion of interest of video being transmitted or being played back.

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: A coding method, apparatus, and medium with software encoded thereon to implement a coding method. The coding method includes encoding the position of non-zero-valued coefficients in an ordered series of quantized transform coefficients of a block of image data, including encoding events using variable length coding using a plurality of variable length code mappings that each maps events to codewords, the position encoding including switching between the code mappings based on the context. The coding method further includes encoding amplitudes of the non-zero-valued coefficients using variable dimensional amplitude coding in the reverse order of the original ordering of the series.

Abstract: A variable length encoding (VLE) device of an image compression system is suitable for encoding transformed and quantized block image signals. The VLE device includes a plurality of encoding modules, for performing VLE on the block image signals; and a selection module (VLE module start controller), for selecting a number of the encoding modules in turn to encode the block image signals. The encoding modules are configured for parallel processing, and an operating frequency of each of the encoding modules is a fractional frequency of a throughput rate of the image compression system. The VLE device is not affected by the time consumed by the VLE in the image compression process, and enables the entire image compression system to operate as desired and achieve the required throughput rate.

Abstract: An optimized method and system for entropy coding is described. The system may include an input module to receive a digital image, a Discrete Cosine Transform (DCT) module to obtain a plurality of DCT coefficients associated with the digital image, a statistics generator to generate statistics associated with the plurality of DCT coefficients, a placement module to store the generated statistics in the plurality of DCT coefficients and entropy coder to generate uniquely decodable (UD) codes for the plurality of DCT coefficients. The entropy coder may utilize the statistics stored in the plurality of DCT coefficients.

Abstract: A graphic data encoding method and apparatus generating a bitstream by encoding a header having at least one piece of first information determined in consideration of a predetermined graphic profile from among multiple pieces of encodable first information; and encoding a payload having at least one piece of second information determined in consideration of the predetermined graphic profile from among multiple pieces of encodable second information. A graphic data decoding method and apparatus decode the generated bitstream. Irrespective of the functions that can be performed by the graphic data encoding apparatus and the functions that can be performed by the graphic data decoding apparatus, the graphic data decoding apparatus, which is in accordance with a graphic profile, can completely restore a 3D mesh model described in the bitstream generated by the graphic data encoding apparatus that is satisfactory to the graphic profile.

Abstract: An image processing apparatus holds a plurality of intermediate smoothed images smoothed at a plurality of preset level values, reduces the N-th frame image of a moving image received from the outside to generate a reduced image, performs a smoothing process on the generated reduced image at the plurality of preset level values to generate a plurality of intermediate smoothed images, stores the generated intermediate smoothed images in an intermediate smoothed image storing unit, acquires, when generating the smoothed images of the frames after the (N+1)-th frame, one or a plurality of intermediate smoothed images from the plurality of intermediate smoothed images of the N-th frame stored in the intermediate smoothed image storing unit, synthesizes the acquired intermediate smoothed images of the N-th frame and the frames after the (N+1)-th frame of the moving image received from the outside, and generates smoothed images.

Abstract: Lossless video data compression is performed in real time at the data rate of incoming real time video data in a process employing a minimum number of computational steps for each video pixel. A first step is to convert each pixel 8-bit byte to a difference byte representing the difference between the pixel and its immediate predecessor in a serialized stream of the pixel bytes. Thus, each 8-bit pixel byte is subtracted from its predecessor. This step reduces the dynamic range of the data. A next step is to discard any carry bits generated in the subtraction process of two's complement arithmetic. This reduces the data by a factor of two. Finally, the 8-bit difference pixel bytes thus produced are subject to a maximum entropy encoding process. Such a maximum entropy encoding process may be referred to as a minimum length encoding process. One example is Huffman encoding.

Abstract: Described herein are compression and processing optimizations by using data transformation techniques. In example embodiments, a byte-wise differential transformation is applied to columnar data represented as a list of length-value pairs to determine a list of delta pairs that is subsequently compressed and stored on persistent storage. A length separation transformation is applied to separate a list of length-value pairs into a length array and a corresponding data value array, where these two arrays are subsequently compressed and stored separately on persistent storage. A native number transformation is applied to a set of number values to remove the lengths stored in the number values, where the transformed set is stored on persistent storage instead of the original set of number values.

Abstract: Coding quantized transform coefficients as occur in image compression to form codewords, and decoding a bitstream comprising the codewords. The coding combines a position identifying method to identify the relative position of clusters of consecutive non-zero-valued quantized transform coefficients, an amplitude event identifying method to identify amplitude events in the clusters of non-zero-valued quantized transform coefficients, and a coding method to code the position events, amplitude events, and signs of the amplitudes in the clusters. The coding method is particularly applicable to an ordered series of quantized transform coefficients where clusters are likely-to-occur.

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: An image processing apparatus includes a criteria setter that sets selection criteria for selecting quantization intensities on the basis of feature indices of an inputted image; an intensity selector that selects, on the basis of the selection criteria set by the criteria setter, one of plural quantization intensities for each partial image area of the inputted image; and a quantizer that quantizes image information on each partial image area with the quantization intensity selected by the intensity selector.

Abstract: Techniques and tools for encoding and decoding a block of frequency coefficients are presented. An encoder selects a scan order from multiple available scan orders and then applies the selected scan order to a two-dimensional matrix of transform coefficients, grouping non-zero values of the frequency coefficients together in a one-dimensional string. The encoder entropy encodes the one-dimensional string of coefficient values according to a multi-level nested set representation. In decoding, a decoder entropy decodes the one-dimensional string of coefficient values from the multi-level nested set representation. The decoder selects the scan order from among multiple available scan orders and then reorders the coefficients back into a two-dimensional matrix using the selected scan order.

Abstract: When a switching target device receives a media output indication from a sender device, a switch connects with contact B, which causes all image data stored in an extended media buffer to be inputted in a decoder, starting from the first frame (which is an I-frame) of the image data. The decoder decodes the image data, starting from the I-frame, and stores a reconstructed image in a reconstructed-image buffer. A reconstructed image required for decoding video picture data outputted from a media buffer is held in the reconstructed-image buffer. Thus, when device switching occurs, the decoder can immediately start decoding regardless of whether video picture data inputted from the media buffer is an intraframe.

Abstract: In order to process image data including a plurality of pixels, a plurality of pixel groups, each of which includes a plurality of pixels, are extracted from the image data sequentially. Next, it is judged whether each of the pixel groups includes only at least one of a white pixel and a black pixel. At least one first pixel group in the pixel groups is binarized in accordance with an arrangement of the at least one of the white pixel and the black pixel therein, in a case where it is judged that the first pixel group includes only at least one of the white pixel and the black pixel, thereby generating at least one first data item. A first resolution of at least one second pixel group in the pixel groups is reduced to a second resolution, in a case where it is judged that the second pixel group includes at least one pixel other than the white pixel and the black pixel, thereby generating at least one second data item.

Abstract: An image processing apparatus includes an image partitioning unit that partitions an image represented by input image information into image partitions, each containing plural pixels; a run coding unit that run-length encodes image partitions for which all pixels contained in any of the image partitions match with a pixel value in a predetermined position in another image partition; and an independently coding unit that encodes image partitions other than image partitions encoded by the run coding unit, so that the resulting codes are decoded independently for each image partition.

Abstract: A drawing apparatus which can create an exposure pattern rapidly. The drawing apparatus has a raster conversion processing module for converting vector images as wiring patterns into bitmap image data, an image cache module for temporarily storing a predetermined-size cached image supplied from the raster conversion processing module, a first compression module for compressing the cached image stored in the image cache module, a second compression module for compressing the cached image stored in the image cache module in a compression ratio differing from that of the first compression module, a comparison module for comparing data sizes of compressed data generated by the first and second compression modules and selecting one having a smaller data size, a memory access module for writing the compressed data selected by the comparison module, into a storage module, and a cache region control module for controlling a compression status of the cached image.

Abstract: An apparatus and a method generate a coded block pattern (CBP) of an alpha channel image. An apparatus and a method encode or decode the alpha channel image using the method. The alpha channel image encoding apparatus includes a CBP generator generating a CBP of a first block corresponding to an encoding unit in the alpha channel image by allocating CBPs to a plurality of second blocks that includes the first block; and a bitstream generator generating a bitstream by encoding the CBP or the CBP and pixel values of the second blocks based on the CBP of each of second blocks.

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

Abstract: Particular embodiments include a method, an apparatus, and logic embodied in tangible computer-readable medium that when executed carries out a method of encoding an ordered sequence of quantized transform coefficients of a block of image data. One embodiment is a context adaptive variable length coding method that includes position coding the positions of zero-valued and non-zero valued coefficients by either a mixed method that encodes either the run length of zeroes preceding a non-zero coefficient or the run length of nonzero-valued coefficients preceding a zero-valued coefficients. Another includes position coding that uses a variable length code for two parameters respectively indicating the number of zero-valued coefficient positions and nonzero-valued coefficient positions still to be coded.

Abstract: An output device which outputs pixel data corresponding to a color material used by a printing unit to the printing unit includes an image buffer which stores image data, a generation unit which generates density data corresponding to the color material based on image data read out from the image buffer, a print buffer which stores density data generated by the generation unit, and a conversion unit which converts density data read out from the print buffer into pixel data corresponding to the resolution of the printing unit synchronously with the printing unit.