CN106952214B - 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
- CN106952214B CN106952214B CN201710184765.9A CN201710184765A CN106952214B CN 106952214 B CN106952214 B CN 106952214B CN 201710184765 A CN201710184765 A CN 201710184765A CN 106952214 B CN106952214 B CN 106952214B
- Authority
- CN
- China
- Prior art keywords
- explanation
- c6a0e696
- 8afc
- jpg
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000009466 transformation Effects 0.000 claims description 45
- 238000006243 chemical reaction Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 claims description 8
- 230000004048 modification Effects 0.000 claims description 4
- 238000012986 modification Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 claims description 3
- 239000011159 matrix material Substances 0.000 claims description 3
- 230000000737 periodic effect Effects 0.000 claims description 2
- 206010038743 Restlessness Diseases 0.000 claims 1
- 238000003491 array Methods 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 10
- 238000000605 extraction Methods 0.000 description 10
- 238000003780 insertion Methods 0.000 description 5
- 230000037431 insertion Effects 0.000 description 5
- 238000013461 design Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 230000008570 general process Effects 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 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
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 be while the vector image to SHP forms carries out product quality supervision, ensures product information safety, retrospect related responsibility, 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 present invention relates to field of information security technology, and in particular to a kind of digital water towards remote sensing images SHP faces file
Print insertion and extracting method.
Background technology
Satellite remote-sensing image is important basic, the strategic information resource of country, is planning of science activities, environmental protection, money
The important evidence of the work such as source exploitation, engineering construction, military combat, it is the basic instrument of informatization and sustainable development
And important leverage.The data information security for ensureing satellite remote-sensing image is the major issue that engineers and technicians face.
Information security encryption technology is the method for protecting digital product the most frequently used, the development comparative maturity of the technology, is being believed
Cease and be widely used in the every field of society.File is encrypted using encryption technology, is changed into file content
Ciphertext, its content can not also so be obtained by illicit interception even if file, the purpose of protection is reached with this.However, encryption
The shortcomings that technology is difficult to overcome in the presence of some in itself, the data after encryption are easier the attention for causing attacker, with computer
Rapid development make it that code breaking ability is more and more stronger, the security of ordinary cryptographic receives great threat.More serious
It is that, once password is decoded by attacker, digital product will lose protection, it is easy to pirate infringement, unauthorized access occur, maliciously usurp
The behavior such as change.
Digital watermark technology compensate for the deficiency of conventional encryption technique, gradually grow up.One complete digital watermarking
Scheme generally comprises three parts：Watermark generation, watermark insertion, watermark extracting or detection.Specifically, digital watermark technology is actual
On be by analyzing carrier medium, watermark pretreatment, watermark embedded location selection, watermark embedded mode design, watermark extracting
Mode the key link such as designs and carries out reasonably optimizing, it is preferential meet primary demand on the premise of, seek to solve not sentience,
Quasi-optimal design problem under security reliability, robustness main constraints.The basic process of digital watermark embedding such as Fig. 1
Shown, its content inputted includes original watermark information, initial carrier dataWith an optional key, output
Result be the data containing watermark.Watermark generating algorithmIt should ensure that the uniqueness, validity, irreversibility of watermark
Deng attribute.KeyIt can be used to strengthen security, to avoid the watermark recovery of unauthorized or watermark extracting.It can be determined by following formula
The general process of adopted watermark insertion：
Wherein,Represent the data after embedded watermark（That is the data containing watermark）；For watermarking algorithm；Table
Show initial carrier data；Represent original watermark information；Represent cipher key sets.Here keyIt is option, typically
Extraction for watermark signal.
Fig. 2 is the general process of digital watermarking extraction, and its process can need the ginseng of initial carrier image or original watermark
With these information can also do not needed, the watermark extraction process under different situations can be described as follows.
Need initial carrier dataWhen：
Need original watermarkWhen：
When there is no raw information：
Wherein,Represent extracted watermark；For watermark extraction algorithm；Represent the data containing watermark.
Using above-mentioned digital watermark technology when satellite remote-sensing image SHP faces file is encrypted, it is necessary to which whole is schemed
Piece all regards watermark information, and the processing to watermark picture is mainly limited to be generated 0,1 binary sequence, so wastes
The imaginary part of caused plural array during Fourier transformation, while the overhead of watermark information is also increased, add watermark
The space hold amount of information.
The content of the invention
It is an object of the invention to provide a kind of digital watermark embedding and extracting method towards remote sensing images SHP faces file,
This method can carry out product quality supervision in the vector image to SHP forms, ensure product information safety, retrospect related responsibility
While, storage redundancy is reduced, and then more watermark information is deposited in a small amount of space, and have to data precision non-
Often good control, can farthest reduce influence of the embedded watermark to data precision.
To achieve the above object, the technical solution that the present invention is taken is as follows.
Towards the digital watermark embedding process of remote sensing images SHP faces file, comprise the following steps：
Step 1：Watermark information scramble uses the Arnold scrambling algorithms of 32*32 pixels, by 128*32 pixel original watermarks
Information is divided into 4 32*32 pixels and treats scramble watermark information, then treats that scramble watermark information does Arnold scrambles to each, obtains 4
32*32 pixel watermark informations after individual scramble, the watermark information being then combined as after 128*32 pixel permutations.Because Arnold is put
It is disorderly periodic transformation, therefore scramble number is counted as key, 32*32 pixel A rnold shuffling cycles are 24,
Wherein,Respectively original image transverse and longitudinal coordinate,Respectively it is multiplied by the seat of the transverse and longitudinal after matrix
Mark；
Step 2：Watermark information system is changed, by the 128*32 pixel watermark informations after the scramble obtained before according to leading
The order of rank rear, one-dimensional 0/1 sequence is encoded to, then every 8 binary digits in this 0/1 sequence are combined into a decimal number
Word, another one-dimensional sequence is obtained, each data divided by 25600 in this one-dimensional sequence, it is less than 0.01, obtain
New one-dimensional sequence.
Wherein,For one-dimensional 0/1 sequence,I-th of element in sequence is represented,To be new
One-dimensional sequence,Represent i-th of element in new sequence；
Step 3：One-dimensional sequence obtained in the previous step is subjected to Fourier transformation.
Wherein,One-dimensional sequence obtained in the previous step is represented,J-th of element in one-dimensional sequence is represented,
0 represents that imaginary part is that 0, i is imaginary unit,For the sequence obtained after Fourier transformation,For conversion
The real part obtained afterwards,For the imaginary part obtained after conversion, k is the sequence number after Fourier transformation；
Step 4：The key chosen beforeDo not repeat the seed of pseudo random number as generation, generating random number
Scope is that each face entity includes the sum for having a number in raw data file, and generation random number number is Fourier transformation
The number of data, i.e., 512 in the sequence obtained afterwards, not repeating random number row are obtained, and willThe abscissa of point is recorded in one
In dimension group, the is representedIndividual random number is, in initial dataThe abscissa of individual point is,
Wherein,Represent that repeating random number does not arrange,I-th of element in sequence is represented,Represent integer set,For number a little；
Step 5：Data in one-dimension array are done into Fourier transformation, obtain frequency domain data, reapply additivity criterion, by Fu
In watermark data after leaf transformation be embedded into above-mentioned frequency domain data, carry out inverse fast Fourier transform, obtain containing watermark
Data, random site is not then repeated according to generation, abscissa is replaced, obtains the data containing watermark information, most
Afterwards, the real part in the data of watermark information is contained with this and replaces the abscissa that chosen position point is corresponded in initial data, is contained
The vector file of watermark information.
Wherein,Represent one-dimension array,Represent that footmark isPoint x sit
Scale value,I-th of value in array is represented,To do the frequency domain data after Fourier transformation,
Respectively gained real and imaginary parts, k are the sequence number after Fourier transformation,After implementing additivity criterion
Obtained data,For the data containing watermark information,Represent with watermarked information
New point, 0 in formula is the number of one very close 0, for convenience of explanation, is directly replaced here with 0；
Step 6：In order to prevent with watermarked information ordinate with there are location point ordinate identical feelings in vector data
Condition to its ordinate, it is necessary to modify, now comprising following two aspects：The ordinate sequence itself for choosing embedded point occurs
Repeat, the ordinate sequence of the embedded point of selection and the ordinate of point not with watermarked information duplicate.
Towards the digital watermarking extraction process of remote sensing images SHP faces file, comprise the following steps:
Step 1：Pass through scramble key during digital watermark embeddingAs seed, generation 512 does not repeat pseudorandom
Number Sequence, and according to the coordinate sequence of the data order acquisition original vector file corresponding points in sequence, process and digital watermarking
After identical modification repeats ordinate method when embedded, according to all data of the ordinate of coordinate sequence to containing watermark in
Point is traveled through, by containing watermark in the ordinate identical point of ordinate and coordinate sequence, and abscissa and coordinate sequence
Point of the difference of the abscissa of row less than 0.008 recorded in abstraction sequence, and abstraction sequence length is all mutually 512 with coordinate sequence
（Due to being likely to occur ordinate identical situation in data, in order to avoid such case, it is necessary to be limited to the difference of abscissa,
Used here as 0.008）；
Step 2：Because the vector file after embedded watermark may be added, delete, move etc. and to operate, abstraction sequence
In have the extraction of part watermark data less than, therefore, using information filling method by abstraction sequence be filled with one it is complete
Sequence, then, the abscissa of the abscissa of coordinate sequence and abstraction sequence is carried out to Fourier transformation respectively and made the difference, obtains two
Individual plural array, inverse fast Fourier transform then is carried out to difference, obtains watermark information.
Wherein,For the coordinate sequence of original vector file corresponding points,Represent i-th yuan in sequence
Element,For the coordinate sequence obtained after Fourier transformation,Respectively its real and imaginary parts, k
For the sequence number after Fourier transformation；For abstraction sequence,I-th of element in sequence is represented,
For the sequence obtained after Fourier transformation,Respectively its real and imaginary parts, k is after Fourier transformation
Sequence number；The data for making to obtain after difference respectively for the real part of above-mentioned two sequence, imaginary part,For in Fu
Watermark information is obtained after leaf inverse transformation,Represent i-th of element in sequence；
Step 3：Because each data are both less than 0.01, it is necessary to which wherein each element is multiplied by 25600 in watermark information
After round, then the data to obtaining decimally turn binary mode and decomposed, and obtain 0/1 one-dimensional sequence, by its according to
128*32 size coding is bianry image, finally the bianry image is decomposed into 4 32*32 bit diagram, respectively to 4 width figures
Do（The 32*32 image scrambling cycles are 24）Secondary Arnold scrambles, be stitched together the 128* finally extracted
32 watermarking images；
Step 4：The watermarking images extracted are matched with all images that watermark is concentrated, set a threshold value p, phase
Then think to contain digital watermarking, similarity in target data like degree >=p<P then thinks not containing digital watermarking in target data, incited somebody to action
Matching degree highest digital watermarking output is used as final result.
The present invention is put according to the demand of remote sensing image quality surveillance and the feature of vector data transverse and longitudinal coordinate using Arnold
Disorderly and not repeat the characteristic of pseudo random number, it is proposed that a kind of frequency digital watermarking insertion based on the conversion of binary watermarking information system
Extraction algorithm, disclosure satisfy that quality surveillance demand, farthest reduces influence of the embedded watermark to data precision, meets
The demand of remote sensing special topic product quality supervision.
Brief description of the drawings
The basic process of Fig. 1 digital watermark embeddings.
The general process of Fig. 2 digital watermarkings extraction.
Digital watermark embedding detailed processes of the Fig. 3 towards remote sensing images SHP faces file.
Detailed process is extracted in the digital watermarking of Fig. 4 towards remote sensing images SHP faces file.
Embodiment
Technical scheme is described in detail below in conjunction with the accompanying drawings：
A kind of specific telescopiny of digital watermarking towards remote sensing images SHP faces file as shown in figure 3, word description such as
Under：
Step 1：Watermark information scramble uses 32*32 pixels（Using 16*16 pixels, 8*8 pixels, 4*4 pixels and 32*32
Pixel principle is identical, and corresponding block count is changed into 16,64,256）Arnold scrambling algorithms, it is first, 128*32 pixels is former
Beginning watermark informationIt is divided into 4 32*32 pixels and treats scramble watermark information, then wait to put to each
Random watermark information does Arnold scrambles, obtains the 32*32 pixel watermark informations after 4 scrambles, thenThe watermark information being combined as after 128*32 pixel permutations.Because Arnold scrambles is periodically
Conversion, therefore scramble number is counted as key, 32*32 pixel A rnold shuffling cycles are 24.
Wherein,Respectively original image transverse and longitudinal coordinate,Respectively it is multiplied by the seat of the transverse and longitudinal after matrix
Mark；
Step 2：Watermark information system conversion purpose is that watermark information is encoded to one-dimensional sequence, for watermark information Fu below
In leaf transformation prepare, while in order to reduce influence degree of the watermark information to former vector file, using method for normalizing, make sequence
Each data in row are both less than 0.01.Specific practice be 128*32 pixels watermark information after the scramble that will be obtained before according to
The order of Row Column, one-dimensional 0/1 sequence is encoded to, then every 8 binary digits in this 0/1 sequence are combined into a decimal system
Numeral, another one-dimensional sequence is obtained, each data divided by 25600 in this one-dimensional sequence, it is less than 0.01, obtain
To new one-dimensional sequence.
Wherein,For one-dimensional 0/1 sequence,I-th of element in sequence is represented,To be new
One-dimensional sequence,Represent i-th of element in new sequence；
Step 3：Fast Fourier Transform (FFT) is a kind of fast algorithm of discrete Fourier transform, spatial information (si) can be changed
For frequency domain information, receive plural number input.It is that watermark information can be made to be distributed in spatial domain in the benefit of frequency domain insertion digital watermarking
Each point on, add the robustness of algorithm.By one-dimensional sequence obtained in the previous stepCarry out Fourier transformation,
Obtain。
Wherein,One-dimensional sequence obtained in the previous step is represented,J-th of element in one-dimensional sequence is represented,
0 represents that imaginary part is that 0, i is imaginary unit,For the sequence obtained after Fourier transformation,For conversion
The real part obtained afterwards,For the imaginary part obtained after conversion, k is the sequence number after Fourier transformation；
Step 4：The key chosen beforeDo not repeat the seed of pseudo random number as generation, generating random number
Scope is that each face entity includes the sum for having a number in raw data file, and generation random number number is Fourier transformation
The sequence obtained afterwardsThe number of middle data, i.e., 512, not repeating random number row are obtained, and willThe horizontal seat of point
Mark is recorded in one-dimension array, represents theIndividual random number is, in initial dataThe abscissa of individual point is,
Wherein,Represent that repeating random number does not arrange,I-th of element in sequence is represented,Represent integer set,For number a little；
Step 5：Data in one-dimension array are done into Fourier transformation, obtain frequency domain data, reapply additivity criterion, by Fu
In watermark data after leaf transformation be embedded into above-mentioned frequency domain data, carry out inverse fast Fourier transform, obtain containing watermark
Data, random site is not then repeated according to generation, abscissa is replaced, obtains the data containing watermark information, most
Afterwards, the real part in the data of watermark information is contained with this and replaces the abscissa that chosen position point is corresponded in initial data, is contained
The vector file of watermark information.
Wherein,Represent one-dimension array,Represent that footmark isPoint x sit
Scale value,I-th of value in array is represented,To do the frequency domain data after Fourier transformation,
Respectively gained real and imaginary parts, k are the sequence number after Fourier transformation,After implementing additivity criterion
Obtained data,For the data containing watermark information,Represent with watermarked information
New point, 0 in formula is the number of one very close 0, for convenience of explanation, is directly replaced here with 0；
Step 6：In order to prevent with watermarked information ordinate with occurring certain point ordinate identical situation in vector data,
Need to modify to its ordinate, now comprising following two aspects：The ordinate sequence for choosing embedded point weighs itself
Ordinate sequence that is multiple, choosing embedded point and the ordinate of point not with watermarked information duplicate.
A kind of digital watermarking extraction process towards remote sensing images SHP faces file is as shown in figure 4, word description is as follows:
Step 1：Pass through scramble key beforeAs seed, generation 512 does not repeat pseudo-random number sequence, and
The coordinate sequence of original vector file corresponding points is obtained according to the data order in sequence, it is identical during by with digital watermark embedding
Modification repeat ordinate method after, according to the ordinate of coordinate sequence to containing watermark according in all data points carry out time
Go through, by containing watermark in the ordinate identical point of ordinate and coordinate sequence, and the horizontal seat of abscissa and coordinate sequence
Point of the target difference less than 0.008 recorded in abstraction sequence, and abstraction sequence length is all mutually 512 with coordinate sequence（Due to data
In be likely to occur ordinate identical situation, in order to avoid such case, it is necessary to be limited to the difference of abscissa, used here as
0.008）；
Step 2：Because the vector file after embedded watermark may be added, delete, move etc. and to operate, abstraction sequence
In have the extraction of part watermark data less than, therefore, using information filling method by abstraction sequence be filled with one it is complete
Sequence, then, the abscissa of the abscissa of coordinate sequence and abstraction sequence is carried out to Fourier transformation respectively and made the difference, obtains two
Individual plural array, inverse fast Fourier transform then is carried out to difference, obtains watermark information.
Wherein,For the coordinate sequence of original vector file corresponding points,Represent i-th yuan in sequence
Element,For the coordinate sequence obtained after Fourier transformation,Respectively its real and imaginary parts, k
For the sequence number after Fourier transformation；For abstraction sequence,I-th of element in sequence is represented,
For the sequence obtained after Fourier transformation,Respectively its real and imaginary parts, k is after Fourier transformation
Sequence number；The data for making to obtain after difference respectively for the real part of above-mentioned two sequence, imaginary part,For in Fu
Watermark information is obtained after leaf inverse transformation,Represent i-th of element in sequence；
Step 3：Because each data are both less than 0.01, it is necessary to which wherein each element is multiplied by 25600 in watermark information
After round, then the data to obtaining decimally turn binary mode and decomposed, and obtain 0/1 one-dimensional sequence, by its according to
128*32 size coding is bianry image, finally the bianry image is decomposed into 4 32*32 bit diagram, respectively to 4 width figures
Do（The 32*32 image scrambling cycles are 24）Secondary Arnold scrambles, be stitched together the 128* finally extracted
32 watermarking images；
Step 4：The watermarking images extracted are matched with all images that watermark is concentrated, set a threshold value p, phase
Then think to contain digital watermarking, similarity in target data like degree >=p<P then thinks not containing digital watermarking in target data, incited somebody to action
Matching degree highest digital watermarking output is used as final result.
It is described above, only it is highly preferred embodiment of the present invention, any formal limitation not is made to the present invention, appoints
What those skilled in the art, without departing from the scope of the technical proposal of the invention, using in the method for the disclosure above
Appearance makes many possible changes and modifications to technical solution of the present invention, belongs to the scope of claims protection.
Claims (2)
1. a kind of data waterprint embedded method of remote sensing images SHP faces file, it is characterised in that comprise the following steps：
Step 1：Watermark information scramble uses the Arnold scrambling algorithms of 32*32 pixels, by 128*32 pixel original watermark informations
It is divided into 4 32*32 pixels and treats scramble watermark information, then treat that scramble watermark information does Arnold scrambles to each, obtains 4 and put
32*32 pixel watermark informations after unrest, the watermark information being then combined as after 128*32 pixel permutations, because Arnold scrambles are
Periodic transformation, therefore scramble number is counted as keyExplanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 996304dest_path_image001.jpg, 32*32 pixel A rnold shuffling cycles are 24,
Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 849739dest_path_image003.jpg
Wherein,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 160634dest_path_image005.jpgRespectively original image transverse and longitudinal coordinate,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 555844dest_path_image007.jpgThe transverse and longitudinal coordinate being respectively multiplied by after matrix；
Step 2：Watermark information system is changed, by the 128*32 pixel watermark informations after the scramble obtained before according to Row Column
Order, be encoded to one-dimensional 0/1 sequence, then every 8 binary digits in this 0/1 sequence are combined into a ten's digit, obtain
To another one-dimensional sequence, each data divided by 25600 in this one-dimensional sequence, it is less than 0.01, obtain new
One-dimensional sequence,
Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 901374dest_path_image009.jpg
Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 723837dest_path_image011.jpg
Wherein,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image007.jpgFor one-dimensional 0/1 sequence,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 720929dest_path_image014.jpgI-th of element in sequence is represented,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 391196dest_path_image009.jpgTo be new one-dimensional
Sequence,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 662132dest_path_image017.jpgRepresent i-th of element in new sequence；
Step 3：One-dimensional sequence obtained in the previous step is subjected to Fourier transformation,
Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 416462dest_path_image019.jpg
Wherein,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 439683dest_path_image009.jpgOne-dimensional sequence obtained in the previous step is represented,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 208017dest_path_image021.jpgRepresent j-th of element in one-dimensional sequence, 0 table
It is that 0, i is imaginary unit to show imaginary part,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image013.jpgFor the sequence obtained after Fourier transformation,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 228013dest_path_image014.jpgTo be obtained after conversion
The real part arrived,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image015.jpgFor the imaginary part obtained after conversion, k is the sequence number after Fourier transformation；
Step 4：The key chosen beforeExplanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 615449dest_path_image001.jpgThe seed of pseudo random number is not repeated as generation, the scope of generating random number is
Each face entity includes the sum for having a number in raw data file, generates random number number to be obtained after Fourier transformation
Sequence in data number, i.e., 512, obtain not repeating random number row, and willExplanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 477456dest_path_image026.jpgThe abscissa of point is recorded in one-dimension array
In, represent theExplanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 737536dest_path_image028.jpgIndividual random number isExplanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 816350dest_path_image026.jpg, in initial dataExplanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 845486dest_path_image026.jpgThe abscissa of individual point isExplanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 617133dest_path_image030.jpg,
Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 98930dest_path_image032.jpg
Wherein,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image020.jpgRepresent that repeating random number does not arrange,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 615810dest_path_image034.jpgI-th of element in sequence is represented,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image021.jpgRepresent integer set,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 718720dest_path_image022.jpgFor number a little；
Step 5：Data in one-dimension array are done into Fourier transformation, obtain frequency domain data, reapply additivity criterion, by Fourier
Watermark data after conversion is embedded into above-mentioned frequency domain data, carries out inverse fast Fourier transform, obtains the data containing watermark,
Then random site is not repeated according to generation, abscissa is replaced, obtains the data containing watermark information, finally, used
Real part in the data for containing watermark information replaces the abscissa that chosen position point is corresponded in initial data, obtains aqueous official seal
The vector file of breath,
Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 948068dest_path_image038.jpg
Wherein,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 286209dest_path_image025.jpgRepresent one-dimension array,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 521635dest_path_image043.jpgRepresent that footmark isExplanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 27834dest_path_image034.jpgPoint x coordinate
Value,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 89331dest_path_image034.jpgI-th of value in array is represented,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 375070dest_path_image027.jpgTo do the frequency domain data after Fourier transformation,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image028.jpgPoint
Not Wei gained real and imaginary parts, k be Fourier transformation after sequence number,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image029.jpgTo be obtained after implementation additivity criterion
The data arrived,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image030.jpgFor the data containing watermark information,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 249168dest_path_image031.jpgRepresent with watermarked information
New, 0 in formula is the number of one very close 0, for convenience of explanation, is directly replaced here with 0；
Step 6：In order to prevent with watermarked information ordinate and location point ordinate identical situation occur in vector data, need
Its ordinate is modified, now comprising following two aspects：The ordinate sequence for choosing embedded point itself duplicates,
The ordinate sequence and the ordinate of point not with watermarked information for choosing embedded point duplicate.
2. a kind of digital watermarking extracting method of remote sensing images SHP faces file, it is characterised in that comprise the following steps:
Step 1：Pass through scramble key during digital watermark embeddingExplanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 148991dest_path_image001.jpgAs seed, generation 512 does not repeat pseudorandom number sequence
Row, and according to the coordinate sequence of the data order acquisition original vector file corresponding points in sequence, process and digital watermark embedding
When identical modification repeat ordinate method after, according to the ordinate of coordinate sequence to containing watermark according in all data click through
Row traversal, by containing watermark in the ordinate identical point of ordinate and coordinate sequence, and abscissa and coordinate sequence
Point of the difference of abscissa less than 0.008 recorded in abstraction sequence, and abstraction sequence length is all mutually 512 with coordinate sequence, in order to
Avoid occurring ordinate identical situation in data, it is necessary to be limited the difference of abscissa, used here as 0.008；
Step 2：Abstraction sequence is filled with a complete sequence by the method filled using information, then, by coordinate sequence
The abscissa of abscissa and abstraction sequence carries out Fourier transformation and made the difference respectively, two plural arrays is obtained, then to difference
Inverse fast Fourier transform is carried out, obtains watermark information,
Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 dest_path_image050.jpg
Wherein,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 485612dest_path_image033.jpgFor the coordinate sequence of original vector file corresponding points,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 686644dest_path_image014.jpgI-th of element in sequence is represented,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 826780dest_path_image035.jpgFor the coordinate sequence obtained after Fourier transformation,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 665423dest_path_image036.jpgRespectively its real and imaginary parts, k are Fu
In sequence number after leaf transformation；Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 556019dest_path_image037.jpgFor abstraction sequence,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 dest_path_image056.jpgI-th of element in sequence is represented,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 56850dest_path_image039.jpgFor warp
Obtained sequence is crossed after Fourier transformation,Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 230342dest_path_image040.jpgRespectively its real and imaginary parts, k are the sequence after Fourier transformation
Number；Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 709865dest_path_image041.jpgThe data for making to obtain after difference respectively for the real part of above-mentioned two sequence, imaginary part,Explanation:Explanation:Explanation:Explanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 44818a7f-afc7-4ede-95ae-df2467e94112 100001 dest_path_image042.jpgFor Fourier
Watermark information is obtained after inverse transformation,Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 dest_path_image062.jpgI-th of element in sequence is represented, 0 in formula is the number of one very close 0, is
Facilitate explanation, directly replaced here with 0；
Step 3：Due in watermark information each data be both less than 0.01, it is necessary to which wherein each element is multiplied by 25600 after take
It is whole, then the data to obtaining decimally turn binary mode and decompose, and 0/1 one-dimensional sequence are obtained, by it according to 128*
32 size coding is bianry image, finally the bianry image is decomposed into 4 32*32 bit diagram, and 4 width figures are done respectivelyExplanation:Explanation: D:Electronic application cases inventions c6a0e696-6f1d-4ce2-8afc-d9b154c546eb others 893b65f3-d56d-4fc5-ab86-aff3c42fc326 100001 79032dest_path_image044.jpgSecondary Arnold scrambles, be stitched together the 128*32 watermarking images finally extracted；
Step 4：The watermarking images extracted are matched with all images that watermark is concentrated, set a threshold value p, similarity
>=p then thinks to contain digital watermarking, similarity in target data<P then thinks not containing digital watermarking in target data, will matched
The digital watermarking output of degree highest is used as 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 CN106952214A (en) | 2017-07-14 |
| CN106952214B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110909323B (en) * | 2019-12-02 | 2021-10-29 | 北华航天工业学院 | 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 |
|---|
| A Digital Watermarking Algorithm Based on Characters of the Remote-Sensing Imagery;Qing Chen 等;《IEEE Xplore》;20100916;全文 * |
| SHP文件数字水印的研究;安志远 等;《福建电脑》;20160131(第2016年第1期);第8-9,17页 * |
| 基于双重置乱技术的实数傅里叶变换域数字水印算法;沈杨 等;《吉林化工学院学报》;20130731;第30卷(第7期);第54-57页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106952214A (en) | 2017-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106251278A (en) | A kind of image encryption territory based on histogram feature reversible information hidden method | |
| CN103442157A (en) | Image encryption method based on Arnold transformations and Henon chaotic system | |
| CN116582246B (en) | Vector geospatial data exchange cipher watermarking method based on chaos and zero watermarking | |
| Wei et al. | A technique for sharing a digital image | |
| CN110225222B (en) | Image encryption method based on 3D orthogonal Latin square and chaotic system | |
| CN106228503B (en) | The digital watermark embedding and extracting method of satellite remote-sensing image SHP dot files | |
| Prashanti et al. | Data confidentiality using steganography and cryptographic techniques | |
| Yadav et al. | 3-Level security based spread spectrum image steganography with enhanced peak signal to noise ratio | |
| Yu et al. | Reversible data hiding in encrypted images for coding channel based on adaptive steganography | |
| CN106952214B (en) | Towards the digital watermark embedding and extracting method of remote sensing images SHP faces file | |
| Ma et al. | Security analysis of a reversible watermarking algorithm for encrypted images in wavelet domain | |
| Wu et al. | A chaos based robust spatial domain watermarking algorithm | |
| Hassan et al. | Self watermarking based on visual cryptography | |
| Abu-Alhaija | Crypto-Steganographic LSB-based System for AES-Encrypted Data | |
| Tiwari et al. | A Robust Method for Image Steganography based on chaos theory | |
| Kaur et al. | A review of image encryption schemes based on the chaotic map | |
| Chalam et al. | Unified Approach with Neural Network for Authentication, Security and Compression of Image: UNICAP | |
| Talee et al. | A new approach for chaotic encrypted data hiding in color image | |
| Bai et al. | Image digital watermarking based on a novel clock-controlled generator | |
| Zhu et al. | An efficient chosen-plaintext attack and improvement on an image encryption algorithm based on cyclicshift and multiple chaotic map | |
| Li et al. | Reality-preserving image encryption assosiated with the chaos and the LCT | |
| Liu et al. | Encrypted Image Steganographic Scheme based on Pixel Valued Differencing | |
| Degadwala et al. | An Efficient Privacy Preserving System Based on RST Attacks on Color Image | |
| Dawood et al. | A Comprehensive Review of Color Image Encryption Technology | |
| Al-Sewadi | Multiple Pseudo Random Number Generators Implementation for Watermarking Technique |
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 |