Abstract: A data compression system is provided in accordance with the present invention. The system includes a scanning component which scans at least a portion of a transformed image. The scan is performed substantially in a horizontal direction on a first section of the portion and in a vertical direction on a second section of the portion to enable improved data compression of the transformed image. The horizontal and vertical scan directions are performed via a contiguous scan of the respective sections to further enable improved data compression of the transformed image.

Abstract: An improved method and block transform for image or video encoding and decoding, wherein transformation and inverse transformation matrixes are defined such that computational complexity is significantly reduced when encoding and decoding. For example, in the two-dimensional inverse transformation of de-quantized transform coefficients into output pixel information during decoding, only four additions plus one shift operation are needed, per co-efficient transformation, all in sixteen-bit arithmetic. Transformations provide correct results because quantization during encoding and de-quantization (sixteen bit) during decoding, via the use of one of three tables selected based on each coefficient's position, have parameter values that already compensate for factors of other transformation multiplications, except for those of a power of two, (e.g., two or one-half), which are performed by a shift operation during the transformation and inverse transformation processes.

Abstract: An encoder reorders quantized wavelet coefficients to cluster large and small wavelet coefficients into separate groups without requiring the use of data-dependent data structures. The coefficients are then adaptively encoded based on a run-length code which continuously modifies a parameter that controls the codewords uses to represent strings of quantized coefficients, seeking to minimize the number of bits spent in the codewords. A matrix of indices contains the coarsest coefficients in the upper left corner, and filling in low high and high low sub bands in larger and larger blocks in an alternating manner, such that low high sub bands comprise the top of the matrix and the high low sub bands comprise the left side of the matrix. The shortest codewords are assigned to represent a run of the most likely character having length of 2k, where k is a parameter. k is adjusted based on successive characters being encountered.

Abstract: A system and process for encoding and later decoding of bi-level images that does not use arithmetic coding, but whose performance is close to that of state-of-the-art coders such as JBIG, JBIG-2, and JB2. In general, the present bi-level coder (BLC) uses two context-based adaptive modules: 1) an adaptive predictor controlled by low-resolution probability estimates that is used to map the original pixels explicitly into prediction error pixels, and 2) a backward-adaptive Run-Length-Rice (RLR) coder that encodes the prediction error pixels. That's contrary to the usual approach where the context-dependent probability estimate controls both pixel prediction and adaptive entropy coding. Due to its simplicity, in many applications BLC may be a better choice other current coders.

Abstract: A system and method for embedding information into digital media and later detecting the embedded information using a unique spread spectrum modulation technique. In general, the present invention removes interference caused by an original signal from the detection process thereby eliminating a major source of detection error. The interference caused by the original signal is removed by using the encoder knowledge about the original signal and modulating the energy of the embedded mark to compensate for the original signal interference. The present invention also includes a novel redundant bit representation technique causes a resulting average over a large sample to tend to zero, thereby reducing the vulnerability of the present invention to malicious collusion attacks.

Abstract: The present invention is embodied in a system and method for compressing image data using a lapped biorthogonal transform (LBT). The present invention encodes data by generating coefficients using a hierarchical LBT, reorders the coefficients in a data-independent manner into groups of similar data, and encodes the reordered coefficients using adaptive run-length encoding. The hierarchical LBT computes multiresolution representations. The use of the LBT allows the present invention to encode image data in a single pass at any desired compression ratio and to make use of existing discrete cosine transform (DCT) software and hardware modules for fast processing and easy implementation.

Abstract: A system and method for compressing digital pen stroke data utilizing curve simplification. Digital pen stroke images (ink images) generate a relatively large amount of data to preserve the ink image generated on a device. Current ink compression algorithms utilize lossless compression algorithm that have limited success. The invention provides a lossy compression algorithm to reduce the amount of data required to store and transmit ink data. The invention utilizes a two-part algorithm to reduce and compress the number of data points representing the ink data. The invention also utilizes curve splines to reconstruct and smooth the lossy ink data image.

Abstract: A system and method for producing fast modulated complex transforms (MCLTs) provides a fast MCLT generator for computationally efficient derivation of modulated MCLT coefficients from an input signal of one or more dimensions. The fast MCLT generator performs spectral analysis by spectrally decomposing a digital signal at predefined frequencies uniformly distributed over a sampling frequency interval into complex frequency coefficients so that magnitude and phase information at each frequency is immediately available. The fast MCLT generator directly uses fast Fourier transforms (FFTs) without data shuffling in the derivation of MCLT coefficients from an input signal. The MCLT coefficients represent an encoded version of the input signal. Reconstruction of the input signal is accomplished by performing an inverse MCLT operation on the MCLT coefficients.

Abstract: A system and method for embedding information into digital media and later detecting the embedded information using a unique spread spectrum modulation technique. In general, the present invention removes interference caused by an original signal from the detection process thereby eliminating a major source of detection error. The interference caused by the original signal is removed by using the encoder knowledge about the original signal and modulating the energy of the embedded mark to compensate for the original signal interference. The present invention also includes a novel redundant bit representation technique causes a resulting average over a large sample to tend to zero, thereby reducing the vulnerability of the present invention to malicious collusion attacks.

Abstract: The present invention is embodied in a system and method for compressing image data using a lapped biorthogonal transform (LBT). The present invention encodes data by generating coefficients using a hierarchical LBT, reorders the coefficients in a data-independent manner into groups of similar data, and encodes the reordered coefficients using adaptive run-length encoding. The hierarchical LBT computes multiresolution representations. The use of the LBT allows the present invention to encode image data in a single pass at any desired compression ratio and to make use of existing discrete cosine transform (DCT) software and hardware modules for fast processing and easy implementation.

Abstract: A system and method for performing trainable nonlinear prediction of transform coefficients in data compression such that the number of bits required to represent the data is reduced. The nonlinear prediction data compression system includes a nonlinear predictor for generating predicted transform coefficients, a nonlinear prediction encoder that uses the predicted transform coefficients to encode original data, and a nonlinear prediction decoder that uses the predicted transform coefficients to decode the encoded bitstream and reconstruct the original data. The nonlinear predictor may be trained using training techniques, including a novel in-loop training technique of the present invention. The present invention also includes a method for using a nonlinear predictor to encode and decode data. The method also includes improving the performance of the nonlinear prediction data compression and decompression using several novel speedup techniques.

Abstract: An encoder reorders quantized wavelet coefficients to cluster large and small wavelet coefficients into separate groups without requiring the use of data-dependent data structures. The coefficients are then adaptively encoded based on a run-length code which continuously modifies a parameter that controls the codewords uses to represent strings of quantized coefficients, seeking to minimize the number of bits spent in the codewords. A matrix of indices contains the coarsest coefficients in the upper left corner, and filling in low high and high low sub bands in larger and larger blocks in an alternating manner, such that low high sub bands comprise the top of the matrix and the high low sub bands comprise the left side of the matrix. The shortest codewords are assigned to represent a run of the most likely character having length of 2k, where k is a parameter. k is adjusted based on successive characters being encountered.

Abstract: A system and method facilitating signal enhancement utilizing an adaptive filter is provided. The invention includes an adaptive filter that filters an input based upon a plurality of adaptive coefficients, the adaptive filter modifying at least one of the adaptive coefficients based on a feedback output. The invention further includes a feedback component that provides the feedback output based, at least in part, upon a non-linear function of the acoustic reverberation reduced output.

Abstract: A system and method facilitating image retouching is provided. The invention includes an image retoucher having a boundary detector and an image extender. The invention provides for the image retoucher to extend care pixels of at least one of a foreground and a background near a detected spurious boundary by altering the binary mask used for compression of the foreground and/or the background.

Abstract: Systems and methods for encoding and decoding document images are disclosed. Document images are segmented into multiple layers according to a mask. The multiple layers are non-binary. The respective layers can then be processed and compressed separately in order to achieve better compression of the document image overall. A mask is generated from a document image. The mask is generated so as to reduce an estimate of compression for the combined size of the mask and multiple layers of the document image. The mask is then employed to segment the document image into the multiple layers. The mask determines or allocates pixels of the document image into respective layers. The mask and the multiple layers are processed and encoded separately so as to improve compression of the document image overall and to improve the speed of so doing. The multiple layers are non-binary images and can, for example, comprise a foreground image and a background image.

Abstract: A system and method facilitating compression of bi-level images with explicit representation of ink clusters is provided. The present invention includes a cluster shape estimator that analyzes connected component information, extracts clusters and stores the cluster in a global dictionary, a page dictionary or a store of unclustered shapes. A bitmap estimation from clusters component determines dictionary positions for clusters stored in the global dictionary which are then encoded. A cluster position estimator determines page positions of clusters of the global dictionary and/or the page dictionary that are then encoded. Further, the global dictionary, the page dictionary and the store of unclustered shapes are also encoded.

Abstract: A system and method facilitating image smoothing is provided. The invention includes an image processor having an image receptor and an image smoother. The invention provides for the image smoother to alter the value of a don't care pixel based, at least in part, upon a weighted average of care pixels.

Abstract: Systems and methods for performing clustering of a document image are disclosed. A property of an extracted mark from a document is compared to the properties of the existing clusters. If the property of the mark fails to match any of the properties of the existing clusters, the mark is added as a new cluster to the existing cluster. One property that can be utilized is x size and y size, which is the width and height, of the existing clusters. Another property that can be employed is ink size, which refers to the ratio of black pixels to total pixels in a cluster. Yet another property that can be utilized is a reduced mark or image, which is a pixel size reduced version the bitmap of the mark and/or cluster. The above properties can be employed to identify mismatches and reduce the number of bit by bit comparisons performed.

Abstract: Systems and methods for performing adaptive filtering are disclosed. The present invention generates probabilities that can be used in an encoder, such as an arithmetic encoder and generates those probabilities in a computationally efficient manner. Probabilities of previously encoded coefficients are employed, effectively, in generating probabilities of the coefficients without regard to directional information. Thus, a large amount of information is adaptively and efficiently used in generating the probabilities. For the coefficients, the probability is computed based at least partly on at least one probability of a previously computed probability of a neighboring coefficient. Then, the coefficients are encoded using those computed probabilities.

Abstract: A system and method facilitating progressively transforming and coding digital pictures is provided. The present invention via employment of a multi-resolution lapped transform provides for progressive rendering as well as mitigation of blocking artifacts and ringing artifacts as compared to many conventional compression systems. The invention includes a color space mapper, a multi-resolution lapped transform, a quantizer, a scanner and an entropy encoder. The multi-resolution lapped transform outputs transform coefficients, for example, first transform coefficients and second transform coefficients. A multi-resolution representation can be obtained utilizing second transform coefficients of the multi-resolution lapped transform. The color space mapper maps an input image to a color space representation of the input image. The color space representation of the input image is then provided to the multi-resolution lapped transform.