CN116805537A - Data processing method for heart-lung rehabilitation management system - Google Patents
Data processing method for heart-lung rehabilitation management system Download PDFInfo
- Publication number
- CN116805537A CN116805537A CN202311060991.8A CN202311060991A CN116805537A CN 116805537 A CN116805537 A CN 116805537A CN 202311060991 A CN202311060991 A CN 202311060991A CN 116805537 A CN116805537 A CN 116805537A
- Authority
- CN
- China
- Prior art keywords
- code
- segment
- continuous
- dictionary
- segments
- 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.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 14
- 230000002612 cardiopulmonary effect Effects 0.000 claims abstract description 105
- 238000000034 method Methods 0.000 claims description 21
- 210000004072 lung Anatomy 0.000 claims description 20
- 238000002372 labelling Methods 0.000 claims description 3
- 238000007726 management method Methods 0.000 abstract description 18
- 230000006837 decompression Effects 0.000 abstract description 8
- 238000013144 data compression Methods 0.000 abstract description 4
- 238000013500 data storage Methods 0.000 abstract description 2
- 230000008569 process Effects 0.000 description 7
- 230000011218 segmentation Effects 0.000 description 5
- 208000024891 symptom Diseases 0.000 description 4
- 230000036541 health Effects 0.000 description 3
- 238000007906 compression Methods 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 208000000059 Dyspnea Diseases 0.000 description 1
- 206010013975 Dyspnoeas Diseases 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H50/00—ICT specially adapted for medical diagnosis, medical simulation or medical data mining; ICT specially adapted for detecting, monitoring or modelling epidemics or pandemics
- G16H50/70—ICT specially adapted for medical diagnosis, medical simulation or medical data mining; ICT specially adapted for detecting, monitoring or modelling epidemics or pandemics for mining of medical data, e.g. analysing previous cases of other patients
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/12—Use of codes for handling textual entities
- G06F40/126—Character encoding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/237—Lexical tools
- G06F40/242—Dictionaries
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Health & Medical Sciences (AREA)
- Public Health (AREA)
- Medical Informatics (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Primary Health Care (AREA)
- Biomedical Technology (AREA)
- Epidemiology (AREA)
- Pathology (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to the technical field of data compression and storage, in particular to a data processing method for a heart-lung rehabilitation management system, which comprises the following steps: acquiring a cardiopulmonary patient data sequence and the number of single character types in the sequence, further acquiring discontinuous code segments, continuous code segments and the number of continuous segments corresponding to the continuous code segments, and further acquiring an initial coding dictionary; acquiring a first coding length according to the initial coding dictionary; acquiring a second coding length according to the number of single character types and the number of continuous segments, and further acquiring a single character dictionary and a continuous segment number dictionary; and obtaining the coding dictionary according to the first coding length, the single character dictionary and the continuous segment dictionary to obtain compressed data, and further finishing decompression of the compressed data. The invention encodes according to the longer code segment formed by the code segments continuously appearing in the cardiopulmonary patient data sequence, greatly increases the code segment length divided by the traditional LZ coding algorithm, reduces the storage space of the dictionary, and improves the coding efficiency by increasing the code segment length.
Description
Technical Field
The invention relates to the technical field of data compression and storage, in particular to a data processing method for a heart-lung rehabilitation management system.
Background
The cardiopulmonary rehabilitation management system is a medical health management system based on the Internet and mobile technology, and aims to provide comprehensive management and monitoring services for cardiopulmonary rehabilitation patients, and generally comprises the functions of health condition monitoring, rehabilitation planning, emergency response mechanism, communication and cooperation and the like. The cardiopulmonary rehabilitation system generally needs to collect vital sign, symptom and other information of a patient, and make a personalized rehabilitation plan according to the physical condition of the patient in a rehabilitation stage, so that a large amount of data needs to be stored, and therefore, in order to reduce the storage and transmission cost of the data and ensure that important information of the patient is not lost, the requirements of researching and applying an efficient data compression algorithm are generated.
The coding algorithm is a lossless compression algorithm, can ensure that compressed data is completely restored after decompression, and cannot lose data information. However, due to the large data volume and complex data distribution of the information stored in the heart and lung rehabilitation system, the traditional +.>The coding algorithm divides the character sequence into a plurality of code segments and takes the shortest code segments as possible based on the repeated pattern in the data, so that a larger dictionary is required to be maintained to store the code segments, which may occupy more memory space and reduce coding efficiency because the code segments are smaller, and even the compressed data may be larger than the original data.
Disclosure of Invention
The invention provides a data processing method for a heart-lung rehabilitation management system, which aims to solve the existing problems.
The data processing method for the heart-lung rehabilitation management system adopts the following technical scheme:
one embodiment of the present invention provides a data processing method for a cardiopulmonary rehabilitation management system, the method including:
acquiring a cardiopulmonary patient data sequence and the number of single character types in the cardiopulmonary patient data sequence;
acquiring a discontinuous code segment according to the cardiopulmonary patient data sequence; acquiring continuous code segments according to the cardiopulmonary patient data sequence; acquiring the number of continuous segments corresponding to the continuous code segments according to the continuous code segments; acquiring an initial coding dictionary according to the non-continuous code segments, the continuous code segments and the number of continuous segments corresponding to the continuous code segments; acquiring a first coding length according to the initial coding dictionary; acquiring a second coding length according to the number of single character types and the number of continuous segments; acquiring a single character dictionary and a continuous segment number dictionary according to the second coding length;
obtaining a coding dictionary according to the first coding length, the single character dictionary and the continuous segment number dictionary to obtain compressed data;
and decompressing the compressed data.
Preferably, the acquiring the discontinuous code segments according to the cardiopulmonary patient data sequence includes:
traversing characters in the cardiopulmonary patient data sequence, carrying out longest matching on the cardiopulmonary patient data sequence according to the existing code segments from the traversed characters, and taking the currently traversed characters as a code segment when the matching fails, wherein the code segment is a discontinuous code segment and is recorded as a first discontinuous code segment;
when a substring taking the current traversed character as a starting sequence in a heart lung patient data sequence is successfully matched with any code segment, the substring taking the current traversed character as the starting sequence in the heart lung patient data sequence is taken as a next code segment of the successfully matched code segment, the next code segment is marked as a first code segment, the substring with the same length as the first code segment after the starting sequence is obtained in the heart lung patient data sequence is marked as the first sequence, the first code segment is matched with the first sequence, if the first code segment fails to be matched with the first sequence, the next single character of the starting sequence in the heart lung patient data sequence is spliced to be used as a code segment, and the code segment is a discontinuous code segment and is marked as a second discontinuous code segment;
stopping until all characters in the cardiopulmonary patient data sequence have been traversed, and acquiring all non-continuous code segments.
Preferably, the acquiring the continuous code segments and the number of the continuous segments corresponding to the continuous code segments according to the cardiopulmonary patient data sequence includes:
traversing characters in a cardiopulmonary patient data sequence, when a substring taking the currently traversed characters as a starting sequence is successfully matched with any code segment in the cardiopulmonary patient data sequence, taking the substring taking the currently traversed characters as the starting sequence in the cardiopulmonary patient data sequence, acquiring the next code segment of the successfully matched code segment, marking the next code segment as a first code segment, marking the substring which is equal to the first code segment in length after the starting sequence is acquired in the cardiopulmonary patient data sequence, marking the first code segment as a first sequence, matching the first code segment with the first sequence, marking the next code segment in a coding dictionary as a second code segment if the first code segment is successfully matched with the first sequence, marking the substring which is equal to the second code segment in length after the starting sequence is acquired in the cardiopulmonary patient data sequence, marking the next code segment as a second sequence, matching the second code segment with the second sequence, acquiring a third code segment and the third sequence until the third code segment and the third sequence are successfully matched, and stopping the matching in turn; splicing the initial sequence, each code segment successfully matched and the next single character of the initial sequence in the cardiopulmonary patient data sequence to be used as a code segment, and using the code segment as a continuous code segment;
stopping until all characters in the cardiopulmonary patient data sequence have been traversed, and acquiring all continuous code segments.
Preferably, the obtaining the number of the continuous segments corresponding to the continuous code segments according to the continuous code segments includes:
and obtaining the successful times of matching of any continuous code segment, and taking the successful times of matching as the number of the continuous segments of the continuous code segment.
Preferably, the obtaining the initial coding dictionary according to the non-continuous code segments, the continuous code segments and the number of the continuous segments corresponding to the continuous code segments includes:
constructing an empty initial coding dictionary, wherein the initial coding dictionary comprises three columns, namely a segment number, a code segment and a code word, and sequentially filling the segment number, a discontinuous code segment and a continuous code segment into the segment number and the code segment column of the initial coding dictionary according to the sequence of characters in a traversing cardiopulmonary patient data sequence to obtain the code word of a first discontinuous code segment: taking 0 and the content of the first discontinuous code segment as code words of the first discontinuous code segment, and filling the code words into an initial coding dictionary; acquiring codewords of a second discontinuous code segment: filling the initial coding dictionary with the segment number and the last single character of the initial sequence in the initial coding dictionary in the second discontinuous code segment as the code word of the second discontinuous code segment; acquiring code words of continuous code segments: and acquiring a segment number, the number of continuous segments and an end single character of a start sequence in the coding dictionary in the continuous code segments as code words of the continuous code segments, and filling the code words of the continuous code segments into the initial coding dictionary.
Preferably, the obtaining the first coding length according to the initial coding dictionary includes:
wherein ,for maximum segment of codeword column in initial coding dictionaryNumber value->For the first coding length, < >>To round the symbol up.
Preferably, the obtaining the second code length according to the number of single character types and the number of continuous segment types includes:
wherein ,for a second code length; />Is the number of single character types; />The number of the continuous segments is the number of the varieties; />To round the symbol up.
Preferably, the obtaining the single character dictionary and the continuous segment number dictionary according to the second coding length includes:
and obtaining all binary codes with the length of the second code length, distributing one binary code for each single character and each continuous segment number one by one, sequentially storing all single characters and the corresponding binary codes into a dictionary, marking the single character dictionary, sequentially storing all continuous segment numbers and the corresponding binary codes into the dictionary, and marking the continuous segment number dictionary.
Preferably, the obtaining the coding dictionary according to the first coding length, the single character dictionary and the continuous segment number dictionary to obtain compressed data includes:
for continuous code segments in an initial coding dictionary, converting the segment numbers of the code words of the continuous code segments into binary numbers with a first coding length to be used as first codes, obtaining corresponding codes of the number of the continuous segments in the code words of the continuous code segments in the continuous segment dictionary to be used as second codes, corresponding codes of single characters in the code words of the continuous code segments in the single character dictionary to be used as third codes, and splicing the first codes, the second codes and the third codes to obtain codes of the continuous code segments, and updating code word columns corresponding to the initial coding dictionary according to the codes of the continuous code segments; for a discontinuous code segment in an initial coding dictionary, converting a code word middle number of the discontinuous code segment into a binary number with a first coding length to be used as a first code, using a code corresponding to a single character in a code word of the discontinuous code segment in the single character dictionary as a third code, splicing the first code and the third code to obtain a code of the discontinuous code segment, and updating a code word column corresponding to the initial coding dictionary according to the code of the discontinuous code segment; and taking the updated initial coding dictionary as a coding dictionary, and splicing all codes of the code word columns in the coding dictionary according to the sequence to obtain compressed data.
Preferably, the decompressing the compressed data includes:
sequentially obtaining data with a first coding length from compressed data for marking, converting the data into corresponding decimal numbers to obtain segment numbers, sequentially obtaining data with a second coding length which is not marked from the compressed data for marking if the segment numbers are 0, inquiring a single character corresponding to the data from a single character dictionary, and taking the single character as a segment of decompressed data;
if the segment number is not 0, sequentially acquiring the data with the second unlabeled coding length from the compressed data for labeling, inquiring the number of continuous segments corresponding to the data in a continuous segment number dictionary, and if the number of continuous segments does not exist, inquiring the single character corresponding to the data in a single character dictionary, acquiring the code segment corresponding to the segment number and the single character, and splicing the code segment and the single character to form one-segment decompressed data;
if the number of the continuous segments exists, the number of the continuous segments is obtained, the code segments corresponding to the segment numbers are obtained, the code segments corresponding to other segment numbers are sequentially traversed downwards according to the number of the continuous segments, the code segments are spliced according to the traversing sequence and recorded as first code segments, the unmarked data with the second coding length are sequentially taken for marking in the compressed data, the single characters corresponding to the data are inquired in the single character dictionary, and the first code segments and the single characters are spliced to form a section of decompressed data;
stopping until all the data in the compressed data have been traversed, and splicing each section of decompressed data according to the sequence to obtain the decompressed data.
The technical scheme of the invention has the beneficial effects that: the invention acquires the cardiopulmonary patient data sequence and the single character type number in the cardiopulmonary patient sequence, acquires the discontinuous code segments, the continuous code segments and the continuous segment number corresponding to the continuous code segments through segmenting the cardiopulmonary patient data sequence, and further acquires the initial coding dictionary, wherein when segmenting the cardiopulmonary patient data sequence, the continuous code segments are coded by the longer continuous code segments formed by the continuously appearing code segments, thereby greatly increasing the number of the continuous code segments according to the traditional methodThe code segment length divided by the coding algorithm reduces the storage space of the dictionary, improves the coding efficiency by increasing the code segment length, obtains the first coding length according to the maximum segment number value in the initial coding dictionary, obtains the second coding length according to the single character type number and the continuous segment number type number, obtains the single character dictionary and the continuous segment number dictionary according to the second coding length, and further obtains the final coding dictionary to obtain compressed data and decompress the compressed data, wherein the second coding length is obtained according to the single character type and the continuous segment number type to ensure that the continuous segment number corresponding to the continuous code segment is identical to the single character coding length, but the corresponding content is different, so that the query can not be wrong when the data is decompressed.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a data processing method for a cardiopulmonary rehabilitation management system according to the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the invention to achieve the preset aim, the following detailed description refers to the specific implementation, structure, characteristics and effects of the data processing method for a heart-lung rehabilitation management system according to the invention with reference to the accompanying drawings and the preferred embodiment. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of the data processing method for a cardiopulmonary rehabilitation management system provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart of a data processing method for a cardiopulmonary rehabilitation management system according to an embodiment of the present invention is shown, where the method includes:
step S1, acquiring a cardiopulmonary patient data sequence and the number of single character types in the cardiopulmonary patient data sequence.
As an example, a heart lung patient data sequence and a number of single character categories in the heart lung patient sequence may be acquired in a heart lung rehabilitation management system.
It should be noted that the cardiopulmonary rehabilitation management system may provide a case recording function, including recording the symptom descriptions of the patient and the information filled in by the patient, and the medical staff may record the symptoms of the patient, such as dyspnea, etc., and evaluate the cardiopulmonary health condition of the patient according to the frequency, severity and duration of the symptoms and give diagnosis and rehabilitation comments.
In the embodiment of the invention, a heart lung patient in the heart and lung rehabilitation management system is acquiredIs called cardiopulmonary patient data, and the acquired cardiopulmonary patient data sequence is recorded as, wherein />Representing the +.o in the cardiopulmonary patient data sequence>The total number of the characters of the heart lung patient is recorded as +.>Acquiring the number of different character types in the cardiopulmonary patient data sequence, and recording the number as the number of single character types +.>。
Thus, a cardiopulmonary patient data sequence is obtained, and the number of single character types in the sequence.
For example, taking an electrocardiogram of a patient as an example, when the electrocardiogram is compressed and stored as a curve drawn by the heartbeat signal of each time of the patient, the heartbeat signal of each time of the patient is essentially stored, so that the heartbeat signal of each time of the patient is acquired, the heartbeat signals of all times of the patient are formed into a cardiopulmonary patient data sequence, any heartbeat signal in the cardiopulmonary patient sequence is used as one character, and the number of different character types in the cardiopulmonary patient data sequence is acquired and recorded as a single character type number.
Step S2, acquiring a discontinuous code segment according to a cardiopulmonary patient data sequence; acquiring continuous code segments according to the cardiopulmonary patient data sequence; acquiring the number of continuous segments corresponding to the continuous code segments according to the continuous code segments; acquiring an initial coding dictionary according to the non-continuous code segments, the continuous code segments and the number of continuous segments corresponding to the continuous code segments; acquiring a first coding length according to the initial coding dictionary; acquiring a second coding length according to the number of single character types and the number of continuous segments; and acquiring a single character dictionary and a continuous segment number dictionary according to the second coding length.
By way of example, segmentation operation can be performed on characters in a cardiopulmonary patient data sequence by analyzing a cardiopulmonary patient data sequence rule, an initial coding dictionary is obtained, a first coding length is obtained according to a maximum segment number value of a code word column in the initial coding dictionary, a second coding length is determined according to the number of single character types and the number of continuous segments, binary codes of each single character and the number of each continuous segment are obtained according to the second coding length, and a single character dictionary and a number of continuous segments dictionary are generated.
It should be noted that the conventionalThe encoding algorithm divides the cardiopulmonary patient data sequence into distinct code segments based on the repeatability of the cardiopulmonary patient data sequence, and the length of the code segments is as short as possible, and then splices the already occurring code segments with a new data output to obtain a new code. Therefore, for a data system with a large data base such as a cardiopulmonary rehabilitation management system, the data system is due to +.>The coding algorithm takes the characteristic of the code segment as short as possible to reduce the coding efficiency, so the coding efficiency needs to be improved by improving the length of the code segment, and as the regularity of the cardiopulmonary patient data sequence is not obvious, firstly, the continuous code segment and the discontinuous code segment in the cardiopulmonary patient sequence are obtained by analyzing the regularity of characters in the cardiopulmonary patient sequence, the cardiopulmonary patient data sequence is segmented, the discontinuous code segment is coded by using the traditional LZ coding, and the continuous code segment is coded by combining the traditional LZ coding with the continuous segment number of the continuous code segment. Thus, the segmentation operation for the characters in the cardiopulmonary patient data sequence is first completed and an initial encoding dictionary is acquired.
Further, since the acquisition of the continuous character string is sequentially performed from front to back according to the cardiopulmonary patient data sequence, the number of continuous segments corresponding to the continuous character string is sequentially increased, and thus, errors do not occur when the continuous character string is subsequently encoded by using the number of continuous segments corresponding to the continuous character string.
In the embodiment of the invention, the segmentation process of the characters in the cardiopulmonary patient data sequence and the process of acquiring the initial coding dictionary are as follows:
constructing an empty initial coding dictionary, wherein the initial coding dictionary comprises three columns which are respectively a segment number, a code segment and a code word, traversing characters in a cardiopulmonary patient data sequence, carrying out longest matching on the cardiopulmonary patient data sequence according to the existing code segment in the initial coding dictionary from the traversed characters, taking the currently traversed characters as a code segment when matching fails, taking the code segment as a discontinuous code segment, taking 0 and the characters as code words of the discontinuous code segment, and sequentially filling the code segment content and the code words of the discontinuous code segment into the initial coding dictionary;
when a substring taking the current traversed character as a starting sequence in a heart lung patient data sequence is successfully matched with any code segment in an initial coding dictionary, taking the substring taking the current traversed character as the starting sequence in the heart lung patient data sequence, acquiring the next code segment of the successfully matched code segment in the initial coding dictionary, marking the next code segment as a first code segment, marking the substring with the same length as the first code segment after the starting sequence is acquired in the heart lung patient data sequence as the first sequence, matching the first code segment with the first sequence, if the first code segment fails to match with the first sequence, splicing the next single character of the starting sequence in the heart lung patient data sequence with the starting sequence in the heart lung patient data sequence to serve as a code segment, taking the code segment as a non-continuous code segment, acquiring the segment number of the starting sequence in the initial coding dictionary and the last single character in the non-continuous code segment as the code segment, and filling the code segment content and the code word of the non-continuous code segment into the initial coding dictionary in sequence;
if the first code segment is successfully matched with the first sequence, the next code segment of the first code segment in the initial coding dictionary is acquired and marked as a second code segment, a substring with the same length as the second code segment after the first sequence is acquired in the cardiopulmonary patient data sequence is marked as a second sequence, the second code segment is matched with the second sequence, if the second code segment is successfully matched with the second sequence, a third code segment and a third sequence are acquired, the third code segment is matched with the third sequence, and the steps are repeated until the matching is not successfully stopped; splicing the initial sequence, each code segment successfully matched and the first single character unsuccessfully matched in the cardiopulmonary patient data sequence to be used as a code segment, taking the code segment as a continuous code segment, acquiring the successful times of the continuous code segment, and taking the successful times of the matching as the continuous segment number of the continuous code segment; acquiring a segment number of a start sequence in an initial coding dictionary, the number of the continuous segments and a single character at the end of the continuous segments as code words of the continuous segments, and sequentially filling the code segment content and the code words of the continuous segments into the initial coding dictionary;
and stopping until all characters in the cardiopulmonary patient data sequence have been traversed, and acquiring an initial coding dictionary.
It should be noted that, the code word column in the initial coding dictionary is composed of a segment number, a number of consecutive segments, and a single character, so that the segment number code, the number of consecutive segments, and the single character code in the code word need to be obtained, and therefore, the code length of the code word column segment number needs to be obtained as the first code length according to the maximum segment number value of the code word column in the initial coding dictionary.
In an embodiment of the present invention, a first coding length is obtained:, wherein />For the maximum segment number value of the codeword column in the initial coding dictionary,/for the codeword column>For the first coding length, < >>To round the symbol up.
In order to ensure the correctness of the subsequent decoding, the codes of the single character code and the number of the continuous segments corresponding to the continuous code segments need to be distinguished, so in the embodiment of the invention, the code length is determined by using the number of the single character types and the number of the continuous segments, so that the number of the continuous segments in the continuous code segments is the same as the code length of the single character, but the corresponding contents are different, thus ensuring that errors can not occur when the data is decompressed, and if the characters corresponding to the codes are queried according to the codes, if the characters corresponding to the codes cannot be queried in a single character dictionary, the numbers of the continuous segments corresponding to the continuous code segments are described, and the continuous segment dictionary can be queried to ensure the correct decoding.
In the embodiment of the invention, the process of acquiring the second coding length by taking the coding length of the single character and the number of the continuous segments as the second coding length according to the number of the single character types and the number of the continuous segments is as follows: when the sum of the number of single character types and the number of continuous segments isIn the middle, wherein->For the second coding length, < >>For the number of types of single characters,for the number of consecutive segments, the number of consecutive segments is obtained by taking the logarithm of the inequality on both sides to obtain the code length +.>It should be noted that, in order to obtain higher compression efficiency, the shortest coding length is taken as the second coding length, and the second coding length is rounded up to ensure that the second coding length is greater than 0 and is an integer, so in the embodiment of the present invention, the second coding length。
After obtaining the second code length, it is necessary to assign a length to each single character and each number of consecutive segmentsThus in an embodiment of the invention all lengths are taken +.>Binary coding of->For coding length, each single character and each continuous segment number are allocated with corresponding binary codes one by one according to the sequence, all single characters and the corresponding binary codes are sequentially stored in a dictionary and are marked as a single character dictionary, and all continuous segment numbers and the corresponding binary codes are sequentially stored in the dictionary and are marked as a continuous segment number dictionary.
The method comprises the steps of analyzing a data sequence rule of a heart-lung patient, carrying out segmentation operation on characters in the data sequence of the heart-lung patient, obtaining an initial coding dictionary, obtaining a first coding length according to a maximum segment number value of a code word column in the initial coding dictionary, determining a second coding length according to the type number of single characters and the type number of continuous segments, obtaining binary codes of each single character and each type number of continuous segments according to the second coding length, and generating a single character dictionary and a continuous segment number dictionary.
For example, the segmentation process for characters in the acquired cardiopulmonary patient data sequence and the initial coding dictionary acquisition process are:
constructing an initial coding dictionary, wherein the initial coding dictionary comprises three columns which are respectively a segment number, a code segment and a code word;
assuming that the example data of the cardiopulmonary patient data sequence is [0,0,1,0,0,1,2], traversing the first character [0] in the cardiopulmonary patient sequence, and because no code segment exists in the initial coding dictionary, if the matching fails, taking the first character [0] in the cardiopulmonary patient sequence as a code segment, marking the first character as a discontinuous code segment, taking a segment number [0] and the character [0] as code words [0, 0] of the discontinuous code segment, and filling the segment number as 1, the discontinuous code segment [0] and the code words [0, 0] into a first row of the initial coding dictionary;
continuing to perform longest matching on the cardiopulmonary patient data sequence according to the existing code segments in the initial coding dictionary, wherein the code segment [0] in the initial coding dictionary can be successfully matched with the second character [0] in the cardiopulmonary patient sequence, the second character [0] is a starting sequence, and the code segment successfully matched in the initial coding dictionary is known to have no next code segment, so that the code segment [0] successfully matched with the second character [1] in the cardiopulmonary patient sequence is spliced to be used as a code segment and recorded as a discontinuous code segment, the segment number 1 of the code segment successfully matched with the character [1] is used as a code word [1 ' 1 ' ], and the segment number is 2, and the discontinuous code segments [0,1] and the code word [1 ' ] are filled into a second row of the initial coding dictionary;
and continuously performing longest matching on the cardiopulmonary patient data sequence according to the code segments existing in the initial coding dictionary, wherein the code segments [0] in the first row in the initial coding dictionary can be successfully matched with the fourth character [0] in the cardiopulmonary patient sequence, the fourth character [0] in the cardiopulmonary patient sequence is used as a starting sequence, the code segments [0,1] in the second row in the initial coding dictionary are used as first code segments, the length of the first code segments is 2, substrings [0,1] with the length of 2 after the fourth character [0] in the cardiopulmonary patient data sequence are obtained and are used as first sequences, and the first code segments are identical to the first sequences, so that the matching is successful. The code segment of the third line does not exist in the initial coding dictionary at present, so that matching is not continued, and therefore the 7 th character [2] in the cardiopulmonary patient data sequence is the first single character of which matching is unsuccessful. The first single character [2] which is unsuccessfully matched in the initial sequence [0], the first sequence [0,1] and the cardiopulmonary patient data sequence is spliced to be used as a code segment [0,0,1,2], the code segment is used as a continuous code segment, the successful matching times are 2, so that the number of continuous segments of the continuous code segment is 2, the segment number of the initial sequence in the initial coding dictionary, the number of continuous segments and the last single character are used as code words [1, 2], the corresponding segment number is 3, the continuous code segment [0,0,1,2] and the code words [1, 2] are filled in the third row of the initial coding dictionary.
To this end, an initial coding dictionary is obtained, see table 1.
TABLE 1
| Segment number | Code segment | Code word |
| 1 | 0 | 0,“0” |
| 2 | 0,1 | 1,“1” |
| 3 | 0,0,1,2 | 1,2,“2” |
For example, a single word Fu Zidian is acquired, and a sequential segment number dictionary:
assume that the cardiopulmonary patient data sequence example data is [0,0,1,0,0,1,2]]The single character is 0,1,2, 3, 2 and 1, so that the second code length of single character and number of continuous segments isThus, a single character dictionary is acquired: a code corresponding to 0 is 00,1, a code corresponding to 01,2 is 10; consecutive segment number dictionary: 2 is coded as 11.
The maximum segment number value contained in the code word column in the initial coding dictionary is 1, and thus the first coding length isThe code of segment number 0 is therefore 0, and the code of segment number 1 is 1.
And S3, acquiring the coding dictionary according to the first coding length, the single character dictionary and the continuous segment number dictionary to obtain compressed data.
It should be noted that, the code word column in the initial coding dictionary is composed of a segment number, a continuous segment number and a single character, so that the segment number, the continuous segment number and the single character need to be converted into corresponding binary codes respectively; for a discontinuous code segment in an initial coding dictionary, converting a code word middle number of the discontinuous code segment into a binary number with a first coding length to be used as a first code, using a code corresponding to a single character in a code word of the discontinuous code segment in the single character dictionary as a third code, splicing the first code and the third code to obtain a code of the discontinuous code segment, and updating a code word column corresponding to the initial coding dictionary according to the code of the discontinuous code segment; and taking the updated initial coding dictionary as a coding dictionary, and splicing all codes of the code word columns in the coding dictionary according to the sequence to obtain compressed data.
Thus, the data compression of the cardiopulmonary patient is completed, and the compressed data is obtained.
For example: the initial dictionary shown in table 1 corresponds to the dictionary shown in table 2.
TABLE 2
| Segment number | Code segment | Code word |
| 1 | 0 | 000 |
| 2 | 0,1 | 101 |
| 3 | 0,0,1,2 | 11110 |
Thus, the compressed data is 00010111110. And S4, decompressing the compressed data.
As an example, the compressed cardiopulmonary patient data may be subjected to a decompression operation.
The acquired compressed data, the single character dictionary and the continuous segment number dictionary are transmitted and stored in the system, and when the cardiopulmonary patient data is required to be checked, the compressed data stored on the cardiopulmonary rehabilitation management system server is required to be decompressed, so that the compressed data is decompressed according to the segment number, the continuous segment number and the encoding length of the single character.
In the embodiment of the invention, the specific process of decompression is as follows:
sequentially obtaining data with a first coding length from compressed data for marking, converting the data into corresponding decimal numbers to obtain segment numbers, sequentially obtaining data with a second coding length which is not marked from the compressed data for marking if the segment numbers are 0, inquiring a single character corresponding to the data from a single character dictionary, and taking the single character as a segment of decompressed data;
if the segment number is not 0, sequentially acquiring the data with the second unlabeled coding length from the compressed data for labeling, inquiring the number of continuous segments corresponding to the data in a continuous segment number dictionary, and if the number of continuous segments does not exist, inquiring the single character corresponding to the data in a single character dictionary, acquiring the code segment corresponding to the segment number and the single character, and splicing the code segment and the single character to form one-segment decompressed data;
if the number of the continuous segments exists, the number of the continuous segments is obtained, the code segments corresponding to the segment numbers are obtained, the code segments corresponding to other segment numbers are sequentially traversed downwards according to the number of the continuous segments, the code segments are spliced according to the traversing sequence and recorded as first code segments, the unmarked data with the second coding length are sequentially taken for marking in the compressed data, the single characters corresponding to the data are inquired in the single character dictionary, and the first code segments and the single characters are spliced to form a section of decompressed data;
stopping until all the data in the compressed data have been traversed, and splicing each section of decompressed data according to the sequence to obtain the decompressed data.
It should be noted that, after a code segment is obtained in the decompression process, the code is obtained according to the first code length for decompression when the compressed data is traversed subsequently.
Thus, decompression of the compressed data is completed.
For example: decompression of compressed cardiopulmonary patient data:
an empty dictionary is constructed as a coding dictionary, comprising a segment number column, a code segment column, and a codeword column.
The method comprises the steps of (1) reading data with a first coding length in compressed data as 00010111110, marking the data with the first coding length in the compressed data as 0, converting the data into decimal 0, wherein the section number is 0, continuously reading data with a second coding length in the compressed data as 00, marking the data, inquiring a single character [0] corresponding to the data in a single character dictionary, taking the single character [0] as one section of decompressed data, and filling the section number 1, the decompressed data [0] and a codeword 000 into a first row of the coding dictionary.
Continuously reading data 1 with the length of a first coding length in compressed data for marking, converting the data into decimal 1, wherein the section number is 1, continuously reading the compressed data for marking the data 01 with the length of a second coding length, searching for the number of continuous sections corresponding to 01 in a continuous section number dictionary, searching for the number of continuous sections, searching for single characters corresponding to 01 in a single character dictionary for the number of [1], acquiring a code section [0] corresponding to the section number 1 and the single characters [1] for splicing as one section of decompressed data, and filling the section number 2, the decompressed data [0,1] and the code word 101 into a second row of the coding dictionary;
the method comprises the steps of continuously reading data 1 with the length of a first coding length in compressed data, marking the data 1, converting the data into decimal 1, marking the data 11 with the length of a second coding length in the compressed data, inquiring the number of continuous segments corresponding to 11 in a continuous segment number dictionary to be 2, obtaining code segments [0] corresponding to the segment number 1, sequentially traversing the two lines of code segments [0], [0,1] in the coding dictionary from the segment number 1 according to the number of the continuous segments 2, marking the data 10 with the length of the second coding length in the compressed data, inquiring the corresponding single characters of [2] in a single character dictionary, splicing the [0], [0,1] and the single characters of [2] together to form one-segment decompressed data [0,0,1,2], and filling the decompressed data [0,0,1,2] and the code words 11110 into a third line of the coding dictionary.
All the decompressed data are spliced in sequence to obtain the final decompressed data [0,0,1,0,0,1,2].
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (10)
1. A data processing method for a cardiopulmonary rehabilitation management system, the method comprising:
acquiring a cardiopulmonary patient data sequence and the number of single character types in the cardiopulmonary patient data sequence;
acquiring a discontinuous code segment according to the cardiopulmonary patient data sequence; acquiring continuous code segments according to the cardiopulmonary patient data sequence; acquiring the number of continuous segments corresponding to the continuous code segments according to the continuous code segments; acquiring an initial coding dictionary according to the non-continuous code segments, the continuous code segments and the number of continuous segments corresponding to the continuous code segments; acquiring a first coding length according to the initial coding dictionary; acquiring a second coding length according to the number of single character types and the number of continuous segments; acquiring a single character dictionary and a continuous segment number dictionary according to the second coding length;
obtaining a coding dictionary according to the first coding length, the single character dictionary and the continuous segment number dictionary to obtain compressed data;
and decompressing the compressed data.
2. The data processing method for a cardiopulmonary rehabilitation management system according to claim 1, wherein the acquiring a discontinuous code segment from a cardiopulmonary patient data sequence includes:
traversing characters in the cardiopulmonary patient data sequence, carrying out longest matching on the cardiopulmonary patient data sequence according to the existing code segments from the traversed characters, and taking the currently traversed characters as a code segment when the matching fails, wherein the code segment is a discontinuous code segment and is recorded as a first discontinuous code segment;
when a substring taking the current traversed character as a starting sequence in a heart lung patient data sequence is successfully matched with any code segment, the substring taking the current traversed character as the starting sequence in the heart lung patient data sequence is taken as a next code segment of the successfully matched code segment, the next code segment is marked as a first code segment, the substring with the same length as the first code segment after the starting sequence is obtained in the heart lung patient data sequence is marked as the first sequence, the first code segment is matched with the first sequence, if the first code segment fails to be matched with the first sequence, the next single character of the starting sequence in the heart lung patient data sequence is spliced to be used as a code segment, and the code segment is a discontinuous code segment and is marked as a second discontinuous code segment;
stopping until all characters in the cardiopulmonary patient data sequence have been traversed, and acquiring all non-continuous code segments.
3. The method for processing data for a cardiopulmonary rehabilitation management system according to claim 1, wherein the step of obtaining the continuous code segments and the number of continuous segments corresponding to the continuous code segments according to the cardiopulmonary patient data sequence includes:
traversing characters in a cardiopulmonary patient data sequence, when a substring taking the currently traversed characters as a starting sequence is successfully matched with any code segment in the cardiopulmonary patient data sequence, taking the substring taking the currently traversed characters as the starting sequence in the cardiopulmonary patient data sequence, acquiring the next code segment of the successfully matched code segment, marking the next code segment as a first code segment, marking the substring which is equal to the first code segment in length after the starting sequence is acquired in the cardiopulmonary patient data sequence, marking the first code segment as a first sequence, matching the first code segment with the first sequence, marking the next code segment in a coding dictionary as a second code segment if the first code segment is successfully matched with the first sequence, marking the substring which is equal to the second code segment in length after the starting sequence is acquired in the cardiopulmonary patient data sequence, marking the next code segment as a second sequence, matching the second code segment with the second sequence, acquiring a third code segment and the third sequence until the third code segment and the third sequence are successfully matched, and stopping the matching in turn; splicing the initial sequence, each code segment successfully matched and the next single character of the initial sequence in the cardiopulmonary patient data sequence to be used as a code segment, and using the code segment as a continuous code segment;
stopping until all characters in the cardiopulmonary patient data sequence have been traversed, and acquiring all continuous code segments.
4. The data processing method for a cardiopulmonary rehabilitation management system according to claim 3, wherein the obtaining the number of continuous segments corresponding to the continuous code segments according to the continuous code segments includes:
and obtaining the successful times of matching of any continuous code segment, and taking the successful times of matching as the number of the continuous segments of the continuous code segment.
5. The method for processing data for a cardiopulmonary rehabilitation management system according to claim 2, 3 or 4, wherein the obtaining an initial coding dictionary according to the non-continuous code segments, the continuous code segments, and the number of continuous segments corresponding to the continuous code segments includes:
constructing an empty initial coding dictionary, wherein the initial coding dictionary comprises three columns, namely a segment number, a code segment and a code word, and sequentially filling the segment number, a discontinuous code segment and a continuous code segment into the segment number and the code segment column of the initial coding dictionary according to the sequence of characters in a traversing cardiopulmonary patient data sequence to obtain the code word of a first discontinuous code segment: taking 0 and the content of the first discontinuous code segment as code words of the first discontinuous code segment, and filling the code words into an initial coding dictionary; acquiring codewords of a second discontinuous code segment: filling the initial coding dictionary with the segment number and the last single character of the initial sequence in the initial coding dictionary in the second discontinuous code segment as the code word of the second discontinuous code segment; acquiring code words of continuous code segments: and acquiring a segment number, the number of continuous segments and an end single character of a start sequence in the coding dictionary in the continuous code segments as code words of the continuous code segments, and filling the code words of the continuous code segments into the initial coding dictionary.
6. The method of claim 5, wherein the obtaining the first code length from the initial code dictionary comprises:
wherein ,for the maximum segment number value of the codeword column in the initial coding dictionary,/for the codeword column>For the first coding length, < >>To round the symbol up.
7. The method for processing data for cardiopulmonary rehabilitation management system according to claim 1, wherein the obtaining the second encoding length according to the number of single character types and the number of continuous segments types includes:
wherein ,for a second code length; />Is the number of single character types; />The number of the continuous segments is the number of the varieties; />To round the symbol up.
8. The method for processing data for cardiopulmonary rehabilitation management system according to claim 1, wherein the acquiring the single character dictionary and the continuous segment number dictionary according to the second encoding length includes:
and obtaining all binary codes with the length of the second code length, distributing one binary code for each single character and each continuous segment number one by one, sequentially storing all single characters and the corresponding binary codes into a dictionary, marking the single character dictionary, sequentially storing all continuous segment numbers and the corresponding binary codes into the dictionary, and marking the continuous segment number dictionary.
9. The method for processing data for a cardiopulmonary rehabilitation management system according to claim 1, wherein the obtaining the coding dictionary according to the first coding length, the single character dictionary, and the continuous segment number dictionary to obtain the compressed data includes:
for continuous code segments in an initial coding dictionary, converting the segment numbers of the code words of the continuous code segments into binary numbers with a first coding length to be used as first codes, obtaining corresponding codes of the number of the continuous segments in the code words of the continuous code segments in the continuous segment dictionary to be used as second codes, corresponding codes of single characters in the code words of the continuous code segments in the single character dictionary to be used as third codes, and splicing the first codes, the second codes and the third codes to obtain codes of the continuous code segments, and updating code word columns corresponding to the initial coding dictionary according to the codes of the continuous code segments; for a discontinuous code segment in an initial coding dictionary, converting a code word middle number of the discontinuous code segment into a binary number with a first coding length to be used as a first code, using a code corresponding to a single character in a code word of the discontinuous code segment in the single character dictionary as a third code, splicing the first code and the third code to obtain a code of the discontinuous code segment, and updating a code word column corresponding to the initial coding dictionary according to the code of the discontinuous code segment; and taking the updated initial coding dictionary as a coding dictionary, and splicing all codes of the code word columns in the coding dictionary according to the sequence to obtain compressed data.
10. The method of claim 1, wherein decompressing the compressed data comprises:
sequentially obtaining data with a first coding length from compressed data for marking, converting the data into corresponding decimal numbers to obtain segment numbers, sequentially obtaining data with a second coding length which is not marked from the compressed data for marking if the segment numbers are 0, inquiring a single character corresponding to the data from a single character dictionary, and taking the single character as a segment of decompressed data;
if the segment number is not 0, sequentially acquiring the data with the second unlabeled coding length from the compressed data for labeling, inquiring the number of continuous segments corresponding to the data in a continuous segment number dictionary, and if the number of continuous segments does not exist, inquiring the single character corresponding to the data in a single character dictionary, acquiring the code segment corresponding to the segment number and the single character, and splicing the code segment and the single character to form one-segment decompressed data;
if the number of the continuous segments exists, the number of the continuous segments is obtained, the code segments corresponding to the segment numbers are obtained, the code segments corresponding to other segment numbers are sequentially traversed downwards according to the number of the continuous segments, the code segments are spliced according to the traversing sequence and recorded as first code segments, the unmarked data with the second coding length are sequentially taken for marking in the compressed data, the single characters corresponding to the data are inquired in the single character dictionary, and the first code segments and the single characters are spliced to form a section of decompressed data;
stopping until all the data in the compressed data have been traversed, and splicing each section of decompressed data according to the sequence to obtain the decompressed data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311060991.8A CN116805537B (en) | 2023-08-22 | 2023-08-22 | Data processing method for heart-lung rehabilitation management system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311060991.8A CN116805537B (en) | 2023-08-22 | 2023-08-22 | Data processing method for heart-lung rehabilitation management system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116805537A true CN116805537A (en) | 2023-09-26 |
| CN116805537B CN116805537B (en) | 2023-11-07 |
Family
ID=88079691
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311060991.8A Active CN116805537B (en) | 2023-08-22 | 2023-08-22 | Data processing method for heart-lung rehabilitation management system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116805537B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117119120A (en) * | 2023-10-25 | 2023-11-24 | 上海伯镭智能科技有限公司 | Cooperative control method based on multiple unmanned mine cars |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5778371A (en) * | 1994-09-13 | 1998-07-07 | Kabushiki Kaisha Toshiba | Code string processing system and method using intervals |
| US5838963A (en) * | 1995-10-25 | 1998-11-17 | Microsoft Corporation | Apparatus and method for compressing a data file based on a dictionary file which matches segment lengths |
| JP2000181916A (en) * | 1998-12-17 | 2000-06-30 | Fujitsu Ltd | Document analysis device and method and computer readable recording medium recording document analysis program |
| US20020196166A1 (en) * | 1998-07-09 | 2002-12-26 | Fujitsu Limited | Data compression method and data compression apparatus |
| US20040085232A1 (en) * | 2002-11-06 | 2004-05-06 | Ramkrishna Ghildiyal | System, method and computer readable medium for compressing a data sequence for partial decompressing |
| EP1895665A2 (en) * | 2000-07-25 | 2008-03-05 | Juniper Networks, Inc. | System and method for incremental and continuous data compression |
| US8902087B1 (en) * | 2013-08-27 | 2014-12-02 | International Business Machines Corporation | Data decompression utilizing pre-expanded dictionaries during decompression |
| CN107133201A (en) * | 2017-04-21 | 2017-09-05 | 东莞中国科学院云计算产业技术创新与育成中心 | The hot information acquisition method and device recognized based on text code |
-
2023
- 2023-08-22 CN CN202311060991.8A patent/CN116805537B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5778371A (en) * | 1994-09-13 | 1998-07-07 | Kabushiki Kaisha Toshiba | Code string processing system and method using intervals |
| US5838963A (en) * | 1995-10-25 | 1998-11-17 | Microsoft Corporation | Apparatus and method for compressing a data file based on a dictionary file which matches segment lengths |
| US20020196166A1 (en) * | 1998-07-09 | 2002-12-26 | Fujitsu Limited | Data compression method and data compression apparatus |
| JP2000181916A (en) * | 1998-12-17 | 2000-06-30 | Fujitsu Ltd | Document analysis device and method and computer readable recording medium recording document analysis program |
| EP1895665A2 (en) * | 2000-07-25 | 2008-03-05 | Juniper Networks, Inc. | System and method for incremental and continuous data compression |
| US20040085232A1 (en) * | 2002-11-06 | 2004-05-06 | Ramkrishna Ghildiyal | System, method and computer readable medium for compressing a data sequence for partial decompressing |
| US8902087B1 (en) * | 2013-08-27 | 2014-12-02 | International Business Machines Corporation | Data decompression utilizing pre-expanded dictionaries during decompression |
| CN107133201A (en) * | 2017-04-21 | 2017-09-05 | 东莞中国科学院云计算产业技术创新与育成中心 | The hot information acquisition method and device recognized based on text code |
Non-Patent Citations (2)
| Title |
|---|
| TAO LIN: "PSEUDO-2D-MATCHING BASED DUAL-CODER ARCHITECTURE FOR SCREEN CONTENTS CODING", 《IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY》 * |
| 陈建华;: "数据无损压缩传输方法在阵列声波测井仪中的应用", 电子测量技术, no. 13 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117119120A (en) * | 2023-10-25 | 2023-11-24 | 上海伯镭智能科技有限公司 | Cooperative control method based on multiple unmanned mine cars |
| CN117119120B (en) * | 2023-10-25 | 2023-12-22 | 上海伯镭智能科技有限公司 | Cooperative control method based on multiple unmanned mine cars |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116805537B (en) | 2023-11-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0732812B1 (en) | Data compressing apparatus, data restoring apparatus and data compressing/restoring system | |
| CN106560010B (en) | VLSI efficient Huffman coding apparatus and method | |
| CN101783788B (en) | File compression method, file compression device, file decompression method, file decompression device, compressed file searching method and compressed file searching device | |
| CN116805537B (en) | Data processing method for heart-lung rehabilitation management system | |
| US6982661B2 (en) | Method of performing huffman decoding | |
| EP2455853A2 (en) | Data compression method | |
| US8189912B2 (en) | Efficient histogram storage | |
| CN116634029B (en) | Work platform data rapid transmission method based on block chain | |
| US20200294629A1 (en) | Gene sequencing data compression method and decompression method, system and computer-readable medium | |
| EP0698862A2 (en) | Transmission compatibility using custom compression method and hardware | |
| CN113868206A (en) | Data compression method, decompression method, device and storage medium | |
| US9236881B2 (en) | Compression of bitmaps and values | |
| CN116614139B (en) | User transaction information compression storage method in wine selling applet | |
| CN116016606A (en) | Sewage treatment operation and maintenance data efficient management system based on intelligent cloud | |
| JP5913748B2 (en) | Secure and lossless data compression | |
| US6748520B1 (en) | System and method for compressing and decompressing a binary code image | |
| CN117097441B (en) | Carrier communication system transmission efficiency optimization method based on data analysis | |
| JP3080149B2 (en) | Pattern encoding method and decoding method, and encoding apparatus and decoding apparatus using the method | |
| CN116168790B (en) | Big data recruitment system for clinical trial | |
| CN104682966B (en) | The lossless compression method of table data | |
| US7683809B2 (en) | Advanced lossless bit coding | |
| CN111274950B (en) | Feature vector data encoding and decoding method, server and terminal | |
| JP2590287B2 (en) | Data compression method and data compression apparatus | |
| JPH05224878A (en) | Data compressing system using universal code | |
| CN117465471A (en) | Lossless compression system and lossless compression method for text file |
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 |