78 results about "Incremental encoding" patented technology

A method of delta-encoding and compressing a table containing 6-byte MAC addresses is provided. The MAC addresses are sorted, a first MAC address is stored, and only the binary differences between succeeding MAC addresses are stored. A method of reading a delta-encoded and compressed MAC address table is provided. A first unencoded MAC address is read. The remaining MAC addresses are generated by successively adding stored binary differences to the result of the previous addition. A method of encoding and compressing a location table is provided. A reference latitude and longitude is selected and stored. The offsets from the reference latitude and longitude are stored for the remaining locations. A method of reading an encoded location table is provided. A stored reference latitude and longitude is read. Stored offsets are read and applied to the reference latitude and longitude to generate a set of latitude and longitude locations.

A redundancy elimination mechanism is provided, which applies aspects of duplicate block elimination and delta encoding at the block level. The redundancy elimination mechanism divides file objects into content-defined blocks or “chunks.” Identical chunks are suppressed. The redundancy elimination mechanism also performs resemblance detection on remaining chunks to identify chunks with sufficient redundancy to benefit from delta encoding of individual chunks. Any remaining chunks that do not benefit from delta encoding are compressed. Resemblance detection is optimized by merging groups of fingerprints into super fingerprints. This merging can be constructed to ensure that if two objects have a single super fingerprint in common, they are extremely likely to be substantially similar.

A robust method to compress relations close to their entropy while still allowing efficient queries. Column values are encoded into variable length codes to exploit skew in their frequencies. The codes in each tuple are concatenated and the resulting tuplecodes are sorted and delta-coded to exploit the lack of ordering in a relation. Correlation is exploited either by co-coding correlated columns, or by using a sort order that can leverage the correlation. Also presented is a novel Huffman coding scheme, called segregated coding, that preserves maximum compression while allowing range and equality predicates on the compressed data, without even accessing the full dictionary. Delta coding is exploited to speed up queries, by reusing computations performed on nearly identical records.

The invention relates to a dynamic visual attention area extraction method based on features in the technical field of machine vision. The method comprises the following steps: first, an independent component analysis method is adopted for carrying out sparse decomposition to mass natural images so as to obtain a group of filtering base functions and a group of corresponding reconfigurable base functions and the input images are divided into small RGB blocks of m multiplied by m and projected on a group of the base to obtain the features of the images; second, effective encoding principle is utilized to measure an incremental encoding length index for each feature; third, according to the incremental encoding length index, the remarkable degree of each small block is processed through the energy reallocation of each feature and finally a remarkable map is obtained. The method can reduce a 'time slice', realize continuous sampling, therefore, data of different frames can direct the processing of remarkable degrees together, and the problem that the remarkable degrees of different frames require independent process is solved so as to realize the dynamic performance.

The present invention relates to systems, apparatus, and methods of utilizing delta coding in acceleration proxy servers. The method including storing, at a proxy server, a plurality of dictionary pages within a page storage disk and indexing, at the proxy server, the plurality of dictionary pages with fingerprint identifiers. The fingerprint identifiers are configured to uniquely identify data strings within each of the plurality of dictionary pages. The method further includes receiving, at the proxy server, a data request. The request includes a plurality of fingerprints associated with the requested data.

Methods and systems for compressing and decompressing 3-D geometry data which includes regularly tiled surface portions. One compression method includes representing a surface portion as a "vertex raster", which comprises specifying an extent value and encoding the vertex parameter values of vertices within the surface portion. The extent of the surface portion specifies the arrangement of vertices within the surface portion, and allows the vertices to be properly assembled into drawing primitives during decompression. The encoded vertex parameter values may be encoded globally (by setting initial values and corresponding delta values), locally (on a per-vertex basis), or using a combination of these techniques. Absolute, delta encoding, or delta-delta encoding may be utilized for these parameter values. Vertex parameters which may be encoded in this manner include position, color, normals, z-displacement values, texture map coordinates, and surface material properties. Additionally, connectivity information may also be encoded using this compression method by specifying quad split bits and half-resolution edges. Quad split bits are used to tessellate a quadrilateral formed by neighboring vertices of a surface portion according to the direction of the strongest color change. Half-resolution edges are utilized to gradually shift from an area of high resolution to an adjacent surface portion represented in lower resolution. For graphical objects which include a plurality of adjacent surface portions, a step command is disclosed which allows data from one surface portion to be advantageously reused. Decompression of a vertex raster representation may comprise decoding the extent value, global parameter values, and a per-vertex stream of local parameter values.

Methods and systems for compressing and decompressing 3-D geometry data which includes regularly tiled surface portions. One compression method includes representing a surface portion as a "vertex raster" by specifying an extent value and encoding the vertex parameter values of vertices within the surface portion. The extent value specifies the arrangement of vertices within the surface portion and allows the vertices to be properly assembled into drawing primitives during decompression. The encoded vertex parameter values (such as position, color, normals, z-displacement values, texture map coordinates, and surface material properties) may be encoded globally (by setting initial values and corresponding delta values), locally (on a per-vertex basis), or using a combination of these techniques. Absolute, delta, or delta-delta encoding may be utilized for these parameter values. Connectivity information may also be encoded using this compression method by specifying quad split bits and half-resolution edges. For graphical objects which include a plurality of adjacent surface portions, a step command may be used to allow reuse of data for more than one surface.

Techniques for predictive predownload of templates with delta caching are used to substantially minimize the time needed to send objects from a server to a client. A template builder generates templates for each web page. A prediction engine maintains a prediction map, responsive to web pages and other objects, the objects including the templates for web pages. The prediction engine selects objects likely to be requested by the client making the particular request, such as a next page or an object referenced by a page. A delta encoder for a page determines a delta between a current version of that page, and a template for that page, and encodes the page for delivery to the client using template information and delta information. The client is able to present the web page in response to the template information (which is likely already present at the client) and the delta information.

A redundancy elimination mechanism is provided, which applies aspects of duplicate block elimination and delta encoding at the block level. The redundancy elimination mechanism divides file objects into content-defined blocks or “chunks.” Identical chunks are suppressed. The redundancy elimination mechanism also performs resemblance detection on remaining chunks to identify chunks with sufficient redundancy to benefit from delta encoding of individual chunks. Any remaining chunks that do not benefit from delta encoding are compressed. Resemblance detection is optimized by merging groups of fingerprints into super fingerprints. This merging can be constructed to ensure that if two objects have a single super fingerprint in common, they are extremely likely to be substantially similar.

The present invention relates to systems, apparatus, and methods of utilizing delta coding in acceleration proxy servers. The method including storing, at a proxy server, a plurality of dictionary pages within a page storage disk and indexing, at the proxy server, the plurality of dictionary pages with fingerprint identifiers. The fingerprint identifiers are configured to uniquely identify data strings within each of the plurality of dictionary pages. The method further includes receiving, at the proxy server, a data request. The request includes a plurality of fingerprints associated with the requested data.

The invention discloses an absolute grating ruler multi-track encoding method. In order to solve problems, such as the accumulative error of incremental encoding and the hardware complexity of absolute encoding, etc., in the micro-nano machining measurement process, the invention adopts an absolute encoding method based on p-element M-sequence pseudo-random codes suitable for single track and multiple tracks. The encoding method is suitable for a straight line absolute position encoder, and a disk absolute angle encoder, locating can be performed at any time, and the boot back-to-zero operation does not needed. Moreover, an incremental encoding strip is provided, so measurement accuracy can be improved by suing the phase segmentation method. The encoding method is an absolute position encoding method has advantages of easy generation, replication and processing, large encoding capacity, low decoding cost and macro-micro composite performance. The encoding method comprises ordinary single-track binary M-sequence absolute grating ruler straight-line encoding, a M-sequence disk encoder, code expanding method multi-code-channel pseudo-random code straight-line encoding and code expanding method p-element M-sequence pseudo-random codes, and the maximum encoding method is obtained by combing the above the encoding methods.

Systems and methods are described for avoiding redundant data transfers using delta coding techniques when reliably and opportunistically communicating data to multiple user systems. According to embodiments, user systems track received block sequences for locally stored content blocks. An intermediate server intercepts content requests between user systems and target hosts, and deterministically chucks and fingerprints content data received in response to those requests. A fingerprint of a received content block is communicated to the requesting user system, and the user system determines based on the fingerprint whether the corresponding content block matches a content block that is already locally stored. If so, the user system returns a set of fingerprints representing a sequence of next content blocks that were previously stored after the matching content block. The intermediate server can then send only those content data blocks that are not already locally stored at the user system according to the returned set of fingerprints.

The invention provides a multi-thread fast storage lossless compression method for FASTQ data, and is applied to compression of a DNA sequence. The method comprises a data classification step of inputting original FASTQ data, and dividing short reading of the original FASTQ data into three data flows, namely metadata, a mass fraction and a base sequence; a data compression step of aiming at the metadata, using an incremental encoding way to detect and eliminate redundant information of the metadata; aiming at the mass fraction, using a bit level PPM (Prediction by partial matching) prediction model and arithmetic coding to compress; aiming at the base sequence, using improved arithmetic coding of a fixed order to compress; and a data output step of archiving and merging compression results of different data flows, and outputting final data after compression. The invention further provides a multi-thread fast storage lossless compression system for the FASTQ data. The technical scheme provided by the invention can improve the compression efficiency and compression speed.

Methods for monitoring the accuracy of positional measurements by encoders that translate positional information into signals include determining the difference between two signals generated by the encoder and comparing the difference to a threshold value. Differences greater than the threshold indicate an error in measurement by the encoders. The methods may be practiced using one or more computer programs. The methods may be practiced with any encoder, including absolute and incremental encoders. Encoders include components to implement the methods.

The invention discloses a fountain code decoding method under a multi-address channel. A sending end adopts a digital fountain code in a increment encoding mode, a receiving end computes initial likelihood ratio of each user, the initial likelihood ratio is sent into a BP decoder to obtain the decoded likelihood ratio, the outside information according to the likelihood ratio before / after the decoding is computed, and then the probability of sending information 0 and information 1 by the user is computed, the probability is used as prior probability to transmit to other user to update the initial likelihood ratio, and iteration updating of the likelihood ratio is performed according to above method till to correct decoding or achieving the maximum iteration time. The BP algorithm and the likelihood ration iteration updating are combined through the method disclosed by the invention, the bit error rate performance and the throughput rate of the multi-user decoding in multi-address interference are improved.

The invention provides a coding method, a decoding method, a coding device and a decoding device for three-dimensional grid data. The three-dimensional grid data include one or more polyhedral grid units. The coding method includes acquiring index information and coordinate information of a vertex of one grid unit, predicating and compressing the index information to generate topological information, predicating and compressing the coordinate information to generate geometrical information, intersecting codes according to the topological information and the geometrical information to generate grid unit information of the grid unit, and outputting the grid unit information. By the coding method, the decoding method, the coding device and the decoding device, high compression rate can be acquired without losses of any detail information, and dependence on network bandwidth is lowered; the coding method and the coding device are applicable to streaming incremental coding, and all grid data do not need to be acquired at one step when coding is started, so that cost for data transmission can be reduced, transmission delay can be avoided, and further, user experience for big data of internet transmission grids can be improved.

Systems and techniques are provided for providing a scalable current leaderboard. Entries may be received. The entries may include an identifier and a score. The entries may be sorted according to a sorting criterion to obtain a leaderboard. The entries may be ranked with a rank according to the position of the entry on the leaderboard. The entry may include the rank. The leaderboard may be divided into buckets. Each bucket may include consecutive entries from the leaderboard. One of the entries may be included at the end of a first buckets and at the beginning of a second buckets. The buckets may be ordered sequentially. The bucket may be updated with score versions to produce an updated bucket, where the score versions may include new versions and old versions.

The invention provides a frame buffering data compression method flow chart for LCD overdrive, including the following steps: executing 2X2 partitioning for the video image, calculating the gradient of the R, G and B color components of the present block in the partitioned video image in the horizontal direction and in the perpendicular direction, obtaining the maximum value of the gradient in horizontal direction and in the perpendicular direction; judging that the gradient of the present block is in the greyscale slow change according to the maximum value of the gradient in horizontal direction and in the perpendicular direction, and executing the gradient increment encoding for the present block according to the gradient. The invention solves the problem in the prior art that the larger block is needed for obtaining over three times of compression ratio, however the larger block size causes the decrease of the compressibility, further the glitter, the step and the like can appear when the bigger anamorphic former frame decompression data is used to execute OverDrive, the movement at the speed being not equal to one half of the block size exists.

Systems and methods are described for avoiding redundant data transfers using delta coding techniques when reliably and opportunistically communicating data to multiple user systems. According to embodiments, user systems track received block sequences for locally stored content blocks. An intermediate server intercepts content requests between user systems and target hosts, and deterministically chucks and fingerprints content data received in response to those requests. A fingerprint of a received content block is communicated to the requesting user system, and the user system determines based on the fingerprint whether the corresponding content block matches a content block that is already locally stored. If so, the user system returns a set of fingerprints representing a sequence of next content blocks that were previously stored after the matching content block. The intermediate server can then send only those content data blocks that are not already locally stored at the user system according to the returned set of fingerprints.

The invention belongs to the technical field of space information acquisition and processing in information technology, in particular to a document mode-based GML compression method. The method comprises the following steps of: separating a structure from data and expressing the structure by using a document mode and a status switching selection code of a tree automaton in a mode verification document process; and separating spatial data from non-spatial data and performing incremental encoding on coordinate geometry data. Therefore, a large amount of redundant information is removed and the volume of a GML document is reduced effectively.

The invention discloses a counting device and method based on an incremental encoder. The method comprises steps that an ARM chip receives level signals input by a first GPIO interface and a second GPIO interface and the level signals are converted into sequential codes; the ARM chip compares the sequential codes with pre-stored turning codes, wherein the turning codes comprises forward turning codes and backward turning codes; and if the sequential codes are identical to the turning codes, the ARM chip modifies counting values storied in a shared memory according to turning and level signals corresponding to the turning codes. Embodiments of the invention enable the circuit to be simplified, and achieve rapid and effective counting of the incremental encoder.

A system orders a set of objects to be optimally compressed using techniques such as delta encoding which compress data by saving differences between sequential objects. In one embodiment, the system determines transition costs associated with transitioning from each object in the set to each other object in the set. The system determines an ordering of the objects that minimizes a total of all the transition costs and compresses the set in the determined order. In another embodiment, the system determines an estimated optimal ordering for data compression. The system extracts feature values from the objects and applies a projection function to the feature values to generate scalar representations of the objects, for example, by projecting the feature values onto a space filling curve. An ordering of the scalar values for the objects determines an ordering for compressing the objects.

A geometry compression method for sort middle, screen space, graphics of the standard graphics pipeline. The pipeline processes a 3D database having geometric objects such as triangles and textures into a display image which may be shown to the user on a display monitor. Lossless compression is achieved through redundancy elimination. Triangles are processed following their transformation to screen space, so that the vertex world 3D locations are determined in their projection to the screen 2D locations. Triangles may also be processed by back projecting the screen space scanlines to test locations against the world space triangles. The general technique is to identify the portions of the data that have little or no effect on the rendered output and remove them during compression. Specific examples disclosed include full packing, constant color, delta coding, edge sharing, slope coding, and color quantization.

An apparatus and method are disclosed for converting XML data to a destination encoding format. A receive module receives a request for bytes of XML data in a destination encoding format streamed from a source XML file. A transfer module transfers the requested bytes from a byte conversion buffer to a request buffer in response to the request and the byte conversion buffer having at least the requested bytes. A conversion module, in response to the byte conversion buffer lacking the requested quantity of bytes, transfers part of the requested bytes to the request buffer, fetches input bytes from an XML file, stores the bytes in a receive buffer, transfers the input bytes through a byte-to-character converter to a character conversion buffer, transfers the characters through a character-to-byte converter to the byte conversion buffer, and transfers enough bytes to the request buffer to satisfy the request.

A geometry compression method for sort middle, screen space, graphics of the standard graphics pipeline. The pipeline processes a 3D database having geometric objects such as triangles and textures into a display image which may be shown to the user on a display monitor. Lossless compression is achieved through redundancy elimination. Triangles are processed following their transformation to screen space, so that the vertex world 3D locations are determined in their projection to the screen 2D locations. Triangles may also be processed by back projecting the screen space scanlines to test locations against the world space triangles. The general technique is to identify the portions of the data that have little or no effect on the rendered output and remove them during compression. Specific examples disclosed include full packing, constant color, delta coding, edge sharing, slope coding, and color quantization.

A digital incremental encoder for generating an output signal indicative of an angular position, a direction of rotation, and a speed of rotation of a shaft. A counter receives a PWM signal indicative of the angular position of the shaft and a clock signal from an angular position sensor, and generates a multi-bit output. A latch latches the multi-bit output, a first bit and a second bit of which are used to generate the output signals that include the first bit. The first bit and the second bit may be XOR'd together to generate an XOR output included in the output signals. A direction of rotation may be derived from a quadrature phase relationship between the first bit and the XOR output. The angular position sensor may be an NCAPS or MT-NCAPS. A linear position sensor may be used instead of an angular position sensor to generate the PWM signal.

The disclosed embodiments provide a system for processing and storing data. During operation, the system obtains a set of records sorted by a first integer value, with each record containing the first integer value and one or more additional integer values. The system sets, for each integer value in each record, a delta encoding bit that indicates whether the integer value is delta encoded with respect to at least one other integer value in the records. Next, the system uses a delta encoding state represented by the delta encoding bit to calculate an encoded value from the integer value. The system then encodes a length of the encoded value in a length tag for the integer value and replaces the integer value in the record with an encoded version containing the delta encoding bit, the length tag, and the encoded value.

A method and an apparatus for 3D model compression are described. Correlation among the components of the 3D model are explored and utilized to increase the compression ratio. A principal parameter is selected and examined for determining a sorting dimension. Components are then sorted according to the sorting dimension. The principal parameter values of the sorted components are incrementally encoded. Other parameters are encoded as usual. The corresponding decoder decodes the principal parameter values of the components incrementally and decodes other parameter values as usual. Further an adaptive bit determination algorithm is disclosed to adaptively determine the number of bits assigned to each parameter value based on the value range thereof and the distortion requirements.

Systems and techniques are provided for providing a scalable current leaderboard. Entries may be received. The entries may include an identifier and a score. The entries may be sorted according to a sorting criterion to obtain a leaderboard. The entries may be ranked with a rank according to the position of the entry on the leaderboard. The entry may include the rank. The leaderboard may be divided into buckets. Each bucket may include consecutive entries from the leaderboard. One of the entries may be included at the end of a first buckets and at the beginning of a second buckets. The buckets may be ordered sequentially. The bucket may be updated with score versions to produce an updated bucket, where the score versions may include new versions and old versions.