CN106952214A - Towards the digital watermark embedding and extracting method of remote sensing images SHP faces file - Google Patents
Towards the digital watermark embedding and extracting method of remote sensing images SHP faces file Download PDFInfo
- Publication number
- CN106952214A CN106952214A CN201710184765.9A CN201710184765A CN106952214A CN 106952214 A CN106952214 A CN 106952214A CN 201710184765 A CN201710184765 A CN 201710184765A CN 106952214 A CN106952214 A CN 106952214A
- Authority
- CN
- China
- Prior art keywords
- sequence
- watermark
- data
- coordinate
- watermark information
- 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
- 238000000034 method Methods 0.000 title claims abstract description 24
- 230000009466 transformation Effects 0.000 claims description 21
- 238000000605 extraction Methods 0.000 claims description 18
- 230000003252 repetitive effect Effects 0.000 claims description 10
- 230000008569 process Effects 0.000 claims description 7
- 239000000654 additive Substances 0.000 claims description 6
- 230000000996 additive effect Effects 0.000 claims description 6
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 238000003491 array Methods 0.000 claims description 3
- 239000011159 matrix material Substances 0.000 claims description 3
- 230000000737 periodic effect Effects 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 10
- 238000011161 development Methods 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 230000008570 general process Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 108090000765 processed proteins & peptides Proteins 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
- G06T1/0028—Adaptive watermarking, e.g. Human Visual System [HVS]-based watermarking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/106—Enforcing content protection by specific content processing
- G06F21/1063—Personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/16—Program or content traceability, e.g. by watermarking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Technology Law (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- General Engineering & Computer Science (AREA)
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a kind of digital watermark embedding and extracting method towards satellite remote-sensing image SHP faces file, belong to field of information security technology.This method can the vector images of SHP forms is carried out product quality supervision, ensure product information safely, review related responsibility while, reduce storage redundancy, and then more watermark information is deposited in a small amount of space, and there is very good control to data precision, can farthest reduce influence of the embedded watermark to data precision.
Description
Technical Field
The invention relates to the technical field of information security, in particular to a remote sensing image SHP file-oriented digital watermark embedding and extracting method.
Background
The satellite remote sensing image is an important basic and strategic information resource of the country, is an important basis for the work such as scientific planning, environmental protection, resource development, engineering construction, military operation and the like, and is a basic tool and an important guarantee for informatization construction and sustainable development. The important problem for engineering technicians is to ensure the data information safety of the satellite remote sensing images.
The information security encryption technology is the most common method for protecting digital products, the development of the technology is mature, and the technology is widely applied to various fields of the information society. The file is encrypted by utilizing an encryption technology, so that the content of the file is changed into a ciphertext, and the content of the file cannot be acquired even if the file is intercepted illegally, thereby achieving the purpose of protection. However, the encryption technology has some defects which are difficult to overcome, the encrypted data is easier to attract the attention of an attacker, and as the rapid development of computers enables the password deciphering capacity to be stronger and stronger, the security of the conventional password is greatly threatened. More seriously, once the password is decoded by an attacker, the digital product loses protection, and piracy infringement, illegal access, malicious tampering and other behaviors are easy to occur.
The digital watermarking technology makes up the defects of the traditional encryption technology and develops gradually. A complete digital watermarking scheme typically consists of three parts: watermark generation, watermark embedding, watermark extraction or detection. Specifically, the digital watermarking technology is actually used for reasonably optimizing key links such as carrier medium analysis, watermark preprocessing, watermark embedding position selection, watermark embedding mode design, watermark extraction mode design and the like, and on the premise of preferentially meeting basic requirements, the quasi-optimization design problem under the main constraint conditions of imperceptibility, safety and reliability is sought to be solved. The basic process of digital watermark embedding is shown in fig. 1, where the input content includes the original watermark informationOriginal carrier dataAnd an optional keyThe output result is data containing watermark. Watermark generation algorithmThe properties of uniqueness, effectiveness, irreversibility and the like of the watermark should be guaranteed. Secret keyMay be used to enhance security to avoid unauthorized watermark recovery or watermark extraction. The general process of watermark embedding can be defined by:
wherein,representing the watermarked data (i.e. the data containing the watermark);embedding a watermark into an algorithm;representing original carrier data;representing original watermark information;representing a set of keys. Here the keyIs an option and is typically used for extraction of the watermark signal.
Fig. 2 is a general process of digital watermark extraction, which may or may not require the participation of the original carrier image or the original watermark, and the watermark extraction process in different cases may be described as follows.
Requiring the original carrier dataThe method comprises the following steps:
the original watermark is requiredThe method comprises the following steps:
without the original information:
wherein,representing the extracted watermark;extracting an algorithm for the watermark;representing data containing a watermark.
When the digital watermarking technology is used for encrypting the SHP file of the satellite remote sensing image, the whole image is required to be used as watermarking information, and the processing of the watermarking image is mainly limited to the generation of a binary sequence of 0 and 1, so that the imaginary part of a complex number array generated in Fourier transform is wasted, the extra expense of the watermarking information is increased, and the space occupation of the watermarking information is increased.
Disclosure of Invention
The invention aims to provide a remote sensing image SHP file-oriented digital watermark embedding and extracting method, which can reduce the storage redundant information while monitoring the product quality of a vector image in an SHP format, ensuring the product information safety and tracing the related responsibility, further store more watermark information in a small amount of space, has good control on the data precision and can reduce the influence of the embedded watermark on the data precision to the greatest extent.
In order to achieve the above object, the technical solution adopted by the present invention is as follows.
The digital watermark embedding process for the remote sensing image SHP surface file comprises the following steps:
step 1: watermark information scrambling uses an Arnold scrambling algorithm of 32 pixels, divides 128 pixel 32 pixel original watermark information into 4 pieces of watermark information to be scrambled, and then carries out Arnold scrambling on each piece of watermark information to be scrambled to obtain 4 pieces of watermark information of 32 pixels after being scrambled, and then the watermark information is combined into watermark information after being scrambled by 128 pixels. Since Arnold scrambling is a periodic transformation, the number of scrambles is counted as a key32 x 32 pixels Arnold scrambling period is 24,
wherein,respectively are the horizontal and vertical coordinates of the original image,respectively are the horizontal and vertical coordinates multiplied by the matrix;
step 2: and (3) carrying out watermark information system conversion, encoding the scrambled 128 x 32 pixel watermark information obtained before into a one-dimensional 0/1 sequence according to the sequence of the first row and the last row, combining every 8 binary digits in the 0/1 sequence into a decimal number to obtain another one-dimensional sequence, and dividing each data in the one-dimensional sequence by 25600 to enable the data to be less than 0.01 to obtain a new one-dimensional sequence.
Wherein,is a one-dimensional 0/1 sequence and,the ith element in the representation sequence,is a new one-dimensional sequence and is,representing the ith element in the new sequence;
and step 3: and performing Fourier transform on the one-dimensional sequence obtained in the last step.
Wherein,the one-dimensional sequence obtained in the last step is shown,represents the jth element in the one-dimensional sequence, 0 represents a complex number with an imaginary part of 0, i is an imaginary unit,is a sequence obtained after the fourier transform,for the real part obtained after the transformation,k is a serial number after Fourier transform for an imaginary part obtained after transformation;
and 4, step 4: the previously selected key is comparedAs a seed for generating the non-repetitive pseudo random number, the random number generation range is the total number of all points contained in each surface entity in the original data file, the generated random number is the number of data in a sequence obtained after Fourier transform, namely 512, a non-repetitive random number sequence is obtained, and the non-repetitive random number sequence is generatedThe abscissa of the point is recorded in a one-dimensional array, representing the firstIs a random number ofIn the original dataThe abscissa of the point is，
Wherein,meaning that the random number sequence is not repeated,the ith element in the representation sequence,a set of integers is represented that is,the number of all points;
and 5: performing Fourier transformation on data in the one-dimensional array to obtain frequency domain data, applying an additive criterion, embedding watermark data subjected to Fourier transformation into the frequency domain data, performing inverse fast Fourier transformation to obtain data containing a watermark, replacing the abscissa according to the generated non-repeated random position to obtain data containing watermark information, and finally replacing the abscissa of a corresponding selected position point in the original data by using a real part in the data containing the watermark information to obtain a vector file containing the watermark information.
Wherein,a one-dimensional array is represented,indicating the corner mark asThe x-coordinate value of the point of (a),representing the ith value in the array,in order to perform the frequency domain data after the fourier transform,respectively the real part and the imaginary part, k is the serial number after Fourier transform,to the data obtained after the additive criteria were applied,in order for the data to contain the watermark information,represents a new point containing watermark information, wherein 0 in the formula is a number very close to 0, and is directly replaced by 0 for convenience of description;
step 6: in order to prevent the condition that the vertical coordinate of the information point containing the watermark is the same as the vertical coordinate of a certain point in the vector data, the vertical coordinate of the information point containing the watermark needs to be modified, and the following two aspects are included in the moment: and the selected longitudinal coordinate sequence of the embedded point repeats itself, and the selected longitudinal coordinate sequence of the embedded point repeats with the longitudinal coordinate of the point without the watermark information.
The digital watermark extraction process for the remote sensing image SHP surface file comprises the following steps:
step 1: by means of a preceding scrambling keyAs a seed, 512 non-repetitive pseudo-random number sequences are generated, and the coordinates of corresponding points of the original vector file are obtained according to the data sequence in the sequencesAfter the same modification and repetition ordinate method as that used in embedding the digital watermark, traversing all data points in the data containing the watermark according to the ordinate of the coordinate sequence, recording the points in the data containing the watermark, the points of which the ordinate is the same as the ordinate of the coordinate sequence and the points of which the difference between the abscissa and the abscissa of the coordinate sequence is less than 0.008, into the extraction sequence, wherein the length of the extraction sequence is 512 as the length of the coordinate sequence (as the situation that the ordinate is the same may occur in the data, in order to avoid the situation, the difference between the abscissas needs to be limited, 0.008 is used here);
step 2: because the vector file embedded with the watermark may be subjected to operations such as adding, deleting, moving and the like, and part of watermark data in the extracted sequence cannot be extracted, the extracted sequence is filled into a complete sequence by adopting an information filling method, then, the abscissa of the coordinate sequence and the abscissa of the extracted sequence are respectively subjected to Fourier transform and differenced to obtain two complex number arrays, and then, the difference is subjected to fast Fourier inverse transformation to obtain the watermark information.
Wherein,is the coordinate sequence of the corresponding point of the original vector file,the ith element in the representation sequence,is a coordinate sequence obtained after Fourier transform,respectively a real part and an imaginary part, and k is a serial number after Fourier transform;in order to extract the sequence(s),the ith element in the representation sequence,is a sequence obtained after a fourier transform,respectively a real part and an imaginary part, and k is a serial number after Fourier transform;the real part and the imaginary part of the two sequences are respectively subjected to difference to obtain data,in order to obtain the watermark information after the inverse fourier transform,representing the ith element in the sequence;
and step 3: because each data in the watermark information is less than 0.01, each element in the watermark information needs to be multiplied by 25600 and then rounded, the obtained data is decomposed in a decimal-to-binary mode to obtain 0/1 one-dimensional sequences, the 0/1 one-dimensional sequences are coded into binary images according to the size of 128 x 32, finally the binary images are decomposed into 4 bit maps of 32 x 32, and 2 images are respectively made on the 4 images(32 x 32 image scrambling period is 24) Arnold scrambling, and splicing together to obtain a final extracted 128 x 32 watermark image;
and 4, step 4: and matching the extracted watermark image with all images in the watermark set, setting a threshold value p, considering that the target data contains the digital watermark if the similarity is more than or equal to p, considering that the target data does not contain the digital watermark if the similarity is less than p, and outputting the digital watermark with the highest matching degree as a final result.
The invention provides a frequency domain digital watermark embedding and extracting algorithm based on binary watermark information system conversion by applying the characteristics of Arnold scrambling and unrepeated pseudo random numbers according to the requirements of remote sensing image quality supervision and the characteristics of the horizontal and vertical coordinates of vector data, which can meet the requirements of quality supervision, reduce the influence of embedded watermarks on data precision to the greatest extent and meet the requirements of quality supervision of remote sensing special products.
Drawings
Fig. 1 shows a basic process of digital watermark embedding.
Fig. 2 general procedure of digital watermark extraction.
FIG. 3 shows a specific process of embedding digital watermarks into remote sensing image SHP files.
FIG. 4 shows a specific process of extracting digital watermarks from SHP files of remote sensing images.
Detailed Description
The technical scheme of the invention is explained in detail in the following with the accompanying drawings:
a specific embedding process of a digital watermark for a remote sensing image SHP surface file is shown in fig. 3, and the text description is as follows:
step 1: watermark information scrambling uses an Arnold scrambling algorithm of 32 × 32 pixels (adopting the same principle of 16 × 16 pixels, 8 × 8 pixels, 4 × 4 pixels and 32 × 32 pixels, and the corresponding block numbers become 16, 64 and 256), firstly, the original watermark information of 128 × 32 pixels is scrambledDividing into 4 pieces of 32-by-32-pixel information to be scrambledPerforming Arnold scrambling on each watermark information to be scrambled to obtain 4 pieces of scrambled 32 × 32 pixel watermark informationThen is connected toCombining into watermark information after 128-by-32-pixel scrambling. Since Arnold scrambling is a periodic transformation, the number of scrambles is counted as a keyThe 32 x 32 pixel Arnold scrambling period is 24.
Wherein,respectively are the horizontal and vertical coordinates of the original image,respectively are the horizontal and vertical coordinates multiplied by the matrix;
step 2: the watermark information binary conversion aims at encoding watermark information into a one-dimensional sequence to prepare for the Fourier transform of the watermark information later, and simultaneously, in order to reduce the influence degree of the watermark information on an original vector file, a normalization method is adopted to ensure that each data in the sequence is less than 0.01. The specific method is to encode the scrambled 128 × 32 pixel watermark information into a one-dimensional 0/1 sequence according to the sequence of the preceding and following columns, combine every 8 binary digits in the 0/1 sequence into a decimal number to obtain another one-dimensional sequence, and divide each data in the one-dimensional sequence by 25600 to make it less than 0.01 to obtain a new one-dimensional sequence.
Wherein,is a one-dimensional 0/1 sequence and,the ith element in the representation sequence,is a new one-dimensional sequence and is,representing the ith element in the new sequence;
and step 3: the fast Fourier transform is a fast algorithm of discrete Fourier transform, and can convert space domain information into frequency domain information and accept complex input. The advantage of embedding the digital watermark in the frequency domain is that the watermark information can be dispersed to each point in the space domain, increasing the robustness of the algorithm. The one-dimensional sequence obtained in the last stepFourier transform is carried out to obtain。
Wherein,the one-dimensional sequence obtained in the last step is shown,represents the jth element in the one-dimensional sequence, 0 represents a complex number with an imaginary part of 0, i is an imaginary unit,is a sequence obtained after the fourier transform,for the real part obtained after the transformation,k is a serial number after Fourier transform for an imaginary part obtained after transformation;
and 4, step 4: the previously selected key is comparedAs a seed for generating the non-repetitive pseudo random number, the random number generation range is the total number of all point numbers contained in each surface entity in the original data file, and the generated random number is a sequence obtained after Fourier transformThe number of the middle data, namely 512, obtains a non-repeated random number sequence, and the random number sequence is to be processedThe abscissa of the point is recorded in a one-dimensional array, representing the firstIs a random number ofIn the original dataThe abscissa of the point is，
Wherein,meaning that the random number sequence is not repeated,the ith element in the representation sequence,a set of integers is represented that is,the number of all points;
and 5: performing Fourier transformation on data in the one-dimensional array to obtain frequency domain data, applying an additive criterion, embedding watermark data subjected to Fourier transformation into the frequency domain data, performing inverse fast Fourier transformation to obtain data containing a watermark, replacing the abscissa according to the generated non-repeated random position to obtain data containing watermark information, and finally replacing the abscissa of a corresponding selected position point in the original data by using a real part in the data containing the watermark information to obtain a vector file containing the watermark information.
Wherein,a one-dimensional array is represented,indicating the corner mark asThe x-coordinate value of the point of (a),representing the ith value in the array,in order to perform the frequency domain data after the fourier transform,respectively the real part and the imaginary part, k is the serial number after Fourier transform,to the data obtained after the additive criteria were applied,in order for the data to contain the watermark information,represents a new point containing watermark information, wherein 0 in the formula is a number very close to 0, and is directly replaced by 0 for convenience of description;
step 6: in order to prevent the condition that the vertical coordinate of the information point containing the watermark is the same as the vertical coordinate of a certain point in the vector data, the vertical coordinate of the information point containing the watermark needs to be modified, and the following two aspects are included in the moment: and the selected longitudinal coordinate sequence of the embedded point repeats itself, and the selected longitudinal coordinate sequence of the embedded point repeats with the longitudinal coordinate of the point without the watermark information.
A digital watermark extraction process for a remote sensing image SHP surface file is shown in fig. 4, and the text description is as follows:
step 1: by means of a preceding scrambling keyAs a seed, 512 non-repetitive pseudo-random number sequences are generated, a coordinate sequence of corresponding points of an original vector file is obtained according to a data sequence in the sequence, after a method for modifying and repeating a vertical coordinate which is the same as that of digital watermarking embedding, all data points in the data containing the watermark are traversed according to the vertical coordinate of the coordinate sequence, the points in the data containing the watermark, the vertical coordinate of which is the same as that of the coordinate sequence, are recorded into an extraction sequence, and the point, the difference between the horizontal coordinate of which and the horizontal coordinate of the coordinate sequence is less than 0.008, is recorded into the extraction sequence, wherein the length of the extraction sequence is 512 which is the same as that of the coordinate sequence (as the situation that the vertical coordinate is the same may occur in the data, in order to avoid the situation, the difference between the horizontal;
step 2: because the vector file embedded with the watermark may be subjected to operations such as adding, deleting, moving and the like, and part of watermark data in the extracted sequence cannot be extracted, the extracted sequence is filled into a complete sequence by adopting an information filling method, then, the abscissa of the coordinate sequence and the abscissa of the extracted sequence are respectively subjected to Fourier transform and differenced to obtain two complex number arrays, and then, the difference is subjected to fast Fourier inverse transformation to obtain the watermark information.
Wherein,is the coordinate sequence of the corresponding point of the original vector file,the ith element in the representation sequence,is a coordinate sequence obtained after Fourier transform,respectively a real part and an imaginary part, and k is a serial number after Fourier transform;in order to extract the sequence(s),the ith element in the representation sequence,is a sequence obtained after a fourier transform,respectively a real part and an imaginary part, and k is a serial number after Fourier transform;the real part and the imaginary part of the two sequences are respectively subjected to difference to obtain data,in order to obtain the watermark information after the inverse fourier transform,representing the ith element in a sequenceA peptide;
and step 3: because each data in the watermark information is less than 0.01, each element in the watermark information needs to be multiplied by 25600 and then rounded, the obtained data is decomposed in a decimal-to-binary mode to obtain 0/1 one-dimensional sequences, the 0/1 one-dimensional sequences are coded into binary images according to the size of 128 x 32, finally the binary images are decomposed into 4 bit maps of 32 x 32, and 2 images are respectively made on the 4 images(32 x 32 image scrambling period is 24) Arnold scrambling, and splicing together to obtain a final extracted 128 x 32 watermark image;
and 4, step 4: and matching the extracted watermark image with all images in the watermark set, setting a threshold value p, considering that the target data contains the digital watermark if the similarity is more than or equal to p, considering that the target data does not contain the digital watermark if the similarity is less than p, and outputting the digital watermark with the highest matching degree as a final result.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention in any way, and those skilled in the art can make many variations and modifications of the present invention without departing from the scope of the present invention as defined in the appended claims.
Claims (2)
1. A digital watermark embedding process of a remote sensing image SHP surface file is characterized by comprising the following steps:
step 1: watermark information scrambling uses an Arnold scrambling algorithm of 32 pixels, divides 128 pixel 32 pixel original watermark information into 4 pieces of watermark information to be scrambled, then carries out Arnold scrambling on each piece of watermark information to be scrambled to obtain 4 pieces of watermark information after scrambling, then combines the watermark information after 128 pixel 32 pixel scrambling, and counts the scrambling times as a secret key because the Arnold scrambling is periodic transformation 32 x 32 pixels Arnold scrambling period is 24,
Wherein, Respectively are the horizontal and vertical coordinates of the original image, Respectively are the horizontal and vertical coordinates multiplied by the matrix;
step 2: carrying out watermark information binary conversion, encoding the scrambled 128 x 32 pixel watermark information obtained previously into a one-dimensional 0/1 sequence according to the sequence of the first row and the last row, combining each 8 binary digits in the 0/1 sequence into a decimal number to obtain another one-dimensional sequence, dividing each data in the one-dimensional sequence by 25600 to enable the data to be less than 0.01 to obtain a new one-dimensional sequence,
Wherein, Is a one-dimensional 0/1 sequence and, The ith element in the representation sequence, < math > shows that D: \ electronic application \ cases \ inventions \ c6a0e696-6f1D-4ce2-8afc-D9b154c546eb \ new \100001\ dest _ path _ image009.jpg > Is a new one-dimensional sequence and is, Representing the ith element in the new sequence;
and step 3: fourier transform is carried out on the one-dimensional sequence obtained in the last step,
Wherein, The one-dimensional sequence obtained in the last step is shown, Represents the jth element in the one-dimensional sequence, 0 represents a complex number with an imaginary part of 0, i is an imaginary unit, Is a sequence obtained after the fourier transform, For the real part obtained after the transformation, K is a serial number after Fourier transform for an imaginary part obtained after transformation;
and 4, step 4: the previously selected key is compared As a seed for generating the non-repetitive pseudo random number, the random number generation range is the total number of all points contained in each surface entity in the original data file, the generated random number is the number of data in a sequence obtained after Fourier transform, namely 512, a non-repetitive random number sequence is obtained, and the non-repetitive random number sequence is generated The abscissa of the point is recorded in a one-dimensional array, representing the first < math > shows that D: \ electronic application \ cases \ inventions \ c6a0e696-6f1D-4ce2-8afc-D9b154c546eb \ new \100001\ dest _ path _ image017.jpg \\/math > Is a random number of In the original data The abscissa of the point is ，
Wherein, Meaning that the random number sequence is not repeated, Representing the ith in the sequenceThe elements are selected from the group consisting of, < math > shows that D: \ electronic application \ cases \ inventions \ c6a0e696-6f1D-4ce2-8afc-D9b154c546eb \ new \100001\ dest _ path _ image021.jpg > A set of integers is represented that is, The number of all points;
and 5: performing Fourier transformation on data in the one-dimensional array to obtain frequency domain data, applying an additive criterion, embedding watermark data after Fourier transformation into the frequency domain data, performing inverse fast Fourier transformation to obtain data containing a watermark, replacing an abscissa according to a generated non-repeated random position to obtain data containing watermark information, and finally replacing the abscissa of a corresponding selected position point in original data by a real part in the data containing the watermark information to obtain a vector file containing the watermark information,
Wherein, A one-dimensional array is represented, Indicating the corner mark as The x-coordinate value of the point of (a), Representing the ith value in the array, In order to perform the frequency domain data after the fourier transform, Respectively the real part and the imaginary part, k is the serial number after Fourier transform, To the data obtained after the additive criteria were applied, In order for the data to contain the watermark information, < math > shows that D: \ electronic application \ cases \ inventions \ c6a0e696-6f1D-4ce2-8afc-D9b154c546eb \ new \100001\655632dest _ path _ image031 Represents a new point containing watermark information, wherein 0 in the formula is a number very close to 0, and is directly replaced by 0 for convenience of description;
step 6: in order to prevent the condition that the vertical coordinate of the information point containing the watermark is the same as the vertical coordinate of a certain point in the vector data, the vertical coordinate of the information point containing the watermark needs to be modified, and the following two aspects are included in the moment: and the selected longitudinal coordinate sequence of the embedded point repeats itself, and the selected longitudinal coordinate sequence of the embedded point repeats with the longitudinal coordinate of the point without the watermark information.
2. A digital watermark extraction process of a remote sensing image SHP surface file is characterized by comprising the following steps:
step 1: by means of a preceding scrambling key As a seed, 512 non-repetitive pseudo-random number sequences are generated, a coordinate sequence of corresponding points of an original vector file is obtained according to a data sequence in the sequence, after a method for modifying and repeating a vertical coordinate which is the same as that of digital watermarking embedding, all data points in the data containing the watermark are traversed according to the vertical coordinate of the coordinate sequence, the points in the data containing the watermark, the vertical coordinate of which is the same as that of the coordinate sequence, are recorded into an extraction sequence, and the point, the difference between the horizontal coordinate of which and the horizontal coordinate of the coordinate sequence is less than 0.008, is recorded into the extraction sequence, wherein the length of the extraction sequence is 512 which is the same as that of the coordinate sequence (as the situation that the vertical coordinate is the same may occur in the data, in order to avoid the situation, the difference between the horizontal;
step 2: because the vector file embedded with the watermark may be added, deleted, moved and the like, and part of watermark data in the extracted sequence can not be extracted, the extracted sequence is filled into a complete sequence by adopting an information filling method, then the abscissa of the coordinate sequence and the abscissa of the extracted sequence are respectively subjected to Fourier transform and differenced to obtain two complex number arrays, then the difference is subjected to fast Fourier inverse transformation to obtain the watermark information,
Wherein, < math > shows that D: \ electronic application \ cases \ inventions \ c6a0e696-6f1D-4ce2-8afc-D9b154c546eb \ new \100001\421779dest _ path _ image033.jpg > Is the coordinate sequence of the corresponding point of the original vector file, The ith element in the representation sequence, Is a seat obtained after Fourier transformThe sequence of the target is shown as, Respectively a real part and an imaginary part, and k is a serial number after Fourier transform; In order to extract the sequence(s), The ith element in the representation sequence, Is a sequence obtained after a fourier transform, < math > shows that D: \ electronic application \ cases \ inventions \ c6a0e696-6f1D-4ce2-8afc-D9b154c546eb \ new \100001\369750dest _ path _ image040.jpg > Respectively a real part and an imaginary part, and k is a serial number after Fourier transform; The real part and the imaginary part of the two sequences are respectively subjected to difference to obtain data, < math > shows that D: \ electronic application \ cases \ inventions \ c6a0e696-6f1D-4ce2-8afc-D9b154c546eb \ new \100001\ dest _ path _ image042.jpg > In order to obtain the watermark information after the inverse fourier transform, Representing the ith element in the sequence;
and step 3: because each data in the watermark information is less than 0.01, each element in the watermark information needs to be multiplied by 25600 and then rounded, the obtained data is decomposed in a decimal-to-binary mode to obtain 0/1 one-dimensional sequence, and the 0/1 one-dimensional sequence is obtained according to 12Coding the size of 8 x 32 into binary image, decomposing the binary image into 4 bit maps of 32 x 32, and making 2 for each of 4 maps (32 x 32 image scrambling period is 24) Arnold scrambling, and splicing together to obtain a final extracted 128 x 32 watermark image;
and 4, step 4: and matching the extracted watermark image with all images in the watermark set, setting a threshold value p, considering that the target data contains the digital watermark if the similarity is more than or equal to p, considering that the target data does not contain the digital watermark if the similarity is less than p, and outputting the digital watermark with the highest matching degree as a final result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710184765.9A CN106952214B (en) | 2017-03-24 | 2017-03-24 | Towards the digital watermark embedding and extracting method of remote sensing images SHP faces file |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710184765.9A CN106952214B (en) | 2017-03-24 | 2017-03-24 | Towards the digital watermark embedding and extracting method of remote sensing images SHP faces file |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106952214A true CN106952214A (en) | 2017-07-14 |
| CN106952214B CN106952214B (en) | 2018-02-06 |
Family
ID=59473369
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710184765.9A Active CN106952214B (en) | 2017-03-24 | 2017-03-24 | Towards the digital watermark embedding and extracting method of remote sensing images SHP faces file |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106952214B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110909323A (en) * | 2019-12-02 | 2020-03-24 | 北华航天工业学院 | Remote sensing image stream forwarding tracing method based on XML multi-label watermark |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102663673A (en) * | 2012-05-10 | 2012-09-12 | 南京师范大学 | Chaotic mapping based shp line-surface layer fragile watermark technology |
| CN106228503A (en) * | 2016-07-15 | 2016-12-14 | 北华航天工业学院 | The digital watermark embedding of satellite remote-sensing image SHP dot file and extracting method |
-
2017
- 2017-03-24 CN CN201710184765.9A patent/CN106952214B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102663673A (en) * | 2012-05-10 | 2012-09-12 | 南京师范大学 | Chaotic mapping based shp line-surface layer fragile watermark technology |
| CN106228503A (en) * | 2016-07-15 | 2016-12-14 | 北华航天工业学院 | The digital watermark embedding of satellite remote-sensing image SHP dot file and extracting method |
Non-Patent Citations (3)
| Title |
|---|
| QING CHEN 等: "A Digital Watermarking Algorithm Based on Characters of the Remote-Sensing Imagery", 《IEEE XPLORE》 * |
| 安志远 等: "SHP文件数字水印的研究", 《福建电脑》 * |
| 沈杨 等: "基于双重置乱技术的实数傅里叶变换域数字水印算法", 《吉林化工学院学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110909323A (en) * | 2019-12-02 | 2020-03-24 | 北华航天工业学院 | Remote sensing image stream forwarding tracing method based on XML multi-label watermark |
| CN110909323B (en) * | 2019-12-02 | 2021-10-29 | 北华航天工业学院 | Remote sensing image stream forwarding tracing method based on XML multi-label watermark |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106952214B (en) | 2018-02-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Reference sharing mechanism for watermark self-embedding | |
| Huang et al. | High-capacity reversible data hiding in encrypted image based on specific encryption process | |
| CN116451258A (en) | Text traceability system based on digital watermark | |
| Song et al. | A secure image encryption algorithm based on multiple one-dimensional chaotic systems | |
| Panchikkil et al. | An efficient spatial transformation-based entropy retained reversible data hiding scheme in encrypted images | |
| CN106228503B (en) | The digital watermark embedding and extracting method of satellite remote-sensing image SHP dot files | |
| Benrhouma | Cryptanalysis and improvement of a semi-fragile watermarking technique for tamper detection and recovery | |
| Jung | Comparative histogram analysis of LSB-based image steganography | |
| Wu et al. | A chaos based robust spatial domain watermarking algorithm | |
| Barani et al. | A secure watermark embedding approach based on chaotic map for image tamper detection | |
| CN106952214B (en) | Towards the digital watermark embedding and extracting method of remote sensing images SHP faces file | |
| Ahmed | A systematic overview of secure image steganography | |
| Gupta et al. | Digital image encoding scheme using fractal approach | |
| Riaz et al. | Image authentication and restoration by multiple watermarking techniques with advance encryption standard in digital photography | |
| Tiwari et al. | A Robust Method for Image Steganography based on chaos theory | |
| Chalam et al. | Unified Approach with Neural Network for Authentication, Security and Compression of Image: UNICAP | |
| Vaish et al. | A systematic review on various reversible data hiding techniques in digital images | |
| Raj et al. | A survey on reversible data hiding in encrypted image | |
| Mukherjee et al. | A novel image Steganographic approach by pixel position Modulus method (PPMM) | |
| Jia et al. | Digital watermark-based security technology for geo-spatial graphics data | |
| Li et al. | Reality-preserving image encryption assosiated with the chaos and the LCT | |
| Niu et al. | Reference Sharing Mechanism‐Based Self‐Embedding Watermarking Scheme with Deterministic Content Reconstruction | |
| CN113194319B (en) | Encryption and decryption method and system for exchange cipher watermark | |
| Perumal | An Innovative Methodology of Steganography and Cryptography Elicited from Randomization and Base64 Code in GIF images | |
| Cahya Prihandoko et al. | Blind image watermarking based on chaotic maps |
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 |