• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.5
• /
• pp.109-120
• /
• 2017

It is important to estimate objectively in the driving test. Especially, the driving test is examined by totally driving ability, rule observation and situational judgement. For this, a grading automation system for driving test was presented by using GPS, sensor data and equipment operation informations. This system is composed of vehicle mounted module, automatic grading terminal, data controller, data storage and processing server. The vehicle mounted module gathters sensor data in the car. The terminal performs automatic grading using the received sensor data according the driving test criterion. To overcome the misposition of vehicle in the map due to GPS error, we proposed the automatic grading system by map matching method, path deviation and return algorithm. In the experimental results, it was possible to grade automatically, display the right position of the car, and return to the right path under 10 seconds when the vehicle was out of the shadow region of the GPS. This system can be also applied to the driving education.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.139-141
• /
• 2016

본 논문에서는 실시간 실내 다중 이동 로봇 충돌 회피에 관한 연구이다. 충돌 회피 기법에는 센서를 이용한 포텐셜 필드 기법 등 다양한 방법[1,2,3]이 있지만 좁은 실내 공간에서 사용하기에는 제한점이 많다. 본 논문에서 제안하는 시스템은 서버, 감시카메라, 로봇 세 가지로 구성되어 있으며 여러 모듈간 상호작용을 통한 충돌 회피 시스템을 제안한다. 감시카메라는 서버에게 실시간으로 영상을 제공해 실내 상황을 파악하게 한다. 서버는 실내 공간에 있는 모든 로봇을 관리하고 감시카메라로부터 받은 영상을 이용한 맵 매칭을 통해 로봇의 위치를 파악한다. 그다음 로봇의 위치를 토대로 경로를 생성하여 로봇에게 전송한다. 로봇 또한 서버에게 경로, 속도를 전송 받아 목적지로 이동하며 서버로부터 지속적인 관리를 받아 충돌을 방지해 목적지까지 신속하고 정확하게 이동하는 것이 본 논문의 목적이다.

• Spatial Information Research
• /
• v.21 no.1
• /
• pp.87-100
• /
• 2013

Recently, the use of locational information is growing rapidly. GPS technology has been adopted generally for obtaining locational information in outdoor spaces. In the other hand, the researches on indoor positioning have been carried out applying WLAN, RFID or Bluetooth technology because of the multi-path interference of GPS signal caused by the physical obstacles such as walls or columns in buildings. However, such technologies for indoor positioning cost too much to build sensing infrastructure and compute-intensive processes are involved. Furthermore, the accuracy of location estimation is variable caused by interior structures in buildings. In this study, to make up for the limitations, descriptive data such as phone number, unique room numbers, or business names readily available in mixed-use buildings is used for extracting location information. Furthermore, during the process, a geocoding method using character matching is applied to this study enabling prompt location estimation and sublating the fluctuation of accuracy caused by interior structures. Based on the proposed method in this study, an architecture is designed, and three-dimensional viewer program is developed for the implementation of this study. Also, this research is quantitatively analyzed through match rate and processing time of proposed method.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.423-436
• /
• 2006

In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pub-sub system, subscribing users specify their interest in profiles expressed in the XPath language, and each new content is matched against the user profiles so that the content is delivered only to the interested subscribers. As the number of subscribed users and their profiles can grow very large, the scalability of the system is critical to the success of pub-sub services. In this paper, we propose a novel scalable filtering system called FiST(Filtering by Sequencing Twigs) that transforms twig patterns expressed in XPath and XML documents into sequences using Prufer's method. As a consequence, instead of matching linear paths of twig patterns individually and merging the matches during post-processing, FiST performs holistic matching of twig patterns with incoming documents. FiST organizes the sequences into a dynamic hash based index for efficient filtering. We demonstrate that our holistic matching approach yields lower filtering cost and good scalability under various situations.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.4
• /
• pp.101-107
• /
• 2010

The aim of this paper is to come up with a methodology of constructing an efficient model for multiple representations which can manage and reconcile real-time data about large-scale roads in Vector Domain. In other words, we suggested framework based on a bottom-up approach, which is allowed to integrate data from the network of the lowest level sequentially and perform automated matching in order to produce variable-scale map. Finally, we applied designed multi-LoD model to in-vehicle application.

• The Korean Journal of Applied Statistics
• /
• v.30 no.3
• /
• pp.453-462
• /
• 2017

Double propensity score adjustment is an analytic solution to address bias due to incomplete matching. However, it is difficult to estimate the standard error of the estimated treatment effect when using double propensity score adjustment. In this study, we propose two bootstrap methods to estimate the standard error. The first is a simple bootstrap method that involves drawing bootstrap samples from the matched sample using the propensity score as well as estimating the standard error from the bootstrapped samples. The second is a complex bootstrap method that draws bootstrap samples first from the original sample and then applies the propensity score matching to each bootstrapped sample. We examined the performances of the two methods using simulations under various scenarios. The estimates of standard error using the complex bootstrap were closer to the empirical standard error than those using the simple bootstrap. The simple bootstrap methods tended to underestimate. In addition, the coverage rates of a 95% confidence interval using the complex bootstrap were closer to the advertised rate of 0.95. We applied the two methods to a real data example and found also that the estimate of the standard error using the simple bootstrap was smaller than that using the complex bootstrap.

• Korean Journal of Remote Sensing
• /
• v.38 no.5_1
• /
• pp.597-608
• /
• 2022

Remotely sensed data have been used in various fields, such as disasters, agriculture, urban planning, and the military. Recently, the demand for the multitemporal dataset with the high-spatial-resolution has increased. This manuscript proposed an automatic image matching algorithm using a deep learning technique to utilize a multitemporal remotely sensed dataset. The proposed deep learning model was based on High Resolution Net (HRNet), widely used in image segmentation. In this manuscript, denseblock was added to calculate the correlation map between images effectively and to increase learning efficiency. The training of the proposed model was performed using the multitemporal orthophotos of the National Geographic Information Institute (NGII). In order to evaluate the performance of image matching using a deep learning model, a comparative evaluation was performed. As a result of the experiment, the average horizontal error of the proposed algorithm based on 80% of the image matching rate was 3 pixels. At the same time, that of the Zero Normalized Cross-Correlation (ZNCC) was 25 pixels. In particular, it was confirmed that the proposed method is effective even in mountainous and farmland areas where the image changes according to vegetation growth. Therefore, it is expected that the proposed deep learning algorithm can perform relative image registration and image matching of a multitemporal remote sensed dataset.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.215-221
• /
• 2010

Hopfield networks have been proposed as a new computational tool for finding the shortest path of networks. Zhang and Ali studied the method of finding shortest path by expended neurons of Hopfield networks. Ali Algorithm is well known as the tool with the neurons of branch numbers. Where a network grows bigger, it needs much more time to solve the problem by Ali algorithm. This paper modifies the method to find the synapse matrix and the input bias vector. And it includes the eSPN algorithm after proper iterations of the Hopfield network. The proposed method is a tow-stage method and it is more efficient to find the shortest path.The proposed method is verified by three sample networks. And it could be more applicable then Ali algorithm because it's fast and easy. When the cost of brach is changed, the proposed method works properly. Therefore dynamic cost-varing networks could be used by the proposed method.

• The KIPS Transactions:PartD
• /
• v.17D no.2
• /
• pp.103-110
• /
• 2010

Recently, many XML document management systems using the advantage of RDBMS have been actively developed for the storage, processing and retrieval of XML documents. However, fractional pattern-matching query such as the LIKE operations cannot take the advantage of the index of RDBMS because these operations have deteriorated retrieval performance through its inefficient comparison processing. The hierarchical XML storage technique which stores XML documents in RDBMS efficiently, and the path inverted index technique are proposed in this paper. It regards the element of an XML document as a keyword, and focuses on organizing a posting file with path identifiers and sequences to reduce the retrieval time of path based query. Through simulations, our methods have shown about 60% better performance than the conventional method using RDBMS in searching.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2021.11a
• /
• pp.167-169
• /
• 2021

친환경 스마트 선박 핵심인력 양성 및 사업화 기술개발의 취업·창업 산학연결 플랫폼, 민간 전문가가 직접 멘토로 참여하도록 유도한다. 멘티는 취업하고자 하는 분야의 전문가를 매칭 또는 선택을 통한, 효과적인 멘토링 실현하고 이해관계 자간의 멘토링을 통해서, 취업과 창업으로 바로 연결될 수 있도록 활성화 시킨다. 멘토·멘티간의 멘토링 지식 빅데이터 수집을 통한, AI 스마트 멘토링 제공하고 멘토와 멘토의 맞춤/화상/AI 멘토링, 멘토링 성과관리, 시스템을 제공한다.