245 results about "Run-length encoding" patented technology

In a closed-loop wireless communication system, a codebook-based precoding feedback compression mechanism is provided to remove redundancy from the precoding feedback that is caused by channel correlation in time and frequency. Redundancy due to temporal correlation of the transmission channel is removed by sending precoding feedback only if there is a change in the precoder state for the channel to the receiver. Redundancy due to frequency correlation is removed by run length encoding the precoding feedback, thereby compressing the precoding feedback prior in the frequency domain. By compressing the precoding feedback, the average rate of precoder feedback is reduced.

A method comprising entropy encoding into bits a set of data values, and packing into storage the entropy encoded bits by reversing the bits of words with unknown length and keeping in blocks the words with known lengths. For instance, in an entropy encoded data set that uses both Huffman coding and zero run coding, the class code may be reversed in bit order from right to left rather left to right while the words of known length such as the zero run code and Huffman pointer are stored left to right in blocks. This data arrangement is particularly useful in an MMX based machine.

A system comprises an encoder configured to compress attribute information and/or spatial for a point cloud and/or a decoder configured to decompress compressed attribute and/or spatial information for the point cloud. To compress the attribute and/or spatial information, the encoder is configured to convert a point cloud into an image based representation. Also, the decoder is configured to generate a decompressed point cloud based on an image based representation of a point cloud. A block/sub-block organization scheme is used to encode blocks and sub-blocks of an occupancy map used in compressing the point cloud. Binary values are assigned to blocks/sub-blocks based on whether they contain patches projected on the point cloud. A traversal path is chosen that takes advantage of run-length encoding strategies to reduce a size of an encoded occupancy map. Also, auxiliary information is used to further improve occupancy map compression.

A method and system of lossless compression of integer data using a novel backward-adaptive technique. The adaptive Run-Length and Golomb/Rice (RLGR) encoder and decoder (codec) and method switches between a Golomb/Rice (G/R) encoder mode only and using the G/R encoder combined with a Run-Length encoder. The backward-adaptive technique includes novel adaptation rules that adjust the encoder parameters after each encoded symbol. An encoder mode parameter and a G/R parameter are adapted. The encoding mode parameter controls whether the adaptive RLGR encoder and method uses Run-Length encoding and, if so, it is used. The G/R parameter is used in both modes to encode every input value (in the G/R only mode) or to encode the number or value after an incomplete run of zeros (in the RLGR mode). The adaptive RLGR codec and method also includes a decoder that can be precisely implemented based on the inverse of the encoder rules.

A method and system of lossless compression of integer data using a novel backward-adaptive technique. The adaptive Run-Length and Golomb/Rice (RLGR) encoder and decoder (codec) and method switches between a Golomb/Rice (G/R) encoder mode only and using the G/R encoder combined with a Run-Length encoder. The backward-adaptive technique includes novel adaptation rules that adjust the encoder parameters after each encoded symbol. An encoder mode parameter and a G/R parameter are adapted. The encoding mode parameter controls whether the adaptive RLGR encoder and method uses Run-Length encoding and, if so, it is used. The G/R parameter is used in both modes to encode every input value (in the G/R only mode) or to encode the number or value after an incomplete run of zeros (in the RLGR mode). The adaptive RLGR codec and method also includes a decoder that can be precisely implemented based on the inverse of the encoder rules.

A lithographic apparatus comprises an array of individually controllable elements and a data processing pipeline. The array of individually controllable elements modulates a beam of radiation. The data processing pipeline converts a first representation of a requested dose pattern to a sequence of control data suitable for controlling the array of individually controllable elements in order substantially to form the requested dose pattern on a substrate. The data processing pipeline comprises an offline pre-processing device and an online rasterizer. The offline pre-processing device converts the first representation of the requested dose pattern to an intermediate representation, which can be rasterized in a fewer number of operations than the first representation. The storage device stores the intermediate representation. The online rasterizer accesses the stored intermediate representation and produces therefrom a stream of bitmap data to be used to generate the sequence of control data substantially in real time.

A computer implemented method of video date encoding generates a mask having one bit corresponding each spatial frequency coefficient of a block during quantization. The bit state of the mask depends upon whether the corresponding quantized spatial frequency coefficient is zero or non-zero. The runs of zero quantized spatial frequency coefficients determined by a left most bit detect instruction are determined from the mask and run length encoded. The mask is generated using a look up table to map the scan order of quantization to the zig-zag order of run length encoding. Variable length coding and inverse quantization optionally take place within the run length encoding loop.

The invention discloses spatial overlap analysis method and system used in a geographic information system (GIS). The method comprises the following steps of: converting vector data input to layers in the GIS into raster data, and representing by adopting run coding; executing overlap operation on the raster data represented by adopting run coding; and converting the overlapped raster data into the vector data to obtain overlapped layers. The invention can avoid the disadvantages of computation geometric algorithms and increases the overlap efficiency by utilizing the advantages of a raster algorithm.

Positions of avatars in a virtual world may be communicated to clients using multiple bitcode resolutions to minimize required communication bandwidth between a virtual world server and virtual world clients, thereby allowing transmission of all avatars' positions to every other player. Lower resolution bitcodes may be based on a lower resolution grid overlaid on the virtual world, whereas higher resolution bitcodes may be based on a higher resolution grid overlaid on the virtual world. In one example, a virtual world server may determine the bitcode resolution to use based on a distance between an avatar to which the position information is to be sent and other avatars in the virtual world. Resolution may include spatial resolution, where nearer avatars' locations are provided with higher resolution bitcodes, or temporal resolution, where the transmission frequency of position information is greater for nearer avatars. Position information in a transmission stream may further be condensed by using run length encoding.

The invention discloses a digital image compressing, encrypting and encoding combined method, and belongs to the technical field of image encrypting. The method is achieved on the basis of the JPEG compressing and encoding standard which is most widely applied at present, and the encrypting algorithm based on chaos is integrated with the encoding process; according to the characteristic that DC coefficients and AC coefficients are separately encoded on the basis of the JPEG standard, the DC coefficients and the AC coefficients of an image are separately encrypted; in order to give consideration to both security and compressing efficiency, all the DC coefficients and part of the AC coefficients are encrypted through the method, coefficients at the same positions in all DCT blocks are divided into different groups and are scrambled and diffused within the groups, and damage to differential encoding and run length encoding in the encrypting process is reduced as much as possible; scrambling and diffusing are achieved on the basis of logistic chaotic mapping and Chebyshev chaotic mapping respectively. The experiments prove that the method has high data compressing capacity while providing effective image data security protection.

A remote sensing image near-lossless compression hardware realization method based on improved JPEG-LS algorithm comprises the steps (1) directly calculating to obtain a pixel reconstruction value by the pixel actual value of an input image and accomplishing the calculation in a single clock period by using a formula Rx=int[Ix/(2Near+1)]*(2Near+1), in the formula, the Rx and the Ix are respectively the pixel reconstruction value and actual value, the int is rounding operation, and the Near is a compression ratio control factor; (2) calculating a context environmental variable Q according to the obtained pixel reconstruction value, if Q is equal to 0, performing run coding, otherwise, going to a step (3) of performing conventional coding; (3) calculating the predictive value of the current pixel by the pixel reconstruction value according to the geometric position relation between the current pixel and the adjacent pixel; (4) calculating the residual value between the predictive value and actual value of the current pixel; and (5) performing Golomb coding after quantising the obtained residual value, and synchronously updating the parameter variable corresponding to the context environmental variable Q using the quantisation result.

A method for transmitting, storing and managing data by compressing data packets to be transmitted and received over an advanced metering infrastructure (AMI) network with low-capacity memory and low-transfer rate. A number of transmission packets may be reduced using at least one of a bitmap interval algorithm that assigns a bitmap value to each interval, thereby reducing a number of request packets, a repeated-bitmap interval algorithm that represents sequential data values as bitmap values by toggling a bit value between 0 and 1 in each data value when a change occurs in the sequential data values, and a run-length encoding algorithm that compresses data by encoding run length of sequential identical data.

The invention publishes a medical image ROI compression method based on a lifting wavelet and a PCNN, which comprises the following steps of: circling a region of interest by a doctor, and separating the region of interest from a region of no interest by a difference image method; adopting lossless compression in the region of interest, constructing compactly supported biorthogonal wavelet transformation through a lifting scheme, and then carrying out Huffman encoding; adopting lossy compression in the region of no interest, segmenting gray-value pixel approximate points through the PCNN, carrying out ignition operation, and then carrying out run-length encoding; and finally carrying out inverse transformation restoration, merging the region of interest and the region of no interest, and eliminating a boundary discontinuity problem through linear interpolation. Experimental results prove that the region of interest can be flexibly selected and controlled by the compression method, the used information for doctor diagnosis can be completely reserved, and the compression ratio is higher. Meanwhile, the computation for an ROI mask and the computation and the encoding for a wavelet coefficient difference value are omitted, the compression and decompression time and the algorithm complexity are reduced, and the image processing and transmitting efficiency is improved.

The invention discloses a multilayer Hash structure and run coding-based lossless compression method for data and mainly aims to solve the problems that a compression effect on repeating data is poor and the longest matching character string is hard to find out when matching character strings are searched by adopting a Lempel-Ziv-Oberhumer (LZO) compression method. The multilayer Hash structure and run coding-based lossless compression method for the data comprises the following implementation steps of: (1) reading in original data, and preprocessing the original data by using run coding to obtain to-be-compressed data; (2) judging the read data is a new character or not; searching the longest matching character string if the read data is not the new character, and coding according to the repeated length and the anaphora distance of the character, and coding according to a coding method for the new character if the read data is the new character; and (3) updating a reading position according to the coded character, and judging whether the end of the to-be-compressed data is coded or not, ending if the end of the to-be-compressed data is coded, and continuously reading in the to-be-compressed data if the end of the to-be-compressed data is not coded, and returning to the step (2). Compared with other traditional lossless compression methods, the multilayer Hash structure and run coding-based lossless compression method for the data is higher in compression efficiency, and can be used in storage devices with requirements on the compression speed and the compression efficiency of the data.

A multi-scanner scans a signal according to several different patterns. A scanning pattern selector determines which scanning pattern produced the most efficient coding result, for example, for runlength coding, and outputs a coded signal, coded most efficiently, and a selection signal which identifies the scanning pattern found to be most efficient.

While a natural image having a resolution of 600 dpi is enlarged at a predetermined magnification ratio and is printed at a resolution of 1200 dpi, if the magnification ratio is equal to or more than two, the natural image is enlarged by using a nearest neighbor method. If the magnification ratio is less than two, a reduction image is generated by reducing an enlargement image obtained by enlarging an object image based on a magnification ratio to 1/2, and the reduction image is enlarged to twice the size by using the nearest neighbor method. The natural image obtained by enlarging in this manner is compressed and encoded by using prediction encoding and run-length encoding with which a run-length value having a prediction error of 0 is calculated.

A drawing processing apparatus is provided to solve the problems in which pixels of a drawing primitive with sub-pixel information may have an increased amount of data causing a burden on implementation. A setup processing unit sets up various parameters to allow a digital differential analyzer (DDA) to process the stream of a drawing primitive supplied from a primitive input unit. The DDA performs DDA processing on the drawing primitive supplied from the setup processing unit for conversion into pixel data. The DDA performs the DDA processing on a per rectangular pixel set basis along a scan line to output the pixel data of the drawing primitive on a per rectangular pixel set basis. A compression encoding unit encodes the sub-pixel information of each pixel contained in the rectangular pixel set by run length encoding for output to a FIFO buffer.

A reading unit reads image data. A re-reading unit that re-reads the image data read by the reading unit by performing, in a pixel matrix consisting of a plurality of pixels of the image data read by the reading unit, a process of scanning pixels in a partition in which at least two pixels are respectively aligned in a column direction and in a row direction in a predetermined order in a predetermined alignment sequence of partitions. A multivalue run length-encoding unit encodes the image data re-read by the re-reading unit to multivalue run length data indicating at least color data and run lengths of the color data.

The invention discloses a method for learning driving styles based on a self-coded regularization network. The method mainly comprises the following steps: performing GPS (Global Positioning System) data conversion, performing regularization network self coding, performing target function sum approximation, establishing a run length encoding frame, and establishing the number of drivers, namely, in a group of unknown driving, inputting GPS data of vehicles establishing a statistic characteristic matrix as network input, introducing a marker of a limited training set as a prior into an unsupervised automatic encoder, reconstructing hidden layer RNN (Recurrent Neural Network) characteristics, extracting a neck layer of a regularization self-coding structure as a final driving style characteristic representation layer, and estimating the number of drivers in the driving process. By adopting the method, the limit that the driving style of an unknown driver is hard to describe can be solved, a self-coded regularization network is designed to directly learn driving habits of the driver from the GPS data, then recognition and classification precision of different drivers can be improved, and a relatively safe and accurate method can be provided for design of assistant and automatic driving systems.

According to the present invention, an image coding apparatus (103) that encodes quantized coefficients corresponding to an image signal as target data to be processed is provided with a run-length encoding unit (RLE2) that assigns variable length codes to the quantized coefficients using code tables. The run-length encoding unit (RLE2) forms a second code table by optimizing a first code table to the target data to be processed, and selects one of the first and the second code tables as a code table that is to be employed for the assignment of the variable length codes in accordance with a quantization parameter (QP) or a variable length coding selection signal (VlcSel), whereby redundancy of information included in the target data to be processed can be effectively eliminated, and the compression ratio for the image signal or the like can be further increased.

An image data compression apparatus which compresses code data obtained by compressing image data by a fixed length encoding method so as to reduce a scale of hardware and reduce a development cost of software for an image data compression a binary image data processing part processes binary image data in accordance with a run length encoding method, the binary image data processing part including an encoding part which encodes run lengths of the binary image data by an encoding part. A multiple value image data processing part processes multiple value image data in accordance with a prediction encoding method. The encoding part of the binary image data processing part is commonly used by the multiple image data processing part so that the encoding part compresses both the binary image data and the multiple value image data.

The invention discloses a mobile device memory compression method based on dictionary encoding and run-length encoding. The mobile device memory compression method based on the dictionary encoding and the run-length encoding mainly solves the problem that an existing dictionary encoding compression method and an existing run-length encoding compression method are low in compression ratio of memory data. The mobile device memory compression method based on the dictionary encoding and the run-length encoding mainly comprises the following steps of (1) reading in the memory data and the lengths of the storage data, (2) judging whether the memory data are compressible data, directly recording the lengths of the data and the data when the data are not compressible data, and using a run-length encoding compressed format to compress continuous identical character strings when the data are compressible data, (3) using a dictionary compressed format to compress other ordinary memory data, (4) judging whether compression is carried out on the tail of the memory data, stopping compressing when the compression is carried out on the tail of the memory data, and continuing reading in the memory data when the compression is not carried out on the tail of the memory data. Compared with existing other storage compression methods, the mobile device memory compression method based on the dictionary encoding and the run-length encoding is higher in compression ratio, thus more residual space can be released for an internal storage of a mobile device, operating efficiency of the mobile device can be improved, and the mobile device memory compression method based on the dictionary encoding and the run-length encoding can be used in mobile devices which need memory compression.

The invention relates to a lossless compressing method and lossless uncompressing method of fault wave record data. The compressing method comprises the steps that firstly a comtrade configuration file is analyzed, and a dat data file is obtained; the dat data file is divided into data basic information, analog channel data and state quantity channel data according to content; the data basic information is stored in a data basic information area; sampling point data of a current period of each analog channel and synchronous sampling point data of the last period of the analog channel are subtracted in sequence, and the results are stored into an analog data pre-processing compression area; the state quantity channel data are compressed in a run coding mode, and the compressed data are stored into a state data pre-processing compression area; one-time dictionary compression is conducted on a pre-processed compression file, and a final compression file is formed. According to the respective data characteristics of the three parts, data pre-processing compression is conducted in different modes, secondary compression is conducted on the pre-processed data, and the compression is efficient and lossless. The uncompressing method is the reverse process of the data compression and the process of data reconstitution.