Abstract: An image compression system and method is described, which makes use of the symmetry found in faces and heads to perform the compression. The image is divided along the line of symmetry, and pairs of corresponding pixels on the two divided sides are determined. A weighted average and a weighted variance of the pixel values of the pairs is computed, and is used to encode the image. A transform such as the Karhunen-Loeve transform is used to compute the weighted averages and variances.

Abstract: The present invention relates to a real-time wideband compressor for multi-dimensional data. The compressor comprises a plurality of compression engines for simultaneously compressing a plurality of data subsets of a set of input data vectors and providing compressed data thereof using one of SAMVQ or HSOCVQ data compression. Each compression engine comprises an along spectral vectors codevector trainer as well as an across spectral bands codevector trainer. The compression engines are programmable to perform either along spectral vectors codevector training or across spectral bands codevector training in combination with one of the SAMVQ or HSOCVQ techniques without changing hardware. The compressor further comprises a network switch for partitioning the set of input data vectors into the plurality of data subsets, for providing each of the plurality of data subsets to one of the plurality of compression engines, and for transmitting the compressed data.

Abstract: A method for enhancing the quality of an image, in particular with respect to its contrast properties, comprises the step of calculating a histogram for an input image (S5), equalizing the input image on the basis of the calculated histogram to obtain a corresponding histogram equalized image (S5), wherein the histogram equalized image and the input image are merged/mixed/blended (S6) to obtain an output image, wherein merging/mixing/blending is weighted (S12) in dependency of the content of the input image and/or of other input image data relating to the input image. This makes it possible to further improve the quality of histogram equalized images.

Abstract: Apparatus and methods for converting raster illustrated parts images into intelligent vector-layered files. The method involves recognizing and removing reference labels from the raster illustrated parts image to produce a reference label scrubbed file. Reference lines are recognized and removed from the reference label scrubbed file to produce a scrubbed file. The scrubbed file includes a reusable base graphic. The scrubbed file is converted to a vector file in which the reusable base graphic is embedded. One or more vector layers are added to the vector file to produce the intelligent vector-layered file. Each vector layer includes vector elements corresponding to one of the recognized reference labels and its one or more reference lines.

Abstract: Reduced complexity inverse discrete cosine transform (IDCT) masks and a method for reducing the number of IDCT calculations in video decoding are provided. The method comprises: accepting an n×m matrix of DCT coefficients; performing (n?y) horizontal IDCT operations, where y is greater than 0; performing y scaling operations; and, generating an n×m block of pixel information. Some aspects of the method further comprise: performing (m?z) vertical IDCT operations, where z is in the range between 0 and m/2. In some aspects, performing (n?y) horizontal IDCT operations includes performing IDCT operations for the first (n?y) horizontal rows. Then, performing y scaling operations includes: selecting the DC component from the first position of each horizontal row; scaling the selected DC component; and, copying the scaled DC component into the remaining positions of each of horizontal row.

Abstract: A method for performing a motion estimation combined with a Walsh-Hadamard transform algorithm. In image frame, which includes a pixel array to display an image object, the method includes fetching a current image pixel content C and a reference image pixel content R. A Walsh-Hadamard transform algorithm is used to transform the current image pixel content C and the reference image pixel content R, so that a WHT SAD(i, j), WSAD(i,j) is computed to serve as a matching criterion.

Abstract: A process and system for modeling, learning and synthesizing cursive handwriting in a user's personal handwriting style. The handwriting synthesis system and process described herein addresses the problem of learning the personal handwriting style of a user based on limited handwriting samples and producing novel scripts of the same style. The handwriting synthesis process includes segmenting handwriting samples into individual characters using a two-level writer-independent segmentation process, aligning samples of the same character into a common coordinate frame, and learning and modeling the individual character. Synthesis of handwriting is performed by generating individual letters from the models and concatenating the letters using a conditional sampling algorithm. The result is a smooth and fluid connection between letters that successfully mimics the personal handwriting style of a user.

Abstract: Provided are an apparatus and method for binary-coding images considering the brightness of a current pixel and a difference in brightness between pixels. The apparatus includes a detector for detecting a local adaptive critical value for a pixel according to a regional characteristic of the pixel in the image, and a comparator for comparing the local adaptive critical value with the value of the pixel and outputting a binary-coded pixel value corresponding to the pixel. In detecting the local adaptive critical value, a local average parameter FLoc related to high frequency elements is supplied after being controlled according to a locally windowed region. Frequencies for converting from black pixels to white pixels or from white pixels to black pixels are reduced in a binary-coded output image so that an image with a reduced number of high frequency elements can be obtained to improve the compressibility of the binary-coded output image.

Abstract: In some embodiments of the present invention, frequently occurring inverse linear transform results are calculated and stored in look-up-tables. In real time, incoming blocks of linear transform coefficients are divided into two or more groups. A numerical code is determined for each group and checked against a look-up-table for that group to see whether it corresponds to a pre-calculated inverse linear transform result.

Abstract: Disclosed are systems and methods for providing spatially-varied demosaicing. In one embodiment, a system and method pertain to collecting color information sensed by image sensor pixels, and estimating color information as to a pixel under consideration that is not collected by the pixel by weighting color information collected by adjacent pixels that are positioned in a direction in which color is shifted due to lateral chromatic aberration.

Abstract: A character overlapping with a line of an entry box is extracted utilizing a dot box. At document input step S2, a document to be recognized is read and converted into electronic data to produce character box data. At electronic data storing step S3, the character box data read at the photoelectric transducing S2 is stored. At character detecting step S5, the character box data is contracted, small points are removed, and the remaining pattern is reversely expanded to produce character data. At entry box detecting step S4, entry box position data is generated from the character box data and character data. At relating step S6, a character pattern entered in each entry box is detected from the character data and the entry box position data. At character recognizing step S7, a character is recognized for the extracted character pattern and the results are stored at step S8.

Abstract: An image compression coding apparatus which can obtain coded data with minimum coding distortion within an allowable compression ratio range while minimizing a deterioration in the performance of a system, and a control method for the apparatus.

Abstract: Methods, apparatus and computer readable medium are described that compress and/or decompress a digital image in a lossless or a lossy manner. In some embodiments, a display controller may compress a digital image by generating a symbol for each pel of the digital image. In particular, the symbol may represent a pel via a match vector and a channel error vector. The match vector may indicate which quantized channels of the pel matched quantized channels of a previous pel. Further, the channel error vector may comprise a lossless or lossy channel for each quantized channel of the pel that did not match a corresponding quantized channel of the previous pel. The channel error may also comprise a lossless or lossy channel error for each quantized channel of the pel that matched a corresponding quantized channel of the previous pel.

Abstract: The invention concerns a method and a device for the automatic perception of an event. Said device comprises a control unit, a data bus, a back-annotation bus and at least a histogram computing unit.

Abstract: A camera picks-up at least two images of a region where an object is present. A monitoring unit monitors the object and displays the images of the object on a display for a user. The monitoring unit obtains a difference image of the two images, and removes an image of a moving object that may be considered as a background image from the difference image to thereby obtain an image of the object. The monitoring unit determines the image of the moving object as the background image based on an area of the image of the moving object. The monitoring unit determines a state of the object based on barycentric positions of the images of the moving objects in the difference image.

Abstract: The present invention aims to increase an encoding efficiency when the occurrence probability of LPS (less probable symbol) is low. An encoding apparatus has a interval size (A), a interval limit value (C), divides a set interval which is set on a number line, selects a sub-interval corresponding to an occurring symbol, updates the interval size (A) and the interval limit value (C) with a limited precision based on the selected sub-interval size, and encodes a coordinate within the interval. Based on the probability (the occurrence probability of symbol) output from a learning memory, the sub-interval size (LSZ, dLSZ) and the sub-interval limit value are obtained.

Abstract: A method and an apparatus for encoding/decoding key value data of a coordinate interpolator used in a three-dimensional graphic animation are provided. The apparatus for encoding key value data of a coordinate interpolator representing the position of each vertex of an object using coordinates of each of the vertices including x, y, and z components includes a quantizer, which quantizes a coordinate interpolator input there into with predetermined quantization bits, a DPCM processor, which performs a DPCM operation of a predetermined mode on each component of each vertex of the quantized coordinate interpolator and generates differential data based on the temporal variation of the coordinates of each of the vertices and differential data based on the spatial variation of the coordinates of each of the vertices.

Abstract: A method of compressing digital images acquired in CFA format that utilizes optimized quantization matrices. The method, basing itself on the statistical characterization of the error introduced during the processing phase that precedes compression, appropriately modifies the coefficients of any initial quantization matrix, even of a standard type, obtaining a greater compression efficiency without introducing further quality losses.

Abstract: A method of run-length encoding for known block size, such as image/video compression with block transform, such as DCT, with end of block indication suppressed when the end of the block can be inferred from the prior coding symbols.

Abstract: An image signal processing apparatus includes two JPEG codecs. A plurality of frames of image signals periodically input from a multiplexer are individually compressed by the two JPEG codecs, and the compressed image signals are recorded on a hard disk by an HDD. Furthermore, the plurality of frames of the compressed image signals reproduced from the hard disk are individually expanded by the two JPEG codecs, and the expanded image signals are output to a monitor. Herein, each of the JPEG codecs selectively executes individual compression of the plurality of frames of the image signals and individual expansion of the plurality of frames of the compressed image signals. A CPU makes the JPEG codecs perform the compression process prior to the expansion process.