Abstract: A process for improved, lossless data transformation with options for adaptive compression, multidimensional prediction, multi-symbol decoding.

Abstract: A process for improved, lossless data transformation with options for adaptive compression, multidimensional prediction, multi-symbol decoding.

Abstract: A process for improved, lossless data transformation with options for adaptive compression, multidimensional prediction, multi-symbol decoding.

Abstract: A data compression system enables user-level applications to compress and decompress files to save storage space even for user-level applications that are not modified to use compressed files. User preferences associated with a user terminal are established for the compression of data, e.g. video data, wherein the user preferences comprise selective enablement of compression for at least one file type. An exemplary system determines the type of a digital data file, e.g. a digital video data file, being output from an application or input to an application, and performs transparent file-type-based compression or decompression of the digital data file, if enabled by the established user preferences. Files of the selected file types are stored with compressed formats and may even have different names, but are shown to user-level applications to have the same file names and file sizes as original uncompressed files. Therefore, the existing applications can perform operations without any disruptions.

Abstract: A fast loss less image compression system based on neighborhood comparisons compares pixel value differences with neighboring pixels and replaces such pixel values with the minimum of the differences. A marker is attached to a block of pixels, such that all the pixels in that block are compared with neighbors of one direction. The marker indicates how all of the pixels in that block are compared. Intermittent Huffman-tree construction is used such that one tree is used for several frames. Huffman coding is used to compress the resulting frame. A single Huffman-tree is constructed once every predetermined number of frames. The frequency of Huffman-tree construction can be performed according to the instantaneous availability of processor time to perform the construction. When more processing time is available, the Huffman-trees are computed more frequently. Such frequency variation can be implemented by using an input video frame buffer.

Abstract: The present invention is an interactive virtual telepresence system that allows an Internet user to view three-dimensional objects from any perspective in a studio at a remote server. The system includes several video cameras trained on the three-dimensional objects and a computer that calculates the depth information of the solid. The server broadcasts each camera view and depth information for each view. A user selects the viewing perspective desired, and the computer at the user's site receives the nearest camera views to the requested perspective and depth information of each of the views for the interpolation and renders the selected view. The invention also applies to virtual viewpoints where a virtual three-dimensional model image is stored on a network server. The server uses virtual cameras that obtain a rendered image and depth information for a particular viewpoint and sends the rendered image and the depth information to a user.

Abstract: An interactive virtual telepresence system allows an Internet user to view three-dimensional objects from any perspective in a studio at a remote server. The system includes several video cameras trained on the three-dimensional objects and a computer that calculates the voxel-representation of the solid. The server broadcasts each camera view and voxel information. A user selects the viewing perspective desired, and the computer at the user's site receives the nearest camera views to the requested perspective and voxel information for the interpolation and renders the selected view.