CN102411695A - Linear-planer type GIS (Geographic Information safety) vector data hiding and reducing method based on interpolation prediction - Google Patents
Linear-planer type GIS (Geographic Information safety) vector data hiding and reducing method based on interpolation prediction Download PDFInfo
- Publication number
- CN102411695A CN102411695A CN2011103926018A CN201110392601A CN102411695A CN 102411695 A CN102411695 A CN 102411695A CN 2011103926018 A CN2011103926018 A CN 2011103926018A CN 201110392601 A CN201110392601 A CN 201110392601A CN 102411695 A CN102411695 A CN 102411695A
- Authority
- CN
- China
- Prior art keywords
- data
- key element
- handle
- horizontal ordinate
- hiding
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a linear-planer type GIS (Geographic Information System) vector data hiding and reducing method based on an interpolation prediction method, belonging to the field of geographic information safety. The data hiding method comprises the following steps of: setting a secret key file, and then reading data of elements one by one; carrying out interpolation processing on the basis of secret key selection points, and carrying out corresponding hiding according to the data difference value before and after interpolation; and storing hidden data after all elements are processed. After the hiding is carried out by using the method disclosed by the invention, coordinate values in an element map layer change to cause offset of the coordinate position and change of data precision, and as for the GIS vector data with higher requirements on data precision and quality, data quality and data using value are reduced and normal use of illegally-copied or intercepted data is restricted by using the hiding, certain purpose of data protection is achieved, and hiding communication and safety transmission requirements of GIS vector data are met to a certain degree.
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 line Noodles type GIS vector data and reduction based on interpolation prediction method.
Background technology
At present, Information hiding has become another important branch except that cryptography in the information security research, and of paramount importance two branches into information disguising (Steganography) and digital watermarking greatly in the Information hiding.Though the two has all adopted the mechanism of hiding message in form information disguising and digital watermarking, exist aspect many more different in application target, object of protection, secret information character, communication mode, performance requirement, attack form etc.Wherein, digital watermarking is mainly used in copyright authentication, and information disguising is a kind of means of confidential corespondence, and it obtains the safety of confidential corespondence through the existence of hiding secret data.Be two big focuses of research in the development history in information disguising and digital watermarking year surplus Information Hiding Techniques ten always, but because commercial interest drives, and the digital watermark technology development is more ripe, and the technological development of information disguising relatively lags behind.
At present, aspect the research of information disguising, the carrier data type that is directed against mainly comprises image, video, remote sensing image, DEM etc.The GIS vector data is because its specific data structure, various data organization mode, and complex spatial relation, and high, the redundant characteristic such as few of precision make that the information disguising research to the GIS vector data has certain singularity and big difficulty.
Summary of the invention
To the deficiency in the research of current GIS vector data information disguising; The objective of the invention is to: based on interpolation prediction method; A kind of camouflage and method of reducing to line Noodles type GIS vector data proposed, with the security of effective raising GIS vector data in data transmission, distribution process.
To achieve these goals, the technical scheme taked of the inventive method mainly comprises following process:
(1) pseudo-process of assembling:
Step 1, the length that a binary format is set are the random series information M={M of n
i, i=0 wherein, 1 ..., n-1;
Step 2 is opened a line Noodles type GIS vector data file, confirms the redundant data start bit of this figure layer, and confirms that thus (min max), according to pseudo-reload request, selects threshold value T in interval [max, 1000max] for the span of redundant digit; Read the spatial data of each key element successively, obtain the number m of coordinate points in this key element and judge whether this key element need be pretended to handle:
(a) if m>=n; Then preceding n * L coordinate points is divided into the L group, changes next procedure over to and handle according to
;
(b) as if m<n, then essentiality does not carry out data camouflage processing;
Step 3 is to each the grouping F among the key element F
j, according to key rotation from grouping F
jIn the data that need handle of screening right, j=0 wherein, 1 ..., L-1; I=0,2 ..., n-1, screening rule is:
I) if M
i=1 or i=0 or i=n-1, then the some G of this position
iDo not handle as the reference mark;
If ii) M
i=0 and i ≠ 0 and i ≠ n-1, then the some G of this position
iChanging next procedure over to handles;
Step 4 is to G
iCarry out interpolation processing
The data that needs are handled are to G
i(X
i, Y
i), search be adjacent about two reference mark A (X
m, Y
m), B (X
n, Y
n), by following formula its horizontal ordinate is carried out interpolation processing, generate new data to G
i' (X
i', Y
i):
Step 5 is according to the data G before and after the interpolation
iWith G
i' to G
iPretend to handle
(a) get G
iIn horizontal ordinate X
iWith G '
iIn horizontal ordinate X '
iHandle the absolute value diff of calculated difference as follows:
diff=|X
i-X′
i| (2)
(b) according to following formula with G
iIn horizontal ordinate X
iBe revised as X "
i
Step 6 repeats above-mentioned steps two to five, after each key element disposes, preserves the data file after pretending, and deposits primary key information M and threshold value T in key file;
(2) reduction process:
Step 1 is opened key file, and the length of read threshold T and binary format is the random series information M={M of n
i, i=0 wherein, 1 ..., n-1;
Step 2 is opened a GIS vector data file after the camouflage, reads the spatial data of each key element successively, obtains the number m of coordinate points in this key element and judges whether this key element need reduce processing:
(a) if m>=n; Then preceding n * L coordinate points is divided into the L group, changes next procedure over to and handle according to
;
(b) as if m<n, then essentiality does not carry out the reduction of data processing;
Step 3 is to each the grouping F among the key element F
j, according to key rotation from grouping F
jIn the data that need handle of screening right, j=0 wherein, 1 ..., L-1; I=0,1 ..., n-1, screening rule is:
I) if M
i=1 or i=0 or i=n-1, then the some G of this position
iDo not handle as the reference mark;
If ii) M
i=0 and i ≠ 0 and i ≠ n-1, then the some G of this position
iChanging next procedure over to handles;
Step 4 is to G
iCarry out interpolation processing
The data that needs are handled are to G
i(X "
i, Y
i), search be adjacent about two reference mark A (X
m, Y
m), B (X
n, Y
n), by formula interpolation processing is carried out to its horizontal ordinate in (1), generates new data to G '
i(X '
i, Y
i);
Step 5 is according to the data G before and after the interpolation
iWith G
i' to G
iReduce processing
(a) get G
iIn horizontal ordinate X
iWith G '
iIn horizontal ordinate X '
iAbsolute value diff ' according to the computes difference:
diff′=|X″
i-X′
i| (4)
(b) according to following formula with G
iIn horizontal ordinate X "
iBe reduced to X
i
Step 6 repeats the step 2 to five of above-mentioned reduction process, after each key element disposes, preserves the data file after the reduction.
Pseudo-process of assembling of the present invention and reduction process are equally applicable to the processing to the data ordinate, perhaps simultaneously horizontal ordinate, the ordinate of data are handled.
The present invention is according to the data organization characteristics of GIS vector data; A kind of camouflage and method of reducing to line Noodles type GIS vector data proposed; In secret figure layer, select the point in the key element to carry out the camouflage and the reduction of secret information at random; Through method of the present invention can avoid confidential data in the remote transmission process by illicit interception, effectively improved the security of GIS vector data in data transmission, distribution process, thereby reached certain data protection purpose.
Description of drawings
Fig. 1 is the data camouflage process flow diagram of the inventive method.
Fig. 2 is the reduction of data process flow diagram of the inventive method.
Fig. 3 is the experimental data that the embodiment of the invention is chosen.
Fig. 4 is the raw data partial result figure of the embodiment of the invention.
Fig. 5 is the camouflage data partial result figure of the embodiment of the invention.
Fig. 6 is the edge partial enlarged drawing of Fig. 5 design sketch.
Embodiment
Explain further details below in conjunction with accompanying drawing and embodiment.
Present embodiment is selected typical shp form vector data, to the whole process that reads, pretends, reduces of data, further explain the present invention.Present embodiment selects provincial boundaries line chart layer data (like Fig. 3) in the whole nation 1: 400 ten thousand as experimental data, and original random series is made as " 10011100101001010011 ".
(1) pseudo-process of assembling:
Step 1: the length n that this random series of random series " 10011100101001010011 " of a binary format is set is 20.
Step 2: open the provincial boundaries vector data file, the redundant data start bit of confirming this figure layer is behind the radix point the 3rd, and confirms that thus the span of redundant digit be (0.001,0.01), gets threshold value T=1 in interval (0.01,10).Read the spatial data of each key element successively, obtain the number m of coordinate points in this key element and judge whether this key element need be pretended to handle.
The coordinate points number of first key element that reads is 177; Because m>n is divided into 8 groups according to
, changes step 3 over to and handle.
Step 3: to each the grouping F among the key element F
j, according to key rotation from grouping F
jIn the data that need handle of screening right, j=0 wherein, 1 ..., L-1; I=0,2 ..., n-1.
In the present embodiment, the 2nd, 3,7,8,10,12,13,15 in 8 groupings, 17,18 data are pretended to handle to needs.
Step 4: to G
iCarry out interpolation processing.With the 3rd data in the 1st group (121.500350952148,53.3138885498047) are described for example below.
The data that needs are handled are to G
i(X
i, Y
i), search be adjacent about two reference mark A (X
m, Y
m), B (X
n, Y
n), by formula interpolation processing is carried out to its horizontal ordinate in (1), generates new data to G
i' (X
i', Y
i).
Among this embodiment; Two reference mark that are adjacent are respectively first point and the 4th point, and its value is respectively (121.488441467285,53.332649230957) and (121.531600952148; 53.3076477050781), carry out interpolation according to formula (1) and obtain a G
i' be (121.520827543965,53.3138885498047).
Step 5: according to the data G before and after the interpolation
iWith G
i' to G
iPretend to handle
(a) get G
iIn horizontal ordinate 121.500350952148 and G '
iIn horizontal ordinate 121.520827543965 by formula (2) to calculate diff be 0.020476591816247947
(b) according to formula (3) to G
iHorizontal ordinate make amendment, the coordinate figure that obtains pretending is to (121.479874360332,53.3138885498047)
Step 6: repeating step two to five, after each key element disposes, preserve the data file after pretending, and deposit primary key information M and threshold value 0.1 in key file.
(2) reduction process:
Step 1: open key file, read threshold 1 is the random series information " 10011100101001010011 " of n with the length of binary format.
Step 2: open the provincial boundaries vector data file after the camouflage, read the spatial data of each key element successively, obtain the number m of coordinate points in this key element and judge whether this key element need reduce processing.
The coordinate points number of first key element that reads is 177; Because m>n is divided into 8 groups according to
, changes next step three over to and handle.
Step 3: to each the grouping F among the key element F
j, according to key rotation from grouping F
jIn the data that need handle of screening right, j=0 wherein, 1 ..., L-1; I=0,2 ..., n-1.
In the present embodiment, the 2nd, 3,7,8,10,12,13,15 in 8 groupings, 17,18 data are reduced processing to needs.
Step 4: to G
iCarry out interpolation processing.With the 3rd data in the 1st group (121.479874360332,53.3138885498047) are described for example below.
The data that needs are handled are to G
i(X "
i, Y
i), search be adjacent about two reference mark A (X
m, Y
m), B (X
n, Y
n), by formula interpolation processing is carried out to its horizontal ordinate in (1), generates new data to G
i' (X
i', Y
i).
Among this embodiment; Two reference mark that are adjacent are respectively first point and the 4th point, and its value is respectively (121.488441467285,53.332649230957) and (121.531600952148; 53.3076477050781), carry out interpolation according to formula (1) and obtain a G
i' be (121.520827543965,53.3138885498047).
Step 5: according to the data G before and after the interpolation
iWith G
i' to G
iReduce processing
(a) get G
iIn horizontal ordinate 121.479874360332 and G '
iIn horizontal ordinate 121.520827543965 by formula (4) to calculate diff be 0.040953183632495893.
(b) according to formula (5) to G
iHorizontal ordinate make amendment, the coordinate figure that obtains reducing is to (121.500350952148,53.3138885498047)
Step 6: repeat the step 2 to five of reduction process, after each key element disposes, preserve the data file after reducing.
Design sketch (Fig. 5, Fig. 6) by the foregoing description can be known: data are after camouflage is handled; Though still be correct shp data, because variation has taken place in the coordinate points position, bigger variation has taken place in the figure layer data after the camouflage; For the higher GIS vector data of data precision quality requirements; This processing has significantly reduced the quality of data and data use value, has limited the normal use of illegal copies or data interception, reaches certain data protection purpose.Have only validated user to get access to key file, could be correctly, restoring data inerrably.
Only carry out the data camouflage with the horizontal ordinate of the line chart layer data of shp form in the embodiment of the invention and handle with reduction, this method also goes for carrying out the data camouflage to ordinate and handles with reduction.This method also can be carried out the data camouflage to horizontal ordinate, ordinate simultaneously and handled with reduction.Only carry out the data camouflage with the line chart layer data in the embodiment of the invention and handle with reduction, this method also goes for face figure 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.
Claims (1)
1. based on the camouflage of line Noodles type GIS vector data and the method for reducing of interpolative prediction, mainly comprise following process:
(1) pseudo-process of assembling:
Step 1, the length that a binary format is set are the random series information M={M of n
i, i=0 wherein, 1 ..., n-1;
Step 2 is opened a line Noodles type GIS vector data file, confirms the redundant data start bit of this figure layer, and confirms that thus (min max), according to pseudo-reload request, selects threshold value T in interval [max, 1000max] for the span of redundant digit; Read the spatial data of each key element successively, obtain the number m of coordinate points in this key element and judge whether this key element need be pretended to handle:
(a) if m>=n; Then preceding n * L coordinate points is divided into the L group, changes next procedure over to and handle according to
;
(b) as if m<n, then essentiality does not carry out data camouflage processing;
Step 3 is to each the grouping F among the key element F
j, according to key rotation from grouping F
jIn the data that need handle of screening right, j=0 wherein, 1 ..., L-1; I=0,2 ..., n-1, screening rule is:
I) if M
i=1 or i=0 or i=n-1, then the some G of this position
iDo not handle as the reference mark;
If ii) M
i=0 and i ≠ 0 and i ≠ n-1, then the some G of this position
iChanging next procedure over to handles;
Step 4 is to G
iCarry out interpolation processing
The data that needs are handled are to G
i(X
i, Y
i), search be adjacent about two reference mark A (X
m, Y
m), B (X
n, Y
n), by following formula its horizontal ordinate is carried out interpolation processing, generate new data to G
i' (X
i', Y
i):
Step 5 is according to the data G before and after the interpolation
iWith G
i' to G
iPretend to handle
(a) get G
iIn horizontal ordinate X
iWith G '
iIn horizontal ordinate X '
iHandle the absolute value diff of calculated difference as follows:
diff=|X
i-X′
i| (2)
(b) according to following formula with G
iIn horizontal ordinate X
iBe revised as X "
i
Step 6 repeats above-mentioned steps two to five, after each key element disposes, preserves the data file after pretending, and deposits primary key information M and threshold value T in key file;
(2) reduction process:
Step 1 is opened key file, and the length of read threshold T and binary format is the random series information M={M of n
i, i=0 wherein, 1 ..., n-1;
Step 2 is opened a GIS vector data file after the camouflage, reads the spatial data of each key element successively, obtains the number m of coordinate points in this key element and judges whether this key element need reduce processing:
(a) if m>=n; Then preceding n * L coordinate points is divided into the L group, changes next procedure over to and handle according to
;
(b) as if m<n, then essentiality does not carry out the reduction of data processing;
Step 3 is to each the grouping F among the key element F
j, according to key rotation from grouping F
jIn the data that need handle of screening right, j=0 wherein, 1 ..., L-1; I=0,1 ..., n-1, screening rule is:
I) if M
i=1 or i=0 or i=n-1, then the some G of this position
iDo not handle as the reference mark;
If ii) M
i=0 and i ≠ 0 and i ≠ n-1, then the some G of this position
iChanging next procedure over to handles;
Step 4 is to G
iCarry out interpolation processing
The data that needs are handled are to G
i(X "
i, Y
i), search be adjacent about two reference mark A (X
m, Y
m), B (X
n, Y
n), by formula interpolation processing is carried out to its horizontal ordinate in (1), generates new data to G '
i(X '
i, Y
i);
Step 5 is according to the data G before and after the interpolation
iWith G
i' to G
iReduce processing
(a) get G
iIn horizontal ordinate X
iWith G '
iIn horizontal ordinate X '
iAbsolute value diff ' according to the computes difference:
diff′=|X″
i-X′
i| (4)
(b) according to following formula with G
iIn horizontal ordinate X "
iBe reduced to X
i
Step 6 repeats the step 2 to five of above-mentioned reduction process, after each key element disposes, preserves the data file after the reduction.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011103926018A CN102411695A (en) | 2011-12-01 | 2011-12-01 | Linear-planer type GIS (Geographic Information safety) vector data hiding and reducing method based on interpolation prediction |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011103926018A CN102411695A (en) | 2011-12-01 | 2011-12-01 | Linear-planer type GIS (Geographic Information safety) vector data hiding and reducing method based on interpolation prediction |
Publications (1)
Publication Number | Publication Date |
---|---|
CN102411695A true CN102411695A (en) | 2012-04-11 |
Family
ID=45913765
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2011103926018A Pending CN102411695A (en) | 2011-12-01 | 2011-12-01 | Linear-planer type GIS (Geographic Information safety) vector data hiding and reducing method based on interpolation prediction |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102411695A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104657669A (en) * | 2015-02-13 | 2015-05-27 | 南京师范大学 | Precision controllable line and plane geographic element information disguising and restoring method |
CN104751399A (en) * | 2015-03-06 | 2015-07-01 | 南京师范大学 | Information sharing based secret-associated linear geographic element pretence and recovery method |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102243700A (en) * | 2011-06-30 | 2011-11-16 | 南京师范大学 | Chaos transformation-based shp liner and planar layer data disguising and restoring method |
CN102393895A (en) * | 2011-11-15 | 2012-03-28 | 南京师范大学 | Line/plane type GIS (geographic information system) vector data hiding and restoring method based on interpolation prediction |
-
2011
- 2011-12-01 CN CN2011103926018A patent/CN102411695A/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102243700A (en) * | 2011-06-30 | 2011-11-16 | 南京师范大学 | Chaos transformation-based shp liner and planar layer data disguising and restoring method |
CN102393895A (en) * | 2011-11-15 | 2012-03-28 | 南京师范大学 | Line/plane type GIS (geographic information system) vector data hiding and restoring method based on interpolation prediction |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104657669A (en) * | 2015-02-13 | 2015-05-27 | 南京师范大学 | Precision controllable line and plane geographic element information disguising and restoring method |
CN104657669B (en) * | 2015-02-13 | 2017-12-15 | 南京师范大学 | A kind of controllable line face information of geographic elements camouflage of precision and restoring method |
CN104751399A (en) * | 2015-03-06 | 2015-07-01 | 南京师范大学 | Information sharing based secret-associated linear geographic element pretence and recovery method |
CN104751399B (en) * | 2015-03-06 | 2017-12-15 | 南京师范大学 | A kind of concerning security matters wire geographic element camouflage deposited based on information point and restoring method |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Zhou et al. | Secret-to-image reversible transformation for generative steganography | |
CN101739695B (en) | Three-dimensional Arnold mapping-based image grouping encryption method | |
CN103491279B (en) | The 4-neighborhood XOR image encryption method of Hyperchaotic Lorenz system | |
CN103077211A (en) | Method for scrambling and reducing GIS (Geographic Information system) vector line Thiessen data | |
CN102332079B (en) | GIS (geographic information system) vector data disguising and restoring method based on error random interference | |
Da et al. | A novel hybrid information security scheme for 2D vector map | |
CN105513002A (en) | Novel image encryption method based on correlation between chaos and plaintext | |
CN102799837B (en) | Line and surface type global information system (GIS) vector data disguise and reduction method based on interpolation prediction | |
CN102243700B (en) | Chaos transformation-based shp liner and planar layer data disguising and restoring method | |
Wang et al. | Chaotic image encryption algorithm based on dynamic spiral scrambling transform and deoxyribonucleic acid encoding operation | |
CN101527030A (en) | Safe watermark method based on side information | |
CN104143174B (en) | Image disguising and reconstructing method based on Tangram algorithm and two-dimensional double-scale rectangular mapping | |
Ye et al. | Research on reversible image steganography of encrypted image based on image interpolation and difference histogram shift | |
Wang et al. | An encryption algorithm for vector maps based on the Gaussian random and Haar transform | |
CN102411695A (en) | Linear-planer type GIS (Geographic Information safety) vector data hiding and reducing method based on interpolation prediction | |
CN116485623B (en) | Multispectral image gray feature watermarking method based on sixteen-element rapid accurate moment | |
Cao et al. | Iterative embedding-based reversible watermarking for 2D-vector maps | |
Durafe et al. | Image steganography using fractal cover and combined chaos-DNA based encryption | |
Li et al. | Retracing extended sudoku matrix for high-capacity image steganography | |
Jamei et al. | Hybrid model of chaotic signal and complete binary tree for image encryption | |
Sasaki et al. | Constructing Digital Watermark Based on Orthogonal Functions | |
CN105279728A (en) | Intelligent mobile terminal image steganography method based on secret information encryption pretreatment | |
CN102622409B (en) | Line surface type GIS (Geographic Information System) vector data disguising and recovering method based on inclined angle transformation | |
CN113051357B (en) | Vector map optimization local desensitization method based on game theory | |
CN103426142A (en) | Patchwork digital watermark encoding and decoding method based on Arnold conversion |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120411 |