CN115119016B - Information data encryption algorithm - Google Patents
Information data encryption algorithm Download PDFInfo
- Publication number
- CN115119016B CN115119016B CN202210757930.6A CN202210757930A CN115119016B CN 115119016 B CN115119016 B CN 115119016B CN 202210757930 A CN202210757930 A CN 202210757930A CN 115119016 B CN115119016 B CN 115119016B
- Authority
- CN
- China
- Prior art keywords
- image
- frame
- encrypted
- gray level
- images
- 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
- 238000000638 solvent extraction Methods 0.000 claims abstract description 9
- 238000007781 pre-processing Methods 0.000 claims abstract description 6
- 238000000034 method Methods 0.000 claims description 24
- 238000012937 correction Methods 0.000 claims description 14
- 238000003708 edge detection Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 7
- 238000004364 calculation method Methods 0.000 description 8
- 238000007906 compression Methods 0.000 description 7
- 230000006835 compression Effects 0.000 description 6
- 230000000694 effects Effects 0.000 description 4
- 238000005192 partition Methods 0.000 description 3
- 238000012216 screening Methods 0.000 description 3
- 229940023184 after bite Drugs 0.000 description 2
- 238000012800 visualization Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
- H04N21/2347—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving video stream encryption
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/40—Extraction of image or video features
- G06V10/44—Local feature extraction by analysis of parts of the pattern, e.g. by detecting edges, contours, loops, corners, strokes or intersections; Connectivity analysis, e.g. of connected components
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
- G06V10/74—Image or video pattern matching; Proximity measures in feature spaces
- G06V10/75—Organisation of the matching processes, e.g. simultaneous or sequential comparisons of image or video features; Coarse-fine approaches, e.g. multi-scale approaches; using context analysis; Selection of dictionaries
- G06V10/752—Contour matching
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
- G06V10/74—Image or video pattern matching; Proximity measures in feature spaces
- G06V10/761—Proximity, similarity or dissimilarity measures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V20/00—Scenes; Scene-specific elements
- G06V20/40—Scenes; Scene-specific elements in video content
- G06V20/46—Extracting features or characteristics from the video content, e.g. video fingerprints, representative shots or key frames
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V20/00—Scenes; Scene-specific elements
- G06V20/40—Scenes; Scene-specific elements in video content
- G06V20/48—Matching video sequences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/184—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being bits, e.g. of the compressed video stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Signal Processing (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Artificial Intelligence (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Databases & Information Systems (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Software Systems (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention relates to the field of data encryption, in particular to an information data encryption algorithm, which is used for preprocessing video information data to be transmitted based on time sequences to obtain gray images corresponding to different frame images; acquiring a node frame gray level image set; partitioning video information data according to the node frame gray level image set to obtain a plurality of areas to be encrypted, wherein each area to be encrypted contains a node frame gray level image; compressing the node frame gray level images in each region to be encrypted to obtain compressed images of the node frame gray level images, and calculating the offset of any pixel point in the compressed images and the corresponding pixel point in the node frame gray level images; and encrypting each frame of gray level image in the corresponding region to be encrypted by using the offset to obtain each encryption region, thereby completing the encryption of video information data. The scheme of the invention can encrypt the video information data in batches, has high encryption efficiency and ensures the safety of subsequent transmission.
Description
Technical Field
The invention relates to the field of data encryption, in particular to an information data encryption algorithm.
Background
With the development of technology, the 21 st century has become an informationized century. In the transmission process of various information data, the security of information transmission is crucial, so that an appropriate encryption algorithm needs to be designed to encrypt the information data. In particular, since video carries a large amount of information, encryption of information data is more necessary for transmission of video data.
The existing video encryption algorithm is mainly divided into two types, one is video information slice encryption taking m3u8 as an example, and the other is video information frame-by-frame encryption based on a private algorithm. The slice partition encryption adopted by the video information slice encryption algorithm taking m3u8 as an example is based on equidistant time sequence partition slices, so that the encryption effect is not strong, but the encryption speed is high, but in the subsequent data transmission, the transmission time is long because the relevance of each interval is extremely variable; while video information is encrypted frame by frame, the encryption effect is strong, but the encryption time is too long and the decryption is extremely complex.
Disclosure of Invention
In order to solve the technical problems, the invention aims to provide an information data encryption algorithm, which adopts the following technical scheme:
The technical scheme of the information data encryption algorithm provided by the invention comprises the following steps:
Preprocessing video information data to be transmitted based on a time sequence to obtain gray images corresponding to different frame images;
Calculating the information entropy of each gray level image, sequentially judging whether the information entropy of the gray level image of the previous frame and the information entropy of the gray level image of the next frame are smaller than the information entropy of the gray level image of the current frame according to a time sequence, if so, sequentially judging the gray level image of the previous frame as a gray level image of a node frame until all the frame images of video information data are judged to be completed, and acquiring a gray level image set of the node frame;
Partitioning video information data according to the node frame gray level image set to obtain a plurality of areas to be encrypted, wherein each area to be encrypted contains a node frame gray level image;
compressing the node frame gray level images in each region to be encrypted to obtain compressed images of the node frame gray level images, and calculating the offset of any pixel point in the compressed images and the corresponding pixel point in the node frame gray level images; and encrypting each frame of gray level image in the corresponding region to be encrypted by using the offset to obtain each encryption region, thereby completing the encryption of video information data.
Further, the method for obtaining each area to be encrypted comprises the following steps: starting from a first frame image of video information until a first node frame gray image is a region to be encrypted, and then, obtaining a plurality of regions to be encrypted.
Further, the method for acquiring the compressed image of the node frame gray level image comprises the following steps:
Performing edge detection on the node frame gray level image by using a canny algorithm to obtain an edge point image, and calculating edge information entropy of the edge point image;
Layering the node frame gray level images by adopting a bit layering technology to obtain images of different layers, and calculating the layer information entropy of each layer of image;
comparing the edge information entropy with the layer information entropy of each layer of image, and discarding the corresponding layer image when the edge information entropy is smaller than the layer information entropy; otherwise, reserving the corresponding layer images to obtain a plurality of reserved layer images;
And randomly selecting at least two layers of images to be overlapped to obtain corresponding overlapped images, calculating the similarity between each overlapped image and the edge point image, and selecting the overlapped image corresponding to the maximum similarity as an image to be compressed to obtain a compressed image of the node frame gray level image.
Further, the offset includes an encryption offset, a weight offset, and a correction offset;
the encryption offset is:
In the middle of The gray value of a pixel point i in a node frame gray image V b,d of the b-th area to be encrypted is represented; /(I)Representing the gray value of a pixel point i in a compressed image im b corresponding to the node frame gray image of the b-th region to be encrypted;
The weight offset is:
Wherein, E b,i is the weight offset of pixel point i in the node frame gray image of the b-th region to be encrypted;
The correction offset is: beta b,i＝255-∈b,i
Wherein, β b,i is the correction offset of the pixel point i in the node frame gray-scale image of the b-th region to be encrypted.
Further, the specific process of encrypting each frame of gray level image in the corresponding region to be encrypted by using the offset comprises the following steps:
Calculating the encryption gray value of the corresponding pixel according to the encryption offset, the weight offset and the correction offset and the gray value of the pixel in each frame of gray image in the region to be encrypted;
and replacing the gray value of the pixel point in each frame of gray image with a corresponding encrypted gray value to obtain each frame of encrypted gray image, and further obtaining each encryption area.
Further, the encryption gray value of the pixel point is:
d′b,i＝εb×cos(∈b,i×db,i+βb,i)
Wherein d' b,i is the encrypted gray value of the pixel point i of the d-th frame image in the b-th area to be encrypted, and d b,i is the gray value of the pixel point i of the d-th frame image in the b-th area to be encrypted.
The invention has the beneficial effects that:
According to the scheme, the node frame gray images for dividing video information data are determined through the information entropy of each frame gray image, the video information data are partitioned, a plurality of areas to be encrypted are obtained, one node frame gray image in different areas to be encrypted is compressed, a compressed image is obtained, the offset of the compressed image and the corresponding pixel point in the node frame gray image is calculated, and all the frame gray images in the corresponding encryption areas are encrypted by utilizing the offset; by encrypting different keys in different areas to be encrypted, the security of video information data can be ensured.
And meanwhile, when the compressed image is acquired, layering is carried out on the gray level image before compression by utilizing a bit layering technology, the layer image with effective information is screened out, then, at least two layer images are randomly selected from all the screened layer images to be overlapped, the overlapped images are compared with the edge point image, if the overlapped images are similar, the overlapped images are compressed, namely, the gray level image information of the whole node frame is not required to be compressed, only the layer image with the effective information is selected to be compressed, and a large amount of calculation amount is saved.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions and advantages of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method of an information data encryption algorithm of the present invention;
fig. 2 is a schematic diagram of an information data encryption algorithm of the present invention using node frame grayscale images for partitioning.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention for achieving the preset purpose, the following detailed description of the specific embodiments, structures, features and effects thereof according to the present invention is given with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The invention aims at providing an information data encryption algorithm which screens node frame gray images from video information by using information entropy, then carries out slicing and partitioning on whole video information data by the node frame gray images, and then encrypts an encryption area where the node frame gray images are positioned by combining a bit layering technology with the node frame gray images to realize the encryption of the video information data.
Specifically, describing an information data encryption algorithm provided by the present invention, please refer to fig. 1, the method includes the following steps:
Firstly, preprocessing video information data to be transmitted based on time sequence to obtain gray images corresponding to different frame images.
In this embodiment, the video information data needs to be preprocessed, wherein the preprocessing mode is graying based on time sequence. The method is characterized in that the video data information is firstly subjected to grey-scale treatment in a frame-by-frame grey-scale treatment mode, the time sequence of the video data is not changed in the grey-scale treatment process of each frame of video image, the grey-scale treatment is carried out according to the time sequence period of each frame of video image, and the preprocessing of the video information data is completed.
Secondly, calculating the information entropy of each gray level image, sequentially judging whether the information entropy of the gray level image of the previous frame and the information entropy of the gray level image of the next frame are smaller than the information entropy of the gray level image of the current frame according to a time sequence, if so, taking the gray level image of the previous frame as a gray level image of a node frame, sequentially judging until all frame images of video information data are judged to be completed, and acquiring a gray level image set of the node frame; partitioning video information data according to the node frame gray level image set to obtain a plurality of areas to be encrypted, wherein each area to be encrypted contains a node frame gray level image.
In this embodiment, the video information data needs to be partitioned, and the partitioning method is to screen the node frame gray level image by using the information entropy and partition by using the node frame gray level image.
Specifically, in order to reduce the calculation amount, the method includes the steps of taking the information entropy of each frame of image in the video information as a judgment, then screening the special frames in the video information by taking bottoming as a basis in a binary judgment mode, and carrying out region division on the whole video information by taking the special frames as node frames, wherein the specific implementation steps are as follows:
1) The calculation of the information entropy of each frame of image in the video information is taken as an example of the calculation of the information entropy of any frame of image for convenience of description, and the calculation mode is as follows:
Wherein the subscript N represents an N-th frame gray image of the video information, wherein N is E [1, N ], and N is the total frame number of the gray image of the video information; g represents the gray value size, where G ε [0, 255]; the subscript I represents the gray value of the ith pixel, I epsilon [1, I ], wherein I is the total number of pixels of each frame of image; h n(GI) information entropy of I pixels representing the n-th frame gray-scale image is H n(GI); The probability of the gray value G i corresponding to the ith pixel point is expressed, and the probability is calculated by dividing the number of the gray value occurrences by the total number of the gray values in the gray image.
It should be noted that, the larger the information entropy, the more disordered the information carried by the image is proved, the larger the frequency of occurrence of different gray values reflected in the image, the smaller the probability of occurrence of the whole single gray value, and the smaller the possibility of the information carried by the visualization is; the smaller the information entropy, the more orderly the information carried by the image is proved, the smaller the frequency of different gray values appearing in the image is reflected, the larger the probability of the integral single gray value appearing is, and the larger the possibility of the information carried by the image for visualization is generally.
2) Judging the information entropy of each frame gray image by using a binary judgment mode, namely taking the frame image corresponding to the binary judgment bottoming entropy as a node frame gray image, wherein the screening mode of the node frame gray image is as follows:
Wherein, H n-1(GI) is the information entropy of the n-1 frame gray scale image, H n(GI) is the information entropy of the n frame gray scale image, and H n+1(GI) is the information entropy of the n+1 frame gray scale image.
It should be noted that, binary decision is to determine three consecutive frames of gray images, that is, comparing the information entropy H n-1(GI) corresponding to the N-1 th frame of gray image with H n(GI), if H n-1(GI)＜Hn(GI), determining H n-1(GI) to be 0, and H n(GI) to be 1, comparing the information entropy of the N-th frame of gray image with the information entropy of the N-th frame of gray image corresponding to the new information entropy of the N-th frame of gray image, until H n(GI) is determined to be 1, stopping the decision, taking the image of the N-1 th frame of the N-th frame of gray image corresponding to H n(GI) as a node frame of gray image V D, repeating the decision until all N frames of gray images of video information are determined to be complete, and obtaining N' node frame gray image sets V: v= { V 1,V2,…,VD,…,VN′ }, wherein the subscript D is the D-th node frame grayscale image.
It is to be noted that, the information entropy corresponding to each frame gray level image in the video information is different, and as mentioned above, the image of the video information of the frame corresponding to the bottoming information entropy is selected according to the binary decision, that is, the information carried by the frame image between the adjacent frame images is proved to be most ordered, and the possibility of carrying the needed visual information is the greatest.
3) Partitioning the whole video information by using the selected node frame gray level image, wherein the partitioning method comprises the following steps: starting from a first frame gray level image of video information, sequentially searching node frame gray level images until the first node frame gray level image is found, and starting from the first frame to the first node frame gray level image as a first area to be encrypted; and by analogy, restarting the gray level image of the non-encrypted area of the next frame of the gray level image of the first node frame until the gray level image of the second node frame is used as the second area to be encrypted, and continuously repeating the process until all the gray level images of the video information belong to the area to be encrypted, so that all the gray level images of the video information data are completely divided, and obtaining the area V' B to be encrypted.
V′B＝{V′1,V′2,…,V′b,…,V′B)
Wherein, the subscript B represents the B-th to-be-encrypted area of the video information data, B is the total number of to-be-encrypted areas, and B E [1, B ].
It should be noted that, as shown in fig. 2, a is a node frame gray image, and E is a region to be encrypted; each region to be encrypted comprises a node frame gray level image and a non-node frame gray level image, wherein the frames of the non-node frame gray level images in each region to be encrypted can be the same or different, taking the b-th region to be encrypted as an example, all d-frame gray level images in the region to be encrypted are V' b＝{Vb,1,Vb,2,…,Vb,d }, wherein the subscript d represents the d-th frame gray level image in the b-th encryption region.
Then, compressing the node frame gray level images in each region to be encrypted to obtain compressed images of the node frame gray level images, and calculating the offset of any pixel point in the compressed images and the corresponding pixel point in the node frame gray level images; and encrypting each frame of gray level image in the corresponding region to be encrypted by using the offset to obtain each encryption region, thereby completing the encryption of video information data.
The method for acquiring the compressed image of the node frame gray level image in the embodiment comprises the following steps:
And detecting edge pixel points of the node frame gray level image by using a canny algorithm to obtain an edge point image, counting edge pixel point information, layering the corresponding node frame image by using a bit layering technology, performing layer superposition compression, and calculating the offset of the compressed node frame gray level image and the node frame gray level image before compression to use the offset as a key of a region to be encrypted of each node frame gray level image.
Specifically, in this embodiment, a bit layering technology is used to layer the node frame gray level images, then different layer images of the layered node frame gray level images are subjected to superposition compression, the offset of the compressed image and the node frame gray level images before compression is calculated, all frame gray level images in the region to be encrypted where the node frame gray level images are located are encrypted by using the offset of the node frame gray level images, and a specific encryption method is described below by taking the b-th region to be encrypted as an example:
1) And carrying out edge point detection and bit layering on the node frame gray level image V b,d in the b-th area to be encrypted.
Firstly, image edge detection is carried out on a node frame gray level image V b,d by utilizing a canny operator, and then pixel gray level values of all edge pixel points are recordedWherein/>The method comprises the following steps:
In the formula, a subscript (x, y) i represents a pixel point i with a position (x, y) in the node frame gray image V b,d, where i∈ [1, i ].
Calculation ofInformation carrying amount/>
Wherein,The probability of pixel i located at (x, y) in the node frame grayscale image V b,d.
Then, bite layering is carried out on the node frame gray level image, and a layered gray level image V' b,d is obtained as follows:
V′b,d＝{Vb,d,1,Vb,d,2,…,Vb,d,M,…,Vb,d,8}
in the formula, the subscript M is an M-th layer image after bite layering of the node frame gray level image, and M is E [1,8].
Taking an M-th layer image as an example, calculating the carrying amount H (V b,d,M) of information of the layer image:
In the method, in the process of the invention, I= [1, i ] is the probability of occurrence of the i-th pixel point in the M-th layer image.
2) Comparing the edge information entropy with the layer information entropy of each layer of image, and discarding the corresponding layer image when the edge information entropy is smaller than the layer information entropy; otherwise, reserving the corresponding layer images to obtain a plurality of reserved layer images.
The bit layering is utilized to obtain each layer of image of the node frame gray image and the edge pixel point information detected by the canny operator, so that the information of the edge pixel point is used as a judging standard to stack different layers of images after bit layering, and the compression of the node frame gray image is achieved; the specific method comprises the following steps:
firstly, removing a layer image with smaller information content after layering a node frame bit; because the edge information in the gray level image of the current frame contains a large amount of needed information, a judgment template is used for judging the information carried by each layer of images after bite layering by using the information entropy of the edge information, and the content of effective information carried by each layer of images is analyzed, so that the layer images of bite layers without effective information or with less effective information content are screened out.
The information value of the layer image is binary judgment based on the information value of the edge pixel point, and the rule is as follows:
When the judgment result is 1, the layer of image is considered to carry enough information quantity, and the layer of image is not required to be removed; when the decision result is 0, the layer image is considered to not carry a sufficient amount of information and should be removed. Wherein, alpha takes a value of 0.25.
And judging all the layer images layered by the bites, so that the rest S layer images carrying enough information can be obtained.
3) And randomly selecting at least two layers of images to be overlapped to obtain corresponding overlapped images, calculating the similarity between each overlapped image and the edge point image, and selecting the overlapped image corresponding to the maximum similarity as an image to be compressed to obtain a compressed image of the node frame gray level image.
Specifically, the rest S layers of images after screening are overlapped, and the specific method is as follows:
the layer images of the bit layer of the embodiment are overlapped by randomly selecting 2 layer images for overlapping, so the method is shared And a superposition mode, wherein similarity Sa S is calculated between each superimposed image and the edge point image, and the s-th superposition mode is taken as an example, and the rest calculation modes are the same:
In the middle of The gray value of the pixel point i with the s-th superimposed image position being (x, y); when the corresponding superimposed picture with the similarity Sa s closest to 1 is named im b as a compressed image, sa s is close to 1, which indicates that the compressed image generated by the superimposed mode is closest to an edge pixel point image, and the edge pixel point image of the node frame gray level image can reflect most of information carried by the node frame gray level image, so that the selected compressed image can reflect most of the characteristics of the node frame gray level image, and most of effective information of a section to be encrypted where the node frame gray level image is located is more likely to be reflected.
It should be noted that, when different layer images are selected for superposition, the method is not limited to two layer images, but may be three layer images and four layer images, and of course, the more the number of layers are superimposed, the more the image information is rich, but in the subsequent compression process, the calculation amount may be large.
The offset in this embodiment is: according to the compressed image im b of the node frame gray image V b,d in the b-th interval to be encrypted, calculating offset by using the compressed image im b and the node frame gray image V b,d, wherein the offset is encryption offset epsilon b, weight offset epsilon b,i and correction offset beta b,i, the encryption offset epsilon b is the integral difference between im b and V b,d, the weight offset epsilon b,i is the fine difference between im b and V b,d, and the correction offset beta b,i is the correction quantity when the video information is encrypted by using the weight offset.
The encryption offset epsilon b is calculated as follows:
In the middle of The gray value of a pixel point i in a node frame gray image V b,d of the b-th area to be encrypted is represented; /(I)And representing the gray value of the pixel point i in the compressed image im b corresponding to the node frame gray image of the b-th area to be encrypted.
Wherein, E b,i is the weight offset of pixel point i in the node frame gray image of the b-th region to be encrypted;
The correction offset is: beta b,i＝255-∈b,i
Wherein, β b,i is the correction offset of the pixel point i in the node frame gray-scale image of the b-th region to be encrypted.
The specific process of encrypting each frame of gray level image in the corresponding region to be encrypted by using the offset comprises the following steps:
Calculating the encryption gray value of the corresponding pixel according to the encryption offset, the weight offset and the correction offset and the gray value of the pixel in each frame of gray image in the region to be encrypted;
and replacing the gray value of the pixel point in each frame of gray image with a corresponding encrypted gray value to obtain each frame of encrypted gray image, and further obtaining each encryption area.
Further, the encryption gray value of the pixel point is:
d′b,i＝εb×cos(∈b,i×db,i+βb,i)
Wherein d' b,i is the encrypted gray value of the pixel point i of the d-th frame image in the b-th area to be encrypted, and d b,i is the gray value of the pixel point i of the d-th frame image in the b-th area to be encrypted.
And finally, encrypting the images of all frames in all video information encryption intervals in the mode, and completing the video information encryption.
Furthermore, the invention also carries out transmission based on time sequence on the encrypted video information data, namely, the encrypted video information is transmitted according to the encrypted time period.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.
Claims (1)
1. An information data encryption algorithm, comprising the steps of:
Preprocessing video information data to be transmitted based on a time sequence to obtain gray images corresponding to different frame images;
Calculating the information entropy of each gray level image, sequentially judging whether the information entropy of the gray level image of the previous frame and the information entropy of the gray level image of the next frame are smaller than the information entropy of the gray level image of the current frame according to a time sequence, if so, sequentially judging the gray level image of the previous frame as a gray level image of a node frame until all the frame images of video information data are judged to be completed, and acquiring a gray level image set of the node frame; partitioning video information data according to the node frame gray level image set to obtain a plurality of areas to be encrypted, wherein each area to be encrypted contains a node frame gray level image;
Compressing the node frame gray level images in each region to be encrypted to obtain compressed images of the node frame gray level images, and calculating the offset of any pixel point in the compressed images and the corresponding pixel point in the node frame gray level images; encrypting each frame of gray level image in the corresponding region to be encrypted by utilizing the offset to obtain each encryption region, thereby completing encryption of video information data;
the method for acquiring each area to be encrypted comprises the following steps: starting from a first frame image of video information until a first node frame gray image is a region to be encrypted, and analogically, obtaining a plurality of regions to be encrypted;
The method for acquiring the compressed image of the node frame gray level image comprises the following steps:
Performing edge detection on the node frame gray level image by using a canny algorithm to obtain an edge point image, and calculating edge information entropy of the edge point image;
Layering the node frame gray level images by adopting a bit layering technology to obtain images of different layers, and calculating the layer information entropy of each layer of image;
comparing the edge information entropy with the layer information entropy of each layer of image, and discarding the corresponding layer image when the edge information entropy is smaller than the layer information entropy; otherwise, reserving the corresponding layer images to obtain a plurality of reserved layer images;
Randomly selecting at least two layers of images to be overlapped to obtain corresponding overlapped images, calculating the similarity between each overlapped image and the edge point image, and selecting the overlapped image corresponding to the maximum similarity as an image to be compressed to obtain a compressed image of the node frame gray level image;
the offset comprises an encryption offset, a weight offset and a correction offset;
the encryption offset is:
In the middle of The gray value of a pixel point i in a node frame gray image V b,d of the b-th area to be encrypted is represented; /(I)Representing the gray value of a pixel point i in a compressed image im b corresponding to the node frame gray image of the b-th region to be encrypted;
The weight offset is:
Wherein, E b,i is the weight offset of pixel point i in the node frame gray image of the b-th region to be encrypted;
The correction offset is: beta b,i＝2hh-∈b,i
Wherein, beta b,i is the correction offset of the pixel point i in the node frame gray level image of the b-th region to be encrypted;
the specific process of encrypting each frame of gray level image in the corresponding region to be encrypted by using the offset comprises the following steps:
Calculating the encryption gray value of the corresponding pixel according to the encryption offset, the weight offset and the correction offset and the gray value of the pixel in each frame of gray image in the region to be encrypted;
the gray value of the pixel point in each frame of gray image is replaced by the corresponding encrypted gray value, so that each frame of gray image after encryption is obtained, and each encryption area is further obtained;
The encryption gray value of the pixel point is as follows:
d′b,i＝εb×cos(∈b,i×db,i+βb,i)
Wherein d' b,i is the encrypted gray value of the pixel point i of the d-th frame image in the b-th area to be encrypted, and d b,i is the gray value of the pixel point i of the d-th frame image in the b-th area to be encrypted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210757930.6A CN115119016B (en) | 2022-06-29 | 2022-06-29 | Information data encryption algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210757930.6A CN115119016B (en) | 2022-06-29 | 2022-06-29 | Information data encryption algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115119016A CN115119016A (en) | 2022-09-27 |
| CN115119016B true CN115119016B (en) | 2024-06-18 |
Family
ID=83330246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210757930.6A Active CN115119016B (en) | 2022-06-29 | 2022-06-29 | Information data encryption algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115119016B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115294360B (en) * | 2022-09-29 | 2023-03-24 | 汉达科技发展集团有限公司 | Management method of hybrid formation training and examination system of driving simulator |
| CN115310114B (en) * | 2022-10-08 | 2022-12-13 | 南通观云网络科技有限公司 | Small program user data processing method |
| CN115311607B (en) * | 2022-10-10 | 2023-04-14 | 南通蓝玺新材料有限公司 | Epoxy resin production monitoring data management method |
| CN115456868B (en) * | 2022-11-14 | 2023-01-31 | 南京金易众和信息科技有限公司 | Data management method for fire drill system |
| CN115633193B (en) * | 2022-12-19 | 2023-04-18 | 吉林省信息技术研究所 | Monitoring video encryption method and system |
| CN115620214B (en) * | 2022-12-20 | 2023-03-07 | 浙江奥鑫云科技有限公司 | Safety processing method for network information data |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105933101A (en) * | 2016-03-31 | 2016-09-07 | 东南大学 | Fully homomorphic encryption public key compression method based on parameter high power offset |
| CN109525893A (en) * | 2018-11-20 | 2019-03-26 | 广州易方信息科技股份有限公司 | Video segment method based on slice file duration threshold value |
Family Cites Families (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20120006848A (en) * | 2010-07-13 | 2012-01-19 | 고려대학교 산학협력단 | Method for compressing moving image and system thereof |
| CN109871781B (en) * | 2019-01-28 | 2020-11-06 | 山东大学 | Dynamic gesture recognition method and system based on multi-mode 3D convolutional neural network |
| CN112218161B (en) * | 2019-07-09 | 2023-03-31 | 中国移动通信有限公司研究院 | Video encryption method, device and equipment |
| CN110493641A (en) * | 2019-08-06 | 2019-11-22 | 东软集团股份有限公司 | A kind of video file encryption and decryption method and device |
| CN111432287A (en) * | 2020-04-14 | 2020-07-17 | 南京巨鲨显示科技有限公司 | Slicing encryption method and system and decryption method and system for audio and video files |
| CN112330618B (en) * | 2020-10-29 | 2023-09-01 | 浙江大华技术股份有限公司 | Image offset detection method, device and storage medium |
| CN113225180A (en) * | 2021-04-29 | 2021-08-06 | 北京连山科技股份有限公司 | Method and system for protecting communication key |
| CN113422984B (en) * | 2021-06-10 | 2022-10-14 | 北京快乐茄信息技术有限公司 | Video processing method and device, electronic equipment and storage medium |
| CN113115037B (en) * | 2021-06-15 | 2021-09-14 | 深圳市中鹏教育科技股份有限公司 | Online education method, system, equipment and storage medium |
| CN113542771A (en) * | 2021-07-15 | 2021-10-22 | 广东电网有限责任公司中山供电局 | Video high-efficiency compression processing method based on content weight |
| CN113839773A (en) * | 2021-08-17 | 2021-12-24 | 厦门市美亚柏科信息股份有限公司 | LUKS key offline extraction method, terminal equipment and storage medium |
| CN113852816A (en) * | 2021-09-28 | 2021-12-28 | 浙江大华技术股份有限公司 | Video frame processing method and device, computer equipment and readable storage medium |
| CN114494985B (en) * | 2022-04-18 | 2022-07-19 | 山东西曼克技术有限公司 | Logistics transfer robot work abnormity detection method and system based on image processing |
-
2022
- 2022-06-29 CN CN202210757930.6A patent/CN115119016B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105933101A (en) * | 2016-03-31 | 2016-09-07 | 东南大学 | Fully homomorphic encryption public key compression method based on parameter high power offset |
| CN109525893A (en) * | 2018-11-20 | 2019-03-26 | 广州易方信息科技股份有限公司 | Video segment method based on slice file duration threshold value |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115119016A (en) | 2022-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115119016B (en) | Information data encryption algorithm | |
| Liao et al. | A new payload partition strategy in color image steganography | |
| Hong et al. | Reversible data hiding using Delaunay triangulation and selective embedment | |
| Cao et al. | Hierarchical recovery for tampered images based on watermark self-embedding | |
| Tang et al. | Real-time reversible data hiding with shifting block histogram of pixel differences in encrypted image | |
| CN109635576B (en) | Method and system for hiding data in image | |
| CN115019111B (en) | Data processing method for Internet literary composition | |
| Ren et al. | Reversible data hiding in encrypted binary images by pixel prediction | |
| US7848567B2 (en) | Determining regions of interest in synthetic images | |
| CN116226471B (en) | Data storage method for homeland resource planning | |
| CN112085016A (en) | Robust watermarking method based on ROI and IWT medical image tampering authentication and recovery | |
| CN111050022A (en) | High-security image transmission system and method | |
| Puteaux et al. | High-capacity data hiding in encrypted images using MSB prediction | |
| RU2636690C1 (en) | Method of hidden transferring digital information | |
| CN113382128B (en) | Bit plane compressed encrypted image reversible information hiding method | |
| CN109391819B (en) | Reversible information hiding method based on pixel value dynamic prediction | |
| CN114697671B (en) | Building engineering quality management system | |
| CN115632780B (en) | Use management system and method for seal of Internet of things | |
| CN115277974B (en) | Management system and encryption method for intelligent traffic monitoring video based on Internet of things | |
| Yao et al. | Adaptive image camouflage using human visual system model | |
| Jhong et al. | Grayscale-invariant reversible data hiding based on multiple histograms modification | |
| CN114584804A (en) | Virtual reality video stream data processing system | |
| Zhan et al. | Three-dimensional prediction-error histograms based reversible data hiding algorithm for color images | |
| CN115426199B (en) | Website data safety protection method | |
| Tang et al. | Reversible data hiding based on improved block selection strategy and pixel value ordering |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20240522 Address after: Unit 301, unit 1, 3 / F, building 15, yard 1, gaolizhang Road, Haidian District, Beijing Applicant after: Beijing Accurate Pointing Information Technology Co.,Ltd. Country or region after: China Address before: Room 1824, Land Investment Innovation Center, Innovation Avenue, High-tech Zone, Hefei City, Anhui Province, 230088 Applicant before: Wang Yujia Country or region before: China |
|
| GR01 | Patent grant |