• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.5
• /
• pp.331-341
• /
• 2019

With the popularity of sensor-rich environments, smartphones have become one of the major platforms for obtaining and sharing information. Since it is difficult to utilize GNSS (Global Navigation Satellite System) inside the area with many buildings, the localization of smartphone in this case is considered as a challenging task. To resolve problem of localization using smartphone a four step image-based localization method and procedure is proposed. To improve the localization accuracy of smartphone datasets, MMS (Mobile Mapping System) and Google Street View were utilized. In our approach first, the searching for candidate matching image is performed by the query image of smartphone's using GNSS observation. Second, the SURF (Speed-Up Robust Features) image matching between the smartphone image and reference dataset is done and the wrong matching points are eliminated. Third, the geometric transformation is performed using the matching points with 2D affine transformation. Finally, the smartphone location and attitude estimation are done by PnP (Perspective-n-Point) algorithm. The location of smartphone GNSS observation is improved from the original 10.204m to a mean error of 3.575m. The attitude estimation is lower than 25 degrees from the 92.4% of the adjsuted images with an average of 5.1973 degrees.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.213-226
• /
• 2011

In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.4
• /
• pp.355-363
• /
• 2007

The purpose of this study is to maximize the use of framework data by a method for updating road framework data using a economical, rapid, and accurate Vehicle-based kinematic survey to get the latest road data among "transportation framework data" which was built in 2003. We collected data using a Vehicle-based kinematic survey with DGPS (Differential Global Positioning System) in Daejeon and Pyeongtaek city and verified the accuracy of line and point features between surveying and previous results. The result showed that Daejeon city which is located near GPS CORS (Continuously Operating Reference Station)s and receive a signal well had lower errors than 1/5,000 digital base map, and Pyeongtaek city which is located far from the stations and receive a signal badly had errors beyond the limits. The study showed that postprocessing method or Total Station surveying should be used where signals cannot be detected well after analyzing a receiving rate from GPS CORSs, the stations of other organizations should be shared, and further studies are needed.

• Korean Journal of Remote Sensing
• /
• v.37 no.2
• /
• pp.291-304
• /
• 2021

Updating a forest type map is essential for sustainable forest resource management and monitoring to cope with climate change and various environmental problems. According to the necessity of efficient and wide-area forestry remote sensing, CAS500-4 (Compact Advanced Satellite 500-4; The agriculture and forestry satellite) project has been confirmed and scheduled for launch in 2023. Before launching and utilizing CAS500-4, this study aimed to pre-evaluation the possibility of satellite-based tree species classification using RapidEye, which has similar specifications to the CAS500-4. In this study, the study area was the Chuncheon forest management complex, Gangwon-do. The spectral information was extracted from the growing season image. And the GLCM texture information was derived from the growing and non-growing seasons NIR bands. Both information were used to classification with random forest machine learning method. In this study, tree species were classified into nine classes to the coniferous tree (Korean red pine, Korean pine, Japanese larch), broad-leaved trees (Mongolian oak, Oriental cork oak, East Asian white birch, Korean Castanea, and other broad-leaved trees), and mixed forest. Finally, the classification accuracy was calculated by comparing the forest type map and classification results. As a result, the accuracy was 39.41% when only spectral information was used and 69.29% when both spectral information and texture information was used. For future study, the applicability of the CAS500-4 will be improved by substituting additional variables that more effectively reflect vegetation's ecological characteristics.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.174-179
• /
• 2003

Through the simultaneous localization and map building (SLAM) technique, a robot can create maps about its unknown environment while it continuously localizes its position. Grid maps and feature maps have been widely used for SLAM together with application of probability methods and POMDP (partially observed Markov decision process). But this approach based on grid maps suffers from enormous computational burden. Topological maps, however, have drawn more attention these days because they are compact, provide natural interfaces, and are easily applicable to path planning in comparison with grid maps. Some topological SLAM techniques like GVG (generalized Voronoi diagram) were introduced, but it enables the robot to decide only whether the current position is part of GVG branch or not in the GVG algorithm. In this paper, therefore, to overcome these problems, we present a method for updating a global topological map from the local topological maps. These local topological maps are created through a labeled Voronoi diagram algorithm from the local grid map built based on the sensor information at the current robot position. And the nodes of a local topological map can be utilized as the features of the environment because it is robust in light of visibility problem. The geometric information of the feature is applied to the extended Kalman filter and the SLAM in the indoor environment is accomplished. A series of simulations have been conducted using a two-wheeled mobile robot equipped with a laser scanner. It is shown that the proposed scheme can be applied relatively well.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.1
• /
• pp.11-19
• /
• 2016

Recently, global companies are developing the automobile technologies, converged with state-of-the-art IT technologies for the commercialization of autonomous vehicles. These autonomous vehicles are required the accurate lane information to enhance its reliability by controlling the vehicles safely. Hence, the study planned to examine possibilities of applying UAV photogrammetry of high-resolution images, obtained from the low altitudes. The high-resolution DSM and the ortho-images were generated from the GSD 7cm-level digital images that were obtained and based on the generated data, when the positions information of the roads including the lanes were extracted. In fact, the RMSE of verifying the extracted data was shown to be about 15cm. Through the results from the study, it could be concluded that the low alititude UAV photogrammetry can be applied for generating and updating a high-accuracy map of road areas.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.1-16
• /
• 2008

Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

• Smart Structures and Systems
• /
• v.6 no.5_6
• /
• pp.579-593
• /
• 2010

Low-power radio frequency (RF) chip transceiver technology and the associated structural health monitoring platforms have matured recently to enable high-rate, lossless transmission of measurement data across large-scale sensor networks. The intrinsic value of these advanced capabilities is the allowance for high-quality, rapid operational modal analysis of in-service structures using distributed accelerometers to experimentally characterize the dynamic response. From the analysis afforded through these dynamic data sets, structural identification techniques can then be utilized to develop a well calibrated finite element (FE) model of the structure for baseline development, extended analytical structural evaluation, and load response assessment. This paper presents a case study in which operational modal analysis is performed on a three-span prestressed reinforced concrete bridge using a wireless sensor network. The low-power wireless platform deployed supported a high-rate, lossless transmission protocol enabling real-time remote acquisition of the vibration response as recorded by twenty-nine accelerometers at a 256 Sps sampling rate. Several instrumentation layouts were utilized to assess the global multi-span response using a stationary sensor array as well as the spatially refined response of a single span using roving sensors and reference-based techniques. Subsequent structural identification using FE modeling and iterative updating through comparison with the experimental analysis is then documented to demonstrate the inherent value in dynamic response measurement across structural systems using high-rate wireless sensor networks.