Abstract: Optimized color codecs and methods of compressing and decompressing color images using programmable color space parameters are provided. In accordance with one method of encoding a color image, input data comprising input image pixel data and color space parameters is provided. The input image pixel data is compressed based on the color space parameter data. The color space parameter data is then appended to the compressed image pixel data. In accordance with one method of decoding a compressed color image, compressed data is provided that comprises compressed image pixel data and color space parameters. The color space parameters are separated from the compressed image pixel data. The compressed image pixel data is then decompressed based on the color space parameters.

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.

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: 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 “multi-resolution signal renderer” provides a computationally efficient process for generating reduced-resolution versions of a hierarchical transform coded digital signal from the encoded coefficients of that signal. The multi-resolution signal renderer begins by decoding the transform coded signal up to the highest hierarchical resolution not exceeding the desired signal resolution. The multi-resolution signal renderer then operates in one of two modes to generate reduced resolution signals. First, to generate signals at coded hierarchical resolution levels, DC coefficients of the transform coefficients are scaled, and then lowpass filtered to reduce aliasing in the signal.

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 and modifies the adaptive coefficients based on a feedback output. A feedback component provides the feedback output based, at least in part, upon a non-linear function of the acoustic reverberation reduced output. Optionally, the system can further include a linear prediction (LP) analyzer and/or a LP synthesis filter. The system can enhance signal(s), for example, to improve the quality of speech that is acquired by a microphone by reducing reverberation. The system utilizes, at least in part, the principle that certain characteristics of reverberated speech are measurably different from corresponding characteristics of clean speech. The system can employ a filter technology (e.g., reverberation reducing) based on a non-linear function, for example, the kurtosis metric.

Abstract: An implementation of a technology is described herein that facilitates rights enforcement of digital goods using watermarks. More particularly, it is a fingerprinting technology for protecting digital goods by detecting collusion as a malicious attack and identifying the participating colluders. If a digital pirate breaks one client and enables this client to avoid watermark detection, all content (both marked/protected an unmarked/free) can be played as unmarked only on that particular client. However, to enable other clients to play content as unmarked, the digital pirate needs to collude the extracted detection keys from many clients in order to create content that can evade watermark detection on all clients. The described implementation significantly improves collusion resistance through a fingerprinting mechanism that can identify the members of a malicious coalition even when their numbers are several orders of magnitude greater than what conventional collusion-protection schemes can accomplish.

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: A scrambling architecture protects data streams in the operating system and hardware components of a computer by scrambling the otherwise raw data prior to the data being handled by the operating system. The architecture has a scrambler implemented at either the client or the server that adds noise to the content. More specifically, the scrambler produces periodic sets of tone patterns having varying amplitudes based on a first key. The scrambler also generates a random signal based on the first key and a second key. The tone patterns and random signal are added to the content to scramble the content. The scrambled content is then passed to the filter graph (or other processing system) where the content is processed while scrambled. Any attacker attempting to siphon off the bits during processing will steal only noisy data, which is worthless for redistribution or copying purposes. After processing, the scrambled data is passed to a driver for output.

Abstract: A system and method facilitating acoustic echo cancellation convergence detection is provided. The invention includes an acoustic echo cancellation convergence detector having a center clipping component, a convergence calculator, a convergence filter and a convergence statistic component. The invention provides for the acoustic echo cancellation convergence detector to provide an output regarding convergence of an adaptive filter based, at least in part, upon a filtered convergence statistic. Optionally, the acoustic echo cancellation convergence detector can provide an output associated with convergence history.

Abstract: A scrambling architecture protects data streams in the operating system and hardware components of a computer by scrambling the otherwise raw data prior to the data being handled by the operating system. The architecture has a scrambler implemented at either the client or the server that adds noise to the content. More specifically, the scrambler produces periodic sets of tone patterns having varying amplitudes based on a first key. The scrambler also generates a random signal based on the first key and a second key. The tone patterns and random signal are added to the content to scramble the content. The scrambled content is then passed to the filter graph (or other processing system) where the content is processed while scrambled. Any attacker attempting to siphon off the bits during processing will steal only noisy data, which is worthless for redistribution or copying purposes. After processing, the scrambled data is passed to a driver for output.

Abstract: A scrambling architecture protects data streams in the operating system and hardware components of a computer by scrambling the otherwise raw data prior to the data being handled by the operating system. The architecture has a scrambler implemented at either the client or the server that adds noise to the content. More specifically, the scrambler produces periodic sets of tone patterns having varying amplitudes based on a first key. The scrambler also generates a random signal based on the first key and a second key. The tone patterns and random signal are added to the content to scramble the content. The scrambled content is then passed to the filter graph (or other processing system) where the content is processed while scrambled. Any attacker attempting to siphon off the bits during processing will steal only noisy data, which is worthless for redistribution or copying purposes. After processing, the scrambled data is passed to a driver for output.

Abstract: A method and system of lossless compression of integer data using a novel backward-adaptive technique. The adaptive Run-Length and Golomb/Rice (RLGR) encoder and decoder (codec) and method switches between a Golomb/Rice (G/R) encoder mode only and using the G/R encoder combined with a Run-Length encoder. The backward-adaptive technique includes novel adaptation rules that adjust the encoder parameters after each encoded symbol. An encoder mode parameter and a G/R parameter are adapted. The encoding mode parameter controls whether the adaptive RLGR encoder and method uses Run-Length encoding and, if so, it is used. The G/R parameter is used in both modes to encode every input value (in the G/R only mode) or to encode the number or value after an incomplete run of zeros (in the RLGR mode). The adaptive RLGR codec and method also includes a decoder that can be precisely implemented based on the inverse of the encoder rules.

Abstract: An efficient lapped transform is realized using pre- and post-filters (or reversible overlap operators) that are structured of unit determinant component matrices. The pre- and post-filters are realized as a succession of planar rotational transforms and unit determinant planar scaling transforms. The planar scaling transforms can be implemented using planar shears or lifting steps. Further, the planar rotations and planar shears have an implementation as reversible/lossless operations, giving as a result, a reversible overlap operator.

Abstract: An implementation of a technology is described herein that facilitates rights enforcement of digital goods using watermarks. More particularly, it is a fingerprinting technology for protecting digital goods by detecting collusion as a malicious attack and identifying the participating colluders. If a digital pirate breaks one client and enables this client to avoid watermark detection, all content (both marked/protected an unmarked/free) can be played as unmarked only on that particular client. However, to enable other clients to play content as unmarked, the digital pirate needs to collude the extracted detection keys from many clients in order to create content that can evade watermark detection on all clients. The described implementation significantly improves collusion resistance through a fingerprinting mechanism that can identify the members of a malicious coalition even when their numbers are several orders of magnitude greater than what conventional collusion-protection schemes can accomplish.

Abstract: An implementation of a technology is described herein that facilitates rights enforcement of digital goods using watermarks. More particularly, it is a fingerprinting technology for protecting digital goods by detecting collusion as a malicious attack and identifying the participating colluders. If a digital pirate breaks one client and enables this client to avoid watermark detection, all content (both marked/protected an unmarked/free) can be played as unmarked only on that particular client. However, to enable other clients to play content as unmarked, the digital pirate needs to collude the extracted detection keys from many clients in order to create content that can evade watermark detection on all clients. The described implementation significantly improves collusion resistance through a fingerprinting mechanism that can identify the members of a malicious coalition even when their numbers are several orders of magnitude greater than what conventional collusion-protection schemes can accomplish.

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 method and system of lossless adaptive Golomb/Rice (G/R) encoding of integer data using a novel backward-adaptive technique having novel adaptation rules. The adaptive G/R encoder and decoder (codec) and method uses adaptation rules that adjust the G/R parameter after each codeword is generated. These adaptation rules include defining an adaptation value and adjusting the G/R parameter based on the adaptation value. If the adaptation value equals zero, then the G/R parameter is decreased by an integer constant. If the adaptation value equals one, then the G/R parameter is left unchanged. If the adaptation value is greater than one, then the G/R parameter is increased by the adaptation value. In addition, the adaptive G/R encoder and method include fractional adaptation, which defines a scaled G/R parameter in terms of the G/R parameter and updates and adapts the scaled G/R parameter to slow down the rate of adaptation.

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. The invention further provides a noise statistics component that stores noise statistics associated with a noise portion of an input signal and a signal+noise statistics component that stores signal+noise statistics associated with a signal and noise portion of the input signal.

Abstract: An implementation of a technology is described herein that facilitates rights enforcement of digital goods using watermarks. More particularly, it is a fingerprinting technology for protecting digital goods by detecting collusion as a malicious attack and identifying the participating colluders. If a digital pirate breaks one client and enables this client to avoid watermark detection, all content (both marked/protected an unmarked/free) can be played as unmarked only on that particular client. However, to enable other clients to play content as unmarked, the digital pirate needs to collude the extracted detection keys from many clients in order to create content that can evade watermark detection on all clients. The described implementation significantly improves collusion resistance through a fingerprinting mechanism that can identify the members of a malicious coalition even when their numbers are several orders of magnitude greater than what conventional collusion-protection schemes can accomplish.