127 results about "Run length coding" patented technology

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 relates to a fisheye image correction method based on distorted straight slope calculation, belonging to the field of digital image processing. According to the fisheye image correction method, the actual slope of a distorted straight line is calculated according to a projective invariance principle by utilizing the specific geometric characteristics of radial distortion and parameter values of a polynomial correction model are obtained by solving linear equations on the basis of the actual slope of the distorted straight line. The fisheye image correction method outstandingly reduces the calculation complexity under the condition of having ideal correction accuracy and completes the position mapping codes between a distorted image and a corrected image according to the solved polynomial correction model by utilizing a run length coding LUT (Look Up Table), thereby realizing the weighting bilinear interpolation of the corrected image; and in addition, the fisheye image correction method has convenient hardware implementation and efficient real-time processing capacity.

Embedded Graphics Coding (EGC) is used to encode images with sparse histograms. In EGC, an image is divided into blocks of pixels. For each block, the pixels are converted into binary representations. For each block, the pixels are scanned and encoded bit-plane by bit-plane from the most significant bit-plane (MSB) to the least significant bit-plane (LSB). The pixels in the block are partitioned into groups. Each group contains pixels with the same value. From the MSB to the LSB, the groups in the current bit plane are processed. During the processing, a group is split into two, if pixels in the group have different bit values in the bit-plane being encoded. Then, the encoder sends the refinement bit for each pixel in the group and the encoder splits the original group into two. A method is described herein to compress the refinement bits which employs context-adaptive prediction and binary run-length coding.

Fast and efficient data compression can be carried out. Original image data are subjected to wavelet transform. The obtained wavelet-transformed data are classified and bit allocation is determined. Based on the determined bit allocation, the wavelet-transformed data are quantized and quantized data are obtained. The quantized data are classified into 0 data and non-zero data. Binary classification information data indicating this classification are also obtained. The classification information data are coded according to a coding method having a comparatively simple operation, such as Huffman coding and run length coding. The multi-valued, non-zero data are coded according to a coding method having a high compression efficiency although having a comparatively complex operation, such as universal coding and Golomb-Rice coding.

The invention provides a compensation table compression method and a decompression method for an OLED display device. The compensation table compression method for an OLED display device compresses data size of compensation tables through run-length coding of data which is arranged continuously and equal in values in the compensation tables, and through adjusting the size of a preset number threshold value, condition of the run-length coding to start is controlled, to prevent to increase redundancy and expand data size caused by coding. The method can compress size of the compensation tables, reduce system storage space occupied by the compensation tables, and shorten time for transmitting and burning data on a production line.

The invention discloses a data compression method based on the set run, including reading the data to be compressed in the memorizer of the computer; looking for the characteristic character set in the data; coding; storing the compressed data into the memorizer of the computer. Looking for the characteristic character set in the data includes the following steps: counting the isolated character; judging whether presenting the isolated character, if true, executing the next step, else converting all the characters into the characteristic characters, wherein the continuous occurrence number mapped by each character is the numerical value, and converting to the coding step; sorting the isolated character; traversing the number of each element that may occur of all the characteristic character set, selecting the number of the characteristic character set when the compression ratio reach the minimum; mapping each element in the characteristic character set till the element appears continuously. The invention advances the efficiency of the run length coding, and obtains better data compression effect in the computer data compression process.

Compression of local data uses various methods to encode location data (e.g. line numbers and, optionally, column numbers) representing references to a source code information symbol in a source code file. Run length encoding and other run encoding methods are used. A preferred run encoding method encodes a run-encoded bitmap comprising a set of runs, in which each run has a first run field that provides a starting line for the run, and a second run field that encodes as a bitmap the remaining lines in the run in which the reference appears. A run length field may be used to indicate the length of the second run field. Another run field may be used to encode the length of the first run field, to permit further compression.

The invention discloses a JPEG-LS run length coding hardware implementation method which improves and optimizes the standard procedure of JPEG-LS run length coding, introduces coding mapping operation, implements coding by comparing a table look-up operation pipeline, and solves cycle coding in multiple clock cycles in an original algorithm; in addition, since only residual coding adopts index value RUN index single-cycle update operation and tour length coding and residual coding adopt index value RUNindex two-cycle update operation, coding speed is improved. The method is completely implemented by FPGA, has the advantages of full pipeline and good real time property, and can be applied to hardware algorithm of JPEG-LS lossless and near lossless compression.

The invention discloses a run length coding-based two-dimensional code information hiding method. The method comprises the following steps of: simultaneously processing carrier information carrier andsecret information set; Before a two-dimensional code is generated, embedding secret information secret to be encrypted into carrier information card through an encryption algorithm, then generatingencrypted information into a two-dimensional code image QR, and genertaing a key Key; enabling The sender to send the two-dimensional code image QR to a receiver; And after receiving the QR of the two-dimensional code image, enabling the receiver to decrypt the QR through a decryption algorithm to obtain carrier information carrier and secret information set. And compressing the text information by adopting a run-length coding algorithm to obtain bits in which information can be embedded, thereby achieving the encryption purpose of the invention. The two-dimensional code information hiding method based on run-length coding has the advantages of being large in transmitted information amount, good in information concealment, high in robustness and compression resistance, high in safety and the like.

The invention relates to a high-speed image compression method based on optimal wavelet sub-band interlacing, which comprises the following steps of: acquiring CCD (Charge Coupled Device) camera data and carrying out 3-level wavelet transform on the CCD camera data; converting parallel sub-band data subjected to the wavelet transform into a sub-band interlaced serial data stream and carrying out optimal quantization; predicating quantized lowest frequency wavelet sub-band data by using a JPEG-LS (Joint Photographic Experts Group-Lossless Standard) algorithm; and carrying out run-length coding and exponential-Golomb coding on the quantized and predicated data to obtain a final code stream of an acquired image. The invention also provides a compression device. According to the image compression method and device, the whole process of image data acquisition, coding and transmission can be achieved by only using a single-chip field programmable logic device, the compression ratio can be adjusted by a quantization step and the throughput of single-channel data can reach 350 MSPS (Million Samples Per Second).

This invention discloses a method for realizing inserted image compression based on travel coding including: inputting images, carrying out wavelet transformation, approaching to quantization quickly step by step and travel coding based on a binary system description and entropy coding and outputting compressed images, in which, the image coefficient after wavelet transformation is quickly quantized by setting up sub-band peak value to reduce the time necessary for approaching to quantization and increase the performance of the compression method and reduce the complexity of the method compared with many wavelet image compression methods with a zero-tree structure as the character.

Embodiments of the present invention relate to run-length encoded sequences and supporting efficient offset-based updates of values while allowing fast lookups. In an embodiment of the present invention, an indexing scheme is disclosed, herein called count indexes, that supports O(log n) offset-based updates and lookups on a run-length sequence with n runs. In an embodiment, count indexes of the present invention support O(log n) updates on bitmapped sequences of size n. Embodiments of the present invention can be generalize to be applied to block-oriented storage systems.

The invention discloses a multidimensional characteristic extraction method and device based on connected domain analysis. An obtained gray scale image is preprocessed to obtain a region of interest, the region of interest is subjected to first noise reduction to remove noise points, then the region of interest after the first noise reduction is subjected to boundary tracking and marking to obtain a target region, the target region is subjected to second noise reduction to remove noise blocks in the target region, and finally characteristic extraction is carried out. The accuracy of the image is improved by two times of noise reduction processing before extracting the characteristics, and the extracted characteristics are enabled to be more accurate; the gray scale image is compressed by run-length coding, and the run-length coding of the gray scale image conversion is operated in the preprocessing, two times of noise reduction and boundary tracking and connected characteristic marking of the gray scale image, so that the operation speed is improved, and processing demands of real-time images are met; and 20 characteristics can be extracted, and industrial field detection demands can be basically met.

A method for realizing quick run length coding / decoding circuit includes marking nonzero coefficient while quantizing when run length is coded and finalizing real time RLC coding when Hoffman coding is carried on in system, obtaining RLC coding while finalizing counter ¿C scanning when run length is decoded and finalizing recovery of quantization coefficient when counter ¿C quantizing is carried on.

The invention discloses a variable length coding method which comprises the following steps: residual coefficient sequences of input data blocks are obtained; run length coding of the residual coefficient sequences is performed; after a level sequence and a run sequence are obtained, run length coding of the level sequence and the run sequence is performed, and then variable length coding of two run length code word pairs obtained is respectively performed. The invention simultaneously discloses a variable length coding device which comprises a pretreatment module and a variable length coding module. The invention further utilizes characteristic information of levels which are 1 in the level sequence and characteristic information of runs which are 0 in the run sequence and has the advantages of reduction of compressed code rate and improvement of peak signal-to-noise ratio. The invention can be applied in various coders and simultaneously also can be completely compatible with prior international H.264 standard and domestic AVS standard.

The invention discloses a run-length coding FPGA (field programmable gate array) implementing method in a JPEG-LS (joint photographic experts group-lossless standard). The method includes: on the basis of a JPEG-LS implementing method, setting up, storing and looking up a mapping table according to index values so as to obtain an accumulated sum array, comparing run lengths with values in the accumulated sum array for five times according to a binary comparison method so as to obtain cycle indexes to achieve run-length coding, and simply and effectively achieving index value updating in two steps. By the method, the problem of complex updating structures of the index values is solved, run-length coding is achieved in short period, a mapping table structure is simplified by accumulated operations, and hardware resources are saved. Besides, a fully-pipelined structure is adopted, hardware resource consumption is less, and the method is real-time and easy to implement a field programmable gate array.

A computer readable storage medium tangibly embodying machine-readable digital data arranged to facilitate expedited searching. The data includes a plurality of words residing in a table having rows and columns, each word residing in a different row and each letter of the word occupying a different column in that row. Each continuous run of same letters in a column forms an interval. The words are positioned relative to each other to maximize lengths of the intervals, and/or optimize efficiency of compression of the columns by run length encoding.