CN112131865B - Track traffic report digital compression processing method, device and storage medium - Google Patents

Track traffic report digital compression processing method, device and storage medium Download PDF

Info

Publication number
CN112131865B
CN112131865B CN202010954312.1A CN202010954312A CN112131865B CN 112131865 B CN112131865 B CN 112131865B CN 202010954312 A CN202010954312 A CN 202010954312A CN 112131865 B CN112131865 B CN 112131865B
Authority
CN
China
Prior art keywords
character
track traffic
group
bit
text data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010954312.1A
Other languages
Chinese (zh)
Other versions
CN112131865A (en
Inventor
崔恒斌
邓雪
陈威
郭海涛
谢东
夏飞远
段云波
王筱野
曹彦秋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Yunda Technology Co Ltd
Original Assignee
Chengdu Yunda Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu Yunda Technology Co Ltd filed Critical Chengdu Yunda Technology Co Ltd
Priority to CN202010954312.1A priority Critical patent/CN112131865B/en
Publication of CN112131865A publication Critical patent/CN112131865A/en
Application granted granted Critical
Publication of CN112131865B publication Critical patent/CN112131865B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/20Natural language analysis
    • G06F40/205Parsing
    • G06F40/216Parsing using statistical methods
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/12Use of codes for handling textual entities
    • G06F40/126Character encoding

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The application discloses a track traffic notification text digital compression processing method, a device and a storage medium, wherein the method comprises the following steps: s1: acquiring text data acquired by a vehicle-mounted sensor in rail transit, and preprocessing; s2: counting the occurrence frequency of each character in the preprocessed text data; s3: the frequency ordering of each character is carried out on the statistical result, and the ordering result is encoded by adopting a binary codebook encoding mode; s4: and (3) calculating and judging the compression rate of the text data coded in the step (S3) according to the set expected compression rate of the track traffic report number: if the compression rate of the encoded text data meets the set expected compression rate, storing, transmitting or analyzing the compressed encoded text data; if not, continuing the loop iteration S3. The application compresses the text data collected by the vehicle-mounted sensor in the track traffic, improves the text compression rate and reduces the communication transmission cost.

Description

Track traffic report digital compression processing method, device and storage medium
Technical Field
The application relates to the technical field of information compression processing, in particular to a track traffic notification text digital compression processing method, a device and a storage medium.
Background
In the fields of compression, encryption, analysis, transmission and the like of information collected by the track traffic vehicle-mounted sensor, as the data collected by the track traffic vehicle-mounted sensor has the characteristics of high frequency, high repetition and big data, the high-frequency vocabulary is subjected to key compression, so that the file size (the file memory is reduced, the file transmission rate is improved) can be greatly reduced, and meanwhile, the change trend of the data collected by the sensor can be reserved to the greatest extent.
However, the coding and decoding methods commonly used at present, such as huffman coding. Because the data collected by the track traffic sensor has the characteristics of high frequency, high repetition and big data, the Huffman code can compress the data on a certain degree, but the compression rate is relatively low, and the code word constructed by the Huffman code is not unique.
Disclosure of Invention
The application aims to provide a track traffic notification text digital compression processing method, a device and a storage medium, which solve the problems that the track traffic industry information transmission amount is large and the compression rate of the traditional code in track traffic information is low; the application is applied to the fields of compression, encryption, analysis, transmission and the like of the information acquired by the track traffic vehicle-mounted sensor, has good compression processing effect, and further greatly improves the message transmission efficiency.
The application is realized by the following technical scheme:
in a first aspect, the present application provides a track traffic notification digital compression processing method, which includes the following steps:
step S1: acquiring text data acquired by a vehicle-mounted sensor in rail transit, and preprocessing;
step S2: counting the occurrence frequency of each character in the preprocessed text data;
step S3: according to the frequency of each character counted in the step S2, the frequency of each character is ordered to the counting result, and the ordering result is encoded by adopting a binary code book encoding mode;
step S4: and (3) calculating and judging the compression rate of the text data coded in the step (S3) according to the set expected compression rate of the track traffic report number: if the compression rate of the encoded text data meets the set expected compression rate of the track traffic report text numbers, storing or transmitting or analyzing the compressed encoded text data; if the compression rate of the encoded text data does not meet the set track traffic report text number expected compression rate, continuing to iterate the step S3.
In the text data compression process, the number of characters is counted, so that the total number of characters (0 or 1) can be calculated, and the ratio of the number of the last characters (0 or 1) to the number of the first characters is the text data compression rate after one coding.
The working principle is as follows:
the information transmission quantity in the track traffic industry is large, and the code words constructed by the Huffman code are not unique because the Huffman code can compress the data acquired by the track traffic sensor in a certain degree due to the characteristics of high frequency, high repetition and large data in the conventional coding and decoding mode (such as Huffman code); therefore, the conventional encoding has a problem of low compression rate in the on-track traffic information.
When a communication message (data acquired by a vehicle-mounted sensor in rail transit) is acquired, counting the occurrence frequency of all characters of the communication message, sequencing after counting, and then sequentially using the code book codes (001, 011, 101, 111, 0001, 0101, 1001, 1101, 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001) for first coding (replacing); and then taking the file generated after the last encoding as a text file, carrying out character statistics and sorting, encoding according to the sorting result, and repeating the steps until the desired compression rate of the track traffic report text numbers is reached. Because the track traffic communication message (data collected by the vehicle-mounted sensor in track traffic) has the characteristics of high frequency, high repetition and big data, the frequency of the occurrence of the first 4 high-frequency characters in the message is far greater than that of the occurrence of the latter characters, and the first 4 coding quantities are small (001 is less than 0001 and 00001), so the message compression rate is high, the information decoding capability is strong (the same sub-message has only one coding mode), and the change trend of the data collected by the sensor is well reserved.
The method is applied to the fields of compression, encryption, analysis, transmission and the like of the information acquired by the track traffic vehicle-mounted sensor, and in practical application, the size of text data can be greatly compressed, the message transmission efficiency is greatly improved, and the communication transmission cost is reduced.
As a further preferable aspect, the text data collected by the vehicle-mounted sensor in step S1 includes axle box temperature data, vibration data and impact value data.
As a further preferable mode, the preprocessing in step S1 includes filtering processing.
As a further preferable scheme, the step S3 specifically includes the following substeps:
step S31: according to the frequency of each character counted in the step S2, sequencing the frequency of each character of the counted result;
step S32: according to the character frequency ordering obtained in the step S32, the character with the highest occurrence frequency is replaced by 001, the second highest occurrence frequency is replaced by 011, the third highest occurrence frequency is replaced by 101, and the rest characters are replaced by 111, 0001, 0101, 1001, 1101 and 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001 in an analogical way.
The encoding scheme (001, 011, 101, 111, 0001, 0101, 1001, 1101, 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001) in step S32 of the present application is described as follows:
all (any) characters are represented by (0000-1111) in the rail transit based system, i.e. they have 16 differentiation (or 16 character categories). In the present coding system, 16 character categories are divided into four groups, and the expression methods of each group are (first group: 001, 0001, 00000, 00001, second group: 011, 0101, 01000, 01001, third group: 101, 1001, 10000, 10001, and fourth group: 111, 1101, 11000, 11001).
The coding identification process comprises the following steps: first two bits are read (00 representing the first set, 01 representing the second set, 10 representing the third set, and 11 representing the fourth set). The third bit is then read: if the third bit is 1, then the first three bits represent the first character within each group and the fourth bit is no longer read. If the third bit is 0, then the fourth bit is read: if the fourth bit is 1, then the (first four bits) represents the second character within each group and the fifth bit is no longer read. If the fourth bit is 0, then the fifth bit is read: if the fifth bit is 0, the (first five bits) represents the third character in each group, and if the fifth bit is 1, the (first five bits) represents the fourth character in each group.
As a further preferable scheme, the method is applied to the fields of compression, encryption, analysis and transmission of information collected by the track traffic vehicle-mounted sensor.
In a second aspect, the present application further provides a track traffic notification digital compression processing device, where the device includes:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the track traffic notification digital compression processing method.
In a third aspect, the present application also provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the track traffic notification text digital compression processing method.
Compared with the prior art, the application has the following advantages and beneficial effects:
aiming at the characteristics of high frequency, high repetition and large data of data acquired by a vehicle-mounted sensor in rail transit, a novel compression processing mode is adopted to encode and compress texts, so that the text compression rate is improved, and the communication transmission cost is reduced.
Drawings
The accompanying drawings, which are included to provide a further understanding of embodiments of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the principles of the application. In the drawings:
FIG. 1 is a flow chart of a method for digitally compressing a notification message of an track traffic.
Detailed Description
For the purpose of making apparent the objects, technical solutions and advantages of the present application, the present application will be further described in detail with reference to the following examples and the accompanying drawings, wherein the exemplary embodiments of the present application and the descriptions thereof are for illustrating the present application only and are not to be construed as limiting the present application.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application. However, it will be apparent to one of ordinary skill in the art that: no such specific details are necessary to practice the application. In other instances, well-known structures, circuits, materials, or methods have not been described in detail in order not to obscure the application.
Throughout the specification, references to "one embodiment," "an embodiment," "one example," or "an example" mean: a particular feature, structure, or characteristic described in connection with the embodiment or example is included within at least one embodiment of the application. Thus, the appearances of the phrases "in one embodiment," "in an example," or "in an example" in various places throughout this specification are not necessarily all referring to the same embodiment or example. Furthermore, the particular features, structures, or characteristics may be combined in any suitable combination and/or sub-combination in one or more embodiments or examples. Moreover, those of ordinary skill in the art will appreciate that the illustrations provided herein are for illustrative purposes and that the illustrations are not necessarily drawn to scale. The term "and/or" as used herein includes any and all combinations of one or more of the associated listed items.
In the description of the present application, it should be understood that the terms "front", "rear", "left", "right", "upper", "lower", "vertical", "horizontal", "high", "low", "inner", "outer", etc. indicate orientations or positional relationships based on the drawings, are merely for convenience in describing the present application and simplifying the description, and do not indicate or imply that the apparatus or elements referred to must have a specific orientation, be configured and operated in a specific orientation, and thus should not be construed as limiting the scope of the present application.
Examples
As shown in fig. 1, the present application relates to a digital compression processing method for a track traffic notification message, which comprises the following steps:
step S1: acquiring text data acquired by a vehicle-mounted sensor in rail transit, and preprocessing;
step S2: counting the occurrence frequency of each character in the preprocessed text data;
step S3: according to the frequency of each character counted in the step S2, the frequency of each character is ordered to the counting result, and the ordering result is encoded by adopting a binary code book encoding mode;
step S4: and (3) calculating and judging the compression rate of the text data coded in the step (S3) according to the set expected compression rate of the track traffic report number: if the compression rate of the encoded text data meets the set expected compression rate of the track traffic report text numbers, storing or transmitting or analyzing the compressed encoded text data; if the compression rate of the encoded text data does not meet the set track traffic report text number expected compression rate, continuing to iterate the step S3.
Specific examples: the locomotive/bullet train/high-speed railway driver has a plurality of voices which call and answer in the driving process, the voice recognition system can convert the voices into texts, and then the texts are compressed and encoded and then transmitted back to the host room/control center.
In the running process of the locomotive/motor train/high-speed rail, the running part monitoring system can continuously acquire the temperature, vibration and impact of the axle box, and the monitoring data volume is extremely large, so that the monitoring data volume needs to be transmitted/stored/analyzed after compression coding.
The implementation steps are as follows:
step 1, acquiring text data (including axle box temperature, vibration and impact values) acquired by a vehicle-mounted sensor in rail transit, and preprocessing (filtering and the like);
step 2, counting the frequency of each character in the text data preprocessed in the step 1;
step 3: according to the frequency of each character counted in the step 2, sequencing the frequency of each character of the counted result, and coding the sequencing result by adopting a binary code book coding mode; the text data is encoded using specifically the codes (001, 011, 101, 111, 0001, 0101, 1001, 1101, 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001) in the codebook.
Step 4: and (3) taking the file generated after the last encoding in the step (3) as a text file, carrying out character statistics and sorting, and encoding according to a sorting result (replacing the character with 001 and 011 with the highest occurrence frequency and 101 with the second highest occurrence frequency and the third highest occurrence frequency, and replacing the rest characters with 111, 0001, 0101, 1001, 1101 and 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001 in sequence).
Step 5: and (4) repeating the step (4) all the time, and calculating and judging the compression rate of the text data coded in the step (4) until the desired compression rate of the text number is reached by the track traffic notification.
Step 6: and (3) storing, transmitting or analyzing the compressed and encoded text file reaching the track traffic report text number expected compression rate in the step (5) for subsequent use.
Wherein: the coding scheme (001, 011, 101, 111, 0001, 0101, 1001, 1101, 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001) in steps 3 and 4 of the present application is described as follows:
all (any) characters are represented by (0000-1111) in the rail transit based system, i.e. they have 16 differentiation (or 16 character categories). In the present coding system, 16 character categories are divided into four groups, and the expression methods of each group are (first group: 001, 0001, 00000, 00001, second group: 011, 0101, 01000, 01001, third group: 101, 1001, 10000, 10001, and fourth group: 111, 1101, 11000, 11001). The coding identification process comprises the following steps: first two bits are read (00 representing the first set, 01 representing the second set, 10 representing the third set, and 11 representing the fourth set). The third bit is then read: if the third bit is 1, then the first three bits represent the first character within each group and the fourth bit is no longer read. If the third bit is 0, then the fourth bit is read: if the fourth bit is 1, then the (first four bits) represents the second character within each group and the fifth bit is no longer read. If the fourth bit is 0, then the fifth bit is read: if the fifth bit is 0, the (first five bits) represents the third character in each group, and if the fifth bit is 1, the (first five bits) represents the fourth character in each group.
Through implementation of the steps 1 to 6, in normal conditions, the axle vibration data collected by the vehicle-mounted sensor is kept unchanged (or slightly changed) in the running process of the motor car/locomotive, and the data only have larger fluctuation when abnormality occurs. By the coding system, the coding result is directly fitted without decoding, and the change trend of the curve can be observed.
For example: axle joritus data of 50, 50, 50, 50, 600, 650, 50, 50, 50, 50, 50 (mm/s);
(1) Directly analyzing the above data, it can be found that the sixth and seventh data are abnormal data (peak data);
(2) If the above data is encoded as 001, 001, 001, 001, 001, 00000, 01000, 001, 001, 001.
According to the application, the coding result (2) is directly fitted, and the sixth and seventh data can still be found to be abnormal data; the text data compression rate of the information acquired by the track traffic vehicle-mounted sensor is high, the text data size can be greatly compressed, and the message transmission efficiency is greatly improved.
The working principle is as follows:
the information transmission quantity in the track traffic industry is large, and the code words constructed by the Huffman code are not unique because the Huffman code can compress the data acquired by the track traffic sensor in a certain degree due to the characteristics of high frequency, high repetition and large data in the conventional coding and decoding mode (such as Huffman code); therefore, the conventional encoding has a problem of low compression rate in the on-track traffic information.
When a communication message (data acquired by a vehicle-mounted sensor in rail transit) is acquired, counting the occurrence frequency of all characters of the communication message, sequencing after counting, and then sequentially using the code book codes (001, 011, 101, 111, 0001, 0101, 1001, 1101, 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001) for first coding (replacing); and then taking the file generated after the last encoding as a text file, carrying out character statistics and sorting, encoding according to the sorting result, and repeating the steps until the desired compression rate of the track traffic report text numbers is reached. Because the track traffic communication message (data collected by the vehicle-mounted sensor in track traffic) has the characteristics of high frequency, high repetition and big data, the frequency of the occurrence of the first 4 high-frequency characters in the message is far greater than that of the occurrence of the latter characters, and the first 4 coding quantities are small (001 is less than 0001 and 00001), so the message compression rate is high, the information decoding capability is strong (the same sub-message has only one coding mode), and the change trend of the data collected by the sensor is well reserved.
The method is applied to the fields of compression, encryption, analysis, transmission and the like of the information acquired by the track traffic vehicle-mounted sensor, and in practical application, the size of text data can be greatly compressed, and the message transmission efficiency is greatly improved.
In a second aspect, the present application further provides a track traffic notification digital compression processing device, where the device includes:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the track traffic notification digital compression processing method.
In a third aspect, the present application also provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the track traffic notification text digital compression processing method.
The foregoing description of the embodiments has been provided for the purpose of illustrating the general principles of the application, and is not meant to limit the scope of the application, but to limit the application to the particular embodiments, and any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the application are intended to be included within the scope of the application.

Claims (4)

1. The track traffic report digital compression processing method is characterized by comprising the following steps:
step S1: acquiring text data acquired by a vehicle-mounted sensor in rail transit, and preprocessing;
step S2: counting the occurrence frequency of each character in the preprocessed text data;
step S3: according to the frequency of each character counted in the step S2, the frequency of each character is ordered to the counting result, and the ordering result is encoded by adopting a binary code book encoding mode;
step S4: and (3) calculating and judging the compression rate of the text data coded in the step (S3) according to the set expected compression rate of the track traffic report number: if the compression rate of the encoded text data meets the set expected compression rate of the track traffic report text numbers, storing or transmitting or analyzing the compressed encoded text data; if the compression rate of the encoded text data does not meet the set expected compression rate of the track traffic report text numbers, continuing to iterate the step S3;
the text data collected by the vehicle-mounted sensor in the step S1 comprises axle box temperature data, vibration data and impact value data;
the step S3 specifically comprises the following substeps:
step S31: according to the frequency of each character counted in the step S2, sequencing the frequency of each character of the counted result;
step S32: according to the character frequency ordering obtained in the step S32, the character with highest occurrence frequency is replaced by 001, the character with second highest occurrence frequency is replaced by 011, the character with third highest occurrence frequency is replaced by 101, and the rest characters are replaced by 111, 0001, 0101, 1001, 1101 and 00000, 01000, 10000, 11000, 00001, 01001, 10001, 11001 in an analogical way;
based on the track traffic system, all characters are represented by 0000-1111, namely, 16 character categories are adopted; in the coding system, 16 character categories are divided into four groups, and the representation method of each group is that the first group is: 001 0001, 00000, 00001; second group: 011 0101, 01000, 01001; third group: 101 1001, 10000, 10001; fourth group: 111 1101, 11000, 11001;
the coding identification process comprises the following steps: first two bits are read: 00 represents a first group, 01 represents a second group, 10 represents a third group, and 11 represents a fourth group; the third bit is then read: if the third bit is 1, the first three bits represent the first character in each group, and the fourth bit is not read; if the third bit is 0, then the fourth bit is read: if the fourth bit is 1, the first four bits represent the second character in each group, and the fifth bit is not read any more; if the fourth bit is 0, then the fifth bit is read: if the fifth bit is 0, the first five bits represent the third character in each group, and if the fifth bit is 1, the first five bits represent the fourth character in each group;
the method is applied to the fields of compression, encryption, analysis and transmission of information acquired by the track traffic vehicle-mounted sensor;
the method is applied to the locomotive/bullet train/high-speed railway driver in the driving process, based on the voices with a plurality of calling responses, a voice recognition system can convert the voices into texts, and then the texts are compressed and encoded and then transmitted back to a host room/control center;
in the running process of the locomotive/motor train/high-speed rail, the running part monitoring system carries out compression coding on the monitoring data quantity according to the collected axle box temperature, vibration and impact monitoring data and then transmits/stores/analyzes the monitoring data quantity.
2. The method of claim 1, wherein the preprocessing in step S1 includes filtering.
3. An apparatus for digitally compressing a notice of track traffic, said apparatus comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the track traffic notification digital compression processing method of any of claims 1-2.
4. A computer-readable storage medium storing a computer program, wherein the program, when executed by a processor, implements the track traffic notification digital compression processing method according to any of claims 1-2.
CN202010954312.1A 2020-09-11 2020-09-11 Track traffic report digital compression processing method, device and storage medium Active CN112131865B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010954312.1A CN112131865B (en) 2020-09-11 2020-09-11 Track traffic report digital compression processing method, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010954312.1A CN112131865B (en) 2020-09-11 2020-09-11 Track traffic report digital compression processing method, device and storage medium

Publications (2)

Publication Number Publication Date
CN112131865A CN112131865A (en) 2020-12-25
CN112131865B true CN112131865B (en) 2023-12-08

Family

ID=73845510

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010954312.1A Active CN112131865B (en) 2020-09-11 2020-09-11 Track traffic report digital compression processing method, device and storage medium

Country Status (1)

Country Link
CN (1) CN112131865B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113792529B (en) * 2021-11-17 2022-05-06 北京华云安信息技术有限公司 Text character coding method and device for machine learning and electronic equipment
CN117200800A (en) * 2022-06-01 2023-12-08 中科寒武纪科技股份有限公司 Data compression method, device, equipment and storage medium
CN116015312B (en) * 2023-03-28 2023-06-09 山东奔虎智能科技有限公司 Gas alarm system data storage method based on Internet of things platform
CN116915258B (en) * 2023-09-12 2023-12-01 湖南省湘辉人力资源服务有限公司 Enterprise pay management method and system
CN117408857B (en) * 2023-12-13 2024-03-26 深圳市海成智联科技有限公司 Vehicle running chart compiling method based on regional collaboration

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999031559A1 (en) * 1997-12-18 1999-06-24 Honeywell Inc. Field programmable industrial process transmitter
CN1498397A (en) * 2001-02-13 2004-05-19 �����ɷ� Method and device for reducing undesired packet generation
CN101014997A (en) * 2004-02-18 2007-08-08 皇家飞利浦电子股份有限公司 Method and system for generating training data for an automatic speech recogniser
CN102054025A (en) * 2010-12-01 2011-05-11 北京中交通信科技有限公司 Traffic information resource integration processing method and system
CN103974393A (en) * 2014-05-15 2014-08-06 海南大学 Improved wireless sensor network data energy-saving compression scheme
CN104331269A (en) * 2014-10-28 2015-02-04 中国科学院自动化研究所 Executable code compression method of embedded type system and code uncompressing system
CN106067824A (en) * 2016-06-02 2016-11-02 洛阳晶云信息科技有限公司 A kind of sequencing data compression method based on bigeminy codon
CN106549674A (en) * 2016-10-28 2017-03-29 银江股份有限公司 A kind of data compression and decompressing method towards electronic health record
CN108268983A (en) * 2016-12-30 2018-07-10 河南辉煌城轨科技有限公司 A kind of management method that the distribution track train frequency is detected using queue length
CN110868336A (en) * 2019-11-11 2020-03-06 北京明略软件***有限公司 Data management method, device and computer readable storage medium
CN111600609A (en) * 2020-05-19 2020-08-28 东南大学 DNA storage coding method for optimizing Chinese storage

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8886926B2 (en) * 2012-11-07 2014-11-11 Centri Technology, Inc. Single-pass data compression and encryption

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999031559A1 (en) * 1997-12-18 1999-06-24 Honeywell Inc. Field programmable industrial process transmitter
CN1498397A (en) * 2001-02-13 2004-05-19 �����ɷ� Method and device for reducing undesired packet generation
CN101014997A (en) * 2004-02-18 2007-08-08 皇家飞利浦电子股份有限公司 Method and system for generating training data for an automatic speech recogniser
CN102054025A (en) * 2010-12-01 2011-05-11 北京中交通信科技有限公司 Traffic information resource integration processing method and system
CN103974393A (en) * 2014-05-15 2014-08-06 海南大学 Improved wireless sensor network data energy-saving compression scheme
CN104331269A (en) * 2014-10-28 2015-02-04 中国科学院自动化研究所 Executable code compression method of embedded type system and code uncompressing system
CN106067824A (en) * 2016-06-02 2016-11-02 洛阳晶云信息科技有限公司 A kind of sequencing data compression method based on bigeminy codon
CN106549674A (en) * 2016-10-28 2017-03-29 银江股份有限公司 A kind of data compression and decompressing method towards electronic health record
CN108268983A (en) * 2016-12-30 2018-07-10 河南辉煌城轨科技有限公司 A kind of management method that the distribution track train frequency is detected using queue length
CN110868336A (en) * 2019-11-11 2020-03-06 北京明略软件***有限公司 Data management method, device and computer readable storage medium
CN111600609A (en) * 2020-05-19 2020-08-28 东南大学 DNA storage coding method for optimizing Chinese storage

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
An efficient encoding algorithm using local path on huffman encoding algorithm for compression;Erdal Erdal 等;《Applied Sciences》;第9卷(第4期);1-19 *
On reducing computational complexity of codebook search in CELP coder through the use of algebraic codes;Laflamme Claude 等;《International Conference on Acoustics, Speech, and Signal Processing》;177-180 *
基于北斗短报文通信的用电信息采集***研究;陈玉卿;《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》(第01期);C042-2181 *
高安全性的物联网网关设计与实现;史冰清;《中国优秀硕士学位论文全文数据库信息科技辑》(第09期);I138-337 *

Also Published As

Publication number Publication date
CN112131865A (en) 2020-12-25

Similar Documents

Publication Publication Date Title
CN112131865B (en) Track traffic report digital compression processing method, device and storage medium
CN109120272B (en) RFID tag data compression method for discrete manufacturing workshop
CN100456638C (en) Treating method for sound frequency data and nondamage decoding method
Wu et al. Context-based, adaptive, lossless image coding
US6542640B1 (en) Data compressing apparatus, reconstructing apparatus, and its method
CN1128917A (en) High performance error control coding in channel encoders and decoders
CN1322405A (en) Device and method for entropy encoding of information words and device and method for decoding entropy-encoded information words
CN103346800B (en) A kind of data compression method and device
CN1112799A (en) Method and apparatus for encoding digital signals, method and apparatus for decoding the coded signals, and medium for recording the coded signals
CN1342309A (en) Low bit-rate coding of unvoiced segments of speech
CN115955569B (en) Monitoring video data transmission method for animal epidemic prevention quarantine center
CN116610265B (en) Data storage method of business information consultation system
CN116910285B (en) Intelligent traffic data optimized storage method based on Internet of things
CN115529357B (en) Updating abnormity matching method based on MES intercommunication interconnection production data
CN109525253A (en) Coding method of convolution code based on deep learning and integrated approach
CN115882866A (en) Data compression method based on data difference characteristic
CN101669819B (en) Electrocardiogram signal lossless compression method based on PT conversion and linear prediction combination
CN107071451A (en) A kind of Larger Dynamic real-time decompression system based on variable input traffic
CN111918071A (en) Data compression method, device, equipment and storage medium
CN1184548A (en) Predictive split-matrix quantization of spectral parameters for efficient coding of speech
CN1354943A (en) Rate detection apparatus and method for variable rate speed encoding
CN102239518B (en) Encoding and decoding method and device
CN115622571A (en) Radar target identification method based on data processing
CN1787421A (en) AMR method for effectively guaranteeing speek voice quality in wireless network
CN101980464A (en) Data coding method, decoding method, coder and decoder

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant