Abstract: Briefly, in accordance with one embodiment of the invention, a method of quantizing signal samples of an image during image compression includes the following. A process to transform the signal samples from a first domain to a second domain is applied. During the transform process, signal samples are filter, by first applying scaled filter coefficients to signal samples along the image in a first direction and then applying scaled filter coefficients to signal samples along the image in a second direction, so that at the completion of the transform process of the image, selected regions of the transformed signal samples are quantized by a common value. Many other embodiments in accordance with the invention are also described.

Abstract: Briefly, in accordance with one embodiment of the invention, a method of sharpening an image includes the following. A crispening parameter is adaptively computed for a local region of a captured image based, at least in part, on a measure of the local contrast and the local brightness. A kernel is applied to the local region of the captured image using the adaptively computed crispening parameter.

Abstract: Embodiments are disclosed of generating a length-constrained Huffman code.

Abstract: Embodiments of a method of generating Huffman code length information are disclosed. In one such embodiment, a data structure is employed, although, of course, the invention is not limited in scope to the particular embodiments disclosed.

Abstract: Embodiments of a method of performing Huffman decoding are disclosed. In one such embodiment, a data structure is employed, although, of course, the invention is not limited in scope to the particular embodiments disclosed.

Abstract: Briefly, in accordance with one embodiment of the invention, a method of sharpening an image includes the following. A crispening parameter is adaptively computed for a captured image based, at least in part, on a measure of the edges and brightness of the captured image. A kernel is applied to the captured image using the adaptively computed crispening parameter.

Abstract: Embodiments of a method of generating Huffman code length information are disclosed. In one such embodiment, a data structure is employed, although, of course, the invention is not limited in scope to the particular embodiments disclosed.

Abstract: Embodiments of a method of performing Huffman decoding are disclosed. In one such embodiment, a data structure is employed, although, of course, the invention is not limited in scope to the particular embodiments disclosed.

Abstract: Embodiments of a method of performing Huffman decoding are disclosed. In one such embodiment, a data structure is employed, although, of course, the invention is not limited in scope to the particular embodiments disclosed.

Abstract: Embodiments of a method of performing Huffman decoding are disclosed. In one such embodiment, a data structure is employed, although, of course, the invention is not limited in scope to the particular embodiments disclosed.

Abstract: Numerous embodiments for a method of performing Huffman decoding are disclosed.

Abstract: A method comprising constructing virtual (Discrete Wavelet Transform) DWT sub-bands from an image by performing the DWT and then applying an inverse DWT upon the virtual sub-bands, the result of the inverse DWT representing an up-sampled version of the image. In an alternate embodiment, an apparatus comprising a computer readable medium having instructions which when executed perform constructing virtual (Discrete Wavelet Transform) DWT sub-bands from an image by performing a DWT upon the image, applying an inverse DWT upon the virtual sub-bands, the result of the inverse DWT representing an up-sampled version of the image.

Abstract: What is disclosed is a method that consists of constructing a bit-serial decoding table for a list of variable length codewords without the use of a binary decoding tree, and decoding using the decoding table, in a bit serial fashion, a bitstream encoded using those variable length codewords.

Abstract: A method is disclosed having the step of loading a register with a set of color pixel component values. The method also includes circularly shifting the register a predetermined number of times before outputting each value in the register to create a cell of color pixel component values suitable for display in a liquid crystal display. An apparatus for performing the method is also disclosed.

Abstract: What is disclosed is a method for removing noise by distinguishing between edge and non-edge pixels and applying a first noise removal technique to pixels classified as non-edge pixels and a second noise removal technique to pixels classified as edge pixels. The methodology operates on images while in a Color Filter Array (CFA) domain prior to color interpolation, and uses techniques suited to the classification, whether edge or non-edge.

Abstract: What is disclosed is a method for dynamically and automatically determining the threshold value for edge detection based on localized intensity information. Each pixel can be assigned a threshold to which its gradient or other intensity change information can be compared so as to detect whether or not the pixel belongs to an edge feature of the image or not. Further, the thresholding can be based upon the response of the human vision system so that visual appearance of the image to users is considered when analyzing localized intensity information. The localized thresholding technique can be applied to any edge detection scheme.