Abstract: A digital signal processing circuit includes a chain of processing units having a selectable number of taps and a tap selection circuit. The tap selection circuit is coupled to the chain of processing units to establish the number of taps of the chains.

Abstract: Embodiments of a method and/or apparatus to provide a binary image are disclosed.

Abstract: Embodiments of an architecture for processing gray-level images is disclosed.

Abstract: Embodiments of a color image matching scheme are disclosed. In one embodiment, a pixel intensity count is determined for color components of color images in a database and for a query color image. A fuzzy similarity and/or a fuzzy dissimilarity between the query image and the database images is computed based at least in part on the pixel intensities counts. An image is selected from the database based at least in part on the computed fuzzy similarity and/or dissimilarity, where computing a fuzzy similarity and/or dissimilarity includes computing the matching intensity. Other embodiments are described and claimed.

Abstract: Embodiments of a color video coding and decoding scheme are disclosed. In one embodiment, an efficient color coding scheme for color video using three dimensional (3-D) discrete wavelet transforms (DWT) employing correlation among different color components is described. At least one of the color components is coded, and an adjustment to at least some of the remaining color components relative to the coded color component are then coded. This adjustment comprises a partial error adjustment based at least in part on a ratio of color components intensities. Other embodiments, for instance for decoding, are described and claimed.

Abstract: A digital signal processing circuit includes a chain of processing units having a selectable number of taps and a tap selection circuit. The tap selection circuit is coupled to the chain of processing units to establish the number of taps of the chains.

Abstract: The present disclosure relates to the compression of data and, more particularly, to the compression of video data based at least upon a variable bit rate compression scheme.

Abstract: A method comprising determining an optimal color correction matrix accounting for both total noise variance and color reproduction error for a captured image; and correcting the colors of said captured image using said optimal color correction matrix.

Abstract: A computer system includes a memory and a processor. The memory stores a program to cause the processor to provide wavelet coefficients that indicate an image. The processor represent each wavelet coefficient as a collection of ordered bits, and the processor codes the bits of each order to indicate zerotree roots that are associated with the order.

Abstract: Briefly, in accordance with one embodiment of the invention, a method of using hue to interpolate color pixel signals includes the following. For a particular pixel location in a subsampled color image, differences in hue are compared for two mutually orthogonal directions across the particular pixel location. A color signal value for that particular pixel location for a color plane other than the color plane of the pixel signal value in the subsampled color image of that location is computed. The computation includes relatively weighing the differences in hue values, the relative weights depending, at least in part, on the difference in hue value in one direction relative to the other.

Abstract: A computer system includes a memory and a processor. The memory stores a program to cause the processor to provide error data that indicate motion in an image. The processor represent each error signal as a collection of ordered bits, and the processor codes the bits of each order to indicate zerotree roots that are associated with the order.

Abstract: Briefly, in accordance with one embodiment, a technique for coding the movement of a head or face from a sequence of images is disclosed. A variety of potential alternative embodiments are discussed.

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: An Euler number representation of a binary image is calculated. The binary image is considered as a series of partial images. The Euler number for each partial image is calculated using properties of runs of zeros and ones in the pixel matrix, and the results are combined together. The operations may be performed sequentially or in parallel. The calculations may be performed using discrete logic components for on-chip VLSI implementations.

Abstract: Briefly, in accordance with one embodiment on the invention, a method of compressing a data set includes the following. In multiple passes, each data signal in the data set is categorized into a category of a predetermined set, and, for selected categories of the predetermined set, the data signals for that category are coded using a codebook for that category. Briefly, in accordance with another embodiment of the invention, a method of decompressing a compressed data set includes the following. For compressed data signals in the data set in one category of a predetermined set of categories, a signal associated with the particular category is employed for the compressed data signal, and, for selected categories of the predetermined set, the compressed data signals for that category are decoded using a codebook for that category.

Abstract: A computer system includes a memory and a processor. The memory stores a program to cause the processor to provide error data that indicate motion in an image. The processor represent each error signal as a collection of ordered bits, and the processor codes the bits of each order to indicate zerotree roots that are associated with the order.

Abstract: An integrated color interpolation and color space conversion technique and apparatus. A raw image that is arranged in a Bayer pattern where each pixel has only one of the color components needed to form a full color resolution pixel may be converted using this technique directly to a YCrCb image space without any intermediate conversion or interpolation steps. Specifically, in one instance, an 8-bit Bayer pattern raw image may be converted directly to a 12-bit YCrCb space in a single step approach. Such an integrated technique may more readily and inexpensively implemented in hardware such as on a digital camera, or in software.

Abstract: A method of encoding a watermark into a digital image. The method includes partitioning an original image into blocks and then determining a variance value of each block. The blocks are then arranged according to the variance values. A number of selected blocks are identified, where the number depends upon the size of the watermark. The blocks selected are then arranged by their location. Data from the watermark is used to replace bits in a representation of each of the selected blocks with data from the watermark. A method of decoding is also discussed.

Abstract: A method of locating a half-pixel resolution motion vector. The method first determines a sum of absolute difference for a predetermined number of neighbors to a current pixel. The gradient of these sums of absolute differences is then calculated. A motion vector is then selected based upon the gradient that indicates which vector lies in a direction of steepest descent. This motion vector is then used in motion compensation for video compression.

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.