• Korean Journal of Remote Sensing
• /
• v.34 no.4
• /
• pp.671-680
• /
• 2018

Compared to the imagery produced by traditional satellites, PlanetScope satellite imagery has made it possible to easily capture remotely-sensed imagery every day through dozens or even hundreds of satellites on a relatively small budget. This study aimed to detect changed areas and update a land cover map using a PlanetScope image. To generate a classification map, pixel-based Random Forest (RF) classification was performed by using additional features, such as the Normalized Difference Water Index (NDWI) and the Normalized Difference Vegetation Index (NDVI). The classification result was converted to vector data and compared with the existing land cover map to estimate the changed area. To estimate the accuracy and trends of the changed area, the quantitative quality of the supervised classification result using the PlanetScope image was evaluated first. In addition, the patterns of the changed area that corresponded to the classification result were analyzed using the PlanetScope satellite image. Experimental results found that the PlanetScope image can be used to effectively to detect changed areas on large-scale land cover maps, and supervised classification results can update the changed areas.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.147-155
• /
• 2006

Hierarchical Prefix Delegation (HPD) protocol refers to a type of solution to problems inherent in non-optimal routing which occurs with Network Mobility (NEMO) basic solution. However, because HPD cannot improve the micro-mobility problems, problem surfaces each time Mobile Network Node (MNN) changes the attachment point; as happens also in a Mobile IPv6 (MIPv6) protocol in sending Binding Update (BU) messages to Home Agent (HA) / Correspondent Nodes(CNs). By applying Hierarchical Mobile IPv6 protocol concept to HPD, this study proposes an algorithm for effectively handling micro-mobility problems which occur with HPD in a nested NEMO environment. By sending BU only to nearby Mobility Anchor Point(MAP) during MNN location change within a MAP's domain, the proposed protocol will alleviate service disruption delays and signaling loads during the handover process, overcoming the limitations of HPD.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.107-115
• /
• 2008

In this paper, a secure and efficient binding update protocol as well as a handover protocol are proposed in the generalized hierarchical MIPv6 environment. Contrary to the conventional hierarchical MIPv6 environment where a foreign network is a small-scaled MAP domain, a large-scaled MAP domain consisting of several MAPs which are connected hierarchically is considered in the proposed protocol for the mechanism to support fast and secure mobility. It is also analyzed the security of the proposed protocol under the various attack scenarios.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.5
• /
• pp.537-546
• /
• 2008

The digital map has been updated in every five years in the past. However, it has been changed to make corrections and updated in every two years for metropolitan region and every four years for other regions since year 2008. Although, the correctness and reliability were decreased and updating work is being delayed due to the updating work in a lump. The period update spends a lot of money because this method uses aerial photogrammetry, and the digital map has the time gap between periods. Therefore, this study provides information necessary for digital map produced by the government and develops digital map production system based on objects which can be updated frequently in order to save state and local government budgets that double investment are generated to update digital map. In order to analyze usefulness of the developed system, subject area was selected and errors of updated data were analyzed. As the result of analysis, checked 66 errors were corrected and saved in the database.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.207-213
• /
• 2006

Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.512-527
• /
• 2001

In a client-server spatial database, it is desirable to maintain the cached data in a client side to minimize the communication overhead across a network. This paper deals with the issues of concurrency and consistency of map updates in this environment. A client transaction to update map data is an interactive work and takes a long time to complete it. The map update in a client site may affect the other sites'updates because of dependencies between spatial data stored at different sites. The concurrent updates should be propagated to the other clients as well as the server to keep the consistency of map replicated in a client cache, and also the communication overhead of the update propagation should be minimized not to lose the benefit of caching. The newly proposed cache region locking with CR lock and CX lock controls the update dependency due to spatial relationships. CS lock and COD lock are suggested to use optimistic detection-based approaches for guaranteeing the consistency of cached client data. The cooperative update protocol uses these extended locking primitives and Spatial Relationship-based 2PC (SR-based 2PC). This paper argues that the concurrent updates of cached client spatial data can be achieved by deciding on collaborative updates or independent updates based on spatial relationships.

• The Journal of Korea Robotics Society
• /
• v.9 no.2
• /
• pp.96-103
• /
• 2014

Global localization is one of the essential issues for mobile robot navigation. In this study, an indoor global localization method is proposed which uses a Kinect sensor and a monocular upward-looking camera. The proposed method generates an environment map which consists of a grid map, a ceiling feature map from the upward-looking camera, and a spatial feature map obtained from the Kinect sensor. The method selects robot pose candidates using the spatial feature map and updates sample poses by particle filter based on the grid map. Localization success is determined by calculating the matching error from the ceiling feature map. In various experiments, the proposed method achieved a position accuracy of 0.12m and a position update speed of 10.4s, which is robust enough for real-world applications.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.808-811
• /
• 2008

HMIPv6는 핸드오버시 시그널링 오버헤드와 패킷 손실을 감소시키는데 목적이 있다. 그러나 HMIPv6는 성능 평가면에서 기존의 MIPv6보다 우수하지 못하다. HMIPv6 환경하에서 새로운 도메인에 진입한 MN이 MAP 선택시 최상위 MAP을 선택하여 CN과 통신할 경우 최상위 MAP에 부하가 집중되고 MN이 빈번하게 이동하거나 대용량서비스를 이용하게 되면 성능이 저하되고, 반대로 MN이 최하위 MAP을 선택하여 CN과 통신할 경우에는 HA나 CN에 대한 Binding Update 시그널 증가로 성능이 저하된다. 이에 본 논문에서는 MN이 MAP 선택시 Distance, 노드사용율 및 대역폭 사용율을 바탕으로 MAP을 선택하는 적응적 MAP을 선택하는 방안에 대해서 논하고자 한다.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.71-78
• /
• 2009

A demand on the spatial data management has been rapidly increased with the introduction and diffusion process of ITS, Telematics, and Wireless Sensor Network. And many different users use the digital map that offers various thematic spatial data. Spatial data for digital map can be managed by tile-based and feature-based data. The existing tile-based digital map management systems have difficult problems such as data construction, history management, and update data based on a spatial object. In order to solve these problems, we proposed the data model for feature-based digital map management system for representation of feature-based seamless map, history management, real-time update of spatial data, and analyzed the validity and utility of the proposed model.

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.609-620
• /
• 2008

The service handling the map data in the mobile device including navigation, LBS, Telematics, and etc., becomes various. The size of map data which is stored and managed in the mobile device is growing and reaches in several GB. The conventional navigation system has used the read-only PSF (physical storage format) in order to enhance the performance of system by maximum in the mobile device which has limited resources. So though a little part of the map data is changed the whole data must be updated. In general, it takes several ten minutes to write the 2 GB map data to a flash memory of mobile device. Therefore, we have developed the mobile spatial DBMS (database management system) to solve the problem which is that the partial map data couldn't be updated in the conventional navigation system. And we suggest the policy to guarantee the performance of the navigation system which is implemented using the spatial mobile DBMS and verify this by experiment.