• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.582-593
• /
• 2010

Recently the commercial value of GIS(geographic information system) has been increased with growing application demands of spatial information in life space. Also, GIS has been expanded to the integrated information system that provides the ease access to map information by public users and also the combined service of GIS map data and various multimedia contents. But several security problems of GIS map data have brought up at GIS industries, such as the illegal copy and distribution of GIS map data. Furthermore, the copyright protection of GIS map data has not been researched yet compared with image and video contents. This paper presents a polyline based watermarking scheme for the copyright protection of GIS vector map. The proposed scheme analyzes the structure of vector map and embeds adaptively the watermark by using the distance distribution of polyline components. From experimental results, we verified that the proposed scheme satisfies the invisibility and the robustness of geometrical attacks.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.210-218
• /
• 2011

Generally, GIS digital map has been represented and transmitted by ASCII and Binary data forms. Among these forms, Binary form has been widely used in many GIS application fields for the transmission of mass map data. In this paper, we present a hierarchical compression technique of polyline and polygon components for effective storage and transmission of vector map with various degree of decision. These components are core geometric components that represent main layers in vector map. The proposed technique performs firstly the energy compaction of all polyline and polygon components in spatial domain for the lossless compression of detailed vector map and compress independently integer parts and fraction parts of 64bit floating points. From experimental results, we confirmed that the proposed technique has superior compressive performance to the conventional data compression of 7z, zip, rar and gz.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.359-366
• /
• 2003

Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects, cache compaction and object structuring step in the clients. The conversion is a time- intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, in order to control the map efficiently in the vector map service based mobile phones, it is necessary to study the methods which reuse cached objects for reducing wireless network bandwidth and overwhelming the limited resources of mobile phones as well. This paper proposes the methods of reusing pre-received spatial objects for map control in the mobile vector map service system based on client-server architecture. The experiments conducted on the Web GIS systems with real data show that the proposed method is appropriate to map services for mobile phone. We also analyze the advantages and drawbacks between the reuse of cached data and transmission of raw data respectively.

• Journal of Broadcast Engineering
• /
• v.14 no.6
• /
• pp.807-810
• /
• 2009

This paper deals with a real-time image based relighting system for tangible video teleconference. The proposed image based relighting system renders the extracted human object using the virtual environmental images. The proposed system can homogenize virtually the lighting environments of remote users on the video teleconference, or render the humans like they are in the virtual places. To realize the video teleconference, the paper obtains the 3D object models of users in real-time using the controlled lighting system. In this paper, we use single color camera and synchronized two directional flash lights. Proposed system generates pure shading images using on and off flash images subtraction. One pure shading reflectance map generates a directional normal map from multiplication of each reflectance map and basic normal vector map. Each directional basic normal map is generated by inner vector calculation of incident light vector and camera viewing vector. And the basic normal vector means a basis component of real surface normal vector. The proposed system enables the users to immerse video teleconference just as they are in the virtual environments.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.4
• /
• pp.229-235
• /
• 2024

Recent years have seen active research on methods for efficiently processing and interpreting large volumes of data in the fields of artificial intelligence and machine learning. One of these data processing technologies, Vector Symbolic Architecture (VSA), offers an innovative approach to representing complex symbols and data using high-dimensional vectors. VSA has garnered particular attention in various applications such as natural language processing, image recognition, and robotics. This study quantitatively evaluates the characteristics and performance of VSA methodologies by applying five VSA methodologies to the MNIST dataset and measuring key performance indicators such as encoding speed, decoding speed, memory usage, and recovery accuracy across different vector lengths. BSC and VT demonstrated relatively fast performance in encoding and decoding speeds, while MAP and HRR were relatively slow. In terms of memory usage, BSC was the most efficient, whereas MAP used the most memory. The recovery accuracy was highest for MAP and lowest for BSC. The results of this study provide a basis for selecting appropriate VSA methodologies depending on the application area.

• Journal of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.803-829
• /
• 1998

We give general fixed point theorems for compact multimaps in the "better" admissible class $B^{K}$ defined on admissible convex subsets (in the sense of Klee) of a topological vector space not necessarily locally convex. Those theorems are used to obtain results for $\Phi$-condensing maps. Our new theorems subsume more than seventy known or possible particular forms, and generalize them in terms of the involving spaces and the multimaps as well. Further topics closely related to our new theorems are discussed and some related problems are given in the last section.n.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.197-205
• /
• 1994

In this paper, we present a vectorization algorithm for finding a vector image from a raster image of the land registered map which is used as the base map for various applications, and an automatic region creation algorithm for generating every re¬gion automatically from the vector image. We describe an ARM (automatic geographical entity recognition and modeling software) which carries out the recognition and process¬ing of geographical entities automatically using those algorithms.

• 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 Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.63-69
• /
• 2011

Recent growth of the geospatial information on the web made it possible to applicate spatial data. Also, the demand for rich and latest information shows a steady growth. The need for the new service using conflation of the existing spatial databases is on the increase. The information delivery of the services using the road vector and aerial image is reached intuitionally and accurately. However, the spatial inconsistencies in map services such as Daum map, Naver map and Google map is the problem. Our approach is processed to extract the road candidate image, match the template and filter the control points pair using vector median. Finally, CNS node and link are aligned to the real road with the aerial image. The experimental results show that our approach can align a set of CNS node and link with aerial imagery for daejon, such that the completeness and correctness of the aligned road have improved about 35% compare with the original roads.

• Communications of the Korean Mathematical Society
• /
• v.10 no.4
• /
• pp.949-961
• /
• 1995

Let f be a smooth G map from a nonsingular real algebraic G variety to an equivariant Grassmann variety. We use some G vector bundle theory to find a necessary and sufficient condition to approximate f by an entire rational G map. As an application we algebraically approximate a smooth G map between G spheres when G is an abelian group.