CN116612437A - Large-block coal transportation data processing system based on recognition result - Google Patents

Large-block coal transportation data processing system based on recognition result Download PDF

Info

Publication number
CN116612437A
CN116612437A CN202310889291.3A CN202310889291A CN116612437A CN 116612437 A CN116612437 A CN 116612437A CN 202310889291 A CN202310889291 A CN 202310889291A CN 116612437 A CN116612437 A CN 116612437A
Authority
CN
China
Prior art keywords
indicator
chain code
sequence
segments
optimal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202310889291.3A
Other languages
Chinese (zh)
Other versions
CN116612437B (en
Inventor
盛文燕
张永福
赵本峰
程训龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huayang Communication Technology Co ltd
Original Assignee
Huayang Communication Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huayang Communication Technology Co ltd filed Critical Huayang Communication Technology Co ltd
Priority to CN202310889291.3A priority Critical patent/CN116612437B/en
Publication of CN116612437A publication Critical patent/CN116612437A/en
Application granted granted Critical
Publication of CN116612437B publication Critical patent/CN116612437B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V20/00—Scenes; Scene-specific elements
    • G06V20/50—Context or environment of the image
    • G06V20/52—Surveillance or monitoring of activities, e.g. for recognising suspicious objects
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Databases & Information Systems (AREA)
  • Complex Calculations (AREA)

Abstract

The invention relates to the field of data transmission, in particular to a large-block coal transportation data processing system based on an identification result, which comprises a data acquisition module, a statistical characteristic acquisition module, a ciphertext data acquisition module and a data transmission module, wherein: acquiring an identification result sequence of a monitoring video in the coal transportation process; acquiring a binary two-dimensional matrix of an identification result sequence, acquiring a plurality of connected domains of the binary two-dimensional matrix, acquiring a chain code set of each wharf according to each connected domain, calculating the regularity of the chain code set, further acquiring an optimal chain code set, acquiring a first optimal indicator segment set according to the optimal chain code set, acquiring an optimal indicator segment to be replaced of each chain code and an alternative indicator set of the indicator segment to be replaced according to the first optimal indicator segment set, and acquiring ciphertext data according to the indicator segment to be replaced and the alternative indicator set; and transmitting the ciphertext data. The invention can better ensure the data security of the monitoring video data.

Description

Large-block coal transportation data processing system based on recognition result
Technical Field
The invention relates to the field of data transmission, in particular to a large-block coal transportation data processing system based on an identification result.
Background
Along with the development of society, people's attention to safety production increases with this, in coal mining area production, the coal of exploitation need utilize the belt feeder to transport out, and the circumstances such as the belt tears, belt off tracking, belt foreign matter probably exist in the big charcoal of belt feeder transportation process, therefore the transportation incident very easily takes place, in order to avoid the emergence of this kind of accident, realizes carrying out remote video monitoring to the transportation process of transport vechicle through the cloud platform of setting up generally, is used for real-time monitoring fortune coal volume on the one hand, monitors whether the belt has the circumstances of abnormality on the one hand.
When the large-block coal is transported in remote monitoring, data such as the coal transportation quantity identified by the monitoring video, abnormal conditions of the belt and the like are required to be transmitted to the cloud platform in real time, and then the data are stored in the cloud platform so as to be convenient for looking over and monitoring. However, since the coal quantity data and the abnormal belt data are sensitive data in the coal mining process and are also operation data of coal mining enterprises, the data are required to be encrypted during transmission so as not to be leaked and stolen.
The traditional encryption processing method generally adopts unified encryption measures for all information, but the distribution rule of each data is different, and some data has obvious distribution rules, so that the distribution rule is easily used as a break of decryption, and therefore, the distribution rule of the data needs to be analyzed, and different encryption is carried out on the data according to the distribution rule of the data.
Disclosure of Invention
The invention provides a large-block coal transportation data processing system based on an identification result so as to solve the existing problems.
The invention discloses a large-block coal transportation data processing system based on an identification result, which adopts the following technical scheme:
one embodiment of the invention provides a large-block coal transportation data processing system based on an identification result, which comprises the following modules:
and a data acquisition module: acquiring an identification result sequence and a comprehensive key sequence of a monitoring video in the coal transportation process;
the statistical characteristic acquisition module is used for: obtaining a binary two-dimensional matrix according to the identification result sequence of the monitoring video; obtaining a binary two-dimensional matrix to obtain a plurality of connected domains, carrying out chain code splitting on each connected domain by taking each pixel as a wharf to obtain a chain code set of each wharf, wherein the chain code set of each wharf is composed of chain codes, obtaining a sequence of the direction symbols of each chain code, obtaining element regularity of each wharf according to the statistics rule of each direction symbol in the sequence of the direction symbols, obtaining a sequence of direction symbol variation of each sequence of the direction symbols according to the sequence of the direction symbols of each chain code, obtaining structural form regularity of each wharf according to the sequence of the direction symbol variation of each sequence of the direction symbols, taking the accumulated sum of the element regularity and the structural form regularity of each wharf as the regularity of each wharf, selecting a chain code set corresponding to the wharf with the largest regularity as an optimal chain code set of each connected domain, wherein the optimal chain code set is composed of optimal chain codes, and obtaining the statistics characteristics of each first optimal direction symbol section according to the optimal chain code set of each connected domain and the sequence of the direction symbol variation of each direction symbol;
Ciphertext data acquisition module: obtaining optimal chain code segments to be replaced of all the optimal chain codes according to the optimal chain code sets of all the connected domains and the statistical characteristics of the first optimal symbol segments, determining candidate symbol segments to be replaced of all the optimal chain code segments, obtaining key sequences of all the chain codes according to the comprehensive key sequences and the candidate symbol segments to be replaced of the optimal symbol segments, and encrypting the optimal chain codes according to the key sequences of all the chain codes and the candidate symbol segments to be replaced of the optimal symbol segments to obtain ciphertext data;
and a data transmission module: and transmitting the ciphertext data to a coal transportation safety management center.
Preferably, the element regularity of each wharf is obtained according to the statistical rule of each indicator in the indicator sequence, and the specific steps include:
marking a set formed by the indicator sequences of all the chain codes in the chain code set of each wharf as a indicator sequence set of each wharf, wherein each indicator sequence is formed by a plurality of indicator elements, and the set formed by the indicator elements in all the indicator sequences in the indicator sequence set of each wharf is called a indicator set of each wharf; counting the number of the directors in the director set of each wharf to obtain a director histogram of each wharf, taking the information entropy of the director histogram of each wharf as the director information entropy of each wharf, and taking the reciprocal of the director information entropy of each wharf as the element regularity of each wharf.
Preferably, the obtaining the sequence of the change amount of the direction symbol of each direction symbol sequence according to the direction symbol sequence of each chain code comprises the following specific steps:
comparing the direction indicator of each position in each direction indicator sequence with the direction indicator of the previous position, when the direction indicator of each position is larger than the direction indicator of the previous position, taking the difference value of the direction indicator of each position and the direction indicator of the previous position as the direction indicator change quantity of each position, and when the direction indicator of each position is smaller than the direction indicator of the previous position, taking the difference value of the direction indicator of each position and the direction indicator of the first position after adding 8 as the direction indicator change quantity of each position; the sequence of the change amounts of the direction symbols at all the positions is referred to as the change amount sequence of the direction symbols of each chain code.
Preferably, the structural morphology regularity of each wharf is obtained according to the sequence of the change amount of the direction symbol of each direction symbol sequence, which comprises the following specific steps:
randomly combining any two chain codes in the chain code set of each wharf to obtain a plurality of chain code pairs of the chain code set of each wharf, calculating the DTW distance of the indicator variable sequences corresponding to the two chain codes in the chain code pair by using a DTW algorithm to serve as the distance of each chain code pair, taking the reciprocal of the distance of each chain code pair as the structural form similarity of the chain code pair, and taking the average value of the structural form similarity of the plurality of chain code pairs in the chain code set of each wharf as the structural form regularity of each wharf.
Preferably, the statistical feature of each first best indicator segment is obtained according to the best chain code set of each connected domain and the indicator variation sequence of each indicator sequence, and the method comprises the following specific steps:
traversing each element of the indicator sequence of each optimal chain code by utilizing a sliding window to obtain a plurality of indicator segments, wherein a set formed by the indicator segments obtained by all the optimal chain codes in the optimal chain code set is called an indicator segment set;
counting the number of times each of the indicator segments appears in the set of indicator segments;
obtaining a change amount segment of each type of the indicator segments, respectively calculating the DTW distance between the change amount of the indicator of each type of the indicator segments and the change amount segments of other types of the indicator segments by using a DTW algorithm, taking the reciprocal of the DTW distance between the change amount of the indicator of each type of the indicator segments and the change amount segments of the indicator of other types of the indicator segments as the similarity between each type of the indicator segments and the other types of the indicator segments, taking the similarity between each type of the indicator segments and the other types of the indicator segments as a weight, carrying out weighted summation on the occurrence times of each type of the indicator segments to obtain the comprehensive similarity of each type of the indicator segments, and solving the comprehensive similarity of all types of the indicator segments with the same length to obtain the comprehensive similarity under each length; acquiring the length with the maximum comprehensive similarity as the optimal length of the direction symbol;
And acquiring all first best-indicator segment sets of the indicator Duan Dedao equal to the length of the best indicator in the first best-indicator segment sets, and taking the comprehensive similarity of all the first best-indicator segments in the first best-indicator segment sets as the statistical characteristics of the first best-indicator segments.
Preferably, the obtaining the best-chain code to be replaced of each best-chain code according to the best-chain code set of each connected domain and the statistical characteristics of the first best-chain code segment includes the following specific steps:
uniformly dividing each of the sequences of the directors into a plurality of second best-fit segments with the length being the best-fit length; the statistical characteristics of the first best indicator segments in the category of the second best indicator Duan Tong are used as the statistical characteristics of the second best indicator segments, and the second best indicator segments with the statistical characteristic values larger than a preset statistical characteristic threshold value in each indicator sequence are used as the best indicator segments to be replaced of each indicator sequence.
Preferably, the determining the candidate indicator segments to be replaced with the optimal indicator segment includes the following specific steps:
obtaining a first best indicator segment of a different type from each best indicator segment to be replaced as each reference indicator segment to be replaced, adding the accumulated sum of the similarity of each best indicator segment to be replaced and the reference indicator segment to the statistical characteristics of the reference indicator segment of each best indicator segment to be replaced as the preferred value of the reference indicator segment of each best indicator segment to be replaced; and taking the set formed by Q reference indicator segments with the maximum preference value as an alternative indicator segment set of each best indicator segment to be replaced.
Preferably, the key sequence of each chain code is obtained according to the comprehensive key sequence and the candidate indicator segment needing to replace the optimal indicator segment, and the specific steps include:
arranging all connected domains in descending order according to the regularity of the optimal chain code set corresponding to each connected domain to obtain a connected domain sequence, obtaining the number of the optimal symbol segments to be replaced of each optimal chain code in each connected domain, and taking the cumulative sum of the numbers of the optimal symbol segments to be replaced of all the optimal chain codes in each connected domain as the key number of each connected domainThe method comprises the steps of carrying out a first treatment on the surface of the Intercepting a sequence with the length of S1 from the comprehensive key sequence according to the position sequence of each connected domain in the connected domain sequence as the key sequence of each connected domain;
the method comprises the steps of obtaining the number of the best chain codes to be replaced, wherein the number of the best indicator segments is used as the key number S2 of each best chain code, arranging the best chain codes of each connected domain in a descending order according to the length of the chain codes to obtain the best chain code sequence of each connected domain, and sequentially intercepting S2 data sequences in the key sequence of the connected domain where each best chain code is located according to the position order of each best chain code in the best chain code sequence to serve as the key sequence of each best chain code.
Preferably, the encrypting the best chain code according to the key sequence of each chain code and the alternative indicator segment needing to replace the best indicator segment to obtain ciphertext data includes the following specific steps:
Sequencing the best-to-be-replaced best-indicator segments of each best chain code by the distance from each best-to-be-replaced indicator segment to the wharf to obtain a best-to-be-replaced indicator segment sequence of each best chain code;
the method comprises the steps of arranging all candidate indicator segments in a candidate indicator segment set of all the best indicator segments to be replaced in a descending order according to a preferred value to obtain candidate indicator segment sequences of all the best indicator segments to be replaced;
obtaining the position order of each best-candidate-for-replacement-indicator segment in the best-candidate-indicator segment sequenceAcquiring a key value at a W position from a key sequence of each optimal chain code, adding 1 to the key value and Q to obtain a position mark value B, and acquiring a +.>The method comprises the steps that the indicator segments at the positions are used as replacement segments of each best indicator segment to be replaced, each best indicator segment to be replaced in each best chain code is replaced by the replacement segment to obtain a first encrypted chain code of each best chain code, and replacement processing is carried out on all best indicator segments to be replaced of each best chain code to obtain encrypted chain codes of each best chain code;
constructing an uninitialized two-dimensional matrix, and filling data into the two-dimensional matrix by using the encryption chain codes of all the optimal chain codes to obtain an encryption binary two-dimensional matrix;
And obtaining ciphertext data according to the encrypted binary two-dimensional matrix.
The beneficial effects of the invention are as follows: the identification result sequence of the monitoring video in the coal transportation process is preprocessed to obtain a binary two-dimensional matrix, a plurality of connected domains of the binary two-dimensional matrix are obtained, chain code splitting is carried out on each connected domain to obtain a chain code set of each wharf, and the chain code set of each wharf is analyzed to obtain the regularity of each wharf because the regularity of the chain code sets of each wharf is different, wherein the chain code set corresponding to the wharf with the largest regularity can describe the regularity characteristics of the connected domain, the optimal chain code set is determined according to the regularity of each wharf, and the segments of each optimal chain code are analyzed to obtain the statistics characteristics of a second optimal indicator segment because the statistics characteristics of the segments of each optimal chain code are different. In order to remove the statistical characteristics in each optimal chain code, encryption processing is required to be performed on each optimal chain code, the rule is easy to be recognized because the same encryption processing is performed on each element in the optimal chain code, so that the segments with strong statistical characteristics in the optimal chain code are required to be selected for processing, the segments needing replacing of each optimal chain code are determined according to the statistical characteristics of the second optimal indicator in each optimal chain code, the rule that the same segments needing replacing are easy to leak is required to be replaced by one type of the segments needing replacing, a plurality of alternative segments of each segment needing replacing are required to be determined for each segment needing replacing of the optimal indicator, the alternative segments of each segment needing replacing are used for replacing the segments of the optimal direction according to the key values in the key sequence, ciphertext data are obtained through replacement processing, the identification result sequence of the coal transportation monitoring video can be better protected, and the easy-to-leak characteristics in the monitoring video data are avoided as much as possible.
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 block diagram of a system for processing data of bulk coal transportation based on recognition results according to the present invention;
FIG. 2 is a schematic diagram of a system for processing data of transporting large-sized coal based on recognition results according to the present invention;
FIG. 3 is a schematic chain code diagram of the system for processing the large-block coal transportation data based on the identification result.
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 large-block coal transportation data processing system based on the identification result 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 large-block coal transportation data processing system based on the identification result provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a block diagram of a system for processing large-block coal transportation data based on recognition results according to an embodiment of the present invention is shown, where the system includes the following modules:
data acquisition module S001: and acquiring an identification result sequence and a comprehensive key sequence of the monitoring video in the coal transportation process.
When large-block coal is remotely monitored and transported, data such as the coal transportation quantity identified by a monitoring video, abnormal belt conditions and the like are required to be transmitted to a cloud platform in real time, and as the coal transportation quantity data and the abnormal belt data of a belt conveyor are sensitive data in the coal exploitation process and are also operation data of a coal exploitation enterprise, the data are required to be encrypted during transmission so as not to be leaked and stolen;
therefore, firstly, the recognition result of the monitoring video during the transportation of the massive coal is required to be obtained, namely, the monitoring video during the coal transportation is obtained by utilizing image acquisition equipment such as a mining intrinsic safety type image processing camera disclosed by CN218006351U, and the recognition result sequence of the monitoring video is obtained by carrying out recognition processing on the monitoring video by utilizing a traditional yoloV4 recognition network;
The specific method for identifying and processing the monitoring video in the embodiment is as follows: and inputting the monitoring video into a convolutional neural network, and outputting belt running types and coal conveying quantity by using the convolutional neural network, wherein the belt running types comprise four types of belt tearing, belt deviation, belt foreign matters and normal belt running. The convolutional neural network adopts a RESNET network structure, and the training data set acquisition method comprises the following steps: collecting a large number of monitoring videos during large-block coal transportation, and then manually marking four categories of belt tearing, belt deviation, belt foreign matters and normal belt running and coal transportation quantity in each frame of video image, wherein the monitoring videos and corresponding labels form a data set to complete the training of a convolutional neural network; in this embodiment, the recognition result sequence of the monitoring video is a time sequence formed by the belt running category and the coal conveying amount corresponding to each frame of video image in the monitoring video output by the convolutional neural network.
Then, ASCII conversion is carried out on each character in the recognition result sequence to obtain 8-bit binary data corresponding to each character, and the total number of the characters in the recognition result data is obtainedThus, all characters in the recognition result sequence occupy +. >Binary data, will->Set as the number of rows and columns of the matrix, thereby obtaining a +.>According to the position sequence of each character in the recognition result sequence, sequentially filling binary data of each character into the two-dimensional matrix in a scanning mode to obtain a binary two-dimensional matrix.
It should be noted that due toThe number of data in the two-dimensional matrix may be larger than the number of binary data occupied by all characters in the recognition result sequence, the binary data occupied by all characters in the recognition result sequence cannot initialize all data of the two-dimensional matrix, and the two-dimensional matrix existsBlank data exists at the end of the two-dimensional matrix, and the blank data of the two-dimensional matrix is filled with 0 and is filled with +.>Representing an upward rounding.
And then, a chaotic sequence is generated by using a chaotic mapping function, and the generated chaotic sequence is used as a key sequence, and the parameters of the chaotic mapping function are agreed between a data transmitting end and a coal transportation safety management center for receiving data, so that the key sequence is not required to be transmitted.
Statistical feature acquisition module S002: obtaining a binary two-dimensional matrix according to the identification result sequence of the monitoring video in the coal transportation process; obtaining a binary two-dimensional matrix to obtain a plurality of connected domains, carrying out chain code splitting on each connected domain by taking each pixel as a wharf to obtain a chain code set of each wharf, wherein the chain code set of each wharf is composed of chain codes, obtaining a sequence of the directors of each chain code, obtaining element regularity of each wharf according to the statistics rule of each direction symbol in the sequence of the directors, obtaining a sequence of the change of the direction symbol of each sequence of the directors according to the sequence of the direction symbol of each chain code, obtaining the structural form regularity of each wharf according to the sequence of the change of the direction symbol of each sequence of the direction symbol, taking the accumulated sum of the element regularity and the structural form regularity of each wharf as the regularity of each wharf, selecting the chain code set corresponding to the wharf with the largest regularity as the optimal chain code set of each connected domain, wherein the optimal chain code set is composed of optimal chain codes, and obtaining the statistics characteristics of each first optimal direction symbol segment according to the optimal chain code set of each connected domain and the sequence of the change of the direction symbol.
When the chain codes are split, the selected wharf is different, the split chain code sets are different, and some chain code sets have stronger regularity, which can reflect the data rule of the binary two-dimensional matrix, and if the rule of the strong regular chain codes can be damaged strongly through encryption, the data rule of the two-dimensional matrix can be damaged strongly. Therefore, the chain code set obtained by each wharf needs to be subjected to regularity evaluation, and the chain code set with stronger regularity is obtained as the optimal chain code set. The specific process is as follows:
1. firstly, carrying out connected domain analysis on data with a value of 1 in a binary two-dimensional matrix by using a Seed-rolling algorithm to obtain a plurality of connected domains;
2. and (3) splitting the chain codes of each connected domain to obtain a chain code set of each wharf, wherein the specific process is as follows:
(1) Chain code direction symbol introduction:
as shown in fig. 2, the horizontal right direction is the reference direction, the direction corresponding to the direction with 0 degree included angle to the reference direction is 0, the direction corresponding to the direction with 45 degrees included angle to the reference direction is 1, the direction corresponding to the direction with 90 degrees included angle to the reference direction is 2, the direction corresponding to the direction with 135 degrees included angle to the reference direction is 3, the direction corresponding to the direction with 180 degrees included angle to the reference direction is 4, the direction corresponding to the direction with 225 degrees included angle to the reference direction is 5, the direction corresponding to the direction with 270 degrees included angle to the reference direction is 6, and the direction corresponding to the direction with 315 degrees included angle to the reference direction is 7.
(2) Setting splitting direction priority:
setting splitting direction priority: the direction of the direction symbol 0 is the first split priority, the first priority is the highest split priority, the direction of the direction symbol 1 is the second split priority, the direction of the direction symbol 2 is the third split priority, the direction of the direction symbol 3 is the fourth split priority, the direction of the direction symbol 4 is the fifth split priority, the direction of the direction symbol 5 is the sixth split priority, the direction of the direction symbol 6 is the seventh split priority, and the direction of the direction symbol 7 is the eighth split priority.
(3) And (3) splitting the chain codes of each connected domain:
taking the ith pixel in the connected domain as a wharfStarting from the wharf, carrying out chain code splitting on the connected domain according to the chain code splitting priority, and splitting a chain code sequence in the process of splitting the chain codeThe pixel points are removed from the current connected domain, the wharf is kept unchanged, when only 1 connected domain pixel point in the wharf octant is left, chain code splitting is continued, after chain code removing is completed, the connected domain pixel point does not exist in the wharf octant, and the wharf is removed from the connected domain; the chain code splitting in the connected domain is completed in the mode, and the wharf +. >The set of multiple chain codes of (2) is denoted as jetty->Is a set of chain codes. And similarly, taking each pixel in the connected domain as a wharf, and splitting the chain codes of the connected domain to obtain a chain code set of each wharf.
3. Performing rule evaluation on the chain code set of each wharf to obtain an optimal chain code set:
the regularity of each chain code in the chain code set of each wharf is mainly reflected by the regularity of the elements contained in the chain code and the structural morphology rule corresponding to each chain code, so that the regularity of the chain code set of each wharf is calculated based on the two aspects.
The chain code is mainly composed of a wharf and a sequence of direction symbols, and the wharf of the chain code is randomly determined, so that the regularity of the chain code is mainly reflected in the regularity of the sequence of direction symbols.
(1) Calculating element regularity of each wharf:
the method comprises the steps of obtaining a sequence of the direction indicator of each chain code, marking a set formed by the sequence of the direction indicator of all the chain codes in a set of the chain codes of each wharf as a sequence set of the direction indicator of each wharf, wherein a plurality of direction indicator elements exist in each sequence of the direction indicator, and the set formed by the direction indicator elements in all the sequence of the direction indicator of each wharf is called a sequence set of the direction indicator of each wharf. Counting the number of the directors in the director set of each wharf to obtain a director histogram of each wharf, taking the information entropy of the director histogram of each wharf as the director information entropy of each wharf, and taking the reciprocal of the director information entropy of each wharf as the element regularity of each wharf.
(2) Calculating the structural morphology regularity of each wharf:
acquiring the j+1st position and the j-th position in the sequence of the symbols of each chain code，/>Comparing the j+1th position of the direction symbol with the j th position of the direction symbol, when the j+1th position of the direction symbol is larger than the j th position of the direction symbol, taking the difference value between the j+1th position of the direction symbol and the j th position of the direction symbol as the change amount of the j th position of the direction symbol, when the j+1th position of the direction symbol is smaller than the j th position of the direction symbol, taking the difference value between the j+1th position of the direction symbol and the j th position of the direction symbol after adding 8 as the j th position of the direction symbol, j taking->Wherein->The length of the sequence of the indicator of each chain code is expressed, and the amount of change in the indicator at each position of each chain code is obtained in this way. The sequence of the change amounts of the direction symbols at all positions of each chain code is marked as the change amount sequence of the direction symbols of each chain code, and the change amount sequence of the direction symbols of each chain code can reflect the structural morphological characteristics of each chain code. Such as chain code 1 and chain code 2 shown in fig. 3, wherein the sequence of the direction symbol of chain code 1 is [7,7,5,4,6 ]]The sequence of the chain code 2 is [1,1,7,6,0 ]]Wherein the sequence of the change amount of the direction symbol of the chain code 1 is [0,6,7,2 ] ]The sequence of the change amount of the direction symbol of the chain code 2 is [0,6,7,2 ]]The two chain codes are chain codes with the same structural form, so that the sequence of the change amount of the direction symbol of the two chain codes is the same.
The method comprises the steps of randomly combining any two chain codes in a chain code set of each wharf to obtain a plurality of chain code pairs of the chain code set of each wharf, calculating the DTW distance of a sequence of the change amount of the direction symbols corresponding to the two chain codes in the chain code pairs by using a DTW algorithm to serve as the distance of each chain code pair, taking the reciprocal of the distance of each chain code pair as the structural form similarity of the chain code pair, taking the average value of the structural form similarity of the plurality of chain code pairs in the chain code set of each wharf as the structural form regularity of each wharf, wherein the larger the value is, the higher the structural form similarity of the chain codes in the chain code set of each wharf is, so that the structural form regularity of the chain code set of the wharf is stronger.
(3) Calculating the regularity of the chain code set of each wharf:
taking the sum of the element regularity and the structural form regularity of the chain code set of each wharf as the regularity of the chain code set of each wharf, wherein the value can reflect the regularity characteristic of the chain code set of each wharf, the larger the value is, the stronger the regularity of the chain code set of the wharf is indicated, the stronger the rule description capability of the chain code set of the wharf on the connected domain corresponding to the chain code set of the wharf is, and if the rule of each chain code in the chain code set of the wharf can be damaged more strongly, the stronger the connected domain corresponding to the chain code set is damaged.
(4) Acquiring an optimal chain code set of each connected domain:
and taking the chain code set corresponding to the wharf with the greatest regularity as the optimal chain code set of each connected domain.
4. Obtaining the optimal length of the direction symbol:
because the overall structure form similarity among the chain codes is poor, the part of the structure form similarity is good, and the part of the fragments with good similarity can be easily found through the statistical rule, the fragments with different lengths of the chain codes are required to be analyzed, the statistical rule of each length fragment is judged, and the optimal indicator length is obtained according to the statistical rule of the fragments with different lengths.
Acquiring the lengths of the indicator sequences corresponding to all the chain codes in the optimal chain code set, averaging the lengths of the indicator sequences corresponding to all the chain codes in the optimal chain code set to obtain the limiting lengths of all the connected domains, averaging the limiting lengths of all the connected domains to obtain the optimal limiting length, and marking as。
Each chain code in the set of best chain codes is referred to as a best chain code for convenience of description. By means of a sliding window of 1 XLTraversing each element of the indicator sequence of each optimal chain code to obtain a plurality of indicator segments, wherein a set formed by the indicator segments obtained by all the optimal chain codes in the optimal chain code set is called an indicator segment set, Get at->All integer values in between.
Counting the number of times of occurrence of the ith type of the indicator segment in the indicator segment set by taking the same indicator segment in the indicator segment set as one type of indicator segmentThe statistical rule features of the ith indicator segment are reflected by the number of occurrences.
Since each of the segments has a different similarity to the other segments, the similarity of each of the segments to the other segments also reflects the similarity of each of the segments.
According to the method for obtaining the sequence of the change amount of the indicator of each indicator sequence in the steps, the change amount of the indicator of the ith indicator segment is obtained, the DTW (digital television) algorithm is utilized to respectively calculate the DTW distance between the change amount of the indicator of the ith indicator segment and the change amount of the indicator of other various indicator segments, the reciprocal of the DTW distance between the change amount of the indicator of the ith indicator segment and the change amount of the indicator of other various indicator segments is taken as the similarity between the change amount of the indicator of the ith indicator segment and the change amount of the indicator of other various indicator segments, the similarity between the change amount of the indicator of the ith indicator segment and the change amount of the indicator of various indicator segments is taken as a weight, the occurrence times of each indicator segment is weighted and summed to obtain the comprehensive similarity of the indicator of the ith indicator segment, the comprehensive similarity of each indicator segment is obtained by the same reason, the average value of all types of indicator segments with the same length is calculated to obtain the comprehensive similarity of the indicator of each length, the indicator segment with the value larger than the indicator length has the characteristic of the indicator segment with the length being more than the regular length, and the indicator segment with the length is more than the regular length is required to be removed; the length with the greatest comprehensive similarity is taken as the optimal length of the indicator.
5. Obtaining a first best set of segments from the best lengths:
a first best-indicator segment set of all the indicators Duan Dedao equal to the best-indicator length is obtained from the indicator segment set, and each element in the first best-indicator set is called a first best-indicator segment.
6. Determining statistical features of the first best indicator segment:
the integrated similarity of the first best indicator segments is used as the statistical characteristics of the first best indicator segments, and the statistical characteristics of all the first best indicator segments in the first best indicator segment set are utilizedThe normalization method performs normalization processing to obtain statistical characteristics of the normalized first optimal indicator segment; for ease of description, the normalized statistics of the first best-indicator segment are subsequently referred to as statistics of the first best-indicator segment.
So far, the statistical characteristics of each first optimal indicator segment are obtained, when the statistical characteristics of the first optimal indicator segments are determined, different chain code sets are obtained by considering different obtaining wharfs, and the regularity of each chain code set is different, wherein the chain code set with larger regularity can better describe the characteristics of the connected domain corresponding to each chain code set, and the optimal chain code set of each connected domain is obtained based on the characteristics. Meanwhile, considering that the similarity of fragments exists among the chain codes, the similarity of the fragments can reflect the regularity of the chain codes, the optimal length of the indicator is obtained by analyzing the similarity among the fragments with different lengths of the chain codes, the first optimal indicator segment set is obtained according to the optimal length of the indicator, the statistical regularity of each first optimal indicator segment in the first optimal indicator segment set is stronger, and the regularity of each chain code can be better removed only by regularly destroying each first optimal indicator segment in the first optimal indicator segment set in the chain code set, so that safer encryption of data is realized.
Ciphertext data acquisition module S003: obtaining the best-to-be-replaced best-indicator segments of each best-indicator according to the best-indicator set and the statistical characteristics of the first best-indicator segments of each connected domain, determining alternative-to-be-replaced best-indicator segments of each best-indicator segment, obtaining key sequences of each link-indicator according to the comprehensive key sequences and the alternative-to-be-replaced best-indicator segments, and encrypting the best link-indicator according to the key sequences of each link-indicator and the alternative-to-be-replaced best-indicator segments to obtain ciphertext data.
When encrypting the chain code, if each element in the chain code is encrypted, the encryption rule is easy to be recognized, so that part of elements in the chain code sequence are required to be selected for encryption, the rule of the chain code is better masked, the part with stronger regularity in the chain code is required to be encrypted, and the rule with weaker regularity is not required to be encrypted.
1. Obtaining the best indicator segment to be replaced:
each of the sequences of the characters is uniformly divided into a plurality of second best character segments of optimal character length. The statistics of each first best-descriptor segment are known, and the second best-descriptor Duan Zhishi is a part of the elements in the first best-descriptor segment set, so that the statistics of each descriptor sequence are greater than the preset statistics threshold value according to the statistics of the first best-descriptor segment of the second best-descriptor Duan Tong class as the statistics of the second best-descriptor segment The second best-hand-piece of the sequence of hand-pieces is used as the best-hand-piece to be replaced of each sequence of hand-pieces, the best-hand-piece to be replaced is generally a segment with obvious statistical characteristics in the sequence of hand-pieces, if the statistical characteristics cannot be broken well, the statistical characteristics can be easily used as a break of decryption, and in the embodiment, the threshold value of the statistical characteristics is preset>Taking 0.4, the practitioner may in other embodiments be based on actual settings.
2. Determining an alternative set of the segments to replace the best segment:
in order to prevent the fragments with obvious statistical characteristics in the chain code from being identified, the fragments with obvious statistical characteristics need to be replaced by other types of fragments, but when the replacement processing is performed, the fragments with obvious statistical characteristics cannot be replaced by only one type of fragments, because if the fragments with one type are replaced, the replacement operation is easily found, and therefore, one of the fragment sets with obvious statistical characteristics needs to be randomly selected for the replacement processing, and therefore, the best-needed indicator Duan Queding alternative-used indicator fragment set needs to be replaced for each.
The best-candidate-segment sets of the best-candidate-segment to be replaced are generally the best-candidate-segment sets having larger differences from the best-candidate-segment to be replaced, and the statistical feature values of the best-candidate-segment sets are smaller, so that the best-candidate-segment sets to be replaced are determined based on the smaller statistical feature values of the best-candidate-segment sets, specifically as follows:
Obtaining a first optimal-direction-symbol section of a different type from an ith optimal-direction-symbol section to be replaced as an ith optimal-direction-symbol section to be replaced, adding a summation obtained by adding the statistical characteristics of the reference-direction-symbol section of the ith optimal-direction-symbol section to the similarity of the ith optimal-direction-symbol section to the reference-direction-symbol section to be replaced as a preferred value of the reference-direction-symbol section of the ith optimal-direction-symbol section to be replaced, and utilizing the preferred value of the reference-direction-symbol section of the ith optimal-direction-symbol section to be replaced as a preferred value of the reference-direction-symbol section of the ith optimal-direction-symbol section to be replacedThe normalization method performs normalization processing to obtain a preferred value of the reference indicator segment of the normalized i-th optimal indicator segment to be replaced, and for convenience of description, the preferred value of the reference indicator segment of the normalized i-th optimal indicator segment to be replaced is referred to as a preferred value of the reference indicator segment of the i-th optimal indicator segment to be replaced.
The set formed by the Q reference symbol segments with the largest preference value is taken as the candidate symbol segment set of the i-th best symbol segment to be replaced, each element in the candidate symbol set of the i-th best symbol segment to be replaced is called as the candidate symbol segment of the i-th best symbol segment to be replaced, in this embodiment, Q is taken as 5, and in other embodiments, the implementation can be set according to the actual situation.
3. And encrypting each optimal chain code according to the optimal indicator segment to be replaced and the alternative indicator set of the optimal indicator segment to be replaced to obtain ciphertext data.
(1) Determining the key sequence of each optimal chain code:
and (3) arranging all the connected domains in descending order according to the regularity of the optimal chain code set corresponding to each connected domain to obtain a connected domain sequence. Obtaining the number of the best-chain code to be replaced in each connected domain, and taking the cumulative sum of the numbers of the best-chain code to be replaced in each connected domain as the key number of each connected domain. And intercepting a sequence with the length of S in the comprehensive key sequence according to the position sequence of each connected domain in the connected domain sequence in sequence as the key sequence of each connected domain.
The method comprises the steps of obtaining the key number S2 of each optimal chain code, which is obtained by taking data needing to replace an optimal indicator segment as the key number of each optimal chain code, arranging each optimal chain code of each connected domain in a descending order according to the length of the chain code to obtain an optimal chain code sequence of each connected domain, and sequentially intercepting S2 data sequences in the key sequence of the connected domain where each optimal chain code is located according to the position order of each optimal chain code in the optimal chain code sequence to serve as the key sequence of each optimal chain code.
(2) And encrypting each optimal chain code according to the key sequence of each optimal chain code and the alternative indicator set needing to replace the optimal indicator segment to obtain ciphertext data.
And sequencing the best-to-be-replaced best-indicator segments of the best chain codes by the distance from the best-indicator segments to the wharf to obtain a sequence of the best-to-be-replaced best-indicator segments of the best chain codes.
And arranging the candidate indicator segments in the candidate indicator segment set of the best indicator segments to be replaced in a descending order according to the preference value to obtain a candidate indicator segment sequence of the best indicator segments to be replaced.
Obtaining the position order of the ith best-needed-to-be-replaced indicator segment in the best-chain code best-needed-to-be-replaced indicator segment sequenceAcquiring the key value +.f at the W-th position in the key sequence of each best chain code>Adding 1 to the remainder of the key value F and Q to obtain a position mark value B, and obtaining the +.>The method comprises the steps of replacing the ith optimal directional symbol segment to be replaced at each position by the replacement segment to obtain a first encrypted chain code of each optimal chain code, and completing the replacement processing of all the optimal directional symbol segments to be replaced of each optimal chain code according to the method to obtain the encrypted chain code of each optimal chain code.
Construction of a oneFilling data into the two-dimensional matrix by utilizing the encryption chain codes of all the optimal chain codes to obtain an encryption binary two-dimensional matrix.
And carrying out reverse processing on the encrypted binary two-dimensional matrix according to a binary two-dimensional matrix obtaining method according to the identification result sequence of the monitoring video in the coal transportation process to obtain ciphertext data.
In order to prevent the problem of overlapping between the encrypted chain codes of the optimal chain codes, the overlapping pixel positions and the overlapping times should be recorded as overlapping pixel sets.
And transmitting the ciphertext data to a coal transportation safety monitoring center, wherein the coal transportation safety management center needs to analyze and process the decrypted ciphertext data to obtain a safety conclusion, and carrying out safety management on coal transportation according to the safety conclusion.
The method comprises the steps of obtaining ciphertext data, determining optimal-to-be-replaced indicator segments in each optimal chain code in consideration of the statistical characteristics of different segments in each optimal chain code when obtaining the ciphertext data, replacing each optimal-to-be-replaced indicator segment by using other types of indicator segments in order to remove the statistical characteristics in each optimal chain code, replacing each optimal-to-be-replaced indicator segment by using one indicator segment in order to prevent each optimal-to-be-replaced indicator segment from being replaced, obtaining a set of candidate indicator segments of each optimal-to-be-replaced indicator segment according to the similarity and the statistical characteristics of each indicator segment and the optimal-to-be-replaced indicator segment, and encrypting the data by using the candidate indicator segments to obtain the ciphertext data.
Data transmission module S004: and transmitting the ciphertext data to the cloud platform.
The decryption side processes the ciphertext data according to the method in the data acquisition module S001 to obtain an encrypted binary two-dimensional matrix. The data at each wharf position is used as wharf to carry out chain code splitting on the encrypted binary two-dimensional matrix to obtain a plurality of chain codes, and when the chain code splitting is carried out, and the overlapping pixel positions do not reach the overlapping times, the overlapping pixels do not need to be removed.
According to the method in the ciphertext data acquisition module S003, a second optimal indicator segment of each chain code is acquired, the optimal indicator segment to be replaced of each chain code is determined according to the statistical characteristics of the second optimal indicator segment, the candidate indicator segment set of each optimal indicator segment to be replaced is determined, the key sequence of each chain code is determined, decryption processing is carried out on each chain code by utilizing the reverse operation of the encryption method in the ciphertext data acquisition module S003 to obtain a decryption chain code, a binary two-dimensional matrix is obtained according to the decryption chain code, and the recognition result sequence of the monitoring video in the coal transportation process is obtained according to the binary two-dimensional matrix.
Through the steps, the safe transmission of the monitoring video data in the coal transportation process is completed, and the monitoring video data is transmitted to the cloud platform for decryption and storage and is used for retrieval and real-time display.
The embodiment provides a large-block coal transportation data processing system based on identification results, which is characterized in that a binary two-dimensional matrix is obtained by preprocessing an identification result sequence of a monitoring video in a coal transportation process, a plurality of connected domains of the binary two-dimensional matrix are obtained, chain code splitting is carried out on each connected domain to obtain a chain code set of each wharf, the chain code set of each wharf is analyzed to obtain the regularity of each wharf because the regularity of the chain code sets of each wharf is different, wherein the chain code set corresponding to the wharf with the largest regularity can describe the regularity of the connected domain, the optimal chain code set is determined according to the regularity of each wharf, and the statistics of fragments of each optimal chain code in the optimal chain code set is different, so that the fragments of each optimal chain code are analyzed to obtain the statistics of a second optimal indicator segment. In order to remove the statistical characteristics in each optimal chain code, encryption processing is required to be performed on each optimal chain code, the rule is easy to be recognized because the same encryption processing is performed on each element in the optimal chain code, so that the segments with strong statistical characteristics in the optimal chain code are required to be selected for processing, the segments needing replacing of each optimal chain code are determined according to the statistical characteristics of the second optimal indicator in each optimal chain code, the rule that the same segments needing replacing are easy to leak is required to be replaced by one type of the segments needing replacing, a plurality of alternative segments of each segment needing replacing are required to be determined for each segment needing replacing of the optimal indicator, the alternative segments of each segment needing replacing are used for replacing the segments of the optimal direction according to the key values in the key sequence, ciphertext data are obtained through replacement processing, the identification result sequence of the coal transportation monitoring video can be better protected, and the easy-to-leak characteristics in the monitoring video data are avoided as much as possible.
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 (9)

1. The system for processing the large-block coal transportation data based on the identification result is characterized by comprising the following modules:
and a data acquisition module: acquiring an identification result sequence and a comprehensive key sequence of a monitoring video in the coal transportation process;
the statistical characteristic acquisition module is used for: obtaining a binary two-dimensional matrix according to the identification result sequence of the monitoring video; obtaining a binary two-dimensional matrix to obtain a plurality of connected domains, carrying out chain code splitting on each connected domain by taking each pixel as a wharf to obtain a chain code set of each wharf, wherein the chain code set of each wharf is composed of chain codes, obtaining a sequence of the direction symbols of each chain code, obtaining element regularity of each wharf according to the statistics rule of each direction symbol in the sequence of the direction symbols, obtaining a sequence of direction symbol variation of each sequence of the direction symbols according to the sequence of the direction symbols of each chain code, obtaining structural form regularity of each wharf according to the sequence of the direction symbol variation of each sequence of the direction symbols, taking the accumulated sum of the element regularity and the structural form regularity of each wharf as the regularity of each wharf, selecting a chain code set corresponding to the wharf with the largest regularity as an optimal chain code set of each connected domain, wherein the optimal chain code set is composed of optimal chain codes, and obtaining the statistics characteristics of each first optimal direction symbol section according to the optimal chain code set of each connected domain and the sequence of the direction symbol variation of each direction symbol;
Ciphertext data acquisition module: obtaining optimal chain code segments to be replaced of all the optimal chain codes according to the optimal chain code sets of all the connected domains and the statistical characteristics of the first optimal symbol segments, determining candidate symbol segments to be replaced of all the optimal chain code segments, obtaining key sequences of all the chain codes according to the comprehensive key sequences and the candidate symbol segments to be replaced of the optimal symbol segments, and encrypting the optimal chain codes according to the key sequences of all the chain codes and the candidate symbol segments to be replaced of the optimal symbol segments to obtain ciphertext data;
and a data transmission module: and transmitting the ciphertext data to the cloud platform.
2. The system for processing large-block coal transportation data based on the recognition result according to claim 1, wherein the step of obtaining the element regularity of each dock according to the statistical rule of each direction symbol in the direction symbol sequence comprises the following specific steps:
marking a set formed by the indicator sequences of all the chain codes in the chain code set of each wharf as a indicator sequence set of each wharf, wherein each indicator sequence is formed by a plurality of indicator elements, and the set formed by the indicator elements in all the indicator sequences in the indicator sequence set of each wharf is called a indicator set of each wharf; counting the number of the directors in the director set of each wharf to obtain a director histogram of each wharf, taking the information entropy of the director histogram of each wharf as the director information entropy of each wharf, and taking the reciprocal of the director information entropy of each wharf as the element regularity of each wharf.
3. The system for processing large-block coal transportation data based on the recognition result according to claim 1, wherein the step of obtaining the sequence of the change amount of the direction symbol of each direction symbol sequence according to the direction symbol sequence of each chain code comprises the following specific steps:
comparing the direction indicator of each position in each direction indicator sequence with the direction indicator of the previous position, when the direction indicator of each position is larger than the direction indicator of the previous position, taking the difference value of the direction indicator of each position and the direction indicator of the previous position as the direction indicator change quantity of each position, and when the direction indicator of each position is smaller than the direction indicator of the previous position, taking the difference value of the direction indicator of each position and the direction indicator of the first position after adding 8 as the direction indicator change quantity of each position; the sequence of the change amounts of the direction symbols at all the positions is referred to as the change amount sequence of the direction symbols of each chain code.
4. The system for processing large-block coal transportation data based on the recognition result according to claim 1, wherein the step of obtaining structural morphology regularity of each dock according to the sequence of the change amount of the direction symbol of each direction symbol sequence comprises the following specific steps:
randomly combining any two chain codes in the chain code set of each wharf to obtain a plurality of chain code pairs of the chain code set of each wharf, calculating the DTW distance of the indicator variable sequences corresponding to the two chain codes in the chain code pair by using a DTW algorithm to serve as the distance of each chain code pair, taking the reciprocal of the distance of each chain code pair as the structural form similarity of the chain code pair, and taking the average value of the structural form similarity of the plurality of chain code pairs in the chain code set of each wharf as the structural form regularity of each wharf.
5. The system for processing large-sized coal transportation data based on the recognition result according to claim 1, wherein the statistical feature of each first best indicator segment is obtained according to the best chain code set of each connected domain and the indicator variation sequence of each indicator sequence, comprising the specific steps of:
traversing each element of the indicator sequence of each optimal chain code by utilizing a sliding window to obtain a plurality of indicator segments, wherein a set formed by the indicator segments obtained by all the optimal chain codes in the optimal chain code set is called an indicator segment set;
counting the number of times each of the indicator segments appears in the set of indicator segments;
obtaining a change amount segment of each type of the indicator segments, respectively calculating the DTW distance between the change amount of the indicator of each type of the indicator segments and the change amount segments of other types of the indicator segments by using a DTW algorithm, taking the reciprocal of the DTW distance between the change amount of the indicator of each type of the indicator segments and the change amount segments of the indicator of other types of the indicator segments as the similarity between each type of the indicator segments and the other types of the indicator segments, taking the similarity between each type of the indicator segments and the other types of the indicator segments as a weight, carrying out weighted summation on the occurrence times of each type of the indicator segments to obtain the comprehensive similarity of each type of the indicator segments, and solving the comprehensive similarity of all types of the indicator segments with the same length to obtain the comprehensive similarity under each length; acquiring the length with the maximum comprehensive similarity as the optimal length of the direction symbol;
And acquiring all first best-indicator segment sets of the indicator Duan Dedao equal to the length of the best indicator in the first best-indicator segment sets, and taking the comprehensive similarity of all the first best-indicator segments in the first best-indicator segment sets as the statistical characteristics of the first best-indicator segments.
6. The system for processing large-block coal transportation data based on the identification result as claimed in claim 1, wherein the step of obtaining the best-chain-code-to-replace best-indicator segment according to the best-chain-code set of each connected domain and the statistical characteristics of the first best-indicator segment comprises the following specific steps:
uniformly dividing each of the sequences of the directors into a plurality of second best-fit segments with the length being the best-fit length; the statistical characteristics of the first best indicator segments in the category of the second best indicator Duan Tong are used as the statistical characteristics of the second best indicator segments, and the second best indicator segments with the statistical characteristic values larger than a preset statistical characteristic threshold value in each indicator sequence are used as the best indicator segments to be replaced of each indicator sequence.
7. The recognition result-based large-block coal transportation data processing system of claim 1, wherein the determining alternative ones of the best-for-replacement indicator segments comprises the steps of:
Obtaining a first best indicator segment of a different type from each best indicator segment to be replaced as each reference indicator segment to be replaced, adding the accumulated sum of the similarity of each best indicator segment to be replaced and the reference indicator segment to the statistical characteristics of the reference indicator segment of each best indicator segment to be replaced as the preferred value of the reference indicator segment of each best indicator segment to be replaced; and taking the set formed by Q reference indicator segments with the maximum preference value as an alternative indicator segment set of each best indicator segment to be replaced.
8. The system for processing large-block coal transportation data based on the identification result as claimed in claim 1, wherein the key sequence of each chain code is obtained according to the comprehensive key sequence and the candidate symbol segment needing to replace the optimal symbol segment, comprising the following specific steps:
all the connected domains are arranged in descending order according to the regularity of the optimal chain code set corresponding to each connected domain to obtain a connected domain sequence, and the number of the optimal chain codes in each connected domain, which need to be replaced, of the optimal symbol segments is obtainedThe cumulative sum of the number of the best-chain codes needing to be replaced in each connected domain is used as the key number of each connected domain The method comprises the steps of carrying out a first treatment on the surface of the Intercepting a sequence with the length of S1 from the comprehensive key sequence according to the position sequence of each connected domain in the connected domain sequence as the key sequence of each connected domain;
the method comprises the steps of obtaining the number of the best chain codes to be replaced, wherein the number of the best indicator segments is used as the key number S2 of each best chain code, arranging the best chain codes of each connected domain in a descending order according to the length of the chain codes to obtain the best chain code sequence of each connected domain, and sequentially intercepting S2 data sequences in the key sequence of the connected domain where each best chain code is located according to the position order of each best chain code in the best chain code sequence to serve as the key sequence of each best chain code.
9. The system for processing large-block coal transportation data based on the identification result as claimed in claim 1, wherein the encrypting the best chain code according to the key sequence of each chain code and the alternative indicator segment to be replaced by the best indicator segment to obtain ciphertext data comprises the following specific steps:
sequencing the best-to-be-replaced best-indicator segments of each best chain code by the distance from each best-to-be-replaced indicator segment to the wharf to obtain a best-to-be-replaced indicator segment sequence of each best chain code;
the method comprises the steps of arranging all candidate indicator segments in a candidate indicator segment set of all the best indicator segments to be replaced in a descending order according to a preferred value to obtain candidate indicator segment sequences of all the best indicator segments to be replaced;
Obtaining the position order of each best-candidate-for-replacement-indicator segment in the best-candidate-indicator segment sequenceAcquiring a key value at a W position from a key sequence of each optimal chain code, adding 1 to the key value and Q to obtain a position mark value B, and acquiring a +.>The method comprises the steps that the indicator segments at the positions are used as replacement segments of each best indicator segment to be replaced, each best indicator segment to be replaced in each best chain code is replaced by the replacement segment to obtain a first encrypted chain code of each best chain code, and replacement processing is carried out on all best indicator segments to be replaced of each best chain code to obtain encrypted chain codes of each best chain code;
constructing an uninitialized two-dimensional matrix, and filling data into the two-dimensional matrix by using the encryption chain codes of all the optimal chain codes to obtain an encryption binary two-dimensional matrix;
and obtaining ciphertext data according to the encrypted binary two-dimensional matrix.
CN202310889291.3A 2023-07-20 2023-07-20 Large-block coal transportation data processing system based on recognition result Active CN116612437B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310889291.3A CN116612437B (en) 2023-07-20 2023-07-20 Large-block coal transportation data processing system based on recognition result

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310889291.3A CN116612437B (en) 2023-07-20 2023-07-20 Large-block coal transportation data processing system based on recognition result

Publications (2)

Publication Number Publication Date
CN116612437A true CN116612437A (en) 2023-08-18
CN116612437B CN116612437B (en) 2023-10-03

Family

ID=87683941

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310889291.3A Active CN116612437B (en) 2023-07-20 2023-07-20 Large-block coal transportation data processing system based on recognition result

Country Status (1)

Country Link
CN (1) CN116612437B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115529357A (en) * 2022-11-24 2022-12-27 武汉惠强新能源材料科技有限公司 Updating abnormity matching method based on MES intercommunication interconnection production data
CN115567329A (en) * 2022-12-06 2023-01-03 互丰科技(北京)有限公司 Data security encryption method for network information
CN115664639A (en) * 2022-12-09 2023-01-31 深圳迅策科技有限公司 Financial asset transaction data transmission encryption method
CN116032474A (en) * 2023-03-27 2023-04-28 莱芜职业技术学院 Safety protection system based on big data computer network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115529357A (en) * 2022-11-24 2022-12-27 武汉惠强新能源材料科技有限公司 Updating abnormity matching method based on MES intercommunication interconnection production data
CN115567329A (en) * 2022-12-06 2023-01-03 互丰科技(北京)有限公司 Data security encryption method for network information
CN115664639A (en) * 2022-12-09 2023-01-31 深圳迅策科技有限公司 Financial asset transaction data transmission encryption method
CN116032474A (en) * 2023-03-27 2023-04-28 莱芜职业技术学院 Safety protection system based on big data computer network

Also Published As

Publication number Publication date
CN116612437B (en) 2023-10-03

Similar Documents

Publication Publication Date Title
CN114826691B (en) Network information security intelligent analysis early warning management system based on multidimensional analysis
CN101777115B (en) Safe fingerprint verification method and system
CN105718871B (en) A kind of video host's recognition methods based on statistics
CN106990109B (en) A kind of underground belt foreign matter detection system and method based on multi-cam judgement
CN109102049B (en) Product information tracing method
CN115225897A (en) Video multi-level encryption transmission method based on Huffman coding
CN115797798A (en) Ecological restoration effect evaluation method based on abandoned mine remote sensing image
CN116071164B (en) Digital asset tracing method based on blockchain management
CN116389170B (en) Network information security management method
CN116612437B (en) Large-block coal transportation data processing system based on recognition result
CN116320292A (en) Water conservancy monitoring control system based on big data
CN110728212B (en) Road well lid monitoring device and monitoring method based on computer vision
CN109359530A (en) Intelligent video monitoring method and device
CN114500574A (en) Monitoring method, device and medium for improving grain depot safety based on block chain
CN113420070B (en) Pollution discharge monitoring data processing method and device, electronic equipment and storage medium
CN112613396B (en) Task emergency degree processing method and system
CN113098913B (en) Data security analysis and evaluation method and system based on data sharing service platform
CN117632937B (en) Industrial Internet big data platform and data processing method
CN115865308B (en) Image data processing method for semiconductor equipment maintenance
CN113347180B (en) Risk analysis method for network security three-synchronization process of computer application system
CN116320203B (en) Data management system for intelligent operation and maintenance platform of hospital
CN114359023B (en) Method, equipment and system for dispatching picture shunt to center based on complexity
CN113630425B (en) Financial data safe transmission method for multiple power bodies
CN115205952B (en) Online learning image acquisition method and system based on deep learning
CN117521119B (en) VR (virtual reality) -technology-based safety experience 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