• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.87-100
• /
• 2004

When spatial data which a user requests are stored various data servers in web mapping environment, it is necessary to access one more map servers to gain data and then integrate them. This paper designs and implements a fusion map server for web mapping. The proposed fusion map server has three characteristics. First, it has customizing metadata which reflect various user's requests. Second, it provides fusion services which integrate spatial and non-spatial data. Last, it uses the dynamic liking method to support the fusion services efficiently. We design and implement a publisher client, a map server and a fusion map server for proposed map server.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.15-22
• /
• 2004

Map services for cellular phone have problem for implementation, which are the limitation of a screen size. To effectively represent map data on screen of celluar phone, it need a process which translate a detailed map data into less detailed data using map generalization, and it should manipulate zoom in out quickly by leveling the generalized data. However, current spatial indexing methods supporting map generalization do not support all map generalization operations. In this paper, We propose a leveled spatial indexing method, LMG-tree, supporting map generalization and presents the results of performance evaluation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3558-3577
• /
• 2017

In 2D-to-3D video conversion process, the virtual left and right view can be generated from 2D video and its corresponding depth map by depth image based rendering (DIBR). The depth map plays an important role in conversion system, so the copyright protection for depth map is necessary. However, the provided virtual views may be distributed illegally and the depth map does not directly expose to viewers. In previous works, the copyright information embedded into the depth map cannot be extracted from virtual views after the DIBR process. In this paper, a new copyright protection scheme for the depth map is proposed, in which the copyright information can be detected from the virtual views even without the depth map. The experimental results have shown that the proposed method has a good robustness against JPEG attacks, filtering and noise.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.3
• /
• pp.609-619
• /
• 2016

RHadoop is a collection of R packages that allow users to manage and analyze data with Hadoop. In this paper, we implement K-Means algorithm based on MapReduce framework with RHadoop to make the clustering method applicable to large scale data. The main idea introduces a combiner as a function of our map output to decrease the amount of data needed to be processed by reducers. We showed that our K-Means algorithm using RHadoop with combiner was faster than regular algorithm without combiner as the size of data set increases. We also implemented Elbow method with MapReduce for finding the optimum number of clusters for K-Means clustering on large dataset. Comparison with our MapReduce implementation of Elbow method and classical kmeans() in R with small data showed similar results.

• The Journal of the Korea Contents Association
• /
• v.10 no.10
• /
• pp.78-85
• /
• 2010

Map/Reduce is the programing model which can implement the Cloud Computing recently has been noticed. The model operates an application program processing amount of data using a lot of computers. It is important to plan the mechanism of separating the data in proper size and distributing that to a cluster consisted of computing node in efficient for using the computing nodes very well. Besides that, planning a process of Map phases and Reduce phases also influences the performance of Map/Reduce. This paper suggests the effectively distributing scheme that separates a huge data and operates Map task in the considering the performance of computing node and network status. And we make the Reduce task can be processed quickly through the tuning the mechanism of Map and Reduce task operation. Using the two Map/Reduce sample application, we experimented the suggestion and we evaluate suggestion considered it in how impact the Map/Reduce performance.

• Journal of Environmental Impact Assessment
• /
• v.15 no.6
• /
• pp.373-383
• /
• 2006

The spatial mapping of risk is very useful data in planning for disaster preparedness. This research presents a methodology for making the landslide life risk map in the Boeun area which had considerable landslide damage following heavy rain in August, 1998. We have developed a three-stage procedure in spatial data analysis not only to estimate the probability of the occurrence of the natural hazardous events but also to evaluate the uncertainty of the estimators of that probability. The three-stage procedure consists of: (i)construction of a hazard prediction map of "future" hazardous events; (ii) validation of prediction results and estimation of the probability of occurrence for each predicted hazard level; and (iii) generation of risk maps with the introduction of human life factors representing assumed or established vulnerability levels by combining the prediction map in the first stage and the estimated probabilities in the second stage with human life data. The significance of the landslide susceptibility map was evaluated by computing a prediction rate curve. It is used that the Bayesian prediction model and the case study results (the landslide susceptibility map and prediction rate curve) can be prepared for prevention of future landslide life risk map. Data from the Bayesian model-based landslide susceptibility map and prediction ratio curves were used together with human rife data to draft future landslide life risk maps. Results reveal that individual pixels had low risks, but the total risk death toll was estimated at 3.14 people. In particular, the dangerous areas involving an estimated 1/100 people were shown to have the highest risk among all research-target areas. Three people were killed in this area when landslides occurred in 1998. Thus, this risk map can deliver factual damage situation prediction to policy decision-makers, and subsequently can be used as useful data in preventing disasters. In particular, drafting of maps on landslide risk in various steps will enable one to forecast the occurrence of disasters.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1127-1130
• /
• 2003

This paper introduces histogramic in-motion mapping for real-time map building with the Eyebot in motion. A histogram grid used in HIMM is updated through three PSD sensors. HIMM makes it possible to make fast map-building and avoid obstacles in real-time. Fast map-building allows the robot to immediately use the mapped information in real-time obstacle-avoidance algorithms. HIMM has been tested on the Eyebot. The Eyebot sends PSD data to computer and computer builds a 3D-Map based on PSD data.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.981-990
• /
• 2002

Over the past few years, a number of studies have been made on web map services which enable the GIS user to access spatial data through the web. They, however. have focused on only implementation techniques separately, such at map client implementation map server implementation, communication between client and server, and the map data representation. Therefore, it is hard to share and practical use the spatial data, because they does not ensure interoperability in heterogeneous map servers. In this paper, In this paper, we have designed and implemented the web map server with open architecture. which complies with the standard interfaces proposed by OpenGIS Consortium (OGC). In particular, we have extended the OGC's Interfaces for a map server to support one or more data sources. This paper has contributed to construction and practical use of web map services by newly proposing the method of implementation of a map server. which could be reused regardless of the types of data sources.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.367-376
• /
• 2001

For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.169-176
• /
• 2009

Low-cost sensors have been widely used for mobile robot navigation in recent years. However, navigation performance based on low-cost sensors is not good enough to be practically used. Among many navigation techniques, building of an accurate map is a fundamental task for service robots, and mapping with low-cost IR sensors was investigated in this research. The robot's orientation uncertainty was considered for mapping by modifying the Bayesian update formula. Then, the data association scheme was investigated to improve the quality of a built map when the robot's pose uncertainty was large. Six low-cost IR sensors mounted on the robot could not give rich data enough to align the range data by the scan matching method, so a new sample-based method was proposed for data association. The real experiments indicated that the mapping method proposed in this research was able to generate a useful map for navigation.