• The Journal of Korea Robotics Society
• /
• v.14 no.4
• /
• pp.357-362
• /
• 2019

This paper proposes a model and train method that can real-time detect objects and distances estimation based on a monocular camera by applying deep learning. It used YOLOv2 model which is applied to autonomous or robot due to the fast image processing speed. We have changed and learned the loss function so that the YOLOv2 model can detect objects and distances at the same time. The YOLOv2 loss function added a term for learning bounding box values x, y, w, h, and distance values z as 클래스ification losses. In addition, the learning was carried out by multiplying the distance term with parameters for the balance of learning. we trained the model location, recognition by camera and distance data measured by lidar so that we enable the model to estimate distance and objects from a monocular camera, even when the vehicle is going up or down hill. To evaluate the performance of object detection and distance estimation, MAP (Mean Average Precision) and Adjust R square were used and performance was compared with previous research papers. In addition, we compared the original YOLOv2 model FPS (Frame Per Second) for speed measurement with FPS of our model.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.223-225
• /
• 2001

This paper discusses the dynamic test of distance relay on transmission line connected unified power flow controller(UPFC) using the real-time digital simulator(RTDS). Depending on operating conditions of UPFC, the trip characteristics of distance relay is influenced by the prefault conditions. In this paper, UPFC is established using the RTDS and then relay test is performed on real time.

• Journal of the Economic Geographical Society of Korea
• /
• v.18 no.4
• /
• pp.539-555
• /
• 2015

This study proposes the methodology for measuring the time-distance accessibility on the Seoul bus system based on the T-card transaction databases and analyzes the results. T-card transaction databases contain the time/space information of each passenger's locations and times of the departure, transfers, and destination. We introduce the bus network graph and develop the algorithms for time-distance accessibility measurement. We account the average speed based on each passenger's get-in and getoff information in the T-card data as well as the average transfer time from the trip chain transactions. Employing the modified Floyd APSP algorithm, the shortest time distance between each pair of bus stops has been accounted. The graph-theoretic nodal accessibility has been given by the sum of the inverse time distance to all other nodes on the network. The results and spatial patterns are analyzed. This study is the first attempt to measure the time-distance accessibility for such a large transport network as the Seoul bus system consists of 34,934 bus stops on the 600 bus routes, and each bus route can have different properties in terms of speed limit, number of lanes, and traffic signal systems, and thus has great significance in the accessibility measurement studies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.352-354
• /
• 2022

Position measurement using a camera has been studied for a long time. This is being studied for distance recognition or object recognition in autonomous vehicles, and it is being studied in the field of indoor navigation, which is a limited space where GPS is difficult to apply. In general, in a method of measuring the distance using a camera, the distance is measured using a distance between the cameras using two stereo cameras and a value measured through a captured image or photo. In this paper, we propose a method of measuring the distance of an object using a single camera. The proposed method measures the distance by using the distance between cameras, such as a stereo camera, and the value measured by the photographed picture through the gap of the photographing time and the distance between photographing.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1333-1343
• /
• 1999

경성 실시간 시스템의 태스크들은 논리적으로 올바른 결과를 산출해야 하지만 또한 각자의 시간 제한 조건을 만족하여야 한다. 간격제한 스케줄링은 시간 제한 조건이 시간 간격 제한으로 주어지는 실시간 태스크들을 스케줄하기 위하여 도입되었다. 간격제한 스케줄링에서의 각 태스크들은 시간 간격 제한 조건을 갖는데, 이것은 태스크의 두 연속적인 수행의 종료시간에 대해 제한을 가한다. 다시 말해, 간격제한 스케줄링에서의 각 태스크 수행은 그 태스크의 직전 수행 완료 시간으로부터 발생하는 데드라인을 갖는다. 간격제한 태스크 스케줄링에 관한 많은 연구는 단순화 방법에 기초하고 있다. 그러나, 우리는 이 논문에서 단순화 방법을 사용하지 않고, 정적 우선순위 및 정적 분리 제한 정책을 채용한 새로운 간격제한 태스크 스케줄링 방법을 제안한다. 제안된 정적 할당 방법은 스케줄링 분석 및 구현을 매우 간단히 할 수 있으며, 또한 스케줄러의 실행시간 오버헤드를 줄일 수 있다.Abstract Tasks in hard real-time systems must not only be logically correct but also meet their timing constraints. The distance-constrained scheduling has been introduced to schedule real-time tasks whose timing constraints are characterized by temporal distance constraints. Each task in the distance-constrained scheduling has a temporal distance constraint which imposes restriction on the finishing times of two consecutive executions of the task. Thus, each execution of a task in the distance-constrained scheduling has a deadline relative to the finishing time of the previous execution of the task.Much work on the distance-constrained task scheduling has been based on the reduction technique. In this paper, we propose a new scheme for the distance-constrained task scheduling which does not use the reduction technique but adopts static priority and static separation constraint assignment policy. We show that our static assignment approach can simplify the scheduling analysis and its implementation, and can also reduce the run-time overhead of the scheduler.

• Current Optics and Photonics
• /
• v.3 no.3
• /
• pp.210-214
• /
• 2019

The allowable path-deviation time of aircraft in a free-space optical communication system has been estimated from various trajectories, using different values of aircraft speeds and turn rates. We assumed the existence of a link between the aircraft and a ground base station. First, the transmitter beam's divergence angle was calculated through two different approaches, one based on a simple optical-link equation, and the other based on an attenuation coefficient. From the calculations, the discrepancy between the two approaches was negligible when the link distance was approximately 110 km, and was under 5% when the link distance ranged from 80 to 140 km. Subsequently, the allowable path-deviation time of the aircraft within the tracking-error tolerance of the system was estimated, using different aircraft speeds, turn rates, and link distances. The results indicated that the allowable path-deviation time was primarily determined by the aircraft's speed and turn rate. For example, the allowable path-deviation time was estimated to be ~3.5 s for an aircraft speed of 166.68 km/h, a turn rate of $90^{\circ}/min$, and a link distance of 100 km. Furthermore, for a constant aircraft speed and turn rate, the path-deviation time was observed to be almost unchanged when the link distance ranged from 80 to 140 km.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.943-957
• /
• 2014

Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.455-461
• /
• 2004

Now, GPS survey is used on equipment from leisure to precise geodetic survey and nation admits the result of GPS survey. When surveyors perform precise GPS survey, they use post processing method but they greatly use real time processing method to consider field status. Especially, when surveyors measure the result of moving target, they use real time GPS survey to the best method. For this study, the author precisely surveyed distance of ship launching from shipyard on real time using real time precise GPS method. In this paper, the author compares and examines the accuracy of first real time precise GPS survey method nationally and the capability on use. And the author performed real time precise GPS survey in NOKBONG and 21C shipyard positioning at GEOJEDO.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.23-29
• /
• 2004

In this paper, we propose a search method for time sequences which supports the normalized distance as a similarity measure. In many applications where the shape of the time sequence is a major consideration, the normalized distance is a more suitable similarity measure than the simple Lp distance. To support normalized distance queries, most of the previous work has the preprocessing step for vertical shifting which normalizes each sequence by its mean. The proposed method is motivated by the property of sequence for feature extraction. That is, the variation between two adjacent elements of a time sequence is invariant under vertical shifting. The extracted feature is indexed by the spatial access method such as R-tree. The proposed method can match time series of similar shape without vertical shifting and guarantees no false dismissals. The experiments are performed on real data(stock price movement) to verify the performance of the proposed method.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.6
• /
• pp.378-386
• /
• 2017

Accurate distance measurement between maneuver target in underwater and measuring devices is required to perform quantitative test evaluation in marine weapons system R&D process. In general, the target distance is measured using a one-way ToA (Time of Arrival) method that calculates the time difference between transmitted and received signals from the two accurately synchronized devices. However, the distance estimation performance is degraded because of the multi-path environments. In this paper, the time-variant transfer function of complex underwater environment is estimated from each received data frame using RBD (Ray-based Blind Deconvolution), and the estimated time-variant transfer function is then used to get rid of the effect about complex underwater environment and to recover the data signal using PTRM (Passive Time Reversal Mirror). The result from the simulation and experimental data show that the suggested method improve the distance estimation performance when comparing with the conventional ToA method.