CN117118456B - Magnetic control switch control data processing method based on depth fusion - Google Patents
Magnetic control switch control data processing method based on depth fusion Download PDFInfo
- Publication number
- CN117118456B CN117118456B CN202311385564.7A CN202311385564A CN117118456B CN 117118456 B CN117118456 B CN 117118456B CN 202311385564 A CN202311385564 A CN 202311385564A CN 117118456 B CN117118456 B CN 117118456B
- Authority
- CN
- China
- Prior art keywords
- data
- bit
- matched
- result
- target sequence
- 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
- 230000004927 fusion Effects 0.000 title claims abstract description 25
- 238000003672 processing method Methods 0.000 title claims abstract description 8
- 238000000034 method Methods 0.000 claims abstract description 15
- 230000006835 compression Effects 0.000 abstract description 21
- 238000007906 compression Methods 0.000 abstract description 21
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000006837 decompression Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013135 deep learning Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
- H03M7/4006—Conversion to or from arithmetic code
- H03M7/4012—Binary arithmetic codes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/25—Fusion techniques
Abstract
The invention relates to the technical field of data processing, in particular to a magnetic control switch control data processing method based on deep fusion, which comprises the following steps: the method comprises the steps of collecting control data of a magnetic switch, converting the control data into data to be encoded, setting a target digital code and two types of identifiers, constructing a target sequence, updating the target sequence according to the data to be encoded, obtaining bits to be matched in the data to be encoded, obtaining a matching object in the data to be encoded according to the bits to be matched, selecting one type of identifier from the two types of identifiers to update the target sequence according to an exclusive or result and a same or result of the bits to be matched and the matching object, continuously updating the bits to be matched to obtain the encoding object, obtaining the encoding result of the encoding object according to the target sequence, further obtaining compressed data, storing and decompressing the compressed data to obtain the control data of the magnetic switch, and realizing intelligent control of the magnetic switch. The invention has high compression efficiency and saves the storage space of control data.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a magnetic control switch control data processing method based on deep fusion.
Background
The magnetic switch is a line switch device controlled by magnetic field signals and is widely applied to various fields such as industrial environments, safety systems, intelligent home and power systems. The deep fusion refers to combining different types of data or information together through a deep learning or neural network method so as to obtain more comprehensive information or realize higher-level control, and the control accuracy of the magnetic control switch can be improved by carrying out the deep fusion on various control data of the magnetic control switch.
Depth fusion, in turn, typically requires a significant amount of data and model training to ensure its accuracy and reliability. The deep fusion involves the storage of a large amount of control data, and the control data of the magnetic switch is required to be compressed in order to save the storage space of the control data.
The control data relates to various types of data, and the conventional compression algorithm is difficult to uniformly compress the various types of data.
Disclosure of Invention
In order to solve the problems, the invention provides a magnetic control switch control data processing method based on depth fusion, which comprises the following steps:
collecting control data of the magnetic control switch, and converting the control data into data to be encoded;
setting a target number and two marks; constructing a target sequence, and updating the target sequence according to the data to be encoded;
obtaining bits to be matched in data to be encoded, and obtaining a matching object in the data to be encoded according to the bits to be matched; according to the exclusive or result and the exclusive or result of the bit to be matched and the matching object, one of the two identifiers is selected to update the target sequence, and the bit to be matched is updated according to the matching object;
the method comprises the steps of continuously updating bits to be matched to obtain a coding object, and obtaining a coding result of the coding object according to a target sequence; taking the coding results of all coding objects in the data to be coded as compressed data;
and storing and decompressing the compressed data to obtain control data of the magnetic control switch, and carrying out deep fusion on different types of data in the control data for intelligent control of the magnetic control switch.
Preferably, the setting the target number and the two kinds of marks includes the following specific steps:
taking any one of the numbers 0 and 1 as a target number; any one of the numbers 0 and 1 is used as a first identifier, and the other number is used as a second identifier.
Preferably, the obtaining the bit to be matched in the data to be encoded includes the following specific steps:
and taking the first bit of the data to be encoded as the bit to be matched.
Preferably, the obtaining the matching object in the data to be encoded according to the bit to be matched includes the following specific steps:
and acquiring binary data with the same bit length as the bit to be matched after the bit to be matched in the data to be coded, and taking the binary data as a matching object.
Preferably, the step of selecting one of the two identifiers to update the target sequence according to the exclusive or result and the exclusive or result of the bit to be matched and the matching object includes the following specific steps:
when each bit in the exclusive-or result is a target number, adding a first identifier to the end of the target sequence; and adding a second identifier to the end of the target sequence when each bit in the sum or result is the target number.
Preferably, the updating the bit to be matched according to the matching object includes the following specific steps:
and splicing the matching object to the bit to be matched to serve as a new bit to be matched.
Preferably, the method for obtaining the coding object by continuously updating the bit to be matched includes the following specific steps:
obtaining a matching object in the data to be coded according to the updated bits to be matched, and continuously updating the updated bits to be matched according to the matching object when each bit in the exclusive OR result of the updated bits to be matched and the matching object is a target digital code or each bit in the exclusive OR result is a target digital code; when the bit in the exclusive OR result of the updated bit to be matched and the matching object is not the target digital code, and when the bit in the exclusive OR result is also the target digital code, the updated object to be matched is taken as the coding object.
Preferably, the obtaining the encoding result of the encoding object according to the target sequence includes the following specific steps:
and taking all data in the target sequence as the coding result of the coding object.
Preferably, the constructing the target sequence updates the target sequence according to the data to be encoded, and includes the following specific steps:
constructing a null sequence as a target sequence, and adding the first bit of the data to be coded into the target sequence.
The technical scheme of the invention has the beneficial effects that: according to the invention, the control data of the magnetic control switch is converted into the data to be encoded, so that a plurality of different types of data in the control data can be uniformly compressed, and the compression complexity of the control data is reduced. Further, the invention screens the adjacent data segments with opposite or same relation by judging the exclusive or result between the front and rear adjacent data segments in the data to be encoded and the distribution of the target numbers in the exclusive or result, compresses the adjacent data segments with opposite or same relation by using the previous data segment in the adjacent data segments and the identification of the same or opposite relation, and compared with the prior compression algorithm such as Huffman coding, arithmetic coding and the like, which is difficult to realize further compression of binary form data to be encoded, the invention realizes the compression of binary form data to be encoded, has high compression efficiency and saves the storage space of magnetic control switch control data.
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 the steps of the method for processing the control data of the magnetic control switch based on the depth fusion.
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 is given below of the specific implementation, structure, characteristics and effects of the magnetic control switch control data processing method based on depth fusion according to the invention with reference to the attached 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 magnetic control switch control data processing method based on depth fusion provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart of a method for processing control data of a magnetic control switch based on depth fusion according to an embodiment of the invention is shown, and the method includes the following steps:
s001, collecting control data of the magnetic switch, and converting the control data into data to be encoded.
It should be noted that, the magnetic control switch detects the state of an object by using different sensors, and performs switch control according to the state of the object, for example, in the smart home field, the magnetic control switch detects the light of the environment by using the light sensor, detects the open-close state of the curtain by using the distance sensor, and automatically controls the open-close of the curtain and the smart light according to the light and the open-close state of the curtain. Therefore, the data collected by the different sensors are used for controlling the switch of the magnetic control switch, and in the embodiment of the invention, the data collected by the different sensors are used as the control data of the magnetic control switch.
Because the data types collected by different sensors are different, the control data of the magnetic control switch contains a plurality of data types, the existing compression algorithm is difficult to uniformly compress the data of different data types, and the control data is uniformly converted into binary data form to be used as the data to be encoded in order to realize the uniform compression of the data of different data types in the control data. It should be noted that, the conversion of different types of data into binary data may be performed by using coding modes such as base64 coding and international coding, and the like, which are not limited in particular, and an implementation person may select a specific conversion method according to the type of data.
So far, the data to be encoded is obtained.
And S002, compressing the data to be encoded.
The data to be encoded is binary data, and only includes two numbers of 0 and 1, so that further compression is difficult to achieve by using the conventional compression algorithm huffman coding, arithmetic coding and the like. In this embodiment, the adjacent bits in the data to be encoded are considered to have the same or opposite relationship, so that the adjacent data segments in the data to be encoded may also have the same or opposite relationship, so that the adjacent data segments having the same or opposite relationship are compressed by using the previous data segment in the adjacent data segments and the identifier of the same or opposite relationship, thereby improving the compression efficiency and reducing the storage space of the control data.
In this embodiment, any one of 0 and 1 is taken as a target number, and in this embodiment, 1 is taken as an example of the target number. Two kinds of marks are set, in this embodiment, 0 is used as a first mark, 1 is used as a second mark, and in other embodiments, an implementation person may use 1 as a first mark and 0 as a second mark.
The target digital code and two kinds of identification are combined to compress the data to be encoded, specifically:
1. a null sequence is constructed as the target sequence.
2. And adding a first bit of data to be encoded into the target sequence, and taking the first bit as a bit to be matched.
3. Binary data with the same bit length as the bit to be matched after the bit to be matched in the data to be coded is obtained and is used as a matching object, and an exclusive or result between the bit to be matched and the matching object are obtained.
And judging the exclusive or combination and the exclusive or result: when each bit in the exclusive-or result is the target digital code, adding a first mark to the end of the target sequence, and executing the step 4; when each bit in the same or result is the target number, adding a second mark to the end of the target sequence, and executing the step 4; when the bit in the exclusive or result is not the target digital code, and the bit in the exclusive or result is also not the target digital code, executing step 5.
4. And (3) after splicing the matching object with the bit to be matched, repeating the step (3) as a new bit to be matched until the bit in the exclusive OR result is not the target digital code, and stopping iteration when the bit in the exclusive OR result is not the target digital code.
5. And taking the current bit to be matched as an encoding object, and outputting all data in the target sequence as an encoding result of the encoding object.
6. And setting the target sequence as null, adding the first bit after the bit to be matched in the data to be coded into the target sequence, and taking the bit as a new bit to be matched.
7. And repeatedly executing the steps 3 to 6 until no bit exists after the latest bit to be matched in the data to be coded, stopping iteration, taking the current bit to be matched as a coding object, and outputting all data in the current target sequence as a coding result of the coding object.
8. And taking all the output coding results as final compression results.
For example, when the data to be encoded is 101001010110011010011001, the first bit is 1, the bit to be matched is 1, the target sequence is {1}, binary data with the same length as the bit to be matched after the bit to be matched 1 in the data to be encoded is 0, the exclusive-or result between 0 and 0 is 1, the exclusive-or result is 0, and all bits in the exclusive-or result are target digital 1, so that the first identifier 1 is added to the target sequence, and the target sequence is {11};
splicing the matching object 0 after the bit 1 to be matched to obtain a new bit 10 to be matched, wherein binary data with the same length as the bit to be matched after the new bit 10 to be matched in the data to be coded is 10, the matching object is 10, the exclusive OR result between 10 and 10 is 00, the exclusive OR result is 11, and all bits in the exclusive OR result are target digital 1, so that a second identification 0 is added to a target sequence, and the target sequence is {110};
similarly, splicing the matching object 10 after the bit 10 to be matched to obtain a new bit 1010 to be matched, wherein binary data with the same length as that of the bit to be matched after the new bit 1010 to be matched in the data to be coded is 0101, the matching object is 0101, the exclusive-or result between 1010 and 0101 is 1111, the exclusive-or result is 0000, and all bits in the exclusive-or result are target digital 1, so that the first identifier 1 is added to the target sequence, and the target sequence is {1101};
splicing the matching object 0101 after the bit 1010 to be matched to obtain a new bit 10100101 to be matched, wherein binary data with the same bit length as that of the bit to be matched after the new bit 10100101 to be matched in the data to be coded is 0100110, the exclusive or result between the matching object 01100110, 10100101 and the bit to be matched is 11000011, the exclusive or result is 00111100, the bit in the exclusive or result 11000011 is not the target digital 1, the bit in the exclusive or result 00111100 is also not the target digital 1, and at the moment, all data 1101 in the target sequence {1101} are taken as the coding result of 10100101. And (3) the target sequence is set to be empty, and bits 0110011010011001 after the bits 10100101 to be matched in the data to be coded are coded by using the same method, so that a coding result is 01101.
The final compression result of the data 101001010110011010011001 to be encoded is 1101 and 01101, so that the 24-bit data to be encoded is compressed into 9 bits, and the compression efficiency is greatly improved.
Thus, the compression of the data to be encoded is realized, and the compression result is obtained.
S003, storing the compression result.
And storing the compression result.
When the control data is required to be checked or a deep fusion model is required to be constructed according to the control data, firstly decompressing the compression result to obtain the control data of the magnetic control switch.
When decompression is performed, reading each coding result in the compressed data, and respectively decoding each coding result:
taking the first bit in the coding result as a data bit, taking the rest bits as identification bits respectively, and when the first identification bit is the first identification, representing that the exclusive or result of the data bit and the next data segment is all 1, namely the data bit is opposite to the next data segment; when the first identification bit is the second identification, the same or result of the data bit and the next data segment is 1, namely the data is the same in the next data segment, the next data segment is acquired, and the next data segment is spliced after the data bit to form a new data bit.
And acquiring a next data segment of the new data bit according to the new data bit and the next identification bit, splicing the next data segment to the new data bit, forming the new data bit again, and so on until all the identification bits have traversed and stopped iterating, wherein the finally obtained data bit is decompressed data of the coding result.
For example, the first bit 1 in the encoding result 1101 is a data bit, and the last three bits 1, 0, and 1 are each an identification bit. The first identification bit is 1, which indicates that the length of a data segment with 1 after the data bit 1 in the original data is 1, and the exclusive or result of the first identification bit and the 1 is 1, then the first identification bit is 0 after the data bit 1 in the original data, and the first identification bit is spliced after the data bit 1 to form a new data bit 10; the second is marked as 0, which indicates that the data segment with the length of 2 after the data bit 10 in the original data is the same as 10 or the result is 11, then the data bit 10 in the original data is the 10, and the 10 is spliced after the 10 to form a new data bit 1010; the third mark is 1, which indicates that the length of the data segment after the data bit 1010 in the original data is 4, and the exclusive or result of the data segment and 1010 is 1111, then the data bit 1010 in the original data is 0101, and the 0101 is spliced after the data bit 1010 to form a new data bit 10100101, and the data bit 10100101 is the decompressed data of the encoding result 1101. It should be noted that, the original data refers to the data to be encoded in step S002.
Splicing the decompressed data of each coding result together according to the sequence of the coding results to obtain data to be coded, and converting the data to be coded into control data.
Thus, decompression of the compression result is realized.
S004, carrying out deep fusion on control data of the magnetic control switch, and being used for intelligent control of the magnetic control switch.
It should be noted that the control data includes data collected by various sensors, which are different types of data. And carrying out deep fusion on different types of data in the control data, and improving the control accuracy of the magnetic control switch. The depth fusion is the prior art, and will not be described in detail herein.
Through the steps, the processing of the magnetic control switch control data is realized.
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 (6)
1. The magnetic control switch control data processing method based on depth fusion is characterized by comprising the following steps of:
collecting control data of the magnetic control switch, and converting the control data into data to be encoded;
setting a target number and two marks; constructing a target sequence, and updating the target sequence according to the data to be encoded;
obtaining bits to be matched in data to be encoded, and obtaining a matching object in the data to be encoded according to the bits to be matched; according to the exclusive or result and the exclusive or result of the bit to be matched and the matching object, one of the two identifiers is selected to update the target sequence, and the bit to be matched is updated according to the matching object;
the method comprises the steps of continuously updating bits to be matched to obtain a coding object, and obtaining a coding result of the coding object according to a target sequence; taking the coding results of all coding objects in the data to be coded as compressed data;
storing and decompressing the compressed data to obtain control data of the magnetic control switch, and performing deep fusion on different types of data in the control data for intelligent control of the magnetic control switch;
the selecting one of the two identifiers to update the target sequence according to the exclusive or result and the exclusive or result of the bit to be matched and the matching object comprises the following steps:
when each bit in the exclusive-or result is a target number, adding a first identifier to the end of the target sequence; when each bit in the same or result is the target digital code, adding a second identifier to the end of the target sequence;
the updating the bit to be matched according to the matching object comprises the following steps:
splicing the matching object to the bit to be matched to serve as a new bit to be matched;
the obtaining the coding object by continuously updating the bit to be matched comprises the following steps:
obtaining a matching object in the data to be coded according to the updated bits to be matched, and continuously updating the updated bits to be matched according to the matching object when each bit in the exclusive OR result of the updated bits to be matched and the matching object is a target digital code or each bit in the exclusive OR result is a target digital code; when the bit in the exclusive OR result of the updated bit to be matched and the matching object is not the target digital code, and when the bit in the exclusive OR result is also the target digital code, the updated object to be matched is taken as the coding object.
2. The method for processing the control data of the magnetic switch based on the depth fusion according to claim 1, wherein the setting of the target number and the two kinds of marks comprises the following specific steps:
taking any one of the numbers 0 and 1 as a target number; any one of the numbers 0 and 1 is used as a first identifier, and the other number is used as a second identifier.
3. The method for processing the control data of the magnetic switch based on the depth fusion according to claim 1, wherein the step of obtaining the bit to be matched in the data to be encoded comprises the following specific steps:
and taking the first bit of the data to be encoded as the bit to be matched.
4. The method for processing the control data of the magnetic switch based on the depth fusion according to claim 1, wherein the step of obtaining the matching object in the data to be encoded according to the bit to be matched comprises the following specific steps:
and acquiring binary data with the same bit length as the bit to be matched after the bit to be matched in the data to be coded, and taking the binary data as a matching object.
5. The method for processing the control data of the magnetic switch based on the depth fusion according to claim 1, wherein the step of obtaining the encoding result of the encoding object according to the target sequence comprises the following specific steps:
and taking all data in the target sequence as the coding result of the coding object.
6. The method for processing the control data of the magnetic switch based on the depth fusion according to claim 1, wherein the constructing the target sequence updates the target sequence according to the data to be encoded, comprises the following specific steps:
constructing a null sequence as a target sequence, and adding the first bit of the data to be coded into the target sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311385564.7A CN117118456B (en) | 2023-10-25 | 2023-10-25 | Magnetic control switch control data processing method based on depth fusion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311385564.7A CN117118456B (en) | 2023-10-25 | 2023-10-25 | Magnetic control switch control data processing method based on depth fusion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117118456A CN117118456A (en) | 2023-11-24 |
| CN117118456B true CN117118456B (en) | 2024-01-26 |
Family
ID=88807844
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311385564.7A Active CN117118456B (en) | 2023-10-25 | 2023-10-25 | Magnetic control switch control data processing method based on depth fusion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117118456B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB8814862D0 (en) * | 1987-08-11 | 1988-07-27 | Appel Computer Inc | Video compression algorithm |
| JPH0621827A (en) * | 1992-06-30 | 1994-01-28 | Nec Corp | Data compressor and its method |
| JPH07264584A (en) * | 1994-03-18 | 1995-10-13 | Ricoh Co Ltd | Encoding and decoding method and its device |
| US5945933A (en) * | 1998-01-27 | 1999-08-31 | Infit Ltd. | Adaptive packet compression apparatus and method |
| CN104038232A (en) * | 2014-05-09 | 2014-09-10 | 安庆师范学院 | Testing data compression and decompression method based on secondary exclusive-or operation |
| CN110995273A (en) * | 2019-10-21 | 2020-04-10 | 武汉神库小匠科技有限公司 | Data compression method, device, equipment and medium for power database |
| CN111865493A (en) * | 2020-06-19 | 2020-10-30 | 腾讯科技（深圳）有限公司 | Data processing method and related equipment |
| CN116137534A (en) * | 2023-01-16 | 2023-05-19 | 阿里巴巴（中国）有限公司 | Lossless compression method, electronic device, and storage medium |
| CN116303374A (en) * | 2023-05-22 | 2023-06-23 | 深圳市维度数据科技股份有限公司 | Multi-dimensional report data optimization compression method based on SQL database |
| CN116757158A (en) * | 2023-08-11 | 2023-09-15 | 深圳致赢科技有限公司 | Data management method based on semiconductor storage |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100223237A1 (en) * | 2007-11-05 | 2010-09-02 | University Of Florida Research Foundation, Inc. | Lossless data compression and real-time decompression |
| US8688621B2 (en) * | 2008-05-20 | 2014-04-01 | NetCee Systems, Inc. | Systems and methods for information compression |
-
2023
- 2023-10-25 CN CN202311385564.7A patent/CN117118456B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB8814862D0 (en) * | 1987-08-11 | 1988-07-27 | Appel Computer Inc | Video compression algorithm |
| JPH0621827A (en) * | 1992-06-30 | 1994-01-28 | Nec Corp | Data compressor and its method |
| JPH07264584A (en) * | 1994-03-18 | 1995-10-13 | Ricoh Co Ltd | Encoding and decoding method and its device |
| US5945933A (en) * | 1998-01-27 | 1999-08-31 | Infit Ltd. | Adaptive packet compression apparatus and method |
| CN104038232A (en) * | 2014-05-09 | 2014-09-10 | 安庆师范学院 | Testing data compression and decompression method based on secondary exclusive-or operation |
| CN110995273A (en) * | 2019-10-21 | 2020-04-10 | 武汉神库小匠科技有限公司 | Data compression method, device, equipment and medium for power database |
| CN111865493A (en) * | 2020-06-19 | 2020-10-30 | 腾讯科技（深圳）有限公司 | Data processing method and related equipment |
| CN116137534A (en) * | 2023-01-16 | 2023-05-19 | 阿里巴巴（中国）有限公司 | Lossless compression method, electronic device, and storage medium |
| CN116303374A (en) * | 2023-05-22 | 2023-06-23 | 深圳市维度数据科技股份有限公司 | Multi-dimensional report data optimization compression method based on SQL database |
| CN116757158A (en) * | 2023-08-11 | 2023-09-15 | 深圳致赢科技有限公司 | Data management method based on semiconductor storage |
Non-Patent Citations (2)
| Title |
|---|
| A Memory-Efficient Edge Inference Accelerator with XOR-based Model Compression;H. Lee等;《 2023 60th ACM/IEEE Design Automation Conference (DAC)》;1-6 * |
| 一种基于相邻位异或运算的测试数据压缩方法;程一飞 詹文法;《系统仿真学报. 》;2756-2761 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117118456A (en) | 2023-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101095284B (en) | Device and data method for selective compression and decompression and data format for compressed data | |
| CN109450596B (en) | Encoding method, decoding method, encoding device, decoding device, storage medium, and terminal | |
| CN106170921B (en) | It is related to the source code and decoding method and device of the data of sign compression | |
| CN100547615C (en) | Become the encoding scheme of the data stream of graphical model during expression | |
| US20140185668A1 (en) | Method for adaptive entropy coding of tree structures | |
| CN116681036B (en) | Industrial data storage method based on digital twinning | |
| CN105359418B (en) | Encoder, decoder and coding-decoding method | |
| CN116016606B (en) | Sewage treatment operation and maintenance data efficient management system based on intelligent cloud | |
| GB2523347A (en) | Encoder, decoder and method | |
| CN1675842B (en) | Method and apparatus arithmetic coding, and related decoding method | |
| CN116506073A (en) | Industrial computer platform data rapid transmission method and system | |
| CN103188494A (en) | Apparatus and method for encoding depth image by skipping discrete cosine transform (DCT), and apparatus and method for decoding depth image by skipping DCT | |
| CN116521093B (en) | Smart community face data storage method and system | |
| CN116910285B (en) | Intelligent traffic data optimized storage method based on Internet of things | |
| Žalik et al. | A universal chain code compression method | |
| CN104811209A (en) | Compressed file data embedding method and device capable of resisting longest matching detection | |
| CN117118456B (en) | Magnetic control switch control data processing method based on depth fusion | |
| US6055273A (en) | Data encoding and decoding method and device of a multiple-valued information source | |
| Reznik | An algorithm for quantization of discrete probability distributions | |
| CN113284203B (en) | Point cloud compression and decompression method based on octree coding and voxel context | |
| KR101023536B1 (en) | Lossless data compression method | |
| CN116109714A (en) | Data coding storage method and system based on neural network | |
| US20220005229A1 (en) | Point cloud attribute encoding method and device, and point cloud attribute decoding method and devcie | |
| CN115913248A (en) | Live broadcast software development data intelligent management system | |
| CN117156014B (en) | Engineering cost data optimal storage method and system |
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 |