• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.323-343
• /
• 2020

With the rapid development of computer and communication techniques, copyright protection of vector geographic data has attracted considerable research attention because of the high cost of such data. A novel adaptive watermark detection algorithm is proposed for vector geographic data that can be used to qualitatively analyze the robustness of watermarks against data addition attacks. First, a watermark was embedded into the vertex coordinates based on coordinate mapping and quantization. Second, the adaptive watermark detection model, which is capable of calculating the detection threshold, false positive error (FPE) and false negative error (FNE), was established, and the characteristics of the adaptive watermark detection algorithm were analyzed. Finally, experiments were conducted on several real-world vector maps to show the usability and robustness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3475-3496
• /
• 2018

Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6190-6213
• /
• 2019

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.58-65
• /
• 2008

This paper presents a new geographic distributed hash table (GDHT) for MANETs or Mesh networks, where virtual geographic protocol is used. In previous wort GDHT is applied to a network scenario based on two dimensional Cartesian coordinate system. Further, logical data space is supposed to be uniformly distributed. However, mobile node distribution in a network using virtual geographic routing is not matched to data distribution in GDHT. Therefore, if we apply previous GDHT to a virtual geographic routing network, lots of DHT data are probably located at boundary nodes of the network or specific nodes, resulting in long average-delay to discover resource (or service). Additionally, in BVR(Beacon Vector Routing) or LCR(Logical Coordinate Routing), because there is correlation between coordinate elements, we cannot use normal hash function. For this reason, we propose to use "geographic hash function" for GDHT that matches data distribution to node distribution and considers correlation between coordinate elements. We also show that the proposed scheme improves resource discovery efficiently.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.15-26
• /
• 2012

Recently, due to applicability increase of vector data based digital map for geographic information and evolution of geographic measurement techniques, large volumed GIS(geographic information service) services having high resolution and large volumed data are flowing actively. This paper proposed an efficient vector map compression technique using the SEC(spatial energy compaction) based on classified bins for the vector map having 1cm detail and hugh range. We encoded polygon and polyline that are the main objects to express geographic information in the vector map. First, we classified 3 types of bins and allocated the number of bits for each bin using adjacencies among the objects. and then about each classified bin, energy compaction and or pre-defined VLC(variable length coding) were performed according to characteristics of classified bins. Finally, for same target map, while a vector simplification algorithm had about 13%, compression ratio in 1m resolution we confirmed our method having more than 80% encoding efficiencies about original vector map in the 1cm resolution. Also it has not only higher compression ratio but also faster computing speed than present SEC based compression algorithm through experimental results. Moreover, our algorithm presented much more high performances about accuracy and computing power than vector approximation algorithm on same data volume sizes.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1359-1361
• /
• 2003

A set of microwave remote sensing data collected with the newly developed UMass Imaging Wind and Rain Airborne Profiler (IWRAP) during the 2002 Atlantic Hurricane Season was analyzed to further our understanding of the effect of precipitation on scatterometer wind vector retrieval. Coincident surface wind speed and precipitation measurements were provided by the UMass Simultaneous Frequency Microwave Radiometer (SFMR). The differences between the wind estimations from IWRAP and SFMR under precipitation conditions of 0-100mm/hr and wind speed of 0-60m/s was calculated, from which the effect of precipitation on the wind vector retrieval using scatterometry is analyzed qualitatively.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.249-254
• /
• 2017

Digital vector maps must be compressed effectively for transmission or storage in Web GIS (geographic information system) and mobile GIS applications. This paper presents a polyline compression method that consists of polyline feature-based hybrid simplification and second derivative-based data compression. Experimental results verify that our method has higher simplification and compression efficiency than conventional methods and produces good quality compressed maps.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.23-29
• /
• 1996

The purpose of this study is to develope an Object-Oriented Graphic database management system to handle geographic data of geographic information systems. As the result of this study, unstructured vector model was developed to handle geographic data and graphic database management was implemented by object-oriented programming. This study was focused on liking function between graphic data and attribute data, and not focused on network analysis function.

• Journal of Korea Multimedia Society
• /
• v.17 no.7
• /
• pp.769-777
• /
• 2014

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1058-1064
• /
• 2009

According to development of Information Technology and generalization of internet, practical use field of geography information became various. Therefor various Geographic Information System (GIS) constructed to manage geography information efficiently. However, geography information data of various form is depending on graphic authorizing tool of various form being not normalized each other. So, OGC(Open Geospatial Consortium) proposed GML(Geography Markup Language) that describe normalized geography information data that can apply mutually and W3C proposed SVG(Scalable Vector Graphics) of vector base. In this paper creates GML data of XML base for geography information data processing to vector graphic object, and design and implementation of GML document editing and translation system that define code converter that create GML document through created graphic objects and change vector graphic to logic structure of XML base.