CN115952549A - End-to-end medical image privacy data elimination system - Google Patents
End-to-end medical image privacy data elimination system Download PDFInfo
- Publication number
- CN115952549A CN115952549A CN202310231999.XA CN202310231999A CN115952549A CN 115952549 A CN115952549 A CN 115952549A CN 202310231999 A CN202310231999 A CN 202310231999A CN 115952549 A CN115952549 A CN 115952549A
- Authority
- CN
- China
- Prior art keywords
- plaintext
- sequence
- subsequence
- matrix
- type
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000008030 elimination Effects 0.000 title claims abstract description 13
- 238000003379 elimination reaction Methods 0.000 title claims abstract description 13
- 239000011159 matrix material Substances 0.000 claims abstract description 168
- 238000000034 method Methods 0.000 claims description 50
- 238000010276 construction Methods 0.000 claims description 8
- 238000012216 screening Methods 0.000 claims 1
- 230000008859 change Effects 0.000 description 9
- 238000003745 diagnosis Methods 0.000 description 6
- 230000000007 visual effect Effects 0.000 description 5
- 230000002441 reversible effect Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000013519 translation Methods 0.000 description 3
- 241000271935 Bitis Species 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000036541 health Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010827 pathological analysis Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Images
Landscapes
- Image Processing (AREA)
Abstract
The invention relates to the technical field of information hiding, in particular to an end-to-end medical image privacy data elimination system, which comprises: converting the private data of the medical image into a watermark information sequence, establishing a matrix to be embedded and an attribute matrix of a plaintext subsequence, obtaining attribute information of the plaintext subsequence according to the key matrix, the matrix to be embedded and the attribute matrix, and establishing an embedding rule equation to obtain all embedding sets which enable the embedding rule equation to be established: and obtaining an optimal embedding set according to the number of elements and the preference degree, carrying out inversion operation on the elements belonging to the optimal embedding set in the matrix to be embedded of the plaintext subsequence to obtain an embedded matrix of the plaintext subsequence, replacing the plaintext subsequence bits to obtain an embedded medical image consisting of all watermark plaintext subsequences, and eliminating the privacy data of the medical image. The medical image privacy data are eliminated, and meanwhile, whether the medical image is tampered or not can be judged, so that the safety of the medical image is guaranteed.
Description
Technical Field
The invention relates to the technical field of information hiding, in particular to an end-to-end medical image privacy data elimination system.
Background
The medium and large hospitals provide services such as remote consultation, remote pathological diagnosis, remote image diagnosis, remote electrocardiogram diagnosis, remote training and the like for the basic medical health institution through the medical information resource sharing platform, so that the utilization rate of high-quality medical resources is improved, and the problem of insufficient resources of the basic medical health institution is solved. Although the medical information resource sharing platform provides convenience for the communication and remote inquiry of doctors and scholars, the medical information resource sharing platform faces the problem of revealing the individual privacy of patients.
Therefore, the private data in the medical image uploaded to the medical information resource sharing platform needs to be eliminated, but if the private data in the medical image is completely eliminated, a doctor cannot give a diagnosis result of a specific patient, and therefore the private data in the medical image cannot be completely eliminated.
In the conventional watermark embedding method based on asymmetric histogram translation, the embedding amount of the watermark depends on the frequency of the maximum prediction error of the frequency, and each pixel point can only be embedded with one bit of watermark information, so that the embedding amount of the watermark is limited; meanwhile, because the image has local similarity and strong correlation, the prediction error with the largest frequency is usually 0, the place where the prediction error is 0 is a smooth area in the image, and the texture area of the image is the important information position of the image, which means that the reversible information hiding method based on the prediction error histogram cannot protect the important texture area in the image.
Disclosure of Invention
The invention provides an end-to-end medical image privacy data elimination system, which aims to solve the existing problems.
The end-to-end medical image privacy data elimination system adopts the following technical scheme:
one embodiment of the present invention provides an end-to-end medical image privacy data elimination system, which includes:
the watermark information acquisition module is used for taking a sequence formed by coding results of all privacy data of the medical image according to the sequence as a watermark information sequence;
the medical image dividing module is used for dividing the medical image to obtain all plaintext subsequences;
the matrix construction module is used for constructing a matrix to be embedded of a plaintext subsequence according to the plaintext subsequence, acquiring a first attribute value and a second attribute value of each pixel point in the plaintext subsequence according to a bit division method, and recording a matrix formed by arranging the first attribute values and the second attribute values of all the pixel points in the plaintext subsequence as an attribute matrix of the plaintext subsequence according to a scanning sequence; constructing a key matrix;
the watermark information embedding module is used for acquiring the watermark information of the plaintext subsequence for any plaintext subsequence, and acquiring the attribute information of the plaintext subsequence according to the key matrix, the to-be-embedded matrix of the plaintext subsequence and the attribute matrix; if the difference value of the decimal numbers corresponding to the attribute information of the plaintext subsequence and the watermark information of the plaintext subsequence is not equal to 0, constructing an embedding rule equation, obtaining all embedding sets which enable the embedding rule equation to be established, calculating the preference degrees of the embedding sets, and taking any embedding set with the maximum preference degree and the minimum element number as an optimal embedding set;
and carrying out inversion operation on elements belonging to the optimal embedding set in the matrix to be embedded of the plaintext subsequence, wherein the inversion operation specifically comprises the following steps: inverting the bit in the binary number into another digital number; taking the new matrix to be embedded after the inversion operation as an embedded matrix of the plaintext subsequences, replacing the last two bit positions in binary numbers corresponding to all pixel points in each plaintext subsequence by the embedded matrix of each plaintext subsequence, and recording the replaced plaintext subsequences as watermark plaintext subsequences; and recording an image formed by arranging all watermark plaintext subsequences according to the scanning sequence as an embedded medical image, so as to eliminate the privacy data of the medical image.
Further, the dividing of the medical image to obtain all plaintext subsequences includes the following specific steps:
and recording a one-dimensional sequence formed by arranging all pixel points in the medical image according to a scanning sequence as a plaintext sequence, and dividing the plaintext sequence into a plurality of subsequences with the length equal to a first preset length and recording the subsequences as plaintext subsequences.
Further, the method for constructing the matrix to be embedded of the plaintext subsequence according to the plaintext subsequence comprises the following specific steps:
the gray value of each pixel point corresponds to a binary number, and the binary number has 8 bits, which are respectively
(ii) a For any plaintext subsequence, the lower two bit positions in binary numbers corresponding to all pixel points in the plaintext subsequence
And
in the scanning order of a size of
The matrix is marked as a matrix to be embedded of the plaintext subsequence; where s represents the first number.
Further, the obtaining of the first attribute value and the second attribute value of each pixel point in the plaintext subsequence according to the bit division method includes the following specific steps:
the bit division method comprises the following steps: corresponding pixel points in the first 6 bits of the binary number
、
And
divided into a first set of the first 6 bits
、
And
dividing into a second set;
obtaining first sequences and second sequences of all types according to the first set and the second set;
for any plaintext subsequence, obtaining a first attribute value and a second attribute value of a 1 st pixel point in the plaintext subsequence according to a first type first sequence and a first type second sequence, comprising: dividing the first 6 bits of binary number corresponding to the 1 st pixel point in the plaintext subsequence into a first set and a second set according to a bit division method, arranging all elements in the first set of the 1 st pixel point according to the sequence of the first type first sequence to obtain a first type first sequence of the 1 st pixel point, and obtaining a first attribute value of the 1 st pixel point according to the first type first sequence
, wherein ,
the 1 st element in the type 1 first sequence representing the 1 st pixel,
the 2 nd element in the type 1 first sequence representing the 1 st pixel,
the 3 rd element in the type 1 first sequence representing the 1 st pixel,
the method is used for converting binary numbers into decimal numbers, and specifically comprises the following steps:
(ii) a Arranging all elements in the second set of the 1 st pixel point according to the sequence of the first-type second sequence to obtain the first-type second sequence of the 1 st pixel pointObtaining the second attribute value of the 1 st pixel point according to the first type second sequence
, wherein ,
the 1 st element in the type one second sequence representing the 1 st pixel,
the 2 nd element in the type 1 second sequence representing the 1 st pixel,
the 3 rd element in the type one second sequence representing the 1 st pixel,
the method represents binary number converted into decimal number, and specifically comprises the following steps:
；
similarly, for any plaintext subsequence, according to the type-II first sequence and the type-II second sequence, obtaining a first attribute value and a second attribute value of the 2 nd pixel point in the plaintext subsequence; according to the third-type first sequence and the third-type second sequence, a first attribute value and a second attribute value of a 3 rd pixel point in a plaintext subsequence are obtained; according to the fourth type first sequence and the fourth type second sequence, a first attribute value and a second attribute value of a 4 th pixel point in a plaintext subsequence are obtained; according to the fifth type first sequence and the fifth type second sequence, a first attribute value and a second attribute value of a 5 th pixel point in a plaintext subsequence are obtained; according to the sixth type first sequence and the sixth type second sequence, a first attribute value and a second attribute value of a 6 th pixel point in a plaintext subsequence are obtained; according to the first type first sequence and the first type second sequence, a first attribute value and a second attribute value of a 7 th pixel point in a plaintext subsequence are obtained; and obtaining a first attribute value and a second attribute value of the 8 th pixel point in the plaintext subsequence according to the type-I first sequence and the type-I second sequence.
Further, the obtaining of the first sequences and the second sequences of all types according to the first set and the second set includes the following specific steps:
randomly ordering the elements in the first set to obtain a first sequence, wherein the first sequence meeting the condition has 6 types, and the method comprises the following steps: a first sequence of type I
Second type first sequence
Type III first sequence
Fourth type first sequence
Fifth type first sequence
First sequence of type six
；
Randomly ordering the elements in the second set to obtain a second sequence, wherein the second sequence meeting the condition has 6 types, and the method comprises the following steps: type one second sequence
Second sequence of type II
Second sequence of type III
Second sequence of type IV
Second sequence of type V
Second sequence of type six
。
Further, the key matrix construction includes the following specific steps:
marking '0' as a first number and marking '1' as a second number; construct a size of
The binary matrix of (2) is recorded as a key matrix, and the number of elements belonging to the first code and the number of elements belonging to the second code in the key matrix are required to be the same.
Further, the acquiring the watermark information of the plaintext subsequence includes the following specific steps:
for the jth plaintext subsequence, the jth plaintext subsequence in the watermark information sequence
An element, the first
An element and the second
Element as watermark information of jth plaintext subsequence
L represents the length of the watermark information sequence,
representing the division remainder.
Further, the obtaining of the attribute information of the plaintext subsequence comprises the following specific steps:
the calculation formula of the attribute information of the jth plaintext subsequence is as follows:
in the formula ,
attribute information indicating the jth plaintext sub-sequence,
the sign of the sum of the matrices is represented,
a matrix to be embedded representing the jth plaintext sub-sequence,
which represents an exclusive-or operation, and,
a key matrix representing the jth plaintext sub-sequence,
it is shown that the operation of dot-product,
an attribute matrix representing the jth plaintext sub-sequence,
representing the division residue, r represents the length of the watermark information of the plaintext subsequence.
Further, the building of the embedded rule equation includes the following specific steps:
recording the result of the XOR operation of the matrix to be embedded and the key matrix as an intermediate matrix, wherein the formula of the embedding rule equation is as follows:
wherein ,
the number of inverted elements in the matrix to be embedded representing the jth plaintext subsequence,
attribute matrix for representing sub-sequence in j-th plain text
Of the j-th plaintext subsequence, has the same position as the k-th inverted element in the matrix to be embedded,
indicating the coefficient corresponding to the element with the same position as the k-th reversal element in the matrix to be embedded of the j-th plaintext subsequence in the intermediate matrix of the j-th plaintext subsequence, wherein if the element is the first code, the corresponding coefficient is
=1, if the element is the second number, the corresponding coefficient is
=-1。
Further, the calculating of the preference of the embedded set includes the following specific steps:
the calculation formula of the preference of the embedding set is as follows:
wherein ,
a preference degree of the embedding set is represented,
the number of elements representing the sum of the row and column numbers of the elements in the embedding set in the matrix to be embedded as an odd number,
the number of elements representing the sum of the row and column numbers of the elements in the embedding set in the matrix to be embedded is even.
The technical scheme of the invention has the beneficial effects that:
1. according to the method for eliminating the privacy data, the privacy data of the medical image are used as the watermark information and are embedded into the medical image, compared with the method for completely eliminating the privacy data in the medical image, the method for eliminating the privacy data can ensure that when a diagnosis result of a specific patient needs to be given according to the medical image, the specific patient can be determined by extracting the watermark information hidden in the medical image, and meanwhile, whether the medical image is tampered or not can be judged by comparing the difference between the extracted watermark information and the original watermark information, so that the safety of the medical image is ensured.
2. The medical image is divided to obtain all plaintext subsequences, a matrix to be embedded and an attribute matrix of the plaintext subsequences are constructed, the matrix to be embedded of the plaintext subsequences is operated by combining a key matrix and the attribute matrix to obtain attribute information of the plaintext subsequences, and partial elements of the plaintext subsequences to be embedded in the matrix are inverted to enable the attribute information of the plaintext subsequences to be equal to decimal numbers corresponding to watermark information of the plaintext subsequences, so that the watermark information is embedded. Compared with the conventional watermark embedding method based on asymmetric histogram translation, in the method for embedding watermark information, each plaintext subsequence can be embedded with 3 bits of watermark information, but local similarity and strong correlation characteristics of medical images are not excessively depended on, and watermark information embedding amount of all medical images is ensured; meanwhile, in the method for embedding the watermark information, the watermark information is embedded according to the attribute information of the whole plaintext subsequence, so that not only is a smooth area in the medical image protected, but also the safety of the whole plaintext subsequence can be ensured, and further the safety of the whole medical image is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a system diagram of an end-to-end medical image privacy data elimination system according to the present invention;
FIG. 2 is a schematic view of a medical image provided by the present invention;
fig. 3 is a first set, a second set, a first attribute value and a second attribute value of all pixel points in a 30 th plaintext subsequence provided by the present invention;
fig. 4 is a prediction error histogram of a medical image schematic diagram provided by the present invention.
Detailed Description
To further illustrate the technical means and effects of the present invention for achieving the predetermined objects, the following detailed description of an end-to-end medical image privacy data elimination system according to the present invention, its specific implementation, structure, features and effects will be described in detail with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" refers to not necessarily the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
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 describes a specific scheme of an end-to-end medical image privacy data elimination system provided by the present invention in detail with reference to the accompanying drawings.
Referring to fig. 1, a system for eliminating end-to-end medical image privacy data according to an embodiment of the present invention is shown, where the system includes the following modules:
the watermark information obtaining module S101 is configured to convert the private data of the medical image into a watermark information sequence.
It should be noted that, in the embodiment, the private data of the medical image is converted into the watermark information, and the watermark information is hidden in the medical image, so that the private data of the medical image is eliminated; since the conventional watermark information is binary information, it is necessary to convert the private data of the medical image into binary information and use the binary information as the watermark information.
The privacy data in the medical image includes patient privacy data such as image number, examination number, name, sex, age, examination part, etc.; therefore, the private data of the medical image includes chinese characters, english letters, arabic numbers, and various symbols, and in this embodiment, the private data is encoded in a GB2312 encoding manner, each private data is encoded into 2 bytes, that is, 16 bits, in the GB2312 encoding manner, a sequence formed by encoding results of all the private data of the medical image in order is recorded as a watermark information sequence, and the length of the watermark information sequence is L.
For example, the privacy data of a certain medical image is: image number: ACC00405, check No.: PID00405, name: test 1, gender: male, age: 40Y, examination site: a chest; <xnotran> , {1,1,0,1,0,0,1,1,1,0, …,1,0,1,0,1,1,1,1,1,1}. </xnotran>
According to the invention, the private data is embedded into the medical image as the watermark information instead of completely removing the private data in the medical image, and when a specific patient diagnosis result is required according to the medical image, the specific patient can be determined by extracting the watermark information hidden in the medical image.
The medical image dividing module S102 is configured to divide the medical image to obtain all plaintext subsequences.
Recording a one-dimensional sequence formed by arranging all pixel points in the medical image according to a scanning sequence as a plaintext sequence, dividing the plaintext sequence into a plurality of subsequences with the length equal to a first length, and recording the subsequences as plaintext subsequences, wherein the scanning sequence refers to a Zigzag scanning sequence, the first length s =8, and if the length of the last subsequence is smaller than the first length, the last subsequence is not operated.
For example, the medical image schematic diagram shown in FIG. 2 is divided, and the 30 th plaintext subsequence obtained is {198,200,197,199,203,205,200,171}.
The gray value of each pixel point can be converted into binary number, and the binary number has 8 bits, respectively
Wherein, the 8 th bit
Is the highest bit, and decreases from left to rightLow, 1 st bit
Is the lowest bit. The binary number corresponding to the pixel point is a number represented by two numbers, namely 0 and 1,0 is denoted as a first number, 1 is denoted as a second number, and each bit in the binary number can only be one of the first number or the second number.
And the matrix construction module S103 is used for constructing a matrix to be embedded and an attribute matrix of the plaintext subsequence and constructing a key matrix.
In this embodiment, an inversion operation is performed on a bit in a binary number corresponding to a pixel point, where the inversion operation specifically includes: the bit in the binary number is inverted into another digital code, and the higher the bit is inverted, the larger the change amount of the gray value of the pixel point is. For example, the binary number corresponding to the pixel point with the grayscale value of 170 is 10101010, the highest bit in the binary number 10101010 is the first number, and after the highest bit in the binary number 10101010 is inverted, the highest bit in the binary number 10101010 becomes the second number, that is, the binary number becomes 00101010, the grayscale value of the pixel point becomes 42, and the change amount of the grayscale value of the pixel point is 128; if the lowest bit in the binary number 10101010 is the second number, the lowest bit in the binary number 10101010 is inverted, the lowest bit in the binary number 10101010 becomes the first number, the binary number becomes 10101011, the gray level of the pixel becomes 171, and the change amount of the gray level of the pixel is 1.
And constructing a matrix to be embedded of the plaintext subsequence according to the lower bit of the plaintext subsequence.
It should be noted that, in this embodiment, the bit in the binary number corresponding to the pixel point is inverted, so as to embed the watermark information, and after the bit with the higher number is inverted, the larger the change amount of the gray value of the pixel point is, the larger the change of the pixel point is, the more easily the pixel point is perceived by human eyes; in order to ensure that the quality of the medical image after embedding the watermark information conforms to the visual effect of human eyes, the embodiment only performs the inversion operation on the lower bit in the binary number corresponding to the pixel point, and ensures that the quality of the medical image conforms to the visual effect of human eyes while embedding the watermark information. Therefore, in this embodiment, the to-be-embedded matrix of the plaintext subsequence is constructed according to the lower bit of the plaintext subsequence, and the lower bit of the to-be-embedded matrix of the plaintext subsequence is inverted, so that the embedding of the watermark information is realized, and the quality of the medical image is ensured to conform to the visual effect of human eyes.
In this embodiment, for any plaintext subsequence, the lower two bits of binary numbers corresponding to all pixel points in the plaintext subsequence are used
And
in the order of scanning, are composed of
The matrix is marked as a matrix to be embedded of the plaintext subsequence; wherein s represents a first number; in this embodiment, the size of the matrix to be embedded of the plaintext subsequence is 4 × 4.
For example, the 30 th plaintext subsequence 198,200,197,199,203,205,200,171 has a matrix to be embedded of
。
And constructing an attribute matrix of the plaintext subsequence according to the higher bit of the plaintext subsequence.
It should be noted that, in this embodiment, according to the lower bit of the plaintext subsequence, a to-be-embedded matrix of the plaintext subsequence is constructed, so as to perform a reverse operation, and implement embedding of watermark information; the attribute matrix is used for determining the reversal bit position to be embedded in the matrix, and the attribute matrix is not changed before and after the watermark information is embedded, so that the attribute matrix is constructed according to the higher bit position of the plaintext subsequence when the attribute matrix of the plaintext subsequence is constructed. The attribute matrix is used for determining inversion bits (which bits are subjected to inversion operation) to be embedded into the matrix, and the smaller the number of the inversion bits is, the fewer modified pixel points are when the same number of watermark information is embedded, so that the quality of the corresponding medical image is better; therefore, to realize that more watermark information can be embedded by performing inversion operation on fewer inversion bits (modifying fewer pixels), it is necessary to make the elements in the attribute matrix have diversity.
It should be further noted that, considering that the medical image has strong local similarity, that is, the difference of the gray values of the adjacent pixel points is small, and the binary number corresponding to the pixel point with the small difference of the gray values is specifically represented as: the difference of the gray values is smaller, the higher bit in the binary number is more likely to be the same, and the lower bit in the binary number is more likely to be different; and the attribute matrix of the plaintext subsequence is constructed according to the higher bit of the binary number corresponding to the pixel point of the plaintext subsequence, so that if the higher bit of the binary number corresponding to all the pixel points in the plaintext subsequence is obtained according to the same dividing method and arrangement sequence, the higher bit in the binary number is more likely to be the same, the more likely the obtained first attribute value and second attribute value of all the pixel points are to be the same, and the diversity of elements in the attribute matrix constructed according to the first attribute value and the second attribute value is worse. Therefore, in order to implement the element diversity of the attribute matrix of the plaintext subsequence, it is necessary to mix and divide a relatively higher bit and a relatively lower bit of the plurality of higher bits, and to scramble the bits divided together, so that the relatively higher bits that may be the same and the relatively lower bits that may not be the same are mixed together, and the corresponding first attribute value and second attribute value are obtained for the higher bits of the binary number corresponding to all the pixel points in the plaintext subsequence according to different division methods and arrangement orders, thereby implementing the element diversity of the attribute matrix of the plaintext subsequence.
In this embodiment, the bit division method includes: in the first 6 bits of the binary number corresponding to the pixel points
、
And
dividing into a first set of the first 6 bits
、
And
into a second set.
Randomly ordering the elements in the first set to obtain a first sequence, wherein the first sequence meeting the condition has 6 types, and the method comprises the following steps: a first sequence of type I
Second type first sequence
First sequence of type III
Fourth type first sequence
Fifth type first sequence
First sequence of type VI
。
Randomly ordering the elements in the second set to obtain a second sequence, wherein the second sequence meeting the condition has 6 types, and the method comprises the following steps: type one second sequence
Second sequence of type II
Second sequence of type III
Second sequence of type IV
Second sequence of type V
Second sequence of type six
。
For any plaintext subsequence, obtaining a first attribute value and a second attribute value of a 1 st pixel point in the plaintext subsequence according to a first type first sequence and a first type second sequence, comprising: dividing the first 6 bits of binary number corresponding to the 1 st pixel point in the plaintext subsequence into a first set and a second set according to a bit division method, arranging all elements in the first set of the 1 st pixel point according to the sequence of the first type first sequence to obtain a first type first sequence of the 1 st pixel point, and obtaining a first attribute value of the 1 st pixel point according to the first type first sequence
, wherein ,
the 1 st element in the type 1 first sequence representing the 1 st pixel,
the 2 nd element in the type 1 first sequence representing the 1 st pixel,
the 3 rd element in the type 1 first sequence representing the 1 st pixel,
the method represents binary number converted into decimal number, and specifically comprises the following steps:
(ii) a Arranging all elements in the second set of the 1 st pixel point according to the sequence of the type-one second sequence to obtain the type-one second sequence of the 1 st pixel point, and obtaining the second attribute value of the 1 st pixel point according to the type-one second sequence
, wherein ,
the 1 st element in the type one second sequence representing the 1 st pixel,
the 2 nd element in the type 1 second sequence representing the 1 st pixel,
the 3 rd element in the type 1 second sequence representing the 1 st pixel,
the method is used for converting binary numbers into decimal numbers, and specifically comprises the following steps:
。
similarly, for any plaintext subsequence, according to the type-II first sequence and the type-II second sequence, obtaining a first attribute value and a second attribute value of the 2 nd pixel point in the plaintext subsequence; according to the third-type first sequence and the third-type second sequence, a first attribute value and a second attribute value of a 3 rd pixel point in a plaintext subsequence are obtained; according to the fourth type first sequence and the fourth type second sequence, a first attribute value and a second attribute value of a 4 th pixel point in a plaintext subsequence are obtained; according to the fifth type first sequence and the fifth type second sequence, a first attribute value and a second attribute value of a 5 th pixel point in a plaintext subsequence are obtained; according to the sixth-type first sequence and the sixth-type second sequence, a first attribute value and a second attribute value of a 6 th pixel point in the plaintext subsequence are obtained; according to the first type first sequence and the first type second sequence, a first attribute value and a second attribute value of a 7 th pixel point in a plaintext subsequence are obtained; and obtaining a first attribute value and a second attribute value of the 8 th pixel point in the plaintext subsequence according to the type-I first sequence and the type-I second sequence.
For any plaintext subsequence, arranging the first attribute values and the second attribute values of all pixel points in the plaintext subsequence according to a scanning sequence to form a plaintext subsequence with a size of
The matrix is marked as an attribute matrix of the plaintext subsequence; wherein s represents a first number; in the present embodiment, the size of the attribute matrix of the plaintext subsequence is 4 × 4.
For example, if the first set of 1 st pixel in the 30 th plaintext subsequence {198,200,197,199,203,205,200,171} is {1, 0} and the second set is {1,0,1}, then the first attribute value of the 1 st pixel is
=4, second attribute value
=5, in the 30 th plaintext subsequence {198,200,197,199,203,205,200,171}, the first set, the second set, the first attribute value, and the second attribute value of all pixel points are as shown in fig. 3; the attribute matrix of the 30 th plaintext subsequence is
。
A key matrix is constructed.
Construct a size of
The binary matrix of (2) is recorded as a key matrix, and the number of elements belonging to the first number and the number of elements belonging to the second number in the key matrix are required to be the same; it should be noted that all plaintext subsequences share the same key matrix.
For example, the present embodiment provides a key matrix of
。
And the watermark information embedding module S104 is used for embedding the watermark information of the plaintext subsequence into the plaintext subsequence to obtain a watermark plaintext subsequence.
It should be noted that, the conventional watermark embedding method for the grayscale image is implemented based on a prediction error histogram, the embedding amount of the watermark depends on the frequency of the prediction error with the largest frequency, and each pixel point can only embed one bit of watermark information, so the embedding amount of the watermark is limited; meanwhile, because the image has local similarity and strong correlation, the prediction error with the largest frequency is usually 0, the place where the prediction error is 0 is a smooth area in the image, and the texture area of the image is the important information position of the image, which means that the reversible information hiding method based on the prediction error histogram cannot protect the important texture area in the image. In this embodiment, the attribute information of the plaintext subsequence is obtained, and the attribute information of the plaintext subsequence is made to be equal to the decimal number corresponding to the watermark information of the plaintext subsequence by performing inversion operation on part of elements of the plaintext subsequence to be embedded in the matrix, so as to realize embedding of the watermark information; when the watermark information is extracted, the attribute information of the plaintext subsequence is obtained according to a calculation formula, namely the watermark information is obtained.
It should be further noted that, because the attribute matrix is formed by the first attribute value and the second attribute value of the pixel point, and both the first attribute value and the second attribute value of the pixel point are 3-bit binary numbers, the attribute matrix is used to determine the inversion bit (which bit is subjected to the inversion operation) to be embedded into the matrix, therefore, it is required that the length of the watermark information embedded into each plaintext subsequence is the same as the number of bits of the binary number corresponding to the element in the attribute matrix by performing the inversion operation on the inversion bit of one bit to realize embedding of the watermark information into the plaintext subsequence.
In this embodiment, the length of watermark information embedded per plaintext sub-sequence
And s represents a first number of,
represents rounding down; for the jth plaintext subsequence, the jth plaintext subsequence in the watermark information sequence
An element, the first
An element and the second
Element as watermark information of jth plaintext subsequence
L represents the length of the watermark information sequence,
representing the division remainder.
For example, the watermark information of the 30 th plaintext sub-sequence is 110.
And calculating the attribute information of the plaintext subsequence according to the matrix to be embedded, the attribute matrix and the key matrix.
in the formula ,
representing attribute information of the jth plaintext sub-sequence,
representing the matrix summation symbol (sum of all elements in the matrix),
a matrix to be embedded representing the jth plaintext sub-sequence,
which represents an exclusive-or operation, and,
a key matrix representing the jth plaintext sub-sequence,
it is shown that the operation of dot-product,
an attribute matrix representing the jth plaintext sub-sequence,
and (3) representing division remainder, r representing the length of the watermark information of the plaintext subsequence, and recording the result (a binary matrix) of the XOR operation of the matrix to be embedded and the key matrix as an intermediate matrix.
For example, the result of the exclusive-or operation of the matrix to be embedded of the 30 th plaintext subsequence and the key matrix, i.e., the intermediate matrix of the 30 th plaintext subsequence is
The attribute information of the plaintext sub-sequence of the 30 th plaintext sub-sequence is
=(4+5+4+3+6+5+5+7+5)
8=44
8=4。
It should be noted that, the idea of embedding the watermark information in this embodiment is to perform inversion operation on part of elements of the plaintext subsequence to be embedded in the matrix, so that the attribute information of the plaintext subsequence is equal to the decimal number corresponding to the watermark information of the plaintext subsequence, and thus the watermark information is embedded; when the watermark information is extracted, the attribute information of the plaintext subsequence is obtained according to a calculation formula, namely the watermark information is obtained. The attribute information of the plaintext subsequence is equal to the decimal number corresponding to the watermark information of the plaintext subsequence, and a reversal operation needs to be performed on part of elements of the plaintext subsequence to be embedded in the matrix, so that the variation of the attribute information of the plaintext subsequence is equal to the difference between the attribute information of the plaintext subsequence and the decimal number corresponding to the watermark information of the plaintext subsequence, and therefore, the process of performing watermark embedding on the plaintext subsequence in the embodiment is as follows:
computing property information of plaintext subsequences
Decimal number corresponding to watermark information of plaintext subsequence
Difference of (2)
，
(ii) a If the difference value is not equal to
The watermark information can be embedded without inversion operation; if the difference is not the same
Constructing an embedded rule equation, which specifically comprises the following steps:
wherein ,
the number of inverted elements in the matrix to be embedded representing the jth plaintext sub-sequence,
attribute matrix for representing the jth plaintext sub-sequence
Of the j-th plaintext subsequence, has the same position as the k-th inverted element in the matrix to be embedded,
is shown in the j-th plaintext subsequenceIn the middle matrix of the column, the coefficient corresponding to the element with the same position as the k-th reversal element in the matrix to be embedded of the j-th plaintext subsequence is obtained, wherein if the element is the first code, the corresponding coefficient is
=1, if the element is the second number, the corresponding coefficient is
=-1。
And obtaining all embedding sets which enable the embedding rule equation to be established, wherein the embedding sets are sets formed by all inversion elements in the matrix to be embedded of the jth plaintext subsequence when the embedding rule equation is established.
Calculating the preference degrees of all the embedding sets, wherein the calculation formula of the preference degrees of the embedding sets is as follows:
wherein ,
a preference degree of the embedding set is represented,
representing the number of elements in the embedding set whose sum of the row number and the column number in the matrix to be embedded is odd,
the number of elements representing the sum of the row and column numbers of the elements in the embedding set in the matrix to be embedded is even.
In the matrix to be embedded, the element with odd row number and column number is the lowest bit in the binary number corresponding to the pixel point
For the lowest bit in the binary number
After the inversion operation is carried out, the change amount of the gray value of the pixel point is 1; the element with even number as the sum of row number and column number is the lower bit in the binary number corresponding to the pixel point
For bits in a binary number
After the inversion operation, the change amount of the gray value of the pixel point is 2. After the inversion operation is performed on the higher bit, the larger the change amount of the gray value of the pixel point is, in order to ensure that the quality of the medical image after the watermark information is embedded conforms to the visual effect of human eyes, the embodiment performs the inversion operation on all the inversion elements in the embedded set
And measuring the preference degree of the embedding set, wherein the smaller the change amount of all the reversal elements in the embedding set is, the greater the preference degree of the embedding set is, and reversing operation is performed on the reversal elements in the plaintext subsequence according to the embedding set with the greater preference degree, so that the embedding of the watermark information is realized, and meanwhile, the quality of the medical image is ensured to be in accordance with the visual effect of human eyes.
Randomly selecting an embedding set with the maximum preference degree and the minimum element number as an optimal embedding set; and carrying out inversion operation on elements belonging to the optimal embedding set in the matrix to be embedded of the jth plaintext subsequence, and using a new matrix to be embedded after the inversion operation as an embedded matrix of the jth plaintext subsequence to realize the embedding of the watermark information of the jth plaintext subsequence.
For example, attribute information of plaintext subsequence of 30 th plaintext subsequence
=4 decimal number corresponding to watermark information of plaintext sub-sequence
Difference value of =6
= 2, all the embedding sets for which the embedding rule equation holds are obtained, and there are 3 embedding sets, which are: the embedding set { (2, 4) }, the embedding set { (3, 2) }, the embedding set { (1, 3) and (1, 1) }, wherein the embedding set { (2, 4) } represents that the embedding of the watermark information of the 30 th plaintext subsequence can be realized only by inverting the elements of the 2 nd row and the 4 th column in the matrix to be embedded of the 30 th plaintext subsequence; the embedding set { (1, 3), (1, 1) } indicates that the element of the 1 st row and the 3 rd column and the element of the 1 st row and the 1 st column in the matrix to be embedded in the 30 th plaintext subsequence need to be inverted, so that the embedding of the watermark information of the 30 th plaintext subsequence can be realized; preference of embedding set { (2, 4) }
=0.5, preference of embedding set { (3, 2) }
=1, embedding preference of set { (1, 3), (1, 1) }
=0.25, therefore, the optimal embedding set for the 30 th plaintext sub-sequence is the embedding set { (3, 2) }; performing inversion operation on elements (namely elements in a 3 rd row and a 2 nd column) belonging to the optimal embedding set in the matrix to be embedded of the 30 th plaintext subsequence, and performing inversion operation on a new matrix to be embedded after the inversion operation
Embedding watermark information of the 30 th plaintext subsequence is realized as an embedded matrix of the 30 th plaintext subsequence.
According to the scanning sequence, replacing the lower two bit positions in the binary number corresponding to all the pixel points in the jth plaintext subsequence by the embedded matrix of the jth plaintext subsequence
And
and recording the replaced plaintext subsequence as a watermark plaintext subsequence.
And (3) recording the image with the size of M multiplied by N formed by arranging all watermark plaintext subsequences according to the scanning sequence as the embedded medical image, thereby realizing the elimination of the privacy data of the medical image.
For example, according to the scanning order, the embedded matrix of 30 plaintext subsequences is substituted for the lower two bits in the binary number corresponding to all the pixel points in the 30 th plaintext subsequence
And
the obtained watermark plaintext subsequences are 198,200,197,199,202,205,200, 171.
It should be noted that, for the medical image shown in fig. 2, the size of the medical image is M × N =400 × 500, the prediction error histogram of the obtained medical image is shown in fig. 4, and in the conventional asymmetric histogram shift-based watermark embedding method, the embedding amount of the watermark depends on the frequency of the prediction error with the largest frequency, so that, in the conventional asymmetric histogram shift-based watermark embedding method, the embedding amount of the watermark is 25730, in the watermark information embedding method of the present embodiment, each plaintext subsequence with the length of s can be embedded with watermark information with the length of r =3, and in the watermark information embedding method of the present embodiment, the embedding amount of the watermark is M × N =400 × 500
=75000, and therefore, the embedding amount of the watermark information embedding method of the present embodiment is larger, and s =8 represents the first number.
The conventional watermark embedding method of the gray level image is realized based on a prediction error histogram, the embedding amount of the watermark depends on the frequency of the maximum prediction error, and each pixel point can only be embedded with one bit of watermark information, so the embedding amount of the watermark is limited; meanwhile, because an image has local similarity and strong correlation, the prediction error with the largest frequency is usually 0, the place where the prediction error is 0 is a smooth region in the image, and a texture region of the image is an important information position of the image, which means that the reversible information hiding method based on the prediction error histogram cannot protect an important texture region in the image. In the embodiment, all plaintext subsequences are obtained by dividing medical images, a matrix to be embedded and an attribute matrix of the plaintext subsequences are constructed, the matrix to be embedded of the plaintext subsequences is operated by combining a key matrix and an attribute matrix to obtain attribute information of the plaintext subsequences, and partial elements in the matrix to be embedded of the plaintext subsequences are inverted to make the attribute information of the plaintext subsequences equal to decimal numbers corresponding to watermark information of the plaintext subsequences, so that the watermark information is embedded; when the watermark information is extracted, the attribute information of the plaintext subsequence is obtained according to a calculation formula, namely the watermark information is obtained. According to the method for embedding the watermark information, each plaintext subsequence can be embedded with a certain number of bits of watermark information, the number of the embedded watermark information is guaranteed without depending on local similarity and strong correlation characteristics of the medical image, and meanwhile, in the method for embedding the watermark information, the watermark information is embedded according to attribute information of the whole plaintext subsequence, so that the safety of the whole plaintext subsequence can be guaranteed, and the safety of the whole medical image is further guaranteed.
The system comprises a watermark information acquisition module, a medical image dividing module, a matrix construction module and a watermark information embedding module, and compared with the method for completely removing the private data in the medical image, the method for removing the private data can ensure that when a specific patient diagnosis result is given according to the medical image, the specific patient can be determined by extracting the hidden watermark information in the medical image, and meanwhile, whether the medical image is tampered or not can be judged by comparing the difference between the extracted watermark information and the original watermark information, so that the safety of the medical image is ensured. The medical image is divided to obtain all plaintext subsequences, a matrix to be embedded and an attribute matrix of the plaintext subsequences are constructed, the matrix to be embedded of the plaintext subsequences is operated by combining a key matrix and the attribute matrix to obtain attribute information of the plaintext subsequences, and partial elements of the plaintext subsequences to be embedded in the matrix are inverted to enable the attribute information of the plaintext subsequences to be equal to decimal numbers corresponding to watermark information of the plaintext subsequences, so that the watermark information is embedded. Compared with the conventional watermark embedding method based on asymmetric histogram translation, in the method for embedding watermark information, each plaintext subsequence can be embedded with 3 bits of watermark information, but local similarity and strong correlation characteristics of medical images are not excessively depended on, and watermark information embedding amount of all medical images is ensured; meanwhile, in the method for embedding the watermark information, the watermark information is embedded according to the attribute information of the whole plaintext subsequence, so that not only is a smooth area in the medical image protected, but also the safety of the whole plaintext subsequence can be ensured, and further the safety of the whole medical image is ensured.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (10)
1. An end-to-end medical image privacy data elimination system, the system comprising:
the watermark information acquisition module is used for taking a sequence formed by coding results of all privacy data of the medical image according to a sequence as a watermark information sequence;
the medical image dividing module is used for dividing the medical image to obtain all plaintext subsequences;
the matrix construction module is used for constructing a matrix to be embedded of a plaintext subsequence according to the plaintext subsequence, acquiring a first attribute value and a second attribute value of each pixel point in the plaintext subsequence according to a bit division method, and recording a matrix formed by arranging the first attribute values and the second attribute values of all the pixel points in the plaintext subsequence as an attribute matrix of the plaintext subsequence according to a scanning sequence; constructing a key matrix;
the watermark information embedding module is used for acquiring the watermark information of any plaintext subsequence, and acquiring the attribute information of the plaintext subsequence according to the key matrix, the matrix to be embedded of the plaintext subsequence and the attribute matrix; if the difference value of the decimal numbers corresponding to the attribute information of the plaintext subsequence and the watermark information of the plaintext subsequence is not equal to 0, constructing an embedding rule equation, obtaining all embedding sets which enable the embedding rule equation to be established, calculating the preference degrees of the embedding sets, and taking any embedding set with the maximum preference degree and the minimum element number as an optimal embedding set;
and carrying out inversion operation on elements belonging to the optimal embedding set in the matrix to be embedded of the plaintext subsequence, wherein the inversion operation specifically comprises the following steps: inverting the bit in the binary number into another digital code; taking the new matrix to be embedded after the inversion operation as an embedded matrix of the plaintext subsequences, replacing the last two bit positions in binary numbers corresponding to all pixel points in each plaintext subsequence by the embedded matrix of each plaintext subsequence, and recording the replaced plaintext subsequences as watermark plaintext subsequences; and recording an image formed by arranging all watermark plaintext subsequences according to the scanning sequence as an embedded medical image, so as to eliminate the privacy data of the medical image.
2. The system for eliminating end-to-end medical image private data according to claim 1, wherein the dividing of the medical image to obtain all plaintext subsequences comprises the following specific steps:
recording a one-dimensional sequence formed by arranging all pixel points in the medical image according to a scanning sequence as a plaintext sequence, dividing the plaintext sequence into a plurality of subsequences with the length equal to a first preset length, and recording the subsequences as plaintext subsequences.
3. The system for eliminating end-to-end medical image privacy data according to claim 1, wherein the construction of the to-be-embedded matrix of plaintext subsequences according to the plaintext subsequences comprises the following specific steps:
each imageThe gray value of the pixel point corresponds to a binary number, and the binary number has 8 bits, which are respectively
(ii) a For any plaintext subsequence, the lower two bits in the binary number corresponding to all pixel points in the plaintext subsequence are combined>
and />
Is formed in the scanning order with a magnitude of->
The matrix is marked as a matrix to be embedded of the plaintext subsequence; where s represents the first number.
4. An end-to-end medical image private data eliminating system according to claim 3, wherein the obtaining of the first attribute value and the second attribute value of each pixel point in the plaintext subsequence according to a bit division method comprises the following specific steps:
the bit division method comprises the following steps: in the first 6 bits of the binary number corresponding to the pixel points
、/>
and />
Dividing into a first set, based on ^ 6 bits before>
、/>
and />
Dividing into a second set;
obtaining first sequences and second sequences of all types according to the first set and the second set;
for any plaintext subsequence, obtaining a first attribute value and a second attribute value of a 1 st pixel point in the plaintext subsequence according to a first type first sequence and a first type second sequence, comprising: dividing the first 6 bits of the binary number corresponding to the 1 st pixel point in the plaintext subsequence into a first set and a second set according to a bit division method, arranging all elements in the first set of the 1 st pixel point according to the sequence of the first type first sequence to obtain a first type first sequence of the 1 st pixel point, and obtaining a first attribute value of the 1 st pixel point according to the first type first sequence
, wherein ,/>
The 1 st element in the first type sequence representing the 1 st pixel, is->
The 2 nd element in the first type sequence representing the 1 st pixel, <' > or>
The 3 rd element in the type 1 first sequence representing the 1 st pixel, device for combining or screening>
The method is used for converting binary numbers into decimal numbers, and specifically comprises the following steps:
(ii) a Arranging all elements in the second set of the 1 st pixel point according to the sequence of the type-one second sequence to obtain the type-one second sequence of the 1 st pixel point, and obtaining the type-one second sequence of the 1 st pixel point according to the type-one first sequenceThe second sequence obtains a second attribute value ^ of the 1 st pixel>
, wherein ,/>
The 1 st element in the type one second sequence representing the 1 st pixel, device for selecting or keeping>
The 2 nd element in the type 1 second sequence representing the 1 st pixel, device for selecting or keeping>
The 3 rd element in the type one second sequence representing the 1 st pixel, <' > or >>
The method is used for converting binary numbers into decimal numbers, and specifically comprises the following steps:
；
similarly, for any plaintext subsequence, according to the type-II first sequence and the type-II second sequence, obtaining a first attribute value and a second attribute value of the 2 nd pixel point in the plaintext subsequence; according to the third-type first sequence and the third-type second sequence, a first attribute value and a second attribute value of a 3 rd pixel point in a plaintext subsequence are obtained; according to the fourth type first sequence and the fourth type second sequence, a first attribute value and a second attribute value of a 4 th pixel point in a plaintext subsequence are obtained; according to the fifth type first sequence and the fifth type second sequence, a first attribute value and a second attribute value of a 5 th pixel point in a plaintext subsequence are obtained; according to the sixth-type first sequence and the sixth-type second sequence, a first attribute value and a second attribute value of a 6 th pixel point in the plaintext subsequence are obtained; according to the first type first sequence and the first type second sequence, a first attribute value and a second attribute value of a 7 th pixel point in a plaintext subsequence are obtained; and obtaining a first attribute value and a second attribute value of the 8 th pixel point in the plaintext subsequence according to the type-I first sequence and the type-I second sequence.
5. An end-to-end medical image privacy data elimination system according to claim 4, wherein the obtaining of the first sequence and the second sequence of all types from the first set and the second set comprises the following specific steps:
randomly ordering the elements in the first set to obtain a first sequence, wherein the first sequence meeting the condition has 6 types, and the method comprises the following steps: a first sequence of type I
Type II first sequence->
Type three first sequence->
Fourth type first sequence
Five type first sequence->
Type six first sequence->
；
Randomly ordering the elements in the second set to obtain a second sequence, wherein the second sequence meeting the condition has 6 types, and the method comprises the following steps: type one second sequence
II type second sequence>
Type three second sequence>
Second sequence of type IV
Fifth type second sequence->
Type six second sequence->
。
6. The system for eliminating privacy data of medical images from an end to end according to claim 1, wherein the key matrix construction comprises the following specific steps:
marking 0 as a first number and 1 as a second number; build a size of
The binary matrix of (2) is recorded as a key matrix, and the number of elements belonging to the first code and the number of elements belonging to the second code in the key matrix are required to be the same.
7. The system for eliminating end-to-end medical image private data according to claim 1, wherein the obtaining of the watermark information of the plaintext subsequence comprises the following specific steps:
for the jth plaintext subsequence, the jth plaintext subsequence in the watermark information sequence
Element number and/or number->
Individual element and a +>
Element as watermark information ≥ for the jth plaintext sub-sequence>
L denotes the length of the watermark information sequence, and>
representing the division remainder.
8. The system for eliminating privacy data of medical images according to claim 1, wherein the obtaining of the attribute information of the plaintext sub-sequence comprises the following steps:
the calculation formula of the attribute information of the jth plaintext subsequence is as follows:
in the formula ,
represents the attribute information of the jth plaintext subsequence, and->
Represents the sign of the sum of the matrices, is>
Represents the matrix to be embedded of the jth plaintext subsequence, and->
Represents an exclusive OR operation, <' > based on>
Key matrix representing the jth plaintext sub-sequence, in combination with a key value>
Represents a point multiplication operation, and>
an attribute matrix representing the jth plaintext sub-sequence, based on which the value of the plaintext sub-sequence is based on>
Representing the division residue, r represents the length of the watermark information of the plaintext subsequence.
9. An end-to-end system for eliminating privacy data of medical images as claimed in claim 1, wherein the construction of the rule-embedded equation comprises the following steps:
recording the result of the XOR operation of the matrix to be embedded and the key matrix as an intermediate matrix, wherein the formula of the embedding rule equation is as follows:
wherein ,
represents the number of inverted elements in the jth plaintext subsequence to be embedded in the matrix, and->
The attribute matrix represented at the jth plaintext sub-sequence +>
In that element which has the same position as the k-th inverted element in the to-be-embedded matrix of the jth plaintext subsequence, is present in the matrix, and/or is present in the matrix>
Representing in an intermediate matrix of a jth plaintext sub-sequence a coefficient corresponding to an element of the jth plaintext sub-sequence having the same position as the kth inverted element in the matrix to be embedded in, wherein, if the element is a first code, the corresponding coefficient is +>
=1, if the element is the second number, the corresponding coefficient is £ h>
=-1。
10. The system for eliminating privacy data of medical images from an end to end according to claim 1, wherein the calculating the preference of the embedded set comprises the following specific steps:
the calculation formula of the preference of the embedding set is as follows:
wherein ,
indicates the degree of preference of the embedded set, and>
represents the number of elements whose sum of the row and column numbers of the elements embedded in the set is odd in the matrix to be embedded, and/or the value of the element>
The number of elements representing the sum of the row and column numbers of the elements in the embedding set in the matrix to be embedded is an even number. />
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310231999.XA CN115952549B (en) | 2023-03-13 | 2023-03-13 | End-to-end medical image privacy data elimination system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310231999.XA CN115952549B (en) | 2023-03-13 | 2023-03-13 | End-to-end medical image privacy data elimination system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115952549A true CN115952549A (en) | 2023-04-11 |
| CN115952549B CN115952549B (en) | 2023-05-09 |
Family
ID=85896308
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310231999.XA Active CN115952549B (en) | 2023-03-13 | 2023-03-13 | End-to-end medical image privacy data elimination system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115952549B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117830204A (en) * | 2023-05-25 | 2024-04-05 | 浙江华舜电子科技有限公司 | Digital system is administered to fire control potential safety hazard |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080285793A1 (en) * | 2003-12-05 | 2008-11-20 | New Jersey Institute Of Technology | Methods and apparatus for lossless data hiding |
| CN104268824A (en) * | 2014-09-19 | 2015-01-07 | 柳州师范高等专科学校 | Self-adaptation reversible watermarking method used for medical image authentication and doctor-patient information hiding |
| CN107846530A (en) * | 2017-09-28 | 2018-03-27 | 四川长虹电器股份有限公司 | Digital watermarking algorithm |
| CN110211018A (en) * | 2019-06-12 | 2019-09-06 | 山东科技大学 | A kind of chaos encryption reversible information hidden method based on odd even identification tactic |
| CN110838908A (en) * | 2019-11-11 | 2020-02-25 | 陕西师范大学 | Image encryption and decryption method based on GF matrix transformation and random layered fusion |
| CN114666453A (en) * | 2022-03-29 | 2022-06-24 | 辽宁师范大学 | Separable ciphertext domain reversible data hiding method based on bit plane segmentation |
| CN115375524A (en) * | 2022-05-31 | 2022-11-22 | 辽宁师范大学 | Medical image zero-watermark method based on multi-feature-point and DNA encryption |
-
2023
- 2023-03-13 CN CN202310231999.XA patent/CN115952549B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080285793A1 (en) * | 2003-12-05 | 2008-11-20 | New Jersey Institute Of Technology | Methods and apparatus for lossless data hiding |
| CN104268824A (en) * | 2014-09-19 | 2015-01-07 | 柳州师范高等专科学校 | Self-adaptation reversible watermarking method used for medical image authentication and doctor-patient information hiding |
| CN107846530A (en) * | 2017-09-28 | 2018-03-27 | 四川长虹电器股份有限公司 | Digital watermarking algorithm |
| CN110211018A (en) * | 2019-06-12 | 2019-09-06 | 山东科技大学 | A kind of chaos encryption reversible information hidden method based on odd even identification tactic |
| CN110838908A (en) * | 2019-11-11 | 2020-02-25 | 陕西师范大学 | Image encryption and decryption method based on GF matrix transformation and random layered fusion |
| CN114666453A (en) * | 2022-03-29 | 2022-06-24 | 辽宁师范大学 | Separable ciphertext domain reversible data hiding method based on bit plane segmentation |
| CN115375524A (en) * | 2022-05-31 | 2022-11-22 | 辽宁师范大学 | Medical image zero-watermark method based on multi-feature-point and DNA encryption |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117830204A (en) * | 2023-05-25 | 2024-04-05 | 浙江华舜电子科技有限公司 | Digital system is administered to fire control potential safety hazard |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115952549B (en) | 2023-05-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Parah et al. | Electronic Health Record hiding in Images for smart city applications: A computationally efficient and reversible information hiding technique for secure communication | |
| Memon et al. | Hybrid watermarking of medical images for ROI authentication and recovery | |
| Luo et al. | A lossless data embedding scheme for medical images in application of e-diagnosis | |
| CN115952549B (en) | End-to-end medical image privacy data elimination system | |
| Sharma et al. | A novel resolution independent gradient edge predictor for lossless compression of medical image sequences | |
| Mathivanan et al. | QR code–based ECG signal encryption/decryption algorithm | |
| Liu et al. | Progressive (k, n) secret image sharing scheme with meaningful shadow images by GEMD and RGEMD | |
| CN113160944A (en) | Medical image sharing method based on block chain | |
| Zhang et al. | A high-capacity and reversible patient data hiding scheme for telemedicine | |
| Bai et al. | A data hiding scheme based on the difference of image interpolation algorithms | |
| Chen et al. | High-capacity separable reversible data-Hiding method in encrypted images based on block-level encryption and Huffman compression coding | |
| Yampolskiy et al. | Password protected visual cryptography via cellular automaton rule 30 | |
| Liu et al. | Hiding multiple images into a single image via joint compressive autoencoders | |
| Ahmed et al. | Robust hybrid watermarking for security of medical images in computer-aided diagnosis based telemedicine applications | |
| Rahim et al. | Exploiting de-noising convolutional neural networks DnCNNs for an efficient watermarking scheme: a case for information retrieval | |
| Baranwal et al. | YOLO-based ROI selection for joint encryption and compression of medical images with reconstruction through super-resolution network | |
| Li et al. | Reversible data hiding in encrypted image based on (7, 4) hamming code and unitsmooth detection | |
| Xintao et al. | Hide the image in fc-densenets to another image | |
| Rizzi et al. | Digital watermarking for healthcare: a survey of ECG watermarking methods in telemedicine | |
| Soni et al. | AFD and chaotic map‐based integrated approach for ECG compression, steganography and encryption in E‐healthcare paradigm | |
| Huang et al. | Reversible and high-capacity data hiding in high quality medical images | |
| Jung | Data hiding of digital images based on bit position and parity bit | |
| Jung et al. | Data hiding based on two-stage referencing for two-colour images | |
| Behura | Congruence of deep learning in biomedical engineering: Future prospects and challenges | |
| Mandal et al. | Variant of LSB steganography algorithm for hiding information in RGB images |
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 |