• Spatial Information Research
• /
• v.19 no.4
• /
• pp.11-20
• /
• 2011

In accordance with low carbon and green growth paradigm, a subway is one of major public transit systems for resolving traffic congestion and decreasing traffic accidents. In addition, as subway networks expand, passengers' travel pattern in the subway network change and consequently affect the urban structure. Generally, new subway route has been planned and developed, mainly considering a travel demand forecast. However, it is desired to conduct an empirical analysis on the forecast model regarding change of travel accessibility and passenger demand pattern according to new subway line. Therefore, in this paper, an alternative method, developed based upon a spatial syntax model, is proposed for evaluating new subway route in terms of passenger's mobility and network accessibility. In a case study, we constructed subway network data, mainly targeting the no 9 subway line opened in 2009. With an axial-map analysis, we calculated spatial characteristics to describe topological movement interface. We then analyzed actual modal shift and change on demand of passengers through the number of subway passenger between subway stations and the number of passenger according to comparative bus line from Smart Card to validate suggested methods. Results show that the proposed method provides quantitative means of visualizing passenger flow in subway route planning and of analyzing the time-space characteristics of network. Also, it is expected that the proposed method can be utilized for predicting a passengers' pattern and its impact on public transportation.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.11-21
• /
• 2013

W ith the recent increasing build and application for 3D spatial information, the importance of management and application for spatial information based on indoor space has been increased. Especially, Due to the increasing of the scale and complexity of the building according to the development of construction technologies several studies have been conducted to provide the services based on indoor space such as indoor navigation for disaster. Therefore, to efficient manage and service for information of complicated indoor space, it is necessary to extend and develop 3D spatial model and services that have been developed for outdoor space. In this paper, Indoor Spatial Data Model(ISDM) is developed to support building spatial information for complicated indoor space and location based services through topological information. ISDM contains a feature model which is a CityGML Application Domain Extension(ADE) model and a topology model that refers the IndoorGML.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4343-4355
• /
• 2014

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD（Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.11-20
• /
• 1999

Because conventional spatial databases process the spatial information that is valid at current time, it is difficult to manage historical information efficiently which has been changed from the past to current. Recently, there are rapid increasing of interest to solve this problem so that makes databases to support historical information as well as spatial management at the same time. It can be eventually used in a various application areas. The formal semantics in a database is used to represent database structures and operations in order to prove the correctiveness of them in terms or mathematics. It also plays an important role in database to design a database and database management system. So in this paper, we suggest spatiotemporal domain, object, data, and spatiotemporal geometric/topological operations. And we not only formalize relational algebra/calculus using formal semantics for a spatiotemporal data model, but also show the example of real orld with them.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.101-112
• /
• 2000

In Geographic Information System, spatial object can be changed in the attribute information, spatial location and the topological relation between them with the change of time. However traditional GIS deletes the old value of aspatial information and replaces them with new value. Therefore. it is difficult to manage thc history of changed spatial object and can not support the spatio-temporal queries including temporal queries. In this paper, we propose a spatio-temporal objected model to solve this problem. We implement the proposed model with spatio-temporal class using Gothic GIS tool. The historical information of an object is stored into the object itself for the effective history management. And, in order to provide the queries for the history of an object and spatio-temporal relationship, we add temporal operators, spatio-temporal operators, and spatio-temporal query operations into Gothic, and improve the facility of the Gothic.

• Spatial Information Research
• /
• v.17 no.4
• /
• pp.445-454
• /
• 2009

Beyond simple transfer of information through sensor network, this study will provide the insights about the way to embody the real context aware location based service in an ubiquitous computing environment. In this paper, a new formal approach is introduced to derive knowledge about the scope of influence for a point object. A scope of influence is defined as the conceptual area where there is a possibility of the phenomenon or event occurring because of this point object. A point object can be spatially extended by considering this scope of influence in conjunction with the point. These point objects are called Spatially Extended Point (SEP) objects. Compositions of gradual changes of topological relations between a SEP and the environment near the SEP show how to represent the qualitative spatial behaviors of a SEP objects. These qualitative spatial behaviors will be good standards for Location Based Service (LBS) to provide more subdivided and suitable information to the users.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.149-159
• /
• 2008

In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.6
• /
• pp.785-791
• /
• 2021

In this paper, we propose a methodology for estimating the optimal traversable destination from the location-based information of the object recognized by the mobile robot to perform the object delivery service. The location estimation process is to apply the generalized Voronoi graph to the grid map to create an initial topology map composed of nodes and links, recognize objects and extract location data using RGB-D sensors, and collect the shape and distance information of obstacles. Then, by applying the hybrid approach that combines the center of gravity and thinning method, the optimal moving position for the service robot to perform the task of grabbing is estimated. And then, the optimal node information for the robot's work destination is updated by comparing the geometric distance between the estimated position and the existing node according to the node update rule.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.1 s.5
• /
• pp.91-104
• /
• 1995

The spatial aggregation of data, in transportation and other planning processes, is an important theoretical consideration because the results of any analysis are not entirely independent of the delineation of zones. Moreover, using a different spatial aggregation may lead to different, and sometimes contradictory conclusions. Two criteria have been considered as important in designing zone systems. They are scale and aggregation. The scale problem arises because of uncertainty about the number of zones needed for a study and the aggregation problem arises because of uncertainty about how the data are to be aggregated to from a given scale problem. In a transportation study, especially in the design of traffic analysis zone(TAZ), the scale problem is directly related to the number dof zones and the aggregation problem involves spatial clustering, meeting the general requirements of forming the zones system such as equal traffic generation, convexity, and the consistency with the political boundary. In this study, first, the comparative study of delineating spatial units has been given. Second, a FORTRAN-based heuristic algorithm for designing TAZ based on socio-economic data has been developed and applied to the Korean peninsula containing 132 micro parcels. The vector type ARC/INFO GIS topological data mosel has been used to provise the adjacency information between parcels. The results, however, leave some to be desired in order to overcome such problems as non-convexity of the agglomerated TAZ system and/or uneven traffic phenomenon for each TAZ.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.508-516
• /
• 2016

When GPS signals are not available, a relative localization can be alternatively used to represent the topological relationship between mobile nodes. A relative location map of a network can be constructed by using the distance information between all the pairs of nodes in the network. If a network is large, a number of small local maps are individually constructed and are merged to obtain the whole map. However, this approach may result in a high computation and communication overhead. In this paper, we propose a reference-node selection scheme for relative localization map construction, which chooses a subset of nodes as a reference node that is supposed to construct local maps. The scheme is a greedy algorithm that iteratively chooses nodes with high degree as a reference node until the chosen local maps are successfully merged with a sufficient number of common nodes between nearby local maps. The simulation results indicate that the proposed scheme achieves higher localization accuracy with a reduced computational overhead.