• Spatial Information Research
• /
• v.19 no.3
• /
• pp.73-81
• /
• 2011

A study about UFID for the management and administration of digital map has achieved much progress through the Korea National Geographic Information Institute. But it is ture that the content and process is too complicated to be applied. For overcoming this and to make harmonious management of the object based seamless digital map, we need to develop the method which has the unique feature identifier on the digital map for management and administration. So, we introduce OSID(Object-based Seamless digital map IDentifier) on the object based seamless digital map and apply OSID in the system to manage the digital map. This study is based on the OSID basic structure which is applied in object based seamless digital map and design the structure of OSID system to maintain and manage each feature of the object based seamless digital map.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.433-436
• /
• 2008

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 people use the digital map that offers various thematic spatial data. Spatial data for digital map can manage to tile-based and feature-based data. The existing tile-based digital map management systems have difficult problems of data construction, history management, and updating based on a spatial object. In order to solve these problems, this paper proposed the data model for the feature-based digital map management system that is designed for feature-based seamless map, history management, real-time updating of spatial data, and analyzed the validity and utility of the proposed model.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.1 s.3
• /
• pp.17-27
• /
• 2000

To build a spatial database from digital maps, it is necessary to rebuild a seamless-map with discrete tile-based digital maps. The sequential merge methods have the disadvantage of degenerating concurrency. In this paper, we consider the implementation of the system based on modified 2PC protocol to retain the concurrent merge. As the engineers share the merge through the system, they can concurrently proceed to merge by negotiation.

• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.153-162
• /
• 2008

We propose a novel image inpainting method composed of two parts: band matching and seamless cloning. In band matching, a band enclosing the boundary of a missing region is compared to those from the other parts of the image. The inner area of the minimum difference band is then copied to the missing region. Even though this band matching results in successful inpainting in many practical applications, brightness discontinuity (a seam) may appear between the filled missing region and its neighborhood. We apply seamless cloning to remove such discontinuity between the two regions. However, since this basic method using one patch may not deal with cases where there are abrupt changes of color or brightness along the boundary, we furthermore devise one more step: target sub-division. The target area is subdivided into small sub-areas, and the band matching and seamless cloning are applied to each of them. The multiple results from the sub-division are then ordered according to inpainting quality, which is measured based on the edge map or discontinuity map along the boundary band.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.171-175
• /
• 2004

This paper proposes a seamless handoff scheme that enables a mobile node to continue a session when moving to an overlapping area. During handoff due to the weakness of signaling, mobile node makes new Care-of Addresses using signals received from access router when MN reaches the edge of its area in addition to its current CoA, and it sends temporary binding update messages to Mobility Anchor Point which manage the area covering MN. MAP receives that binding update messages from MN, and temporarily stores new binding informations from them to its binding cache besides existing binding information for MN. This scheme ensures a seamlessly handoff using multicasting until MN enter a new access router area and sends a confirmed binding update message to 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.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.466-468
• /
• 2005

MMORPG enables thousands of players to play in an evolving virtual world at the same time over the internet. So, the load of this kind of games is heavier than that of any other precedents. One of load balancing methods is map-partition to divide the load of entire system which is vulnerable to delay message between clients and servers. In this paper, we propose a game architecture using MigAgent to help migration of player character between field servers and to reduce message traffic between clients and field servers.

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

Many schemes to reduce the inter-MAP handoff delay in hierarchical mobile IPv6 have been proposed but the previous schemes waste relatively large network resources to decrease the path rerouting delay. In this paper, we propose the 2-layered MAP concept, where the seamless inter-MAP handoff can be supported regardless of path rerouting time. As a result, the waste of wired resources and the rate of the inter-MAP handoff can be reduced. From the performance analysis and simulation, the inter-MAP handoff rate for non-real-time traffic is only about 1/3 of the conventional result. Such advantageous features of the proposed scheme neither incur any increase of the total handoff rate nor require additional MAPs.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.585-594
• /
• 2008

The issues that we should consider in the process of providing mobile web service using a mobile device are seamless service and QoS-guaranteed service. HMIPv6 has MAP because of improving packet loss and transmission delay due to disconnection. However, a load is concentrated on HMIPv6 because of receiving and delivering packet for MN. Owing to this, real time data fails to be processed quickly, and also adaptive mobile service is required for QoS guaranteed service. However, this method demands the response time cost of contents service owing to the hardware differences of various devices. Therefore, we improve the process performance of real time data by applying a queue in MAP for seamless service in this paper. For decreasing response time cost, we propose mobile web service method which has reusable cache of contents using the elements of contents. The result of a numerical formula and simulation shows that our proposed method is superior under various system conditions.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.311-315
• /
• 2007

Since the first phase of NGIS (National Geographic Information System) project was launched in 1988, various types and spatial database has been produced and updated. With recent developments in the information technology, the application of spatial data has increased in amount as well as in the coverage of the area of interest. There is a need for production and management of a nationwide single continuous digital map. This paper looks into three problems of map edge matching when dealing with such a task : 1) different scales of adjacent maps, 2) different time of capture between adjacent maps, and 3) different responsible organization where map matching has not been peformed along the boundary.