CN102332079A - GIS (geographic information system) vector data disguising and restoring method based on error random interference - Google Patents
GIS (geographic information system) vector data disguising and restoring method based on error random interference Download PDFInfo
- Publication number
- CN102332079A CN102332079A CN201110274342A CN201110274342A CN102332079A CN 102332079 A CN102332079 A CN 102332079A CN 201110274342 A CN201110274342 A CN 201110274342A CN 201110274342 A CN201110274342 A CN 201110274342A CN 102332079 A CN102332079 A CN 102332079A
- Authority
- CN
- China
- Prior art keywords
- data
- key
- file
- key element
- gis
- 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
- Storage Device Security (AREA)
Abstract
The invention discloses a GIS (geographic information system) vector data disguising and restoring method based on error random interference, and belongs to the field of geographical information security. The data disguising method comprises the following main processing steps that: (1) a GIS vector data layer file is opened, the layer type is judged, the digit N behind the decimal point of abscissa data is calculated, and 8-bit binary random information is used as a Key and is stored into a key file; (2) the data is read and grouped; (3) for each grouping Di in an array queue D, the error interfere processing of the data is carried out; (4) the steps (2) and (3) are repeated until after each element is processed, the disguised data file is stored. By the method provided by the invention, the security of GIS vector data in data transmission and decrypt processing can be effectively improved, and the method can be applied to the hidden communication and secure transmission of the GIS vector data.
Description
Technical field
The invention belongs to the geography information security fields, be specifically related to a kind of method of carrying out camouflage of GIS vector data and reduction based on error random disturbance technology.
Background technology
The security protection of geography information relates to national security and social benefit, is country and social great needs of problems that current urgent need solves.Particularly current Spatial Data Sharing demand progressively enlarges, and geographic information services is used under the situation about constantly expanding, and the safety problem of geography information is further outstanding.As the GIS vector data of NSDI general data content, its information security research is most important especially.
At present, information disguising has become another important branch except that cryptography in the information security research.Correlative study document and patent search result analysis both at home and abroad shows that at present, aspect the research of information disguising, the carrier data type of being studied mainly comprises image, video, remote sensing image, DEM etc.But; Vector data is because it has the data organization of no fixed storage order, various data layout, powerful visual expression means, complicated projective transformation, various spatial analysis application; And precision is high, the characteristic of redundant many aspects such as few, makes that the information disguising research to vector data has certain singularity and big difficulty.
Summary of the invention
The objective of the invention is to: based on error random disturbance technology, propose a kind of camouflage and method of reducing, with the security of effective raising GIS vector data in data transmission, DecryptDecryption are handled to the GIS vector data.
To achieve these goals, the technical scheme that the present invention taked mainly comprises following process:
(1) pseudo-process of assembling
Step 1: open a GIS vector data figure layer file, judge layer type and calculate the figure place N behind the radix point in the horizontal ordinate data, 8 scale-of-two random informations are set as key K ey, and deposit key file in;
Step 2: data read and divide into groups
(a) if be line Noodles type data; Then read a horizontal ordinate of being had a few in the key element at every turn; The number m of calculation level; And according to
; Be divided into the L group, be organized among the array formation D;
(b) if be the vertex type data; There is a key element in the institute that then reads in this document; The number m of calculation level; And with the horizontal ordinate of reference point key element according to
, be divided into the L group, be organized among the array formation D;
Step 3: to each the grouping D among the array formation D
i, carrying out the error of data and disturb processing, concrete grammar is:
(a) get this grouping D
iIn first data D
I1Radix point before primary value d;
(b) if 0 < d < (N-1), the corresponding secret key information bit is each data of 1 in then will dividing into groups, and carries out d position and the exchange of d+1 bit data behind the radix point;
Step 4: circulation step two to three, after each key element disposes, preserve the data file after pretending;
(2) reduction process
Step 1: open a GIS vector data figure layer file, judge layer type and calculate the figure place N behind the radix point in the horizontal ordinate data, read key file and key K ey is set;
Step 2: packet is read
(a) if be line Noodles type data; Then read the horizontal ordinate of all point coordinate data in the key element at every turn; Calculate its number m; And, be divided into the L group according to
, be organized among the array formation D;
(b) if be the vertex type data; There is a key element in the institute that then reads in this document; The number m of calculation level; And with the horizontal ordinate of reference point key element according to
, be divided into the L group, be organized among the array formation D;
Step 3: to each coordinate grouping D
i, carrying out the reduction of data and handle, concrete grammar is:
(a) get this grouping D
iIn first data D
I1Radix point before primary value d;
(b) if 0 < d < (N-1), the corresponding secret key information bit is each data of 1 in then will dividing into groups, and carries out d position and the exchange of d+1 bit data behind the radix point;
Step 4: circulation step two to three, after each key element disposes, preserve the data file after reducing.
The present invention is according to the data organization characteristics of GIS vector data; Based on error random disturbance principle; A kind of camouflage and method of reducing to the GIS vector data proposed; Can carry out the camouflage of shp formatted data and handle, satisfy the hiding communication and the safe transmission demand of GIS vector data to a certain extent with reduction.
Description of drawings
The experimental data that Fig. 1 chooses for the embodiment of the invention.
Fig. 2 is the data camouflage process flow diagram of the inventive method.
Fig. 3 is the reduction of data process flow diagram of the inventive method.
Fig. 4 is raw data partial result figure in the embodiment of the invention.
Fig. 5 is camouflage data partial result figure in the embodiment of the invention.
Embodiment
Explain further details below in conjunction with accompanying drawing and embodiment.
This instance is selected a typical shp face figure layer data, to the reading of data, pretend to handle, the whole process of reduction of data, further explain the present invention.Present embodiment selects the planar figure layer data in the provincial boundaries of national 1:400 ten thousand (like Fig. 1) as experimental data.Key K ey value is " 10010101 ".
(1) the data camouflage is handled.
Step 1: open provincial boundaries figure layer data file, data layout is planar data, and the data bits behind the horizontal ordinate radix point is 14, and key key K ey value is " 10010101 ".
Step 2: read the spatial data of each key element successively, calculate the number m and the judgement of coordinate points in the pre-treatment key element and carry out packet transaction.
The coordinate points number of first key element that reads is 923.Because m>2n; According to
, be divided into 56 groups.Every group of data are write behind the array d and are added among the array formation D.
Step 3: each the array D among the logarithm set of queues D
i, carry out the error of data and disturb processing.In the present embodiment, first array D
1In first data be: 121.49738309820822, primary value d is 1 before its radix point, meets 0<d<(N-1) condition, the corresponding secret key information bit is four data such as the 1st, 4,6,8 of 1 in then will dividing into groups, carry out behind the radix point the 1st with the exchange of the 2nd bit data.
Step 4: circulation step two to three, after each key element disposes, preserve the data file after pretending.
(2) reduction of data is handled.
Step 1: open the provincial boundaries figure layer data file after camouflage is handled, data layout is planar data.Read key file, and key key K ey is set, its value is " 10010101 ".
Step 2: read the spatial data of each key element successively, calculate the number m and the judgement of coordinate points in the pre-treatment key element and carry out packet transaction.
The coordinate points number of first key element that reads is 923.Because m>2n; According to
, be divided into 56 groups.Every group of data are write behind the array d and are added among the array formation D.
Step 3: each the array D among the logarithm set of queues D
i, carry out the error of data and disturb processing.In the present embodiment, first array D
1In before first data radix point primary value d be 1, meet 0<d<(N-1) condition, the corresponding secret key information bit is four data such as the 1st, 4,6,8 of 1 in then will dividing into groups, carry out behind the radix point the 1st with the exchange of the 2nd bit data.
Step 4: circulation step two to three, after each key element disposes, preserve the data file after reducing.
Only carry out the data camouflage with the horizontal ordinate of shp form face figure layer data in the embodiment of the invention and handle with reduction, this method also goes for using the ordinate of these data to carry out the data camouflage and handles with reduction.
Only carry out the data camouflage with face figure layer data in the embodiment of the invention and handle with reduction, this method also goes for point, line type map layer data.
Only carry out the data camouflage with the GIS vector data of shp form in the embodiment of the invention and handle with reduction, this method is applicable to that also the data camouflage of other form GIS vector datas such as GML, E00, MIF handles with reduction.
(3) test analysis.
Can be known by the raw data in the foregoing description and the design sketch (Fig. 4, Fig. 5) of camouflage deal with data: data are after camouflage is handled; Though still be the shp data that to use GIS software correctly to open; But bigger variation has taken place in the position of each coordinate points, and for the higher GIS vector data of data precision quality requirements, this processing has significantly reduced the quality of data and data use value; Limit the normal use of illegal copies or data interception, reached certain data protection purpose.Have only validated user to get access to key file, could be correctly, restoring data nondestructively.
To sum up analyze, the method that the present invention adopted can successfully be applied to the camouflage of GIS vector data and handle with reduction, satisfies the hiding communication and the safe transmission demand of GIS vector data to a certain extent.
Claims (1)
1. based on the camouflage of GIS vector data and the method for reducing of error random disturbance, comprise following process:
(1) pseudo-process of assembling
Step 1: open a GIS vector data figure layer file, judge layer type and calculate the figure place N behind the radix point in the horizontal ordinate data, 8 scale-of-two random informations are set as key K ey, and deposit key file in;
Step 2: data read and divide into groups
If be line Noodles type data; Then read a horizontal ordinate of being had a few in the key element at every turn; The number m of calculation level; And according to
; Be divided into the L group, be organized among the array formation D;
If be the vertex type data; There is a key element in the institute that then reads in this document; The number m of calculation level; And with the horizontal ordinate of reference point key element according to
, be divided into the L group, be organized among the array formation D;
Step 3: to each the grouping D among the array formation D
i, carrying out the error of data and disturb processing, concrete grammar is:
Get this grouping D
iIn first data D
I1Radix point before primary value d;
If 0 < d < (N-1), the corresponding secret key information bit is each data of 1 in then will dividing into groups, and carries out d position and the exchange of d+1 bit data behind the radix point;
Step 4: circulation step two to three, after each key element disposes, preserve the data file after pretending;
(2) reduction process
Step 1: open a GIS vector data figure layer file, judge layer type and calculate the figure place N behind the radix point in the horizontal ordinate data, read key file and key K ey is set;
Step 2: packet is read
If be line Noodles type data; Then read the horizontal ordinate of all point coordinate data in the key element at every turn; Calculate its number m; And, be divided into the L group according to
, be organized among the array formation D;
If be the vertex type data; There is a key element in the institute that then reads in this document; The number m of calculation level; And with the horizontal ordinate of reference point key element according to
, be divided into the L group, be organized among the array formation D;
Step 3: to each coordinate grouping D
i, carrying out the reduction of data and handle, concrete grammar is:
Get this grouping D
iIn first data D
I1Radix point before primary value d;
If 0 < d < (N-1), the corresponding secret key information bit is each data of 1 in then will dividing into groups, and carries out d position and the exchange of d+1 bit data behind the radix point;
Step 4: circulation step two to three, after each key element disposes, preserve the data file after reducing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102743429A CN102332079B (en) | 2011-09-16 | 2011-09-16 | GIS (geographic information system) vector data disguising and restoring method based on error random interference |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102743429A CN102332079B (en) | 2011-09-16 | 2011-09-16 | GIS (geographic information system) vector data disguising and restoring method based on error random interference |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102332079A true CN102332079A (en) | 2012-01-25 |
| CN102332079B CN102332079B (en) | 2013-12-04 |
Family
ID=45483851
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011102743429A Expired - Fee Related CN102332079B (en) | 2011-09-16 | 2011-09-16 | GIS (geographic information system) vector data disguising and restoring method based on error random interference |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102332079B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622409A (en) * | 2012-02-09 | 2012-08-01 | 南京师范大学 | Line surface type GIS (Geographic Information System) vector data disguising and recovering method based on inclined angle transformation |
| CN103020544A (en) * | 2013-01-04 | 2013-04-03 | 南京师范大学 | Encryption and decryption method for shp line-surface graph layer data hierarchy |
| CN103067159A (en) * | 2012-12-28 | 2013-04-24 | 南京师范大学 | Geographic information system (GIS) vector data reversible decryption method |
| CN103093414A (en) * | 2013-01-22 | 2013-05-08 | 南京师范大学 | Decryption and recovery method of document object model (DOM) raster data |
| CN103559452A (en) * | 2013-10-30 | 2014-02-05 | 南京师范大学 | Altitude data decryption and recovery method |
| CN104077535A (en) * | 2014-06-19 | 2014-10-01 | 南京师范大学 | Graphic information system (GIS) vector data local decryption and restoring method |
| CN110427450A (en) * | 2019-08-09 | 2019-11-08 | 深圳四维集思技术服务有限公司 | Oil-gas pipeline data processing method and system based on Internet map |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020147910A1 (en) * | 2001-03-05 | 2002-10-10 | Brundage Trent J. | Digitally watermarked maps and signs and related navigational tools |
| JP2008501160A (en) * | 2004-03-17 | 2008-01-17 | シードラゴン ソフトウェア インコーポレイテッド | Method and apparatus for navigating images |
| CN101576993A (en) * | 2009-06-01 | 2009-11-11 | 南京师范大学 | Digital watermark embedding and extraction method for GIS vector data based on data mask |
| CN101604440A (en) * | 2009-04-23 | 2009-12-16 | 哈尔滨工程大学 | Treatment method for reversibly watermarking vector map based on space characteristics |
-
2011
- 2011-09-16 CN CN2011102743429A patent/CN102332079B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020147910A1 (en) * | 2001-03-05 | 2002-10-10 | Brundage Trent J. | Digitally watermarked maps and signs and related navigational tools |
| JP2008501160A (en) * | 2004-03-17 | 2008-01-17 | シードラゴン ソフトウェア インコーポレイテッド | Method and apparatus for navigating images |
| CN101604440A (en) * | 2009-04-23 | 2009-12-16 | 哈尔滨工程大学 | Treatment method for reversibly watermarking vector map based on space characteristics |
| CN101576993A (en) * | 2009-06-01 | 2009-11-11 | 南京师范大学 | Digital watermark embedding and extraction method for GIS vector data based on data mask |
Non-Patent Citations (2)
| Title |
|---|
| LI HUANG ET AL.: "Data Quality Inspection of Watermarked GIS Vector Map", 《2010 18TH INTERNATIONAL CONFERENCE ON GEOINFORMATICS》 * |
| 邵承永 等.: "矢量地图的无损数据隐藏算法研究", 《中国图象图形学报》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622409A (en) * | 2012-02-09 | 2012-08-01 | 南京师范大学 | Line surface type GIS (Geographic Information System) vector data disguising and recovering method based on inclined angle transformation |
| CN103067159A (en) * | 2012-12-28 | 2013-04-24 | 南京师范大学 | Geographic information system (GIS) vector data reversible decryption method |
| CN103067159B (en) * | 2012-12-28 | 2016-03-02 | 南京师范大学 | A kind of reversible DecryptDecryption method of GIS vector data |
| CN103020544A (en) * | 2013-01-04 | 2013-04-03 | 南京师范大学 | Encryption and decryption method for shp line-surface graph layer data hierarchy |
| CN103020544B (en) * | 2013-01-04 | 2015-05-20 | 南京师范大学 | Encryption and decryption method for shp line-surface graph layer data hierarchy |
| CN103093414A (en) * | 2013-01-22 | 2013-05-08 | 南京师范大学 | Decryption and recovery method of document object model (DOM) raster data |
| CN103093414B (en) * | 2013-01-22 | 2015-11-18 | 南京师范大学 | A kind of DOM raster data DecryptDecryption and restoration methods |
| CN103559452A (en) * | 2013-10-30 | 2014-02-05 | 南京师范大学 | Altitude data decryption and recovery method |
| CN103559452B (en) * | 2013-10-30 | 2016-03-30 | 南京师范大学 | A kind of altitude data decryption and restoration methods |
| CN104077535A (en) * | 2014-06-19 | 2014-10-01 | 南京师范大学 | Graphic information system (GIS) vector data local decryption and restoring method |
| CN104077535B (en) * | 2014-06-19 | 2017-01-25 | 南京师范大学 | Graphic information system (GIS) vector data local decryption and restoring method |
| CN110427450A (en) * | 2019-08-09 | 2019-11-08 | 深圳四维集思技术服务有限公司 | Oil-gas pipeline data processing method and system based on Internet map |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102332079B (en) | 2013-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102332079B (en) | GIS (geographic information system) vector data disguising and restoring method based on error random interference | |
| Liu et al. | Coverless steganography based on image retrieval of DenseNet features and DWT sequence mapping | |
| Li et al. | Double-encrypted watermarking algorithm based on cosine transform and fractional Fourier transform in invariant wavelet domain | |
| Shang et al. | A block location scrambling algorithm of digital image based on Arnold transformation | |
| Wang et al. | A New V‐Net Convolutional Neural Network Based on Four‐Dimensional Hyperchaotic System for Medical Image Encryption | |
| Yang et al. | Federated Learning with Privacy-preserving and Model IP-right-protection | |
| CN103049877B (en) | Based on watermark embedment and the detection method of vertex distribution feature digital three-dimensional model | |
| Cao et al. | Nonlinear scrambling-based reversible watermarking for 2D-vector maps | |
| CN102243700B (en) | Chaos transformation-based shp liner and planar layer data disguising and restoring method | |
| Qiu et al. | Rich-information reversible watermarking scheme of vector maps | |
| CN102799837B (en) | Line and surface type global information system (GIS) vector data disguise and reduction method based on interpolation prediction | |
| Cao et al. | Iterative embedding-based reversible watermarking for 2D-vector maps | |
| CN102509058B (en) | Point type GIS vector data disguise and recovery method based on redundant bit replacement | |
| Chen et al. | A Generic Cryptographic Deep-Learning Inference Platform for Remote Sensing Scenes | |
| Parah et al. | Data hiding in color images: a high capacity data hiding technique for covert communication | |
| CN102509056B (en) | GIS (geographic information system) vector data camouflage and reduction method based on geometric accuracy weakening of elements | |
| Liang et al. | Enhanced Feature Interaction Network for Remote Sensing Change Detection | |
| Cartwright | Coastal vulnerability in the context of climate change: A South African perspective | |
| CN102411695A (en) | Linear-planer type GIS (Geographic Information safety) vector data hiding and reducing method based on interpolation prediction | |
| Lei et al. | W-Hilbert: A W-shaped Hilbert curve and coding method for multiscale geospatial data index | |
| CN102651059B (en) | Method for certificating GIS (Geographic Information System) vector data copyright based on multi-element spatial feature | |
| CN103106370A (en) | Information camouflage and reduction method applied to digital elevation model (DEM) | |
| Yue et al. | Rights protection for trajectory streams | |
| CN104751399B (en) | A kind of concerning security matters wire geographic element camouflage deposited based on information point and restoring method | |
| CN102254007A (en) | Difference expansion-based method for disguising and recovering line-plane type GIS (Geographic Information System) vector data |
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: 20131204 Termination date: 20160916 |