Abstract: A pixel filling system or method begins with an initial set of image data that is a subset of data values in a data array fk,l representing data values at corresponding positions (k,l). Some of the fk,l values are initially undefined, while others, at positions where both k and l are even numbers, have initially defined values.

Abstract: An image file, which typically represents a palette-based image that has been encoded using a first predefined run-length based encoding method, is decoded to produce an image data array. The image data array is divided into blocks; either all the blocks or a majority of the blocks have a predefined fixed size. At least some of the blocks of the image are processed to produce a corresponding re-encoded block. In particular, each such block is processed by applying a plurality of distinct encodings to the block to produce an equal plurality of distinct re-encoded block versions. One of the plurality of distinct re-encoded block versions is selected in accordance with predefined selection criteria for use as the re-encoded block. Each re-encoded block is stored in a distinct data structure, such as a file.

Abstract: An initial magnified image is generated using a lowpass magnification filter. The resulting image will generally have smaller image data gradients than the original image. Portions of the image that the user, or an application, want to sharpen are selected, and the corresponding portions of the original image data are highpass filtered by one or more highpass filters to generate sharpening data. The initial magnified image data and the sharpening data are combined to generate a sharpened magnified image. In a preferred embodiment, two highpass filters are used, and a distinct sharpening parameter is used to scale the coefficients in each of the two highpass filters. The sharpening parameters are user selectable. This gives the user greater control over the image sharpening process than use of a single highpass filter.

Abstract: An image magnifying method and apparatus magnifies a portion of an image displayed on a computer display device. The user of the computer selects a first region (called a magnification window) of the displayed image, for instance using a mouse or trackball pointer device. Image data from the screen buffer for the user selected magnification window is copied to a first buffer. A magnified image is generated from the copied image data and the magnified image is stored in the screen buffer so as to replace the copied image data. When the user moves the screen cursor, or otherwise selects a second magnification window that overlaps with the first, the magnification application copies image data for a combined window, covering both the first and second magnification windows, from the screen buffer to a second buffer.

Abstract: A data encoder and method encodes color image data. The image data include Y, U and V data. A data image quality level is selected, which corresponds to a compression ratio. The Y data is encoded using a wavelet or wavelet-like compression method in accordance with the selected data image quality level. When the compression ratio is less than a threshold value, indicating a low compression ratio, the U and V data are compressed using a JPEG compression method. Otherwise the U and V data are compressed using the wavelet or wavelet-like compression method. The encoded image data includes an indication of which compression method was used to encode the U and V data. When encoded image data is decoded by a data decoder, the decoder determines which compression method was used to encode the U and V data, and then decodes the encoded image data accordingly.

Abstract: A method and apparatus for displaying images. In one embodiment, the method comprises displaying a first image at a first resolution level, identifying a location in the first image, and generating a second image for display at a second resolution level different than the first resolution level in response to user input via a user input mechanism. The second image represents a portion of the first image at a different resolution level, which is dependent on the number of times the user input mechanism is utilized or activated (e.g., the number of mouse clicks made with a mouse). The data reuse may also be used for panning images in display windows.

Abstract: A method and apparatus for creating a background or foreground image at different resolutions with a scalable graphic thereon is described. In one embodiment, the method comprises selecting a version of an image for display with a scalable graphic. The version of the image is at one of a plurality of resolutions. The method also includes generating the version of the image from a first image bitstream from which versions of the image at two or more of the plurality of resolutions could be generated. One of the versions is generated using a first portion of the first image bitstream and a second of the versions is generated using the first portion of the first image bitstream and a second portion of the first image bitstream.

Abstract: A system and method for compressing a video data stream receives a sequence of video frames, each video frame containing an array of image data representing an image. A spatial transform module performs a spatial decomposition transform on the video frames to generate spatially transformed video frames. A temporal transform module performs a temporal decomposition transform on blocks of the spatially transformed video frames, each block containing a predefined number of the spatially transformed video frames in a sequence corresponding to the sequence of the corresponding video frames. The temporal transform module applies a temporal decomposition transform to at least one low spatial frequency subband of data in the spatially transformed video frames so as to generate temporally transformed video data. A data encoder encodes, for each block of video frames, the temporally transformed video data and the subbands of data, if any, to which the temporal decomposition transform was not applied.

Abstract: A digital camera includes a data capture device and data processing circuitry for processing image data representing captured images. The data processing circuitry processes tiles of the image data in a predefined order to generated processed image data, which is then stored as a data image file. The tiles are nonoverlapping portions of the image data. Each tile of image data is processing by applying a predefined sequence of transform layers to the tile of image data so as to generate successive layers of transform coefficients. In a preferred embodiment, the transform layers are successive applications of a wavelet-like decomposition transform. While each tile is processed, a predefined set of edge transform coefficients from a plurality of the transform layers are saved in memory for use while processing neighboring tiles.

Abstract: A digital camera includes a data capture device and data processing circuitry for processing image data representing captured images. The data processing circuitry processes tiles of the image data in a predefined order to generated processed image data, which is then stored as a data image file. The tiles are nonoverlapping portions of the image data. Each tile of image data is processing by applying a predefined sequence of transform layers to the tile of image data so as to generate successive layers of transform coefficients. In a preferred embodiment, the transform layers are successive applications of a wavelet-like decomposition transform. While each tile is processed, a predefined set of edge transform coefficients from a plurality of the transform layers are saved in memory for use while processing neighboring tiles.

Abstract: A system and method for compressing a video data stream receives a sequence of video frames, each video frame containing an array of image data representing an image. A spatial transform module performs a spatial decomposition transform on the video frames to generate spatially transformed video frames. A temporal transform module performs a temporal decomposition transform on blocks of the spatially transformed video frames, each block containing a predefined number of the spatially transformed video frames in a sequence corresponding to the sequence of the corresponding video frames. The temporal transform module applies a temporal decomposition transform to at least one low spatial frequency subband of data in the spatially transformed video frames so as to generate temporally transformed video data. A data encoder encodes, for each block of video frames, the temporally transformed video data and the subbands of data, if any, to which the temporal decomposition transform was not applied.

Abstract: A wavelet transform system and an inverse wavelet transform system are disclosed that respectively implement a wavelet transform and an inverse wavelet transform. Semi-orthogonal standard wavelets are used as the basic wavelets in the wavelet transform and the inverse wavelet transform. As a result, two finite sequences of decomposition coefficients are used for decomposition in the wavelet transform. Furthermore, two finite sequences of reconstruction coefficients that are derived from the two finite sequences of decomposition coefficients are used for reconstruction in the inverse wavelet transform. The finite sequences of decomposition and reconstruction coefficients are not infinite sequences of coefficients that have been truncated. Furthermore, in one embodiment, downsampling is not used in the wavelet transform and upsampling is not used in the inverse wavelet transform.

Abstract: A wavelet transform system and an inverse wavelet transform system are disclosed that respectively implement a wavelet transform and an inverse wavelet transform. Semi-orthogonal standard wavelets are used as the basic wavelets in the wavelet transform and the inverse wavelet transform. As a result, two finite sequences of decomposition coefficients are used for decomposition in the wavelet transform. Furthermore, two finite sequences of reconstruction coefficients that are derived from the two finite sequences of decomposition coefficients are used for reconstruction in the inverse wavelet transform. The finite sequences of decomposition and reconstruction coefficients are not infinite sequences of coefficients that have been truncated. Furthermore, in one embodiment, downsampling is not used in the wavelet transform and upsampling is not used in the inverse wavelet transform.

Abstract: An image processing system stores image files in a memory device at a number of incremental quality levels. Each image file has an associated image quality (that is fidelity or resolution) level corresponding to a quality level at which the corresponding image has been encoded. The images are initially encoded by applying a predefined transform, such as a DCT transform or wavelet-like transform, to image data received from an image capture mechanism and then applying a data compression method to the transform data. The image is regenerated by successively applying a data decompression method and an inverse transform to an image file.

Abstract: A unified system and method for encoding an array of data. If the data array is comprised of DCT data, then coefficients from corresponding positions in the data array are mapped into a common blocks in a second data array so as to group similarly valued coefficients. If the data array is comprised of wavelet data and the wavelet tile is greater than a predetermined size, then the wavelet tile coefficients are mapped into a second array so as to combine coefficients from the same wavelet family. After the DCT or wavelet coefficients have been mapped, the DC coefficients are encoded using a differential pulse code modulation (DPCM) process. The maximum number of bits required to represent any coefficient in each block family in the data array is determined. The difference between the maximum number of bits required to represent any coefficient in the entire data array and each of the block family maximums is determined and encoded.

Abstract: A digital camera includes a data capture device and data processing circuitry for processing image data representing captured images. The data processing circuitry processes tiles of the image data in a predefined order to generated processed image data, which is then stored as a data image file. The tiles are nonoverlapping portions of the image data. Each tile of image data is processing by applying a predefined sequence of transform layers to the tile of image data so as to generate successive layers of transform coefficients. In a preferred embodiment, the transform layers are successive applications of a wavelet-like decomposition transform. While each tile is processed, a predefined set of edge transform coefficients from a plurality of the transform layers are saved in memory for use while processing neighboring tiles.

Abstract: In a multiresolution image processing system images are stored in files that contain thumbnail data as well as a full image data structure. The image data is preferably wavelet or wavelet-like transform coefficients, generated by applying a wavelet or wavelet-like transform to an image multiple times. Data representing mid-level resolution images are generated on the fly by extracting from the full image data structure only the data needed for the user or application selected resolution level. If the user has selected a subset of the image for viewing at a higher resolution level, a corresponding mid-level resolution image is constructed by extracting from the full image data structure the data needed for the user specified image portion at the user or application selected resolution level. The full image data structure is preferably encoded and stored in a manner allowing the image data for mid-level resolution images to be efficiently extracted without having to compute or recompute any image coefficients.

Abstract: A video data encoding system and method represents video frame image by an initial array of data. The image data array is processed by a wavelet transform function to produce an array of transform coefficients, sometimes called a processed image data array. The processed image data array is divided into subarrays and each subarray is encoded by generating a plurality of encoded representations of the subarray, and then selecting and outputting the smallest of the encoded subarray representations. The plurality of encoded representations are generated by encoding the subarray using a predefined coding technique; generating a differential array that is equal to the difference, on a coefficient by coefficient basis, between the subarray of transform coefficients and the corresponding subarray from a prior video frame; and encoding the differential array. Each encoded subarray is preceded by a flag to indicate if the encoded data represents the subarray or the differential array.

Abstract: A data encoder and method utilizes a node list for storing a list of nodes in the data array to be processed, a branch list for storing a list of tree branches in the data array to be processed and a set list for storing a list of data sets. The method begins by initially storing in the node list node identifiers representing a predefined set of nodes in the data array, corresponding to coefficients generated by a last iteration of a data decomposition procedure. Also, it initially stores in the branch list branch identifiers representing tree branches corresponding to a predefined subset of the nodes initially listed in the node list. Each such tree branch has an associated root node and a branch depth value indicating how many node layers intervene between the root node and the nodes of the tree branch closest to the root node. The set list is initially empty, and a parameter called the LayerLimit value is also initialized.

Abstract: A data encoding system and method successively generates compressed data on a bit plane by bit plane basis, starting with the bit position of the most significant non-zero bit for the node in the data array having the largest absolute value, and then encoding the data in the array for progressively less significant bits. All the nodes in the data array are represented initially by blocks of nodes on a block list, and later in the processing by nodes on two node lists. Whenever a block contains a node whose most significant bit is on the bit plane currently being processed, the block will be subdivided recursively until all the nodes in the block whose most significant bit in on the current bit plane are placed in a node list. Data bits representing an m.sup.th least significant bit of the block and node values are written to the compressed data file first, where m is the minimum number of bits required to represent the node having the largest absolute value in the entire data array being encoded.