CN101706943A - Image map watermarking method based on file attribute features - Google Patents
Image map watermarking method based on file attribute features Download PDFInfo
- Publication number
- CN101706943A CN101706943A CN200910073150A CN200910073150A CN101706943A CN 101706943 A CN101706943 A CN 101706943A CN 200910073150 A CN200910073150 A CN 200910073150A CN 200910073150 A CN200910073150 A CN 200910073150A CN 101706943 A CN101706943 A CN 101706943A
- Authority
- CN
- China
- Prior art keywords
- watermark
- file
- bitmap
- watermarking
- binary
- 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
Images
Landscapes
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The invention provides an image map watermarking method based on file attribute features, comprising the steps: (1) reading a data structure containing redundant bytes in an image map file; (2) scanning a watermarking bitmap and converting the watermarking bitmap into a binary sequence; (3) writing the length and sequence to be embedded of the binary sequence into a preferred space of the redundant bytes; (4)sequentially writing binary watermarking sequences into the redundant bytes of the file; (5) reading the size of the watermarking bitmap by utilizing a watermark extraction unit; (6) sequentially reading the binary watermarking sequences by the watermark extraction unit; and (7) according to the binary watermarking sequences and the size of the watermarking bitmap, generating the watermarking bitmap. The image map watermarking method based on file attribute features realizes completely lossless watermarking embedding and extraction, does not cause any damage to the map file, and has better robustness and invisibility.
Description
Technical field
What the present invention relates to is information processing method about cartography and geography information science, mainly is a kind of image map watermarking method.
Background technology
Digital watermark technology is a kind of generally acknowledged means of digital product being carried out copyright protection.Held first international information in Britain Camb newton research institute in 1996 and hidden scientific seminar, indicated the birth of Information hiding, and also obtained developing rapidly as the research of the digital watermark technology of one of main branch of Information hiding.In recent years, the digital watermark technology of image has been obtained bigger achievement.
At present, to the digital watermarking algorithm of photomap seldom, mainly comprise two classes: i.e. spatial domain and frequency field for the watermarking algorithm of image.The spatial domain algorithm mainly is to come embed watermark by revising Pixel Information, and algorithm is realized simple, but robustness is relatively poor, and is also bigger to the damage of image, can't resist multiple attack; The frequency field algorithm obtains frequency coefficient by mathematical methods such as discrete cosine transform, Fourier transform or wavelet transformations, come embed watermark by adjusting frequency coefficient, such algorithm is complicated, the quality of image is also had certain influence, and can't resist multiple combination attacks.
Document related to the present invention has:
[1] Wang Xianmin, Guan Zequn, Wu is heavy cold. and small echo is used for based on the blind watermarking algorithm of the self-adaption two-dimensional of remote sensing image feature. computer engineering and application, 2004,20:37-41;
[2] Wang Xun, vast stretch of wooded country, Bao Hujun. a kind of map vector digital watermarking algorithm of robust. computer-aided design (CAD) and graphics journal, 2004,16 (10): 1377-1381;
[3] Liu Jiufen, Wang Zhenwu, yellow intelligent. the wavelet transformed domain image watermark algorithm of resist geometric attacks. journal of Zhejiang university: engineering version, 2003,37 (4): 386-392;
[4] Zhang Jun, Wang Nengchao. be used for the digital watermark based on neural network of image authentication. computer-aided design (CAD) and graphics journal, 2003,15 (3): 307～312;
[5] fertile spark, Korea S is strong, opens ripple. based on the Gray-level adaptive blind watermarking of visual characteristic. and communication journal, 2003,24 (9): 132～141.
Summary of the invention
The object of the present invention is to provide a kind of photomap 100% of Img form that can guarantee can't harm, be highly resistant to multiple combination attacks, have a kind of image map watermarking method of high security and invisibility based on file attribute features.
The object of the present invention is achieved like this:
Comprise the embedding and the extraction of watermark, its step comprises:
(1) reads the data structure that contains redundancy bytes in the photomap file;
(2) the scanning watermark bitmap saves as binary sequence;
(3) watermark bitmap capital and small letter is gone in preceding 8 bytes of redundant file to preserve;
(4) the binary watermarking sequence is written to successively in all the other bytes of redundant file;
(5) utilize the watermark extracting unit to read out the watermark bitmap size;
(6) utilize the watermark extracting unit to read the binary watermarking sequence successively;
(7), generate the watermark bitmap according to the binary watermarking sequence that reads and the size of watermark bitmap.
The present invention can also comprise:
1, described reading in the data structure step that contains redundancy bytes in the photomap file when reading the satellite remote sensing map file of Img form, read the data structure that contains redundancy bytes by the traversal mode; The data structure that wherein contains redundancy bytes is meant name field in the node of Archive sit, and the name field is that a size is 64 character type array, and nodename leaves several in front in, and the character of back is end mark entirely.
2, described scanning watermark bitmap saves as in the binary sequence step, is that the watermark bitmap is lined by line scan, and draws a string binary watermarking sequence.
3, preserve in the step in described preceding 8 bytes of watermark bitmap capital and small letter being gone into redundant file, the end mark that contains node name among the data structure Ehfa Entry of redundancy bytes and be name field back all is useless character for file, utilizes these characters watermark information can be hidden wherein; But read out useless end mark in all data structures of photomap file as the redundant file of water mark inlaying, and the size of watermark bitmap is written in preceding 8 bytes of redundant file and preserves.
4, in described all the other bytes that the binary watermarking sequence are written to successively redundant file in the step, specific practice is as follows:
Begin to carry out watermark from the 9th byte of redundant file and embed, the ASCII that is about to per 8 bit of the binary watermarking sequence corresponding character of encoding embeds in the name field array; After watermark embedded, the end mark front was node name, and the end mark back is a watermark information, and the user can only read end mark when checking node name, so this watermark has disguised preferably.
5, the described watermark extracting unit that utilizes reads out in the watermark bitmap size step, according to reading the traversal order that contains the redundancy bytes data structure in the step 1 redundant file that contains watermark is traveled through, and extract the size of the watermark bitmap in preceding 8 bytes of redundant file.
6, the described watermark extracting unit that utilizes reads in the binary watermarking sequence step successively, according to reading the traversal order that contains the redundancy bytes data structure in the step 1 redundant file that contains watermark is traveled through, and extract the 9th binary watermarking sequence that byte is later in the redundant file successively.
7, the binary watermarking sequence that reads of described basis and the size of watermark bitmap, generate in the watermark bitmap step, because the bitmap size that extracts is to set in advance, can calculate the byte number of bitmap according to the size of setting, be bitmap byte number=bitmap width * bitmap height, therefore can generate the watermark picture by binary watermarking sequence that reads and bitmap size.
The harmless water mark method that the present invention is based on file attribute features has the following advantages:
(1) realized that harmless fully watermark embeds and extracts.Watermark is embedded into the redundant position of file, modification be absolute useless information, be harmless fully therefore to map, do not influence the use of map datum.
(2) can not increase the size of map file.This programme is not to add hereof by revising data embed watermark redundant in some files, therefore can not increase the size of file.
(3) can not damage the original data.Add according to file structure the position that watermark embeds, and therefore the data of the redundancy in the just file of modification can not damage file structure and original data.
(4) robustness preferably.Through test, this water mark method can be resisted multiple attack, is not knowing under the situation of embedding grammar, and the assailant is the effect that is difficult to the watermarking images of influence proposition.
(5) disguised preferably. the pixel value of the map before and after this programme embeds without any variation, promptly use powerful ERDAS IMAGINE professional treatment software also can't perceive this map and whether contain watermark, because the position that embeds is very hidden, even the assailant can read the position that file structure also can't find watermark, be difficult to watermark is attacked.
Description of drawings
Fig. 1 watermark embeds process flow diagram;
Fig. 2 watermark extracting process flow diagram;
The structural drawing of Fig. 3 photomap Archive sit;
Fig. 4 watermark embeds program interface;
Fig. 5 watermark extracting program interface;
Fig. 6 (a)-Fig. 6 (h) is the synoptic diagram of 8 kinds of combination attacks patterns, be followed successively by random shearing, random noise, random shearing+Gaussian noise, random shearing+random noise, random shearing+salt-pepper noise, random shearing+Gaussian noise+salt-pepper noise, random shearing+Gaussian noise+random noise, random shearing+Gaussian noise+salt-pepper noise+random noise+translation.
Embodiment
For example the present invention is done description in more detail below in conjunction with accompanying drawing:
The present invention is based on the image map watermarking method of file attribute features, carrier is the photomap of Img form, and development environment is VC.6.0, mainly comprises two aspects: 1. the embedding grammar of watermarking images and extracting method (as Fig. 1, shown in Figure 2); 2.Img reading and disposal route of file structure.
1. the embedding of watermarking images and extracting method:
(1) reads the data structure that contains redundancy bytes in the photomap file;
When reading the satellite remote sensing map file of Img form,, therefore read the data structure that contains redundancy bytes by the traversal mode because the organizational form of the node of file is similar to binary tree (as shown in Figure 3).The data structure that wherein contains redundancy bytes is meant name field in the node of Archive sit, and the name field is that a size is 64 character type array, and nodename leaves several in front in, and the character of back is end mark entirely.
(2) produce watermark sequence by scanning input watermark bitmap
Program reads the watermark bitmap, the pixel value of surface sweeping bitmap since test what use is bianry image, what therefore be that scanning obtains is binary sequence.
(3) watermark bitmap capital and small letter is gone in preceding 8 bytes of redundant file to preserve;
The end mark that contains node name among the data structure Ehfa Entry of redundancy bytes and be name field back all is useless character for file, utilizes these characters watermark information can be hidden wherein.But read out useless end mark in all data structures of photomap file as the redundant file of water mark inlaying, and the size of watermark bitmap is written in preceding 8 bytes of redundant file and preserves.Concrete steps are as follows:
A reads the image file of img form, reads the node structure of file, stores the EhfaEntry object of all nodes, and the Ehfa Entry object of all nodes is deposited with the form of chained list.
The node of b sequential access chained list reads each name field in Ehfa Entry structure, and the space behind the end mark of name field is redundant file, and preceding 8 bytes of all redundant files are used for depositing watermark picture size data.
Wherein watermark picture size of c data are that per 8 bits are that one group of form with character is stored in the name field.Wherein 8 bit sequences are the characters that generate according to the ASCII coding rule.As:
01000001——A 01000010——B……
D generates destination node, and the name field that is embedded into picture size is updated to chained list, then according to write down in the chained list read node the time the address, chained list node is write node in the file.
E preserves map file.
(4) the binary watermarking sequence is written to successively in all the other bytes of redundant file;
Begin to carry out watermark from the 9th byte of redundant file and embed, the ASCII that is about to per 8 bit of the binary watermarking sequence corresponding character of encoding embeds in the name field array.After watermark embedded, the end mark front was node name, and the end mark back is a watermark information, and the user can only read end mark when checking node name, so this watermark has disguised preferably.Concrete steps are as follows:
A reads the image file of img form, reads the node structure of file, stores the EhfaEntry object of all nodes, and the Ehfa Entry object of all nodes is deposited with the form of chained list.
The node of b sequential access chained list reads each in the name of EhfaEntry structure field, and the space behind the end mark of name field is redundant file, and all redundant files are used for depositing the watermark binary sequence since the 9th byte.
C wherein binary watermarking sequence is that per 8 bits are that one group of form with character is stored in the name field.Wherein 8 bit sequences are the characters that generate according to the ASCII coding rule.As:
01000001——A?01000010——B……
D generates destination node, and the name field that is embedded into picture size is updated to chained list, then according to write down in the chained list read node the time the address, chained list node is write node in the file.
E preserves map file.
As shown in Figure 4, be exactly the watermark embedding interface based on file attribute of operation in the test.
(5) utilize the watermark extracting unit to read out the watermark bitmap size;
Read the satellite remote sensing map file of Img form, read the data structure that contains redundancy bytes in the mode that is similar to binary tree traversal.And extract the size of the watermark bitmap in preceding 8 bytes of redundant file.
(6) utilize the watermark extracting unit to read the binary watermarking sequence successively;
Read the satellite remote sensing map file of Img form, read the data structure that contains redundancy bytes in the mode that is similar to binary tree traversal.And extract the binary watermarking sequence of redundant file after the 9th byte.
(7), generate the watermark bitmap according to the binary watermarking sequence that reads and the size of watermark bitmap.
According to the byte number of the watermark bitmap that extracts, i.e. bitmap byte number=bitmap width * bitmap height, and the binary watermarking sequence that reads can generate former watermark picture.Utilize the watermark extracting program can extract the watermark in the img file and the watermark bitmap of original watermark bitmap and proposition is carried out the NC value relatively come to determine whether contain watermark in the map.The program run interface as shown in Figure 5.
2.Img reading and disposal route of file structure
The basic structure of Img file as shown in Figure 3, when reading the nodal community data of Img file, be to adopt earlier, the header file of the node read is preserved with the form of chained list along traversal, each node all has the header file of oneself, and the storage organization of header file is that Ehfa Entry form is as follows:
Long next; The position * of/* next node/
Long prey; The position * of the previous node of/*/
Long parent; The position * of/* father node/
Long child; The position * of first child node of/*/
Long data; The deposit position * of/* data/
Long datasize :/* size of data */
Char[64] name; The name * of/* node/
Char[32] type; The storage organization * of/* node/
TIME modTime; The modification time * of this node of/*/
A node that only drawn among Fig. 3, the data division that do not draw, the name in each square frame is that the name of node is the name field.More than be basic node structure, different photomaps is difference slightly.
In order to verify reliability of the present invention, utilize algorithm of the present invention to carry out following various experiments especially.The watermark of establishment embeds and extracts trace routine, and setting user profile is " Kazakhstan engineering ", i.e. the abbreviation of " Harbin Engineering University ", 1254 watermark bitmaps of binary sequence figure place.
Robust analysis, attack through the image of multiple attack strategies after watermark, and the watermark that proposes carried out watermark detection, watermark effect is very good after testing, can reach 100% extraction, as shown in table 1 is the multiple combination attacks that the map after the watermark is carried out, and the map image of attack is shown in Fig. 6 (a)-Fig. 6 (h).
Table 1
Safety analysis guarantees can not being illegally extracted of watermark; this is very vital to copyright protection; because we are according to the attribute embed watermark of file; therefore the assailant can not damage watermark under the situation of not understanding file attribute; even the assailant can analyze the embedded location that file attribute also may not recognized watermark; simply read file attribute and can not perceive the location of watermark; just stop to read because read the end mark of name field when file reads, so the assailant can not read watermark at all.
In sum, utilize watermarking algorithm, utilize the watermark of end mark mark can reach harmless watermark and embed based on file attribute, neither influence the useful data of file, can resist multiple attack again, reach 100% extraction, really realize the harmless watermark of photomap.The harmless watermark of being mentioned in the paper at present is meant: picture quality is affected behind the embed watermark, and image can can't harm recovery after the proposition watermark, and is difficult to the multiple attack of opposing.The algorithm of Ti Chuing has given new implication for harmless watermark herein.
Claims (8)
1. the image map watermarking method based on file attribute features comprises the embedding and the extraction of watermark, it is characterized in that comprising the steps:
(1) reads the data structure that contains redundancy bytes in the photomap file;
(2) the scanning watermark bitmap saves as binary sequence;
(3) watermark bitmap capital and small letter is gone in preceding 8 bytes of redundant file to preserve;
(4) the binary watermarking sequence is written to successively in all the other bytes of redundant file;
(5) utilize the watermark extracting unit to read out the watermark bitmap size;
(6) utilize the watermark extracting unit to read the binary watermarking sequence successively;
(7), generate the watermark bitmap according to the binary watermarking sequence that reads and the size of watermark bitmap.
2. a kind of image map watermarking method according to claim 1 based on file attribute features, it is characterized in that: described reading in the data structure step that contains redundancy bytes in the photomap file, read the data structure of the satellite remote sensing map file of Img form; The data structure that wherein contains redundancy bytes is meant name field in the node of Archive sit, and the name field is that a size is 64 character type array, and nodename leaves several in front in, and the character of back is end mark entirely.
3. a kind of image map watermarking method based on file attribute features according to claim 2 is characterized in that: described scanning watermark bitmap saves as in the binary sequence step, is that the watermark bitmap is lined by line scan, and draws a string binary watermarking sequence.
4. a kind of image map watermarking method according to claim 3 based on file attribute features, it is characterized in that: preserve in the step in described preceding 8 bytes of watermark bitmap capital and small letter being gone into redundant file, the end mark that utilizes node name field back among the data structure Ehfa Entry is to hide watermark information wherein.But read out useless end mark in all data structures of photomap file as the redundant file of water mark inlaying, and the size of watermark bitmap is written in preceding 8 bytes of redundant file and preserves.
5. a kind of image map watermarking method according to claim 4 based on file attribute features, it is characterized in that: in described all the other bytes that the binary watermarking sequence are written to successively redundant file in the step, specific practice is: begin to carry out watermark from the 9th byte of redundant file and embed, the ASCII that is about to per 8 bit of the binary watermarking sequence corresponding character of encoding embeds in the name field array.
6. a kind of image map watermarking method according to claim 5 based on file attribute features, it is characterized in that: the described watermark extracting unit that utilizes reads out in the watermark bitmap size step, according to reading the traversal order that contains the redundancy bytes data structure in the step 1 redundant file that contains watermark is traveled through, and extract the size of the watermark bitmap in preceding 8 bytes of redundant file.
7. a kind of image map watermarking method according to claim 6 based on file attribute features, it is characterized in that: the described watermark extracting unit that utilizes reads in the binary watermarking sequence step successively, according to reading the traversal order that contains the redundancy bytes data structure in the step 1 redundant file that contains watermark is traveled through, and extract the 9th binary watermarking sequence that byte is later in the redundant file successively.
8. a kind of image map watermarking method according to claim 7 based on file attribute features, it is characterized in that: the binary watermarking sequence that described basis reads and the size of watermark bitmap, generate in the watermark bitmap step, calculate the byte number of bitmap according to the size of setting, be bitmap byte number=bitmap width * bitmap height, generate the watermark picture by binary watermarking sequence that reads and bitmap size.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100731504A CN101706943B (en) | 2009-11-09 | 2009-11-09 | Image map watermarking method based on file attribute features |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100731504A CN101706943B (en) | 2009-11-09 | 2009-11-09 | Image map watermarking method based on file attribute features |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101706943A true CN101706943A (en) | 2010-05-12 |
| CN101706943B CN101706943B (en) | 2011-09-14 |
Family
ID=42377166
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100731504A Expired - Fee Related CN101706943B (en) | 2009-11-09 | 2009-11-09 | Image map watermarking method based on file attribute features |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101706943B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104794677A (en) * | 2015-05-05 | 2015-07-22 | 哈尔滨工程大学 | Vector map watermark method based on space geometric features |
| CN105023235A (en) * | 2015-07-09 | 2015-11-04 | 哈尔滨工程大学 | Electronic chart watermarking method based on space redundancy relation |
| CN107071455A (en) * | 2017-05-03 | 2017-08-18 | 西安科技大学 | Jpeg image information concealing method based on data flow |
| CN113032744A (en) * | 2021-03-29 | 2021-06-25 | 吉林省容汇科技服务中心(有限合伙) | Digital watermark all-in-one system |
| US11423505B2 (en) | 2018-10-25 | 2022-08-23 | Hewlett-Packard Development Company, L.P. | Encoded monochrome images of data-hiding watermarks |
-
2009
- 2009-11-09 CN CN2009100731504A patent/CN101706943B/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104794677A (en) * | 2015-05-05 | 2015-07-22 | 哈尔滨工程大学 | Vector map watermark method based on space geometric features |
| CN105023235A (en) * | 2015-07-09 | 2015-11-04 | 哈尔滨工程大学 | Electronic chart watermarking method based on space redundancy relation |
| CN105023235B (en) * | 2015-07-09 | 2018-06-12 | 哈尔滨工程大学 | A kind of electronic chart water mark method based on spatial redundancy relationship |
| CN107071455A (en) * | 2017-05-03 | 2017-08-18 | 西安科技大学 | Jpeg image information concealing method based on data flow |
| CN107071455B (en) * | 2017-05-03 | 2019-11-29 | 西安科技大学 | Jpeg image information concealing method based on data flow |
| US11423505B2 (en) | 2018-10-25 | 2022-08-23 | Hewlett-Packard Development Company, L.P. | Encoded monochrome images of data-hiding watermarks |
| CN113032744A (en) * | 2021-03-29 | 2021-06-25 | 吉林省容汇科技服务中心(有限合伙) | Digital watermark all-in-one system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101706943B (en) | 2011-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101458810B (en) | Vector map watermark method based on object property characteristic | |
| CN101706943B (en) | Image map watermarking method based on file attribute features | |
| CN104794677A (en) | Vector map watermark method based on space geometric features | |
| CN107067363B (en) | A kind of non-blind robust Spatial Domain Image Watermark method constant based on pixel order relation | |
| CN100452823C (en) | Implementation method of anti printing and scanning meaningful digital watermark with large capacity | |
| CN103377457B (en) | A kind of vector geographic data Hard Authentication vulnerable watermark method | |
| Vasudev | A review on digital image watermarking and its techniques | |
| CN1963865A (en) | A safety multifunctional image digital watermark system | |
| Yang et al. | An efficient webpage information hiding method based on tag attributes | |
| CN110211020B (en) | Image watermark embedding and extracting method based on SWT-DFT | |
| Li et al. | Study on copyright authentication of GIS vector data based on Zero-watermarking | |
| Hazim et al. | A Novel Method of Invisible Video Watermarking Based on Index Mapping and Hybrid DWT-DCT. | |
| Zope-Chaudhari et al. | Copyright protection of vector data using vector watermark | |
| Sun et al. | A reversible digital watermarking algorithm for vector maps | |
| Wang et al. | Steganography on point-sampled geometry | |
| CN104915918B (en) | A kind of strong robust digital watermark method towards photomap | |
| Fei et al. | A reversible watermark scheme for 2D vector map based on reversible contrast mapping | |
| Niu et al. | GIS watermarking: hiding data in 2D vector maps | |
| CN104103031A (en) | Normalization-based vector spatial data blind watermark method | |
| KR100944488B1 (en) | Watermark Inserting Method to Vector data for using Azimuth Information and Watermark Detecting Method to the same | |
| Xuan et al. | Image steganalysis based on statistical moments of wavelet subband histograms in DFT domain | |
| Behravan et al. | Introducing a new method of image reconstruction against crop attack using sudoku watermarking algorithm | |
| Liu et al. | A new image watermarking scheme based on DWT and ICA | |
| Huang et al. | Detection of hidden information in webpages based on randomness | |
| Jan et al. | Genetic programming-based perceptual shaping of a digital watermark in the wavelet domain using Morton scanning |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110914 Termination date: 20171109 |