Supercharge Your Innovation With Domain-Expert AI Agents!

Run-length reduced binary sequence compressed encoding method

A binary sequence, compression coding technology, applied in electrical components, image communication, etc., can solve the problems of reduced coding compression efficiency, excessive coding bits, low compression efficiency, etc., to improve coding and decoding efficiency, simple algorithm, and compression efficiency. high effect

Inactive Publication Date: 2012-08-29
SHANGHAI UNIV
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The traditional binary sequence compression method generally adopts one-dimensional run-length encoding. The basic principle of one-dimensional run-length encoding is to use the variable-length encoding method to re-encode all 0-runs and all 1-runs in the binary sequence regardless of their length. Re-encoding with a shorter run length often results in the number of new encoding bits exceeding the length of the shorter run length, resulting in expansion of data volume and reducing the overall encoding compression performance
For example, the international facsimile standard CCITT.4 (G3) uses Huffman coding to encode the run length, and its compression efficiency is low

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Run-length reduced binary sequence compressed encoding method
  • Run-length reduced binary sequence compressed encoding method
  • Run-length reduced binary sequence compressed encoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The present invention is a binary sequence compression encoding method with reduced length, and its specific application objects are files such as digital images, binary images, text pages, engineering drawings and circuit diagrams. A binary sequence, the binary value is specified as 0 and 1, wherein, after decomposing the 256-level grayscale digital image according to the bit plane, 8 binary image files with binary values ​​of 0 and 1 can be obtained. For a 24-bit color image, after decomposing the three color values ​​into bit planes, 24 binary image files with binary values ​​of 0 and 1 can be obtained. After the binary sequence converted from the above file is compressed by the method of the present invention, a compressed file can be generated, and the original file can be restored by decoding the compressed file.

[0046] A binary sequence compression encoding method with run length reduction proposed by the present invention, such as figure 1 As shown, in this m...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a run-length reduced binary sequence compressed encoding method which comprises the following steps of: firstly, converting a file to be compressed into a binary code sequence consisting of 0 and 1; then converting the binary code sequence into a run length sequence and calculating an arithmetic mean value of a 0 run length and a 1 run length in the run length sequence; acquiring the maximum reduced times of the 0 run length and the 1 run length; generating run-length subsequences after the run lengths are reduced and binary code tables of conversion relations of the run-length subsequences before and after the run lengths are reduced; constructing run-length subsequence length encoding tables after the run-length subsequences are reduced and sequentially splicing the run-length subsequence length encoding tables to generate a length encoding table of the run-length sequence; generating a run-length conversion relation encoding table; and respectively adding file header data into head parts of the length encoding table and the run-length sequence conversion relation encoding table so as to generate a compressed encoding table of the binary code sequence. According to the method, the problem that the number of encoded bits is increased as a short run length is encoded again can be avoided; the encoding and decoding efficiencies are improved; an algorithm is simple; and the run-length reduced binary sequence compressed encoding method is easy to implement.

Description

technical field [0001] The invention relates to a method for compressing and encoding a run-length-reduced binary sequence, and belongs to the technical field of data lossless compression. Background technique [0002] In today's electronic information technology field, most information is expressed in digital form. The data volume of digital multimedia information, especially digital video and audio signals, is extremely large, which brings many problems to storage and transmission. If the data is not effectively compressed, it will be difficult to obtain practical applications. Therefore, data compression technology has become a key technology in today's digital communication, broadcasting and multimedia. [0003] Binary images, text pages, engineering drawings, and circuit diagrams are all binary sequences after elements are extracted line by line, and the binary elements in the binary sequence are respectively taken as 0 and 1 elements, and the continuous elements in th...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04N1/41
Inventor 高健饶珺宋奥刘万孙瑞鹏朱继
Owner SHANGHAI UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More