Automated Edgematching of Features from Adjoining Vector Map Databases

Liviu Porumb;  ; Oana-Lavinia Porumb;

doi:10.32754/jmt.2021.1.03

Research of distributed coordinated management of spatial date based on division of GML vector map layer

Journal of Computer Applications ◽

10.3724/sp.j.1087.2009.00297 ◽

2009 ◽

Vol 29 (1) ◽

pp. 297-300 ◽

Cited By ~ 1

Author(s):

Bo GAO ◽

Chao-zhen GUO ◽

Shan-jing DING

Keyword(s):

Vector Map

Download Full-text

Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

Applied Sciences ◽

10.3390/app9040642 ◽

2019 ◽

Vol 9 (4) ◽

pp. 642 ◽

Cited By ~ 3

Author(s):

Xu Xi ◽

Xinchang Zhang ◽

Weidong Liang ◽

Qinchuan Xin ◽

Pengcheng Zhang

Keyword(s):

Singular Value Decomposition ◽

Singular Value ◽

Two Dimensional ◽

Triangle Mesh ◽

Vector Map ◽

Vector Maps ◽

Feature Sequence ◽

Zero Watermarking ◽

Value Decomposition ◽

Watermarking Scheme

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

Download Full-text

Lane Level Path Planning for Urban Autonomous Driving using Vector Map

2020 IEEE International Conference on Consumer Electronics - Asia (ICCE-Asia) ◽

10.1109/icce-asia49877.2020.9277298 ◽

2020 ◽

Author(s):

Chanyoung Jung ◽

Deagyu Lee ◽

Boseong Kim ◽

David Hyunchul Shim

Keyword(s):

Path Planning ◽

Autonomous Driving ◽

Vector Map

Download Full-text

Vector Map Encryption Algorithm Based on Double Random Position Permutation Strategy

ISPRS International Journal of Geo-Information ◽

10.3390/ijgi10050311 ◽

2021 ◽

Vol 10 (5) ◽

pp. 311

Author(s):

Xiaolong Wang ◽

Haowen Yan ◽

Liming Zhang

Keyword(s):

Encryption Algorithm ◽

Hyperchaotic System ◽

Secret Key ◽

Vector Map ◽

Coordinate Position ◽

Random Position ◽

One To One ◽

Map Objects ◽

Geographic Information Sciences ◽

The Relationship

Encryption of vector maps, used for copyright protection, is of importance in the community of geographic information sciences. However, some studies adopt one-to-one mapping to scramble vertices and permutate the coordinates one by one according to the coordinate position in a plain map. An attacker can easily obtain the key values by analyzing the relationship between the cipher vector map and the plain vector map, which will lead to the ineffectiveness of the scrambling operation. To solve the problem, a vector map encryption algorithm based on a double random position permutation strategy is proposed in this paper. First, the secret key sequence is generated using a four-dimensional quadratic autonomous hyperchaotic system. Then, all coordinates of the vector map are encrypted using the strategy of double random position permutation. Lastly, the encrypted coordinates are reorganized according to the vector map structure to obtain the cipher map. Experimental results show that: (1) one-to-one mapping between the plain vector map and cipher vector map is prevented from happening; (2) scrambling encryption between different map objects is achieved; (3) hackers cannot obtain the permutation key value by analyzing the pairs of the plain map and cipher map.

Download Full-text