CN117176177B - Data sharing method and system for forestry information - Google Patents
Data sharing method and system for forestry information Download PDFInfo
- Publication number
- CN117176177B CN117176177B CN202311451246.6A CN202311451246A CN117176177B CN 117176177 B CN117176177 B CN 117176177B CN 202311451246 A CN202311451246 A CN 202311451246A CN 117176177 B CN117176177 B CN 117176177B
- Authority
- CN
- China
- Prior art keywords
- data
- segments
- data segment
- segment
- initial
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 66
- 230000017105 transposition Effects 0.000 claims abstract description 147
- 238000005457 optimization Methods 0.000 claims abstract description 88
- 238000007906 compression Methods 0.000 claims abstract description 25
- 230000006835 compression Effects 0.000 claims abstract description 23
- 238000012545 processing Methods 0.000 claims abstract description 6
- 238000004364 calculation method Methods 0.000 claims description 7
- 238000013144 data compression Methods 0.000 claims description 7
- 238000007405 data analysis Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 claims description 3
- 238000011835 investigation Methods 0.000 claims description 3
- 230000000694 effects Effects 0.000 description 21
- 230000011218 segmentation Effects 0.000 description 18
- 241001465754 Metazoa Species 0.000 description 7
- 238000003860 storage Methods 0.000 description 5
- 238000009826 distribution Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 241000894007 species Species 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002023 wood Substances 0.000 description 1
Abstract
The invention relates to the technical field of data processing, in particular to a data sharing method and system for forestry information, comprising the following steps: acquiring original data according to forestry information and obtaining an initial data segment in the original data; performing left transposition and right transposition on two adjacent initial data segments for the first time, and obtaining the optimization degree of the left transposition and the right transposition on the two adjacent initial data segments for the first time; according to the optimization degree of the first left transposition and the first right transposition on two adjacent initial data segments, acquiring each final data segment in the original data; and finally, each final data segment in the original data is compressed by using an arithmetic code to obtain an arithmetic code compression result, and the arithmetic code compression result is stored in the sharing platform. According to the invention, the data segments are redistributed according to the frequency difference degree of the data segments, so that the aim of compressing forestry information is achieved better.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a data sharing method and system for forestry information.
Background
Forestry information is typically collected and managed by different institutions and departments, and such data can be isolated, scattered, inconsistent, and the like. The forestry information data comprises data of different aspects such as forest vegetation data, wild animal and plant data and the like, and the occurrence frequency of characters in the data of different aspects is greatly different, so that the characters in the data have stronger local characteristics.
The arithmetic coding has better data compression rate, and the storage space of forestry information data can be better reduced by compressing the data through the arithmetic coding so as to carry out data sharing. For data with particularly obvious local characteristics such as forestry data, a data segment mode is generally adopted to make the occurrence frequency difference of various characters in the data segment larger and make the average coding length of arithmetic coding lower. The conventional segmentation method directly uses global fixed-length segmentation, and the determined data segment length is too large to ensure that the aim of greatly differentiating the character frequency inside the data segment still cannot be achieved after a large number of data segments are segmented, and the too small data segment length can cause too much extra length of data coding generated by segmentation due to too much data segment, so that the coding length is unnecessarily increased.
Disclosure of Invention
The invention provides a data sharing method and a system for forestry information, which are used for solving the existing problems: traditional arithmetic coding cannot compress forestry information well.
The invention relates to a data sharing method and a system for forestry information, which adopt the following technical scheme:
an embodiment of the present invention provides a data sharing method for forestry information, the method including the steps of:
acquiring forestry information, and acquiring original data according to the forestry information; segmenting the original data to obtain each initial data segment in the original data;
performing left transposition for the first time on two adjacent initial data segments to obtain two adjacent left data segments; acquiring the optimization degree of the first left transposition to two adjacent initial data segments according to two adjacent left data segments; performing right transposition for the two adjacent initial data segments for the first time to obtain two adjacent right data segments; acquiring the optimization degree of the first right transposition to two adjacent initial data segments according to two adjacent right data segments;
taking the sum of the optimization degree of the first left transposition and the optimization degree of the first right transposition on two adjacent initial data segments as the optimization degree of the first transposition on the two adjacent initial data segments; judging whether the initial data segments need to be adjusted according to the optimization degree of the first transposition on two adjacent initial data segments, and acquiring each adjusted data segment;
Acquiring data segments to be combined according to each data segment which is adjusted in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; acquiring each final data segment in the original data according to the data segment combined with the data segment to be combined; and (3) compressing each final data segment in the original data by using an arithmetic code to obtain an arithmetic code compression result, and storing the arithmetic code compression result in a sharing platform.
Preferably, the acquiring forestry information acquires original data according to the forestry information; the method for segmenting the original data to obtain each initial data segment in the original data comprises the following specific steps:
acquiring forestry information through field investigation, remote sensing technology and unmanned aerial vehicle, and converting all text data in the forestry information into Unicode codes by contrast to Unicode coding tables; converting the obtained Unicode code into 16-bit binary code, splitting the 16-bit binary code into a first 8-bit binary code and a second 8-bit binary code, then converting the obtained 8-bit binary code into ASCII character data by contrasting an ASCII coding table, and using the obtained ASCII character data and non-text data in forestry information as raw data;
Presetting an initial data segment lengthThe 1 st character to the 1 st character in the original data>All characters among the characters form a 1 st initial data segment; the original data is>The first character to->All characters among the characters form a 2 nd initial data segment; the original data is>The first character to->All characters among the characters form a 3 rd initial data segment; and so on, up to +.>The number of characters between the individual character and the last character is equal to or less than +.>The method comprises the steps of carrying out a first treatment on the surface of the The original data is>All characters from the character to the last character in the original data constitute +.>A plurality of initial data segments; and obtaining each initial data segment in the original data.
Preferably, the first left transposition is performed on two adjacent initial data segments to obtain two adjacent left data segments, including the following specific methods:
obtaining a first final data segment and a second tentative data segment through the first initial data segment and the second initial data segment, obtaining a second final data segment and a third tentative data segment through the second tentative data segment and the three initial data segments, and the like;
for the firstTemporary data section and->A plurality of initial data segments; will be- >The last character in the temporary data section is from +.>Removed from the temporary data section and the removed character is placed in +.>Before the first character of the initial data segment, marking the first left transposition; obtaining the +.>Temporary data section and->An initial data section to be left shifted by the first time +.>Temporary data section and->The initial data segments are respectively marked as +.>Left one data segment and +.>The left data segment.
Preferably, the optimizing degree of the first left transposition to the two adjacent initial data segments is obtained according to the two adjacent left data segments, and the specific calculation formula is as follows:
in the method, in the process of the invention,indicating the first left transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicate->Each character in the left data section is in the +.>Variance of probability of occurrence in the left data segment;indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Represent the firstEach character in the left data section is in the +.>Variance of probability of occurrence in the left data segment; />Indicate->Each character in the initial data section is at +. >Variance of probability of occurrence in the temporary data segments; />A logarithmic function based on a natural constant is represented.
Preferably, the first right transposition is performed on two adjacent initial data segments to obtain two adjacent right data segments, including the following specific methods:
for the firstTemporary data section and->The initial data segment is +.>The first character in the initial data section is from +.>Removed from the initial data segment and the removed character is placed at +.>After the last character of the temporary data segment, marking as first right transposition; obtaining the +.f after the first right transposition>Temporary data section and->An initial data section to be subjected to the first right transposition +.>Temporary data section and->The initial data segments are respectively marked as +.>Right one data segment and +.>The right data segment.
Preferably, the optimizing degree of the first right transposition to the two adjacent initial data segments is obtained according to the two adjacent right data segments, and the specific calculation formula is as follows:
in the method, in the process of the invention,indicating the first right transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicate->Each character in the right data section is in the +. >The variance of the probability of occurrence in the right data segment;indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Represent the firstEach character in the right data section is in the +.>The variance of the probability of occurrence in the right data segment; />Indicate->Each character in the initial data section is at +.>Variance of probability of occurrence in the temporary data segments; />A logarithmic function based on a natural constant is represented.
Preferably, the first adjustment is performed on the initial data segments according to the optimization degree of the first transposition on two adjacent initial data segments, and each data segment in the original data after the first adjustment is obtained; according to each data segment in the original data after the first adjustment, each adjusted data segment in the original data is obtained, and the specific method comprises the following steps:
for the firstTemporary data section and->Initial data segment, when->A value greater than 0 andwhen it is necessary to do so>Temporary data section and->The first adjustment is made to the initial data segment,indicating the first right transposition pair +>Temporary data section and->The degree of optimization of the individual initial data segments,indicating the first left transposition pair +>Temporary data section and- >The degree of optimization of the individual initial data segments,representing the degree of optimization of the first transposition to two adjacent initial data segments; obtain the first adjustedTemporary data section and->A plurality of initial data segments;
will be subjected to the first adjustmentRemoving the last character in the temporary data section and placing the removed character in the first adjusted +.>Before the first character of the initial data segment, the first character is marked as the second left transposition, and the first adjusted first part of the second left transposition is completed>The temporary data section is marked as +.>Left data pieces, after the first adjustment of the second left transposition will be completed +.>The initial data segment is marked as +.>Left data segments; obtaining the second left transposition pair after the first adjustment>Temporary data section and->The degree of optimization of the individual initial data segments is denoted +.>；
Acquiring the first time of adjustment of the second right transposition pairTemporary data section and->The degree of optimization of the individual initial data segments is recorded as +.>；
And then will beAnd->The sum of (1) as the first transposition pair after the first adjustment +.>Temporary data section and->Optimization degree record of each initial data segment Is->；
When (when)The value of (2) is greater than 0 and +.>In this case, the first adjustment is required>Temporary data section and->The second adjustment is carried out on the initial data segment to obtain the +.>Temporary data section and->A plurality of initial data segments;
and so on, continuously to the firstTemporary data section and->The initial data segments are adjusted until the +.>Temporary data section and->The first data segment is adjusted to +.>Temporary data section and->Initial number ofAnd (5) according to the segments.
Preferably, the pair ofTemporary data section and->The specific method for adjusting the initial data segments comprises the following steps:
for passing through the firstSecond adjusted->Temporary data section and->An initial data segment, comparison->And->The size of (1)>Will be->Temporary data section and->The original data segments are replaced by +.>Left->Data section and->Left->A data segment; if->Will be->Temporary data section and->The original data segments are replaced by +.>Right->Data section and->Right->A data segment; get through->Second adjusted->Temporary data section and->A plurality of initial data segments; said->Indicate- >Right transposition pair->Temporary data section and->Optimizing degree of the individual initial data segments, +.>Indicate->Second left transposition pair->Temporary data section and->The degree of optimization of the individual initial data segments.
Preferably, the data segments to be combined are obtained according to each data segment after adjustment in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; each final data segment in the original data is acquired according to the data segment combined with the data segment to be combined, and the specific method comprises the following steps:
presetting a data segment length thresholdThe length of the data segment in the original data after being adjusted is less than or equal to +.>The data segments of the data are marked as data segments to be combined;
if the data segment to be combined has only one adjacent data segment, the data segment to be combined is directly combined with the adjacent data segment; if the merging data segment has two adjacent data segments, calculating merging direction parameters of the data segments to be merged, wherein a specific judging formula is as follows:
in the method, in the process of the invention,a merging direction parameter representing a data segment to be merged; />Representing waitingCombining the variance of the occurrence probability of each character in the data segment after the data segment is combined with the data segment adjacent to the left side; />Representing the variance of the occurrence probability of each character in the adjacent data segments on the left side of the data segments to be combined; / >Representing the variance of the occurrence probability of each character in the data segment after the data segment to be combined is combined with the data segment adjacent to the right side; />Representing the variance of the occurrence probability of each character in the adjacent data segments on the right side of the data segments to be combined; />Representing an absolute value operation;
if it isIf the value of (2) is greater than or equal to 0, merging the data segment to be merged with the data segment adjacent to the left side; if->If the value of (2) is less than 0, combining the data segment to be combined with the data segment adjacent to the right side to obtain the final +.>Temporary data pieces and final +.>The initial data segments.
The embodiment of the invention provides a data sharing system for forestry information, which comprises a data acquisition module, a data analysis module, a data processing module and a data compression module, wherein:
the data acquisition module is used for acquiring forestry information and acquiring original data according to the forestry information; segmenting the original data to obtain each initial data segment in the original data;
the data analysis module is used for performing first left transposition on two adjacent initial data segments to obtain two adjacent left data segments; acquiring the optimization degree of the first left transposition to two adjacent initial data segments according to two adjacent left data segments; performing right transposition for the two adjacent initial data segments for the first time to obtain two adjacent right data segments; acquiring the optimization degree of the first right transposition to two adjacent initial data segments according to two adjacent right data segments;
The data processing module is used for obtaining the optimization degree of the first transposition to the two adjacent initial data segments according to the optimization degree of the first left transposition to the two adjacent initial data segments and the optimization degree of the first right transposition to the two adjacent initial data segments; according to the optimization degree of the first transposition to two adjacent initial data segments, the initial data segments are adjusted for the first time, and each data segment in the original data after the first adjustment is obtained; acquiring each adjusted data segment in the original data according to each data segment in the original data after the first adjustment;
the data compression module is used for acquiring data segments to be combined according to each data segment which is adjusted in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; acquiring each final data segment in the original data according to the data segment combined with the data segment to be combined; and finally, each final data segment in the original data is compressed by using an arithmetic code to obtain an arithmetic code compression result, and the arithmetic code compression result is stored in the sharing platform.
The technical scheme of the invention has the beneficial effects that: the conventional segmentation method directly uses global fixed-length segmentation, and the determined data segment length is too large to ensure that the aim of greatly differentiating the character frequency in the data segment can not be achieved after a large number of data segments are segmented, and the too small data segment length can cause that the extra length of data coding generated by segmentation is too large because of too many data segments, so that the coding length is unnecessarily increased, and therefore forestry information can not be well compressed; the invention obtains the frequency difference degree of all data segments by carrying out preliminary segmentation on the data with fixed length, reallocates the characters at the segmentation boundary according to the frequency difference degree of the data segments, judges the frequency distribution condition of the characters in two adjacent segments of data involved before and after the reallocation to obtain the best existing segment of the characters, thereby obtaining the best segmentation of the data, and then compressing the best segmentation of each data; the purpose of compressing forestry information is achieved better.
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.
Figure 1 is a flow chart of the steps of a data sharing method for forestry information of the present invention;
figure 2 is a block diagram of a data sharing system for forestry information according to the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purposes, the following detailed description refers to specific implementation, structure, characteristics and effects of a data sharing method and system for forestry information according to the present invention, which are provided by the present invention with reference to the accompanying drawings and preferred embodiments. 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 a data sharing method and system for forestry information provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart of steps of a data sharing method for forestry information according to an embodiment of the present invention is shown, the method includes the steps of:
step S001: acquiring forestry information, and acquiring original data according to the forestry information; and segmenting the original data to obtain each initial data segment in the original data.
The forestry information in this embodiment refers to woodland vegetation data, wild animal data, forestry economic data, and the like; further woodland vegetation data includes, but is not limited to: vegetation type, vegetation distribution, vegetation area, and growth status; wild animal data includes, but is not limited to, the species, number, distribution, and protection of the wild animal; forestry economic data includes, but is not limited to: forestry yield, wood production, and trade of forest products. Meanwhile, the forestry information has important reference values for various aspects such as forestry resource management, ecological environment protection, economic development, scientific research and the like, and the embodiment is used as a data sharing method of the forestry information, so that the forestry information needs to be collected at first.
Specifically, forestry information can be collected through field investigation, remote sensing technology and unmanned aerial vehicle.
It should be further noted that, the types of data to be recorded in the forestry information are complicated, and if the collected forestry information is directly stored, a large amount of storage space is occupied, so that the use efficiency of the storage space point is improved, and therefore the collected forestry information needs to be compressed. In order to be able to compress forestry information better, it is also necessary to convert text data in the forestry information into characters that are easier to compress.
Specifically, all text data in the forestry information are converted into Unicode codes against a Unicode coding table; and converting the obtained Unicode code into 16-bit binary code, splitting the 16-bit binary code into a first 8-bit binary code and a second 8-bit binary code, converting the obtained 8-bit binary code into ASCII character data by contrasting an ASCII coding table, and taking the obtained ASCII character data and non-text data in forestry information as raw data.
It should be noted that, in forestry information contains many different types of data, but the data character similarity degree contained in the same type of data is high, and the data character similarity degree contained in different types of data is low; for example, in woodland vegetation data, characters related to plants such as vegetation types and vegetation growth conditions are mainly included, and in wild animal data, characters related to animals such as animal types and protection conditions are mainly included. Therefore, the original data is segmented, and the data of the same type are placed in the same data segment for compression, so that the data compression effect can be effectively improved.
Specifically, the initial data segment length is preset，/>The specific size of (2) can be set according to the actual situation, the hard requirement is not required in the present embodiment, and +_ is adopted in the present embodiment>Description is made; the 1 st character to the 1 st ∈of the original data>All characters among the characters form a 1 st initial data segment; the original data is>The first character to->All characters among the characters form a 2 nd initial data segment; the original data is>The first character to->All characters between the characters constitute the 3 rd initial dataA segment; and so on, up to +.>The number of characters between the individual character and the last character is equal to or less than +.>The method comprises the steps of carrying out a first treatment on the surface of the The original data is>All characters from the character to the last character in the original data constitute +.>A plurality of initial data segments; and obtaining each initial data segment in the original data.
Thus, the initial segmentation of the original data is completed, and each initial data segment in the original data is obtained.
Step S002: performing left transposition for the first time on two adjacent initial data segments to obtain two adjacent left data segments; acquiring the optimization degree of the first left transposition to two adjacent initial data segments according to two adjacent left data segments; performing right transposition for the two adjacent initial data segments for the first time to obtain two adjacent right data segments; and obtaining the optimization degree of the first right transposition to the two adjacent initial data segments according to the two adjacent right data segments.
It should be noted that, the larger the difference of occurrence frequency between the characters in the data segment in arithmetic coding, the better the compression effect, that is, the longer the data segment, the difference of occurrence frequency between the characters in the data segment cannot be ensured, resulting in poor data compression effect; the too short data segment can cause too many divided data segments, and because each data segment needs extra coding length to record the coding table in the compression process, the coding length is unnecessarily increased; thus, simply determining the data segment length does not give a good compression effect. In order to further improve the compression effect of forestry information, the root also needs to adaptively adjust the initial data segment according to the degree of occurrence frequency difference between characters in the initial data segment.
It should be further noted that, in arithmetic coding, the greater the degree of occurrence frequency difference between different characters in a piece of data, the smaller the average coding length per character per bit of arithmetic coding is, and the better the compression effect is. Therefore, the optimized degree of adjustment can be calculated by continuously adjusting the initial data segment according to the degree of the occurrence frequency difference between the characters in the adjusted initial data segment.
Firstly, obtaining a final first data segment and a tentative second data segment according to a first initial data segment and a second initial data segment; and then obtaining a final second data segment and a final third data segment according to the temporary second data segment and the initial third data segment, and the like, obtaining a final penultimate data segment and a temporary penultimate data segment of the original data, and taking the temporary penultimate data segment as the final penultimate data segment of the original data.
It should be further noted that, in this embodiment, the tentative data segment and the final data segment are obtained according to the initial data segment and the initial data segment; the procedure and method for obtaining the tentative data segment and the final data segment from the tentative data segment and the initial data segment are exactly the same, so in this embodiment, only the procedure for obtaining the tentative data segment and the final data segment from the tentative data segment and the initial data segment will be described.
Specifically, for the firstTemporary data section and->A plurality of initial data segments; will be->The last character in the temporary data section is from +.>Removed from the temporary data section and the removed character is placed in +.>Before the first character of the initial data segment, marking the first left transposition; obtaining the +. >Temporary data section and->An initial data section to be left shifted by the first time +.>Temporary data section and->The initial data segments are respectively marked as +.>Left one data segment and +.>Left one data segment; according to->Left one data segment and +.>Degree of frequency difference between characters in left data section, and +.>Temporary data section and->The degree of the difference in the frequency of occurrence between the characters in the initial data segment is obtained for the first left transposition pair +.>Temporary data section and->Primary part(s)The optimization degree of the initial data segment is as follows:
in the method, in the process of the invention,indicating the first left transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicate->Each character in the left data section is in the +.>Variance of probability of occurrence in the left data segment;indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Represent the firstEach character in the left data section is in the +.>Left one dataVariance of probability of occurrence in the segment; />Indicate->Each character in the initial data section is at +.>Variance of probability of occurrence in the temporary data segments; />A logarithmic function based on a natural constant is represented.
It should be further noted that, in this embodiment, the variance of the probability of each character in the data segment appearing in the data segment is used as the degree of the occurrence frequency difference between the characters in the data segment; whileCalculated is show->The degree of the difference in the frequency of occurrence between the characters in the left data segment and +.>The ratio of the degree of the occurrence frequency difference between the characters in the temporary data segments ifIf the value of (2) is greater than 1, this indicates that the first left shift is for the +.>The temporary data segments have an optimized effect if +.>If the value of (2) is less than or equal to 1, this indicates that the first left shift is for the +.>The temporary data segments have no optimizing effect and/>the larger the value of (2) is, the better the optimization effect is;
similarly, ifIf the value of (2) is greater than 1, this indicates that the first left shift is for the +.>The initial data segments have an optimizing effect; if->If the value of (2) is less than or equal to 1, this indicates that the first left shift is for the +.>The initial data pieces do not have an optimizing effect and +.>The larger the value of (2) is, the better the optimization effect is;
thus, whenIf the value of (2) is greater than 0, it indicates that the first left transposition has an optimal effect when +.>If the value of (2) is less than or equal to 0, it indicates that the first left transposition has no optimization effect and +.>The larger the value of (2) the better the optimization.
Thus, the first left transposition pair is obtained Temporary data section and->Optimizing the initial data segments to obtain adjacent initial numbers of the primary data by the first left transpositionAccording to the optimization degree of the segments.
For the firstTemporary data section and->The initial data segment is +.>The first character in the initial data section is from +.>Removed from the initial data segment and the removed character is placed at +.>After the last character of the temporary data segment, marking as first right transposition; obtaining the +.f after the first right transposition>Temporary data section and->An initial data section to be subjected to the first right transposition +.>Temporary data section and->The initial data segments are respectively marked as +.>Right one data segment and +.>A right data segment; according to->Right one data segment and +.>Degree of occurrence frequency difference between characters in right one data segment, and +.>Temporary data section and->The degree of the difference in the frequency of occurrence between the characters in the initial data segment is obtained for the first right transposition pair +.>Temporary data section and->The optimization degree of each initial data segment is calculated according to the following specific formula:
in the method, in the process of the invention,indicating the first right transposition pair +>Temporary data section and- >Optimizing degree of each initial data segment; />Indicate->Each character in the right data section is in the +.>The variance of the probability of occurrence in the right data segment;indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Represent the firstEach character in the right data section is in the +.>The variance of the probability of occurrence in the right data segment; />Indicate->Each character in the initial data section is at +.>Variance of probability of occurrence in the temporary data segments; />A logarithmic function based on a natural constant is represented.
It should be further noted that, with the first left shift pairTemporary data section and->The optimization degree of the initial data segments is the same; when->If the value of (2) is greater than 0, it indicates that the first right transposition has an optimized effect when +.>If the value of (2) is less than or equal to 0, it indicates that the first right transposition has no optimization effect and +.>The larger the value of (2) the better the optimization.
Thus, the first right transposition pair is obtainedTemporary data section and->Optimizing degree of each initial data segment; and the same is done to obtain the optimization degree of the first right transposition on each adjacent initial data segment on the original data.
Step S003: taking the sum of the optimization degree of the first left transposition and the optimization degree of the first right transposition on two adjacent initial data segments as the optimization degree of the first transposition on the two adjacent initial data segments; and judging whether the initial data segments need to be adjusted according to the optimization degree of the first transposition on two adjacent initial data segments, and acquiring each adjusted data segment.
It should be noted that, in order to better compress the original data, the optimization degree of each adjacent initial data segment on the original data by combining the first left transposition and the optimization degree of each adjacent initial data segment on the original data by the first right transposition are needed to obtain the optimization degree of each adjacent initial data segment on the original data by the first transposition; and judging whether the initial data segment needs to be adjusted or not and how to adjust the initial data segment according to the optimization degree of each adjacent initial data segment on the original data by the first transposition.
Specifically, a specific calculation formula for obtaining the optimization degree of the first transposition to two adjacent initial data segments is as follows:
in the method, in the process of the invention,the first transposition pair +.>Temporary data section and->Optimizing degree of each initial data segment; />Indicating the first left transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicating the first right transposition pair +>Temporary data section and->The degree of optimization of the individual initial data segments.
It should be noted that whenWhen the value of (2) is 0 or less, the first transposition pair is described as +.>Temporary data section and- >The initial data segments do not have an optimization effect; when->When the value of (2) is greater than 0, it indicates that the first transposition pair is +.>Temporary data section and->The individual initial data segments have an optimizing effect.
In particular, whenWhen the value of (2) is 0 or less, or +>When not to->Temporary data section and->Performing first adjustment on the initial data segments; when->The value of (2) is greater than 0 and +.>When it is necessary to do so>Temporary data section and->The initial data segments are adjusted for the first time.
Further, for the firstTemporary data section and->The first adjustment of the initial data pieces is performed by comparing +.>And->The size of (1)>Will be->Temporary data section and->The original data segments are replaced by +.>Left one data segment and +.>Left one data segment; if->Will be->Temporary data section and->The original data segments are replaced by +.>Right one data segment and +.>The right data segment.
Thus, the first adjustment of the initial data segment is completed, and the first adjusted data segment is obtainedTemporary data section and->The initial data segments.
For the first adjusted partTemporary data section and->The first data segment is to be adjusted by the first time +. >Removing the last character in the temporary data section and placing the removed character in the first adjusted +.>Before the first character of the initial data segment, the first character is marked as the second left transposition, and the first adjusted first part of the second left transposition is completed>The temporary data section is marked as +.>Left data pieces, after the first adjustment of the second left transposition will be completed +.>The initial data segment is marked as +.>Left data segments; and calculating the first left transposition pair +.>Temporary data section and->The optimization degree of the initial data segments is the same, and the second left transposition pair is calculated to be the first adjusted +.>Temporary data section and->The degree of optimization of the individual initial data segments is recorded as +.>；
And calculate the first right transposition pairTemporary data section and->The optimization degree of the initial data segments is the same, and the second right transposition pair is calculated to be the first adjusted +.>Temporary data section and->The degree of optimization of the individual initial data segments is recorded as +.>；
And then will beAnd->The sum of (1) as the first transposition pair after the first adjustment +.>Temporary data section and->The degree of optimization of the individual initial data segments is recorded as +.>。
When the following is performed The value of (2) is 0 or less, or +>When not to->Temporary data section and->Performing first adjustment on the initial data segments; when->The value of (2) is greater than 0 and +.>When it is necessary to do so>Temporary data section and->The initial data segments are adjusted a second time.
Specifically, for the first adjusted partTemporary data section and->The second adjustment of the initial data segments is performed by comparing +.>And->The size of (1)>The first adjusted +.>Temporary data section and->The original data segments are replaced by +.>Left data piece and +.>Left data segments; if->The first adjusted +.>Temporary data section and->The original data segments are replaced by +.>Right data piece and +.>The right data segment.
Thus, the second adjustment of the initial data segment is completed, and each data segment in the original data after the second adjustment is obtained.
And so on, each data segment in the original data is continuously adjusted until the first data segment can not be adjustedTemporary data section and->The last adjusted +.>The temporary data section is marked as +.>A final data section to be subjected to a final adjustment +. >The initial data segment is marked as +.>Temporary data segments.
Thus far, get the firstFinal data segment +.>And the temporary data segments are similarly obtained, namely the final data segment of all the data segments except the last data segment and the temporary data segment of the last data segment are obtained, and the temporary data segment of the last data segment is taken as the final data segment of the last data segment.
Step S004: acquiring data segments to be combined according to each data segment which is adjusted in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; acquiring each final data segment in the original data according to the data segment combined with the data segment to be combined; and (3) compressing each final data segment in the original data by using an arithmetic code to obtain an arithmetic code compression result, and storing the arithmetic code compression result in a sharing platform.
It should be noted that, because all the data segments in the original data are iteratively adjusted, the length of a part of the data segments in the original data is too short finally, and because each data segment needs an additional coding length to record the coding table in the compression process, the coding length is unnecessarily increased, so in order to improve the compression effect of the forestry information, the data segments with too short length are required to be combined with the adjacent data segments, and the purpose of reducing the coding length is achieved.
Specifically, a data segment length threshold is preset，/>The specific size of (2) can be set according to the actual situation, the hard requirement is not required in the present embodiment, and +_ is adopted in the present embodiment>To make a description of->For a preset initial data segment length, +.>Is an upward-taking function; the length of the data segment in the original data after being adjusted is less than or equal to +.>The data segments of (2) are marked as data segments to be combined.
If the data segment to be combined has only one adjacent data segment, the data segment to be combined is directly combined with the adjacent data; if the combined data segment has two adjacent data segments, the data segment to be combined needs to be combined with the adjacent data segment, and a specific judgment formula is as follows:
in the method, in the process of the invention,a merging direction parameter representing a data segment to be merged; />Representing the variance of the occurrence probability of each character in the data segment after the data segment to be combined is combined with the data segment adjacent to the left side; />Representing the variance of the occurrence probability of each character in the adjacent data segments on the left side of the data segments to be combined; />Representing the variance of the occurrence probability of each character in the data segment after the data segment to be combined is combined with the data segment adjacent to the right side; />Representing the variance of the occurrence probability of each character in the adjacent data segments on the right side of the data segments to be combined; / >Representing an absolute value operation.
When the merging direction parameter of the data segment to be merged is greater than 0, the difference degree of the occurrence probability of each character in the data segment after merging the data segment to be merged and the left data segment is greater than the difference degree of the occurrence probability of each character in the data segment after merging the data segment to be merged and the right data segment; when the merging direction parameter of the data segments to be merged is smaller than 0, the difference degree of the occurrence probability of each character in the data segments after the data segments to be merged and the left data segment are explained to be smaller than the difference degree of the occurrence probability of each character in the data segments after the data segments to be merged and the right data segment are merged. In order to make the degree of difference of the occurrence probability of characters in the whole data segment larger, the data segment to be combined is combined with the data segment with the larger degree of difference of the occurrence probability of each character after combination.
In particular, ifIf the value of (2) is greater than 0, merging the data segment to be merged with the segment adjacent to the left side; if->If the value of (2) is smaller than 0, merging the data segment to be merged with the segment adjacent to the right side; if->If the value of (2) is equal to 0, the data segment to be combined can be combined with any adjacent data segment, in this embodiment +. >And when the data segment to be combined is equal to 0, combining the data segment to be combined with the segment adjacent to the left side.
And thus, the merging of the data segments to be merged is completed, and each final data segment in the original data is obtained.
And finally, each final data segment in the original data is compressed by using an arithmetic code to obtain an arithmetic code compression result, and the arithmetic code compression result is stored in the sharing platform. When the forestry information data is required to be accessed, the forestry information data can be accessed in the sharing platform, and as the forestry information data is compressed in a segmented compression mode, storage can be completed only by consuming a small storage space, and sharing efficiency is improved.
Referring to fig. 2, a block diagram of a data sharing system for forestry information according to an embodiment of the present invention is shown, where the system includes the following modules:
the data acquisition module is used for acquiring forestry information and acquiring original data according to the forestry information; segmenting the original data to obtain each initial data segment in the original data;
the data analysis module is used for performing first left transposition on two adjacent initial data segments to obtain two adjacent left data segments; acquiring the optimization degree of the first left transposition to two adjacent initial data segments according to two adjacent left data segments; performing right transposition for the two adjacent initial data segments for the first time to obtain two adjacent right data segments; acquiring the optimization degree of the first right transposition to two adjacent initial data segments according to two adjacent right data segments;
The data processing module is used for obtaining the optimization degree of the first transposition to the two adjacent initial data segments according to the optimization degree of the first left transposition to the two adjacent initial data segments and the optimization degree of the first right transposition to the two adjacent initial data segments; according to the optimization degree of the first transposition to two adjacent initial data segments, the initial data segments are adjusted for the first time, and each data segment in the original data after the first adjustment is obtained; acquiring each adjusted data segment in the original data according to each data segment in the original data after the first adjustment;
the data compression module is used for acquiring data segments to be combined according to each data segment which is adjusted in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; acquiring each final data segment in the original data according to the data segment combined with the data segment to be combined; and finally, each final data segment in the original data is compressed by using an arithmetic code to obtain an arithmetic code compression result, and the arithmetic code compression result is stored in the sharing platform.
The conventional segmentation method directly uses global fixed-length segmentation, and the determined data segment length is too large to ensure that the aim of greatly differentiating the character frequency in the data segment can not be achieved after a large number of data segments are segmented, and the too small data segment length can cause that the extra length of data coding generated by segmentation is too large because of too many data segments, so that the coding length is unnecessarily increased, and therefore forestry information can not be well compressed; the invention obtains the frequency difference degree of all data segments by carrying out preliminary segmentation on the data with fixed length, reallocates the characters at the segmentation boundary according to the frequency difference degree of the data segments, judges the frequency distribution condition of the characters in two adjacent segments of data involved before and after the reallocation to obtain the best existing segment of the characters, thereby obtaining the best segmentation of the data, and then compressing the best segmentation of each data; the purpose of compressing forestry information is achieved better.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the invention, but any modifications, equivalent substitutions, improvements, etc. within the principles of the present invention should be included in the scope of the present invention.
Claims (6)
1. A data sharing method for forestry information, the method comprising the steps of:
acquiring forestry information, and acquiring original data according to the forestry information; segmenting the original data to obtain each initial data segment in the original data;
performing left transposition for the first time on two adjacent initial data segments to obtain two adjacent left data segments; acquiring the optimization degree of the first left transposition to two adjacent initial data segments according to two adjacent left data segments; performing right transposition for the two adjacent initial data segments for the first time to obtain two adjacent right data segments; acquiring the optimization degree of the first right transposition to two adjacent initial data segments according to two adjacent right data segments;
taking the sum of the optimization degree of the first left transposition and the optimization degree of the first right transposition on two adjacent initial data segments as the optimization degree of the first transposition on the two adjacent initial data segments; judging whether the initial data segments need to be adjusted according to the optimization degree of the first transposition on two adjacent initial data segments, and acquiring each adjusted data segment;
Acquiring data segments to be combined according to each data segment which is adjusted in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; acquiring each final data segment in the original data according to the data segment combined with the data segment to be combined; each final data segment in the original data is compressed by using an arithmetic code to obtain an arithmetic code compression result, and the arithmetic code compression result is stored in a sharing platform;
the method for obtaining the two adjacent left data segments by performing the first left transposition on the two adjacent initial data segments comprises the following specific steps:
obtaining a first final data segment and a second tentative data segment through the first initial data segment and the second initial data segment, obtaining a second final data segment and a third tentative data segment through the second tentative data segment and the three initial data segments, and the like;
for the firstTemporary data section and->A plurality of initial data segments; will be->The last character in the temporary data section is from +.>Removed from the temporary data section and the removed character is placed in +.>Before the first character of the initial data segment, marking the first left transposition; obtaining the +. >Temporary data section and->An initial data section to be left shifted by the first time +.>Temporary data section and->The initial data segments are respectively marked as +.>Left one data segment and +.>Left one data segment;
the optimization degree of the first left transposition to the two adjacent initial data segments is obtained according to the two adjacent left data segments, and the specific calculation formula is as follows:
in the method, in the process of the invention,indicating the first left transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicate->Each character in the left data section is in the +.>Variance of probability of occurrence in the left data segment; />Indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Indicate->Each character in the left data section is in the +.>Variance of probability of occurrence in the left data segment; />Indicate->Each character in the initial data section is at +.>Variance of probability of occurrence in the temporary data segments; />A logarithmic function representing a base of a natural constant;
the optimization degree of the first right transposition to the two adjacent initial data segments is obtained according to the two adjacent right data segments, and the specific calculation formula is as follows:
In the method, in the process of the invention,indicating the first right transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicate->Each character in the right data section is in the +.>The variance of the probability of occurrence in the right data segment; />Indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Indicate->Each character in the right data section is in the +.>The variance of the probability of occurrence in the right data segment; />Indicate->Each character in the initial data section is at +.>Variance of probability of occurrence in the temporary data segments; />A logarithmic function representing a base of a natural constant;
the initial data segments are adjusted for the first time according to the optimization degree of the first transposition to two adjacent initial data segments, and each data segment in the original data after the first adjustment is obtained; according to each data segment in the original data after the first adjustment, each adjusted data segment in the original data is obtained, and the specific method comprises the following steps:
for the firstTemporary data section and->Initial data segment, when->A value greater than 0 andwhen it is necessary to do so>Temporary data section and->The first adjustment is made to the initial data segment, Indicating the first right transposition pair +>Temporary data section and->The degree of optimization of the individual initial data segments,indicating the first left transposition pair +>Temporary data section and->The degree of optimization of the individual initial data segments,representing the degree of optimization of the first transposition to two adjacent initial data segments; obtain the first adjustedTemporary data section and->A plurality of initial data segments;
will be subjected to the first adjustmentRemoving the last character in the temporary data section and placing the removed character in the first adjusted +.>Before the first character of the initial data segment, the first character is marked as the second left transposition, and the first adjusted first part of the second left transposition is completed>The temporary data section is marked as +.>Left data pieces, after the first adjustment of the second left transposition will be completed +.>The initial data segment is marked as +.>Left data segments; obtaining the second left transposition pair after the first adjustment>Temporary data section and->Primary part(s)The degree of optimization of the initial data segment is denoted +.>；
Acquiring the first time of adjustment of the second right transposition pairTemporary data section and->The degree of optimization of the individual initial data segments is recorded as +. >；
And then will beAnd->The sum of (1) as the first transposition pair after the first adjustment +.>Temporary data section and->The degree of optimization of the individual initial data segments is recorded as +.>；
When (when)The value of (2) is greater than 0 and +.>In this case, the first adjustment is required>Temporary data section and->The second adjustment is carried out on the initial data segment to obtain the +.>Temporary data section and->A plurality of initial data segments;
and so on, continuously to the firstTemporary data section and->The initial data segments are adjusted until the +.>Temporary data section and->The first data segment is adjusted to +.>Temporary data section and->The initial data segments.
2. The data sharing method for forestry information according to claim 1, wherein the acquiring forestry information acquires original data according to the forestry information; the method for segmenting the original data to obtain each initial data segment in the original data comprises the following specific steps:
acquiring forestry information through field investigation, remote sensing technology and unmanned aerial vehicle, and converting all text data in the forestry information into Unicode codes by contrast to Unicode coding tables; converting the obtained Unicode code into 16-bit binary code, splitting the 16-bit binary code into a first 8-bit binary code and a second 8-bit binary code, then converting the obtained 8-bit binary code into ASCII character data by contrasting an ASCII coding table, and using the obtained ASCII character data and non-text data in forestry information as raw data;
Presetting an initial data segment lengthThe 1 st character to the 1 st character in the original data>All characters among the characters form a 1 st initial data segment; the original data is>The first character to->All characters among the characters form a 2 nd initial data segment; the original data is>The first character to->All characters among the characters form a 3 rd initial data segment; and so on, up to +.>The number of characters between the individual character and the last character is equal to or less than +.>The method comprises the steps of carrying out a first treatment on the surface of the The original data is>All characters from the character to the last character in the original data constitute +.>A plurality of initial data segments; and obtaining each initial data segment in the original data.
3. A method for sharing forestry information according to claim 1, wherein the first right transposition of two adjacent initial data segments to obtain two adjacent right data segments comprises the following specific steps:
for the firstTemporary data section and->The initial data segment is +.>The first character in the initial data section is from +.>Removed from the initial data segment and the removed character is placed at +.>After the last character of the temporary data segment, marking as first right transposition; obtaining the +.f after the first right transposition >Temporary data section and->An initial data section to be subjected to the first right transposition +.>Temporary data section and->The initial data segments are respectively marked as +.>Right one data segment and +.>The right data segment.
4. A data sharing method for forestry information as defined in claim 1, wherein said pair of firstTemporary data section and->The specific method for adjusting the initial data segments comprises the following steps:
for passing through the firstSecond adjusted->Temporary data section and->An initial data segment, comparison->And (3) withThe size of (1)>Will be->Temporary data section and->The original data segments are replaced by +.>Left->Data section and->Left->A data segment; if->Will be->Temporary data section and->The original data segments are replaced by +.>Right->Data section and->Right->A data segment; get through->Second adjusted->Temporary data section and->A plurality of initial data segments; said->Indicate->Right transposition pair->Temporary data section and->Optimizing degree of the individual initial data segments, +.>Indicate->Second left transposition pair->Temporary data section and->The degree of optimization of the individual initial data segments.
5. A data sharing method for forestry information according to claim 1, wherein the data segments to be combined are obtained according to each data segment adjusted in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; each final data segment in the original data is acquired according to the data segment combined with the data segment to be combined, and the specific method comprises the following steps:
presetting a data segment length thresholdThe length of the data segment in the original data after being adjusted is less than or equal to +.>The data segments of the data are marked as data segments to be combined;
if the data segment to be combined has only one adjacent data segment, the data segment to be combined is directly combined with the adjacent data segment; if the merging data segment has two adjacent data segments, calculating merging direction parameters of the data segments to be merged, wherein a specific judging formula is as follows:
in the method, in the process of the invention,a merging direction parameter representing a data segment to be merged; />Representing the variance of the occurrence probability of each character in the data segment after the data segment to be combined is combined with the data segment adjacent to the left side; />Representing the variance of the occurrence probability of each character in the adjacent data segments on the left side of the data segments to be combined; />Representing the variance of the occurrence probability of each character in the data segment after the data segment to be combined is combined with the data segment adjacent to the right side; / >Representing the variance of the occurrence probability of each character in the adjacent data segments on the right side of the data segments to be combined; />Representing an absolute value operation;
if it isIf the value of (2) is greater than or equal to 0, merging the data segment to be merged with the data segment adjacent to the left side; if->If the value of (2) is less than 0, combining the data segment to be combined with the data segment adjacent to the right side to obtain the final +.>Temporary data pieces and final +.>The initial data segments.
6. A data sharing system for forestry information, the system comprising the following modules:
the data acquisition module is used for acquiring forestry information and acquiring original data according to the forestry information; segmenting the original data to obtain each initial data segment in the original data;
the data analysis module is used for performing first left transposition on two adjacent initial data segments to obtain two adjacent left data segments; acquiring the optimization degree of the first left transposition to two adjacent initial data segments according to two adjacent left data segments; performing right transposition for the two adjacent initial data segments for the first time to obtain two adjacent right data segments; acquiring the optimization degree of the first right transposition to two adjacent initial data segments according to two adjacent right data segments;
The method for obtaining the two adjacent left data segments by performing the first left transposition on the two adjacent initial data segments comprises the following specific steps:
obtaining a first final data segment and a second tentative data segment through the first initial data segment and the second initial data segment, obtaining a second final data segment and a third tentative data segment through the second tentative data segment and the three initial data segments, and the like;
for the firstTemporary data section and->A plurality of initial data segments; will be->The last character in the temporary data section is from +.>Removed from the temporary data section and the removed character is placed in +.>Before the first character of the initial data segment, marking the first left transposition; obtaining the +.>Temporary data section and->An initial data section to be left shifted by the first time +.>Temporary data section and->The initial data segments are respectively marked as +.>Left one data segment and +.>Left one data segment;
the optimization degree of the first left transposition to the two adjacent initial data segments is obtained according to the two adjacent left data segments, and the specific calculation formula is as follows:
in the method, in the process of the invention, Indicating the first left transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicate->Each character in the left data section is in the +.>Variance of probability of occurrence in the left data segment; />Indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Indicate->Each character in the left data section is in the +.>Variance of probability of occurrence in the left data segment; />Indicate->Each character in the initial data section is at +.>Variance of probability of occurrence in the temporary data segments; />A logarithmic function representing a base of a natural constant;
the optimization degree of the first right transposition to the two adjacent initial data segments is obtained according to the two adjacent right data segments, and the specific calculation formula is as follows:
in the method, in the process of the invention,indicating the first right transposition pair +>Temporary data section and->Optimizing degree of each initial data segment; />Indicate->Each character in the right data section is in the +.>The variance of the probability of occurrence in the right data segment; />Indicate->Each character in the temporary data section is in +.>Variance of probability of occurrence in the temporary data segments; />Indicate->Each character in the right data section is in the +. >The variance of the probability of occurrence in the right data segment; />Indicate->Each character in the initial data section is at +.>Variance of probability of occurrence in the temporary data segments; />A logarithmic function representing a base of a natural constant;
the data processing module is used for obtaining the optimization degree of the first transposition to the two adjacent initial data segments according to the optimization degree of the first left transposition to the two adjacent initial data segments and the optimization degree of the first right transposition to the two adjacent initial data segments; according to the optimization degree of the first transposition to two adjacent initial data segments, the initial data segments are adjusted for the first time, and each data segment in the original data after the first adjustment is obtained; acquiring each adjusted data segment in the original data according to each data segment in the original data after the first adjustment;
the initial data segments are adjusted for the first time according to the optimization degree of the first transposition to two adjacent initial data segments, and each data segment in the original data after the first adjustment is obtained; according to each data segment in the original data after the first adjustment, each adjusted data segment in the original data is obtained, and the specific method comprises the following steps:
For the firstTemporary data section and->Initial data segment, when->A value greater than 0 andwhen it is necessary to do so>Temporary data section and->The first adjustment is made to the initial data segment,indicating the first right transposition pair +>Temporary data section and->The degree of optimization of the individual initial data segments,indicating the first left transposition pair +>Temporary data section and->The degree of optimization of the individual initial data segments,representing the degree of optimization of the first transposition to two adjacent initial data segments; obtain the first adjustedTemporary data section and->A plurality of initial data segments;
will be subjected to the first adjustmentRemoving the last character in the temporary data segment and placing the removed character on the first adjusted character/>Before the first character of the initial data segment, the first character is marked as the second left transposition, and the first adjusted first part of the second left transposition is completed>The temporary data section is marked as +.>Left data pieces, after the first adjustment of the second left transposition will be completed +.>The initial data segment is marked as +.>Left data segments; obtaining the second left transposition pair after the first adjustment>Temporary data section and- >The degree of optimization of the individual initial data segments is denoted +.>；
Acquiring the first time of adjustment of the second right transposition pairTemporary data section and->The degree of optimization of the individual initial data segments is recorded as +.>；
And then will beAnd->The sum of (1) as the first transposition pair after the first adjustment +.>Temporary data section and->The degree of optimization of the individual initial data segments is recorded as +.>；
When (when)The value of (2) is greater than 0 and +.>In this case, the first adjustment is required>Temporary data section and->The second adjustment is carried out on the initial data segment to obtain the +.>Temporary data section and->A plurality of initial data segments;
and so on, continuously to the firstTemporary data section and->The initial data segments are adjusted until the +.>Temporary data section and->The first data segment is adjusted to +.>Temporary data section and->A plurality of initial data segments;
the data compression module is used for acquiring data segments to be combined according to each data segment which is adjusted in the original data; acquiring a data segment combined with the data segment to be combined according to the data segment to be combined; acquiring each final data segment in the original data according to the data segment combined with the data segment to be combined; and finally, each final data segment in the original data is compressed by using an arithmetic code to obtain an arithmetic code compression result, and the arithmetic code compression result is stored in the sharing platform.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311451246.6A CN117176177B (en) | 2023-11-03 | 2023-11-03 | Data sharing method and system for forestry information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311451246.6A CN117176177B (en) | 2023-11-03 | 2023-11-03 | Data sharing method and system for forestry information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117176177A CN117176177A (en) | 2023-12-05 |
| CN117176177B true CN117176177B (en) | 2024-02-06 |
Family
ID=88930232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311451246.6A Active CN117176177B (en) | 2023-11-03 | 2023-11-03 | Data sharing method and system for forestry information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117176177B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0475520A2 (en) * | 1990-09-10 | 1992-03-18 | Koninklijke KPN N.V. | Method for coding an analog signal having a repetitive nature and a device for coding by said method |
| JPH08167852A (en) * | 1994-12-13 | 1996-06-25 | Fujitsu Ltd | Method and device for compressing data |
| RU2108665C1 (en) * | 1996-02-22 | 1998-04-10 | Олег Александрович Ратушняк | Methods and device for pulse-signal data stream fragmentation, structure analysis, and compression |
| US8497788B1 (en) * | 2012-04-25 | 2013-07-30 | Pure Storage Inc. | Efficient techniques for aligned fixed-length compression |
| RU2739335C1 (en) * | 2020-08-10 | 2020-12-23 | Акционерное общество "Рязанское производственно-техническое предприятие "Гранит" | Telemetering information transmission method |
| WO2021174839A1 (en) * | 2020-03-06 | 2021-09-10 | 平安科技（深圳）有限公司 | Data compression method and apparatus, and computer-readable storage medium |
| JP7355913B1 (en) * | 2022-04-22 | 2023-10-03 | 中国長江三峡集団有限公司 | Transmission management method and system for operation and maintenance data of power equipment |
| CN116861041A (en) * | 2023-09-04 | 2023-10-10 | 世窗信息股份有限公司 | Electronic document processing method and system |
-
2023
- 2023-11-03 CN CN202311451246.6A patent/CN117176177B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0475520A2 (en) * | 1990-09-10 | 1992-03-18 | Koninklijke KPN N.V. | Method for coding an analog signal having a repetitive nature and a device for coding by said method |
| JPH08167852A (en) * | 1994-12-13 | 1996-06-25 | Fujitsu Ltd | Method and device for compressing data |
| RU2108665C1 (en) * | 1996-02-22 | 1998-04-10 | Олег Александрович Ратушняк | Methods and device for pulse-signal data stream fragmentation, structure analysis, and compression |
| US8497788B1 (en) * | 2012-04-25 | 2013-07-30 | Pure Storage Inc. | Efficient techniques for aligned fixed-length compression |
| WO2021174839A1 (en) * | 2020-03-06 | 2021-09-10 | 平安科技（深圳）有限公司 | Data compression method and apparatus, and computer-readable storage medium |
| RU2739335C1 (en) * | 2020-08-10 | 2020-12-23 | Акционерное общество "Рязанское производственно-техническое предприятие "Гранит" | Telemetering information transmission method |
| JP7355913B1 (en) * | 2022-04-22 | 2023-10-03 | 中国長江三峡集団有限公司 | Transmission management method and system for operation and maintenance data of power equipment |
| CN116861041A (en) * | 2023-09-04 | 2023-10-10 | 世窗信息股份有限公司 | Electronic document processing method and system |
Non-Patent Citations (2)
| Title |
|---|
| 基于Viterbi的低功耗确定性测试方案;陈田;易鑫;郑浏旸;王伟;梁华国;任福继;刘军;;计算机辅助设计与图形学学报(第05期);全文 * |
| 过站保障车辆集中式调度的单亲遗传算法;朱新平;韩松臣;;西南交通大学学报(第02期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117176177A (en) | 2023-12-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jaware et al. | Crop disease detection using image segmentation | |
| CN113919442B (en) | Tobacco maturity state identification method based on convolutional neural network | |
| CN110704649B (en) | Method and system for constructing flow image data set | |
| CN108319518B (en) | File fragment classification method and device based on recurrent neural network | |
| CN110738201B (en) | Self-adaptive multi-convolution neural network character recognition method based on fusion morphological characteristics | |
| CN116910285B (en) | Intelligent traffic data optimized storage method based on Internet of things | |
| US11570069B2 (en) | Network traffic classification method and system based on improved K-means algorithm | |
| CN111476287A (en) | Hyperspectral image small sample classification method and device | |
| CN117155407A (en) | Intelligent mirror cabinet disinfection log data optimal storage method | |
| CN117176177B (en) | Data sharing method and system for forestry information | |
| CN115952067A (en) | Database operation abnormal behavior detection method and readable storage medium | |
| CN116861271B (en) | Data analysis processing method based on big data | |
| CN117195006B (en) | Veterinary drug residue data management system for chicken | |
| CN113111830A (en) | Grape vine winter pruning point detection algorithm | |
| CN113726824B (en) | Fraud website searching method and system based on image characteristics | |
| CN111797991A (en) | Deep network model compression system, method and device | |
| CN113210264B (en) | Tobacco sundry removing method and device | |
| CN112886967B (en) | Data compression coding processing method and device | |
| CN111814592B (en) | Plant leaf identification method based on stackable capsule network | |
| CN114332640A (en) | Cloud platform and random forest based earth surface covering object identification and area estimation method | |
| CN113094567A (en) | Malicious complaint identification method and system based on text clustering | |
| CN111104372A (en) | Mobile internet big data processing system and processing method thereof | |
| CN117708513B (en) | Planting data management method for valerian characteristic research | |
| CN116597318B (en) | Irrigation area cultivated land precise extraction method, equipment and storage medium based on remote sensing image | |
| CN116228606B (en) | Image optimization processing system based on big data |
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 |