CN104915918B - A kind of strong robust digital watermark method towards photomap - Google Patents
A kind of strong robust digital watermark method towards photomap Download PDFInfo
- Publication number
- CN104915918B CN104915918B CN201510349570.6A CN201510349570A CN104915918B CN 104915918 B CN104915918 B CN 104915918B CN 201510349570 A CN201510349570 A CN 201510349570A CN 104915918 B CN104915918 B CN 104915918B
- Authority
- CN
- China
- Prior art keywords
- watermark
- map
- mrow
- mtd
- pseudo
- 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
Abstract
Present invention relates particularly to be a kind of strong robust digital watermark method towards photomap.Data structure of the invention according to IMG photomaps, the chained list of node is read, and obtain the pixel value of each node respectively according to corresponding field；Watermark binary coding is obtained, generates corresponding pseudo-random sequence；Scale and pseudo-random sequence size according to the map, setting are less than the value of 1 pixel unit as threshold value, the translation in eight directions are carried out to map；The difference of each characteristic point and surrounding pixel point is calculated, and reads pseudo-random sequence, by the pixel value of the product accumulation of corresponding stochastic ordering train value and pixel value difference to this feature point；For the map after embedded watermark, wherein a few width issues are randomly selected.The present invention realizes the watermark insertion and extraction of strong robustness.Watermark is embedded in luminance difference of the carrier based on image, and is embedded in the extremely strong map of several correlations, and watermark is once destroyed, and can be recovered by the correlating and average pixel value of map.
Description
Technical field
Present invention relates particularly to be a kind of strong robust digital watermark method towards photomap.
Background technology
Remote sensing image (satellite, aviation, ground close shot) obtains earth surface covering and structural information as earth observation
Carrier, it is indispensable information source in geoanalysis application field.And how geographical image is converted into valuable information
It is vital again to successful implementation GIS and drawing engineering.At present, increasing people can utilize entirely around us
The geographical audio and video products of scope extract and using valuable information.
As the initial data source of numerous numerical maps, the authenticity and security of photomap are especially paid close attention to,
The legitimate interests of the map owner should be safeguarded, lacks map content again and is not tampered with, therefore, photomap digital watermarking is ground
Study carefully to have obtained more quickly development.
At present, it is seldom to the digital watermarking algorithm of photomap, mainly include two classes for the watermarking algorithm of image：It is i.e. empty
Between domain and frequency domain.Spatial-domain algorithm is mainly embedded in watermark by changing Pixel Information, and algorithm is realized simply, but robustness
Poor, the damage to image is also larger, can not resisting various attacks；Frequency domain algorithm is become by discrete cosine transform, Fourier
Changing or wavelet transformation etc. is mathematically obtained frequency coefficient, watermark is embedded in by adjusting frequency coefficient, such algorithm is more complicated,
Also there is certain influence to the quality of image, and multiple combinations attack can not be resisted.
Deficiency based on spatial-domain algorithm and frequency domain algorithm, some scholars propose the algorithm of lossless shadow map watermark,
Mainly to study as follows：Wang Xianmin etc. proposed small echo in 2004 and is used for the blind water of self-adaption two-dimensional based on characteristics of remote sensing image
Print algorithm；Wang Xun etc. proposes a kind of map vector digital watermarking algorithm of robust；Liu Jiufen etc. proposes a kind of anti-geometry and attacked
The wavelet transformed domain watermarking algorithm hit；Open army etc. and invent the digital watermark based on neutral net for being used for image authentication；
Fertile spark etc. proposes the Gray-level adaptive blind watermarking of view-based access control model characteristic.This algorithm is based on towards the strong of photomap
The algorithm of robust watermarking book, compared with algorithm above, spatial-domain algorithm and frequency domain algorithm is allowed more to optimize.
The content of the invention
It is an object of the invention to provide one kind to be highly resistant to various attacks, has high security and invisibility
Towards the strong robust digital watermark method of photomap.
The present invention comprises the following steps：
(1) according to the data structure of IMG photomaps, the chained list of node is read, and is obtained respectively often according to corresponding field
The pixel value of individual node；
(2) scanning watermark bitmap, watermark binary coding is obtained, generates corresponding pseudo-random sequence L,
Wherein, La ∈ {+1, -1 }, L are a pseudo-random sequences being made up of N number of element, and N is the length of watermark encoder；
(3) scale and pseudo-random sequence size according to the map, setting are less than the value of 1 pixel unit as threshold value, over the ground
Figure carries out the translation in eight directions, including upper T, upper right RT, right R, bottom right RD, lower D, lower-left LD, left L, upper left LT；
(4) for eight width maps after displacement, according to clock-wise order, wherein 3 width maps are randomly selected, in conjunction with primitively
Figure collectively constitute watermark to be embedded atlas V | vi|1≤i≤4}；
(5) utilize human visual system, detect each width map, according to atlas V | vi| 1≤i≤4 }, according to each
The coding rule of only embedded 1 bit watermark of node, chooses the set of characteristic points of maximum-norm, while extract the pixel of corresponding node
Value；
(6) difference of each characteristic point and surrounding pixel point is calculated, and reads pseudo-random sequence, by corresponding random sequence
Pixel value of the product accumulation of value and pixel value difference to this feature point；
(7) for the map after embedded watermark, wherein a few width issues are randomly selected；
(8) in watermark detection, geodetic graph to be checked and other embedded watermarks but the map do not issued is mutually merged, tried to achieve
Map with average pixel value；
(9) according to the pseudo-random sequence of original watermark, and the watermark map after fusion, calculate correlation coefficient, if
The absolute value of coefficient correlation is more than or equal to set threshold value, then shows to detect watermark encoder, be otherwise not detected by；
(10) coding is reduced to watermark bitmap, and calculates similarity.
The generation step of the atlas of described watermark to be embedded includes：
For every width map vi, watermark embedment strength corresponding to calculating：
S(vi)={ s (pj)>0|1≤j≤N}
Wherein, s (pj) represent characteristic point p in mapjImperceptible degree in HVS systems, i.e. pjWith around other its
The luminance difference of his eight pixel nodes；
Watermark sequence is successively read, to each characteristic point：
s′(pj)=s (pj)+s(pj)Lj,
vi'=vi+s(pj)Lj,
Obtain V ' | vi′|1≤i≤4}。
The beneficial effects of the present invention are
The present invention is based entirely on the chromatic characteristic of photomap, by way of more figures coexist, keep map essentially like
Plain feature, the horizontal purpose deposited of watermark is reached, has specifically included：
Realize the watermark insertion and extraction of strong robustness.Watermark is embedded in luminance difference of the carrier based on image, and embedded
In the extremely strong map of several correlations, watermark is once destroyed, can by the correlating and average pixel value of map and
Recovered.
Extremely strong robustness.By test, watermark is seriously damaged, and only needs photomap carrier to have availability, then
Average recovery can be carried out by correlation map, obtains the higher watermark information of similarity.
It is preferably disguised.Combine HVS principles in the selection of watermark insertion node, characteristic point be all some visions not
The position easily discovered, and by calculating luminance difference, effectively control color caused by being embedded in due to watermark and disturb, due to insertion
Position it is extremely hidden, attacker is difficult that ad hoc watermark is launched a offensive.
Brief description of the drawings
Fig. 1 photomap file structures；
Fig. 2 a photomap original maps；
Panning effect figure on the right side of Fig. 2 b images ground；
Fig. 2 c images ground bottom right panning effect figure；
Fig. 3 experimental arrangements interface；
Fig. 4 overall system architecture figures；
Fig. 5 watermarks are embedded in flow chart.
Embodiment
The present invention is described in more detail with reference to experiment embodiment：
Proposed by the present invention is a kind of strong robust watermarking method towards photomap.(1) photomap file is read, is obtained
Obtain complete data structure；(2) according to the data structure of IMG images, map color characteristic value is extracted, pixel value is compiled
Code；(3) given threshold is combined, original map is existed according to upper and lower, left and right, upper left, lower-left, upper right, the direction of bottom right eight
Random translation in threshold range；(4) 4 width are randomly selected in the map for translating to obtain from eight width, and image is collectively constituted with artwork
Sequence；(5) make watermark bitmap and be converted to binary sequence, corresponding watermark encoder produces one and is available for embedded pseudorandom sequence
Row；(6) to selected image sequence, limited individual characteristic point is chosen with reference to HVS (human visual system) principles and threshold value, is calculated special
Sign point pixel and around it other eight pixels difference；(7) it is pixel value difference is corresponding with the result of product of pseudo-random sequence
Ground is added in characteristic point；(8) recurrence complete aforesaid operations, then randomly select have been inserted into it is any in 5 width maps of watermark
Several width release.
The present invention is the information processing method on cartography and Geographical Information Sciences, mainly a kind of IMG format images
The water mark method of map.
The object of the present invention is achieved like this：Insertion and extraction including watermark, its step include：
(1) IMG photomap files are read, obtain the chained list of all pixels information.
(2) scanning watermark bitmap, watermark binary coding is obtained, and generates pseudo-random sequence.
(3) given threshold, and threshold value is combined, the translation in eight directions is carried out to map.
(4) eight width maps after displacement are obtained, randomly select wherein three width, water to be embedded is used as in the lump in conjunction with original map
The map of print.
(5) HVS (human visual system) system is utilized, detects every width map, obtains characteristic point.
(6) difference of each characteristic point and surrounding pixel point is calculated, by multiplying for corresponding stochastic ordering train value and pixel value difference
Accumulation is added to this feature point.
(7) for the map after embedded watermark, wherein a few width issues are randomly selected.
(8) in watermark detection, geodetic graph to be checked and other embedded watermarks but the map do not issued is mutually merged, tried to achieve
Map with average pixel value.
(9) according to the watermark map after original watermark sequence, and fusion, calculate correlation coefficient.Detect watermark encoder.
(10) coding detected is reduced to watermark bitmap, and calculates the similarity with original watermark.
The present invention can also include：
2nd, in the step of described reading IMG photomap files, directly according to the data knot of tissue of IMG pyramids
Structure, since chained list head node, read the pixel value field of each node.
3rd, in the step of described pseudo-random sequence generation, specific method is：
It is binary watermark encoder sequence by bitmap-converted according to the watermark bitmap defined, then scanning is every successively
Individual watermark bit value, and build pseudo-random sequence L according to following rule.
Wherein, La ∈ {+1, -1 }, then L is a pseudo-random sequence being made up of N number of element, and N is corresponding binary system watermark
The length of coding.
4th, in the setting of described threshold value and map translation motion, strong disturbance is crossed for watermark map in order to reduce, is limited
Unit is translated no more than 1 pixel, therefore threshold value is less than 1, meanwhile, in order to play the purpose obscured and spread, according to counterclockwise
Direction defines eight translation modes, and eight width for obtaining different directions derive map.
5th, it is for the relation of both balancing safety and efficiency during described map is chosen, it is impossible to cross how often
Insertion watermark information, therefore 3 width are chosen from the derivative map obscured, and combine original map conduct can be embedded in watermark in the lump
Map object V | vi|1≤i≤4}。
6th, it is every according to HVS (human visual system) principle, scanning during described every width map feature point is chosen
One width map, the key node in the insensitive region of vision is found, the Selection Strategy of finish node is with reference to per node only embedded 1
The rule of bit watermark, choose most element sets.
7th, in described digital watermark embedding strategy, watermark pseudo-random sequence is added to vision with the product of luminance difference
In insensitive characteristic point, specific method is：
For every width map vi, watermark embedment strength, i.e. watermark capacity corresponding to calculating：
S(vi)={ s (pj)>0|1≤j≤N}
Wherein, s (pj) represent characteristic point pjIn the case of keeping vision insensitive in HVS systems, pjWith around other other
The luminance difference of eight pixel nodes.
Specifically, after reading the pseudo-random sequence value of watermark, watermark information is embedded in each characteristic point in map：
s′(pj)=s (pj)+s(pj)Lj
To every width map thus recursive calculation：
vi'=vi+s(pj)Lj
Finally give the atlas after embedded digital watermarking V ' | vi′|1≤i≤4}。
8th, during described watermark map publishing, that is, choose atlas V ' | vi' | 1≤i≤4 } in part map
Issue.
9th, in described watermark information detection process, by map V ' to be detected and other embedded watermarks but the ground do not issued
Scheme V0Blend, according to threshold value T, inversely translate V0, and to map V ' carry out backward recoveries to be detected, try to achieve average pixel value
Map specimen
10th, specific watermark extracting mode is：According to original watermark W0Create-rule, regenerate pseudo-random sequence L,
Calculate L and map specimenDegree of association C：
If | C |>T, show that map has been embedded in doubtful watermark Wt；Otherwise, show that pseudo-random sequence is not present in map
It is interior, i.e., without watermark is detected in map, it is embodied as：
Especially, in unit watermark comparison procedure, being tied to form just like ShiShimonoseki vertical：
Wherein, wi∈Wt,∑ici=C.
11st, for the watermark sequence tried to achieve, by the Similarity Measure with original watermark, the authenticity and ground of watermark are determined
The integrality of figure.For the watermark identifier W detectedt, partial information bit loss is caused because map is under attack, causes WtWith
Raw water print W contents are inconsistent.On the other hand, need to carry out similarity watermark detection：
W0For original watermark, WtFor the watermark detected.N is watermark capacity.For Wi≠WtiThere are two kinds of situations：1. bit
Bit value is opposite；2. body spy bit value is sky.
Embodiment 1
A kind of strong robust digital watermark method towards photomap, include the insertion and extraction of watermark, its step includes：
(1) IMG photomap files are read, obtain the chained list of all pixels information.
(2) scanning watermark bitmap, watermark binary coding is obtained, and generates corresponding pseudo-random sequence.
(3) scale and pseudo-random sequence size, automatic given threshold, and combine threshold value according to the map, eight are carried out to map
The translation in individual direction.
(4) for eight width maps after displacement, three width therein is randomly selected, in conjunction with original map in the lump as to be embedded
The map of watermark.
(5) HVS (human visual system) system is utilized, each width map is detected, obtains its characteristic point and its pixel value.
(6) difference of each characteristic point and surrounding pixel point is calculated, and reads pseudo-random sequence, by corresponding random sequence
Pixel value of the product accumulation of value and pixel value difference to this feature point.
(7) for the map after embedded watermark, wherein a few width issues are randomly selected.
(8) in watermark detection, because the map in application process can be by different degrees of change, therefore, will be to be checked
Geodetic graph and other embedded watermarks but the map do not issued mutually merges, try to achieve the map with average pixel value.
(9) according to the watermark map after the pseudo-random sequence of original watermark, and fusion, calculate correlation coefficient.If
The absolute value of coefficient correlation is more than or equal to set threshold value, then shows to detect watermark encoder, be otherwise not detected by.
(10) by the above-mentioned means, coding is reduced into watermark bitmap, and similarity is calculated.
According to the data structure of IMG photomaps, the chained list of node is read, and obtains each section respectively according to corresponding field
The pixel value of point.
According to the watermark bitmap defined, binary watermark encoder sequence is denoted as, and according to following regular structure
Build pseudo-random sequence L.
Wherein, La ∈ {+1, -1 }, L are a pseudo-random sequences being made up of N number of element, and N is the length of watermark encoder.
A value for being less than 1 pixel unit is randomly selected as threshold value, and according to threshold size according to clockwise
Translation obtains eight width maps respectively.Direction is：Upper (T), upper right (RT), right (R), bottom right (RD), under (D), lower-left (LD), left
(L), upper left (LT).
Consider robustness and computational efficiency, according to clock-wise order, wherein 3 width maps are randomly selected, in conjunction with original map
Collectively constitute watermark to be embedded atlas V | vi|1≤i≤4}。
Gather according to the map V | vi| 1≤i≤4 }, it is only embedding according to each node according to HVS (human visual system) principle
Enter the coding rule of 1 bit watermark, choose the set of characteristic points of maximum-norm, while extract the pixel value of corresponding node.
For every width map vi, watermark embedment strength corresponding to calculating：
S(vi)={ s (pj)>0|1≤j≤N} (2)
Wherein, s (pj) represent characteristic point p in mapjImperceptible degree in HVS systems, i.e. pjWith around other its
The luminance difference of his eight pixel nodes.Ensure that watermark insertion does not cause excessive disturbance to map with this.
Specifically, watermark sequence is successively read, to each characteristic point：
s′(pj)=s (pj)+s(pj)Lj (3)
Thus：
vi'=vi+s(pj)Lj (4)
Obtain being embedded in after watermark atlas V ' | vi′|1≤i≤4}。
The present invention can arbitrarily choose at most 3 width map publishings to facilitate follow-up watermark extracting from V '.
The present invention is according to the watermark map and geodetic graph to be checked do not issued, according to threshold definitions, selected part area pixel
After value is contrasted, backward recovery is carried out to all translation maps, and finally try to achieve the map specimen of average pixel value.
The present invention regenerates pseudo-random sequence, calculates its ground with average pixel value according to original watermark create-rule
The degree of association of pattern sheet, if random sequence is present in map, the absolute value of the degree of association must be more than threshold value；Association is spent
It is small, then show that pseudo-random sequence is not present in map, i.e., without detected watermark in map.
The present invention is for the watermark sequence tried to achieve, by the Similarity Measure with original watermark, determines the authenticity of watermark
With the integrality of map.
Strong robust digital watermark method of the invention towards photomap, carrier are the Digital image map of IMG forms,
IMG can be converted directly into the multiple formats such as TIFF, JPG, CNG.Development environment is VC.6.0, as shown in figure 4, mainly verifying number
The embedding grammar and extracting method of word watermark.
(1) data structure of photomap file interior joint Pixel Information is read
Because the organizational form of the node of IMG files is similar to binary tree (as shown in Figure 1).Read the node of IMG files
During pixel data, using first order traversal, each node has oneself chained list and header file, the storage organization of header file
EhfaEntry forms are as follows：
Longnext；The position * of/* next nodes/
Longprey；The position * of the previous nodes of/*/
Longparent；The position * of/* father nodes/
Longchild；The position * of/* the first child node/
Longdata；/*The deposit position of pixel data*/
Longdatasize：/ * size of data */
Char[64]name；The name * of/* nodes/
Char[32]type；The storage organization * of/* nodes/
TIMEmodTime；The modification time * of this node of/*/
There is specific Pixel Information after the data fields of each node.
(2) watermark sequence is produced by scanning input watermark bitmap
Program reads watermark bitmap, the pixel value of surface sweeping bitmap, obtains binary sequence.In order to improve security, generation pair
The pseudo-random sequence answered.
(3) characteristic point of every width map is extracted
As shown in Fig. 2 needing to be embedded in the object of watermark after selection translation, watermark encoder length is write into HVS systems, specifically
Ground：
A reads photomap file, according to pseudo-random sequence size, determines the number of characteristic point；
B utilizes HVS systems, scans full width map, searches for the insensitive characteristic point of maximum quantity, if characteristic point have it is adjacent
Situation, then compare its brightness value；
If the optional numbers of c are ranked up according to brightness value still greater than watermark encoder length, determine priority；
D preserves set of characteristic points.
(4) pseudo-random sequence is write into map successively
Comprise the following steps that：
A reads the Pixel Information of first Object node.
B compares the luminance difference of the node and surrounding adjacent node, records the difference.
C flow charts as shown in Figure 5, watermark encoder sequence are write successively in the pixel data of each node, i.e., by brightness
Pixel value of the product accumulation of difference (paying attention to just bearing) coding corresponding with pseudo-random sequence to the node.
D preserves map file.
As shown in figure 3, it is main program interface.
(5) new map specimen is obtained, extracts digital watermarking
Map file to be detected is read, according to the map file of identical content, translation recovery is carried out to map again, asked for
The average pixel value of map is detected, obtains map specimen, and calculates the degree of correlation of map specimen and pseudo-random sequence, if related
The absolute value of coefficient is more than threshold value then corresponding watermark extracting success.
(6) according to the binary watermarking sequence of reading and the size of watermark bitmap, watermark bitmap is generated.
According to the byte number of the watermark bitmap extracted, bitmap byte number=bitmap width * Bitmap Heights, and read
Binary watermarking sequence can generate original watermark.And NC values are carried out to original watermark bitmap and the watermark bitmap detected and relatively come
Determine the authenticity and integrated degree of watermark.
Claims (2)
1. a kind of strong robust digital watermark method towards photomap, include the insertion and extraction of watermark, it is characterised in that bag
Include following steps：
(1) according to the data structure of IMG photomaps, the chained list of node is read, and obtains each section respectively according to corresponding field
The pixel value of point；
(2) scanning watermark bitmap, watermark binary coding is obtained, generates corresponding pseudo-random sequence L,
<mrow>
<mi>L</mi>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>L</mi>
<mi>a</mi>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mi>f</mi>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>m</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mn>1</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>-</mo>
<mi>L</mi>
<mi>a</mi>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mi>f</mi>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>m</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mn>0</mn>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>;</mo>
</mrow>
Wherein, La ∈ {+1, -1 }, L are a pseudo-random sequences being made up of N number of element, and N is the length of watermark encoder；
(3) scale and pseudo-random sequence size, setting are less than the value of 1 pixel unit as threshold value, map are entered according to the map
The translation in eight directions of row, including upper T, upper right RT, right R, bottom right RD, lower D, lower-left LD, left L, upper left LT；
(4) for eight width maps after displacement, according to clock-wise order, wherein 3 width maps is randomly selected, are total in conjunction with original map
With form watermark to be embedded atlas V | vi|1≤i≤4}；
(5) utilize human visual system, detect each width map, according to atlas V | vi| 1≤i≤4 }, according to each node only
The coding rule of embedded 1 bit watermark, chooses the set of characteristic points of maximum-norm, while extract the pixel value of corresponding node；
(6) calculate the difference of each characteristic point and surrounding pixel point, and read pseudo-random sequence, will corresponding stochastic ordering train value with
Pixel value of the product accumulation of pixel value difference to this feature point；
(7) for the map after embedded watermark, wherein a few width issues are randomly selected；
(8) in watermark detection, geodetic graph to be checked and other embedded watermarks but the map do not issued are mutually merged, trying to achieve has
The map of average pixel value；
(9) according to the watermark map after the pseudo-random sequence of original watermark, and fusion, calculate correlation coefficient, if related
The absolute value of coefficient is more than or equal to set threshold value, then shows to detect watermark encoder, be otherwise not detected by；
(10) coding is reduced to watermark bitmap, and calculates similarity.
2. a kind of strong robust digital watermark method towards photomap according to claim 1, it is characterised in that described
The generation step of atlas of watermark to be embedded include：
For every width map vi, watermark embedment strength corresponding to calculating：
S(vi)={ s (pj)>0|1≤j≤N}
Wherein, s (pj) represent characteristic point p in mapjImperceptible degree in HVS systems, i.e. pjWith around other other eight
The luminance difference of individual pixel node；
Watermark sequence is successively read, to each characteristic point：
s′(pj)=s (pj)+s(pj)Lj,
vi'=vi+s(pj)Lj,
Obtain V ' | vi′|1≤i≤4}。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510349570.6A CN104915918B (en) | 2015-06-23 | 2015-06-23 | A kind of strong robust digital watermark method towards photomap |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510349570.6A CN104915918B (en) | 2015-06-23 | 2015-06-23 | A kind of strong robust digital watermark method towards photomap |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104915918A CN104915918A (en) | 2015-09-16 |
| CN104915918B true CN104915918B (en) | 2017-12-19 |
Family
ID=54084960
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510349570.6A Active CN104915918B (en) | 2015-06-23 | 2015-06-23 | A kind of strong robust digital watermark method towards photomap |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104915918B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106991423B (en) * | 2016-01-21 | 2019-06-07 | 腾讯科技（深圳）有限公司 | Identify specification picture in whether include watermark method and device |
| CN106372467B (en) * | 2016-08-31 | 2019-11-12 | 哈尔滨工程大学 | A kind of sea chart water mark method for copyright protection based on color component |
| CN110913092B (en) * | 2019-11-26 | 2021-06-29 | 西南交通大学 | Reversible information hiding method for encrypted image |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101149835A (en) * | 2007-10-29 | 2008-03-26 | 中国人民解放军信息工程大学 | Map data rasterizing based robust blind water mark embedding and extraction method |
| CN101458810A (en) * | 2008-12-08 | 2009-06-17 | 哈尔滨工程大学 | Vector map watermark method based on object property characteristic |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7457962B2 (en) * | 1996-07-02 | 2008-11-25 | Wistaria Trading, Inc | Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data |
| US7130442B2 (en) * | 1996-10-28 | 2006-10-31 | International Business Machines Corporation | Protecting images with an image watermark |
-
2015
- 2015-06-23 CN CN201510349570.6A patent/CN104915918B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101149835A (en) * | 2007-10-29 | 2008-03-26 | 中国人民解放军信息工程大学 | Map data rasterizing based robust blind water mark embedding and extraction method |
| CN101458810A (en) * | 2008-12-08 | 2009-06-17 | 哈尔滨工程大学 | Vector map watermark method based on object property characteristic |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104915918A (en) | 2015-09-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chang et al. | A secure fragile watermarking scheme based on chaos-and-hamming code | |
| CN102880998B (en) | The extracting method of watermarking images | |
| CN102682418B (en) | Method for embedding and extracting multiple zero watermarks of digital image | |
| CN103384331A (en) | Video inter-frame forgery detection method based on light stream consistency | |
| CN102156952A (en) | Copyright-protection-service-oriented remote sensing image digital watermarking method | |
| CN104915918B (en) | A kind of strong robust digital watermark method towards photomap | |
| CN102147912A (en) | Adaptive difference expansion-based reversible image watermarking method | |
| Kuo et al. | A reversible data hiding scheme based on block division | |
| CN107067363B (en) | A kind of non-blind robust Spatial Domain Image Watermark method constant based on pixel order relation | |
| CN104778651A (en) | Digital image authentication method based on super-pixels | |
| CN104794677A (en) | Vector map watermark method based on space geometric features | |
| CN103024375B (en) | A kind of stereo-picture semi-fragile watermarking method that just can perceive distortion based on binocular | |
| CN101706943B (en) | Image map watermarking method based on file attribute features | |
| Ni et al. | Pinpoint authentication watermarking based on a chaotic system | |
| CN102880997B (en) | Method for embedding watermark image | |
| Keyvanpour et al. | An effective chaos-based image watermarking scheme using fractal coding | |
| Luo et al. | A reversible data hiding scheme for 3D point cloud model | |
| CN106056521A (en) | RSD attack resistant digital fingerprint blind detection method based on difference feature point grid | |
| Radouane et al. | A Method of LSB substitution based on image blocks and maximum entropy | |
| Niu et al. | GIS watermarking: hiding data in 2D vector maps | |
| Huo et al. | Protecting GIS vector map using the k-means clustering algorithm and odd-even coding | |
| CN103325084A (en) | Three-dimensional image fragile watermark method based on joint just noticeable distortion | |
| CN103559677B (en) | Based on the adapting to image watermark embedding method of wavelet transformation and visual characteristic | |
| CN106599727A (en) | Vector map integrity authentication method | |
| Behravan et al. | Introducing a new method of image reconstruction against crop attack using sudoku watermarking algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |