4777 results about "Data compression" patented technology

A foveated imaging system, which can be implemented on a general purpose computer and greatly reduces the transmission bandwidth of images has been developed. This system has demonstrated that significant reductions in bandwidth can be achieved while still maintaining access to high detail at any point in an image. The system is implemented with conventional computer, display, and camera hardware. It utilizes novel algorithms for image coding and decoding that are superior both in degree of compression and in perceived image quality and is more flexible and adaptable to different bandwidth requirements and communications applications than previous systems. The system utilizes novel methods of incorporating human perceptual properties into the coding the decoding algorithms providing superior foveation. One version of the system includes a simple, inexpensive, parallel pipeline architecture, which enhances the capability for conventional and foveated data compression. Included are novel applications of foveated imaging in the transmission of pre-recorded video (without eye tracking), and in the use of alternate pointing devices for foveation.

A system and method of optimizing transmission of a program to multiple users over a distribution system, with particular application to video-on-demand for a CATV network. The system includes, at a head end of the CATV network a scheduling and routing computer for dividing the video program stored in long term fast storage or short term fast storage into a plurality of program segments, and a subscriber distribution node for transmitting the program segments in a redundant sequence in accordance with a scheduling algorithm. At a receiver of the CATV network there is provided a buffer memory for storing the transmitted video program segments for subsequent playback whereby, in use, the scheduling algorithm can ensure that a user's receiver will receive all of the program segments in a manner that will enable continuous playback in real time of the program. Under the control of controller the receiver distinguishes received program segments by a segment identifier so that redundant segments captured in capture memory are then stored in buffer memory from which the segments can be retrieved and decompressed in data compressor for immediate or subsequent viewing. In one embodiment, the method of this invention includes dividing at least some segments into fragments, and transmitting one fragment of each segment during a playback interval of a duration, for example, equal to a playback time of a segment.

An integrated circuit active memory device receives task commands from a component in a host computer system that may include the active memory device. The host system includes a memory controller coupling the active memory device to a host CPU and a mass storage device. The active memory device includes a command engine issuing instructions responsive to the task commands to either an array control unit or a DRAM control unit. The instructions provided to the DRAM control unit cause data to be written to or read from a DRAM and coupled to or from either the processing elements or a host / memory interface. The processing elements execute instructions provided by the array control unit to decompress data written to the DRAM through the host / memory interface and compress data read from the DRAM through the host / memory interface.

A data compression system and method for that is capable of detecting and eliminating repeated phrases of variable length within a window of virtually unlimited size.

In a memory system with a file storage system, a scheme for allocating memory locations for a write operation is to write the files substantially contiguously in a memory block one after another rather than to start a new file in a new block. In this way, they are more efficiently packed into the blocks by being written contiguously one after another. In a preferred embodiment, an incrementing write pointer points to the write location in memory for the next data for a file, which is independent of the offset address of the data within the file. When a current write block becomes filled with file data, an erased block is allocated, and the write pointer is moved to this block. Similarly a relocation pointer is used for data relocation during garbage collection or data compaction operations.

Adaptive system for medical monitoring distributes data processing among computing devices connected to a network to optimize usage of computational resources, network communication speed and user experience. Data processing is distributed into several levels with bi-directional communication between the levels (computing devices) to coordinate and adjust data compression, filtering, and analysis, as well as the size of buffered data available for transmission and / or receiving.

A method is disclosed for compressing a frame of data representing parameter values, a time at which each parameter value was recorded, and an orientation of a sensor at the time each parameter value was recorded. Generally the method includes performing a two-dimensional transform on the data in the orientation domain and in a domain related to the recording time. In one embodiment, the method includes calculating a logarithm of each parameter value. In one embodiment, the 2-D transform includes generating a Fourier transform of the logarithm of the parameter values in the azimuthal domain, generating a discrete cosine transform of the transform coefficients in the time domain. This embodiment includes quantizing the coefficients of the Fourier transform and the discrete cosine transform. One embodiment of the method is adapted to transmit resistivity measurements made by an LWD instrument in pressure modulation telemetry so that while-drilling images of a wellbore can be generated. The one embodiment includes encoding the quantized coefficients, error encoding the encoded coefficients, and applying the error encoded coefficients to the pressure modulation telemetry.

A multi-function robotic device may have utility in various applications. In accordance with one aspect, a multi-function robotic device may be selectively configurable to perform a desired function in accordance with the capabilities of a selectively removable functional cartridge operably coupled with a robot body. Localization and mapping techniques may employ partial maps associated with portions of an operating environment, data compression, or both.

Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.

A service gateway provides a proxy between a client protocol and a plurality of standard communication protocols. The service gateway provides asymmetrical routing, data compression and encryption to optimize client processing power and communication link bandwidth. The service gateway enables content translation between clients and service providers. The service gateway keeps track of client available memory and sequence numbers in messages to generate error codes when applicable. A store and forward message capability is provided along with abstract session identifiers. The service gateway supports user datagram protocol.

A multi-function robotic device may have utility in various applications. In accordance with one aspect, a multi-function robotic device may be selectively configurable to perform a desired function in accordance with the capabilities of a selectively removable functional cartridge operably coupled with a robot body. Localization and mapping techniques may employ partial maps associated with portions of an operating environment, data compression, or both.

A method and apparatus for increasing the bandwidth of a memory controller system are provided. According to the invention, data received at an interface of a memory controller system is compressed in the memory controller by a compression engine for storage in associated memory. The address of the data written to memory is maintained in a memory controller. When data is read from the memory for provision to an interface of the memory controller, the memory manager retrieves the data from memory and provides it to a decompression engine. The decompression engine restores the data to its original, uncompressed form. The data is then provided to the appropriate interface.

Some aspects of the invention provide methods, systems, and computer program products for creating a static dictionary in which longer byte-strings are preferred. To that end, in accordance with aspects of the present invention, a new heuristic is defined to replace the aforementioned frequency count metric used to record the number of times a particular node in a data tree is visited. The new heuristic is based on counting the number of times an end-node of a particular byte-string is visited, while not incrementing a count for nodes storing characters in the middle of the byte-string as often as each time such nodes are visited. The result is an occurrence count metric that favours longer byte-strings, by being biased towards not incrementing the respective occurrence count values for nodes storing characters in the middle of a byte-string.

A method for compressing a stream of application layer network traffic communicated over a transport layer connection of a virtual private network connection between a client and a server using an appliance. The appliance intercepts one or more transport layer packets of a stream of application network traffic communicated via a transport layer connection of a virtual private network connection between a client and a server. The appliance accumulates data from a payload of the intercepted transport layer packets, determines data accumulated for transmission should be compressed based on one or more compression trigger, and compresses the accumulated data into a self-contained compression block for transmission.

Methods and apparatus for dynamically adapting the degree of compression used in compressing data based upon the type of contents contained within a packet are disclosed. According to one aspect of the present invention, an apparatus that forwards data across a digital communications network includes a compression switch, a compression system, and an output interface. The compression switch receives the data, determines a content type associated with the data by examining the data, and assigns a compression level to the data in response to the determined content type. The compression system is arranged to compress the data based upon the compression level, while the output interface forwards the compressed data across the network. In one embodiment, the apparatus also includes a network congestion estimator that determines a level of network congestion.

The defacto standard for text entry on standard telephone keypads, such as fixed phones, cell phones, fax machines, and the like is a multi-tap method where one of several letters associated to a input means is selected by pressing the input means a number of times equal to the position of the desired letter in the ordering of letters associated to the input means. Typically, for the standard alphabetic ordering, a large number of presses are required to obtain any given letter. The present invention uses prefix information to dynamically reorder the choices so that the average number of input means manipulations is reduced. This method is applicable to any language composed of strings of symbols for which the probability of any given symbol appearing in a string at a given position is correlated with the probability of another symbol appearing in the string. Using adapted data compression techniques, the amount of information which needs to be stored for excellent results on any given language can be kept small.

Some aspects of the invention provide methods, systems, and computer program products for creating a static dictionary in which longer byte-strings are preferred. To that end, in accordance with aspects of the present invention, a new heuristic is defined to replace the aforementioned frequency count metric used to record the number of times a particular node in a data tree is visited. The new heuristic is based on counting the number of times an end-node of a particular byte-string is visited, while not incrementing a count for nodes storing characters in the middle of the byte-string as often as each time such nodes are visited. The result is an occurrence count metric that favours longer byte-strings, by being biased towards not incrementing the respective occurrence count values for nodes storing characters in the middle of a byte-string.

A service gateway provides a proxy between a client protocol and a plurality of standard communication protocols. The service gateway provides asymmetrical routing, data compression and encryption to optimize client processing power and communication link bandwidth. The service gateway enables content translation between clients and service providers. The service gateway keeps track of client available memory and sequence numbers in messages to generate error codes when applicable. A store and forward message capability is provided along with abstract session identifiers. The service gateway supports user datagram protocol.

A multi-function robotic device may have utility in various applications. In accordance with one aspect, a multi-function robotic device may be selectively configurable to perform a desired function in accordance with the capabilities of a selectively removable functional cartridge operably coupled with a robot body. Localization and mapping techniques may employ partial maps associated with portions of an operating environment, data compression, or both.

Adaptive control of codebook regeneration in data compression mechanisms. In one implementation, the present invention provides a means controlling the frequency of codebook updates based on expected performance gains resulting from codebook regeneration. The present invention, in one implementation, employs a mechanism that simulates the expected compression performance of a hypothetically, updated codebook. A compression module compares the simulated compression performance to the actual performance of the codebook used to compress the data, and updates the codebook if a threshold condition is satisfied.

An apparatus and method for image data compression performs a modified zero-tree coding on a range of image bit plane values from the largest to a defined smaller value, and a vector quantizer codes the remaining values and lossless coding is performed on the results of the two coding steps. The defined smaller value can be adjusted iteratively to meet a preselected compressed image size criterion or to meet a predefined level of image quality, as determined by any suitable metric. If the image to be compressed is in RGB color space, the apparatus converts the RGB image to a less redundant color space before commencing further processing.

The present invention relates to a method of intelligent 2D and 3D object and scene modeling, transformation and manipulation and more particularly this invention relates to the field of computer modeling, virtual reality, animation and 3D Web streaming. The method uses attributed hypergraph representations (AHR) for modeling, transforming and manipulating objects. From one or more 2D views of a 3D object or scene, range information is first computed and then a triangular mesh model is constructed. The data structure is designed to handle the transformations on the representation corresponding to movements and deformations of the object. In an attributed hypergraph, the attributes associated with the hyperedges and the vertices facilitates modeling of various shapes with geometrical, physical or behavior features. As a hierarchical and generic representation, AHR enables pattern matching, recognition, synthesis and manipulation to be carried out at different resolution levels on different subsets depending on the context. Symbolic computation on knowledge represented in the format of attributed hypergraphs becomes straightforward. Given the features of a 3D object or scene, the procedure of constructing the AHR corresponds to the concept of functor in category theory, which maps one category to another one. The transformations of AHR are in the form of a set of operations defined on attributed hypergraphs, which stand for the motions and deformations of the object. This representation is applied to various modeling and manipulation tasks on 3D objects. The process of motion analysis of a 3D object is the task of extracting a sequence of AH operators from the AHR of the object. A 3D scene can be modeled by AHR and then altered / augmented with other 3D models, by which an augmented reality can be built. Given the AHR's of two different 3D shapes, 3D morphing may be accomplished by matching the two AHR's and then mapping the difference to a sequence of AH operators. Model based animation of an object can be accomplished by applying a set of AH operators to its AHR. The AHR method forms a data compression system for efficient web streaming over the Internet.

A portable audio / visual program player comprising a video display, electrical-audio transducer, a central processing unit and associated logic and memory circuits. The portable audio / visual player is able to play pre-recorded programs from a memory device, which includes compress digital audio and video program information and a decoder program. The digital compression method comprises a series of compression methods to greatly reduce the amount of digital data. The data compression method is particularly suitable for motion video comprising cartoons and similar images, but is also suitable for other applications.

The invention provides a neutral network processor based on data compression, a design method and a chip. The processor comprises at least one storage unit used for storing operating instructions and data participating in calculation, at least one storage unit controller used for controlling the storage unit, at least one calculation unit used for executing calculation of a neutral network, a control unit connected with the storage unit controllers and the calculation units and used for acquiring instructions stored by the storage unit through the storage unit controllers and analyzing the instructions to control the calculation units, and at least one data compression unit used for compressing data participating in calculation according to a data compression storage format. Each data compression unit is connected with the corresponding calculation unit. Occupancy of data resources in the neutral network processor is reduced, the operating rate is increased, and energy efficiency is improved.

In optical filter systems and optical transmission systems, an optical filter compresses data into and / or derives data from a light signal. The filter way weight an incident light signal by wavelength over a predetermined wavelength range according to a predetermined function so that the filter performs the dot product of the light signal and the function.

In a memory system with a file storage system, an optimal file handling scheme is adaptively selected from a group thereof based on the attributes of the file being handled. The file attributes may be obtained from a host or derived from a history of the file had with the memory system. In one embodiment, a scheme for allocating memory locations for a write operation is dependent on an estimated size of the file to be written. In another embodiment, a scheme for allocating memory locations for a relocation operation, such as for garbage collection or data compaction, is dependent on an estimated access frequency of the file in question. In this way, the optimal handling scheme can be used for the particular file at any time.

A method and mechanism is disclosed for implementing storage and retrieval of data in a computing system. Data compression is performed on stored data by reducing or eliminating duplicate values in a database block. Duplicated values are eliminated within the set of data that is to be stored within a particular data storage unit. Rather than writing the duplicated data values to the data storage unit, the on-disk data is configured to reference a symbol table a single copy of each duplicated data value. Column reordering may be performed in an embodiment to further improve compression efficiency. The column reordering may be performed to allow efficient removal of trailing NULL values from on-disk storage.