• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.40-50
• /
• 2007

In this paper, we propose an efficient method for detecting and tracking multiple moving objects based on morphological region merging from real-time video sequences. The proposed approach consists of adaptive threshold extraction, morphological region merging and detecting and tracking of objects. Firstly, input frame is separated into moving regions and static regions using the difference of images between two consecutive frames. Secondly, objects are segmented with a reference background image and adaptive threshold values, then, the segmentation result is refined by morphological region merge algorithm. Lastly, each object segmented in a previous step is assigned a consistent identification over time, based on its spatio-temporal information. The experimental results show that a proposed method is efficient and useful in terms of real-time multiple objects detecting and tracking.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.132-140
• /
• 2003

In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.292-305
• /
• 2009

Wireless sensor networks have a lot of application areas such as industrial process control, machine and resource management, environment and habitat monitoring. One of the main objects of using wireless sensor networks in these areas is the event detection. To detect events at a user's request, we need a join processing between sensor data and the predicates of the events. If there are too many predicates of events compared with a node's capacity, it is impossible to store them in a node and to do an in-network join with the generated sensor data This paper proposes a predicate-merge based in-network join approach to efficiently detect multiple events, considering the limited capacity of a sensor node and many predicates of events. It reduces the number of the original predicates of events by substituting some pairs of original predicates with some merged predicates. We create an estimation model of a message transmission cost and apply it to the selection algorithm of targets for merged predicates. The experiments validate the cost estimation model and show the superior performance of the proposed approach compared with the existing approaches.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.349-352
• /
• 2006

To cope with traffic congestion, traffic accidents and lack of parking facilities, caused by dramatic increase in total vehicle number, vigorous researches on managing vehicles efficiently are done, both domestically and internationally. The vehicle license plate recognition makes effective management of traffic possible, with its wide application in many fields, covering from speed enforcement, collecting toll, stolen vehicle detection to parking management. The vehicle license plate recognition system causes high cost for collecting training data. Many researches are done by using the virtual sample method, which can be effective for utilizing limited number of training data by generating virtual sample. This paper investigates techniques to improve the performance of vehicle license plate recognition by using the training data's annexation. Also, popular methods for virtual sample creation used for text recognition algorithm are analyzed and their effectiveness is verified.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.289-298
• /
• 2009

Active Contour Model, that is, Snake algorithm is effective for detection and tracking the objects. However, this algorithm has some drawbacks; numerous parameters must be designed(weighting factors, iteration steps, etc.), a reasonable initialization must be available and moreover suffers from numerical instability. Therefore we propose a novel Energy Corrected Snake(ECS) algorithm which improved on external energy of Snake algorithm for detection and tracking the moving object more effectively. The proposed algorithm uses the difference image, getting when the object is moving. It copies four direction images from the difference image and performs the accumulating compute to erasing image noise, so that it gets external energy steadily. Then external energy united with contour that is computed by internal energy. Consequently we can detect and track the moving object more speedily and easily. To show the effectiveness of the proposed algorithm, we experiment on 3 situations. The experimental results showed that the proposed algorithm outperformed by 6$\sim$9% of detection rate and 6$\sim$11% of tracker detection rate compared with the Snake algorithm.

• Journal of Advanced Navigation Technology
• /
• v.19 no.2
• /
• pp.116-122
• /
• 2015

Motivated by continuous increase in flight demand, awareness of the importance in developing ways to increase aircraft operational efficiency on the airport movement area has been raised. This paper proposes a new routing algorithm for providing the shortest path in a right time, enhancing the aircraft movement efficiency. Many researches on developing algorithms have been performed, for example, Dijkstra algorithm and $A^*$ algorithm. The Dijkstra algorithm provide optimal solution but could possibly provide it with a cost of relatively longer computation time. On the other hand, $A^*$ algorithm does not guarantee the optimality of a solution. In this paper, we suggest a Hybrid $A^*$ algorithm, incorporating both algorithms to eliminate the weaknesses. Rigorous test shows the proposed Hybrid $A^*$ algorithm may achieve shorter computing time and optimality in searching the shortest path.

• The KIPS Transactions:PartD
• /
• v.18D no.6
• /
• pp.415-422
• /
• 2011

Finding similar strings is an important operation because textual data can have errors, duplications, and inconsistencies by nature. Many algorithms have been developed for string approximate searches and most of them make use of inverted lists to find similar strings. These algorithms basically perform merge operations on inverted lists. In this paper, we develop a bitmap representation of an inverted list and propose an efficient search algorithm that can skip unnecessary inverted lists without searching using bitmap filters. Experimental results show that the proposed technique consistently improve the performance of the search.

• The Bulletin of The Korean Astronomical Society
• /
• v.36 no.2
• /
• pp.67.2-67.2
• /
• 2011

은하단에 속한 은하들의 광도함수에 의하면, 어두운 은하들(MB>-18,확인요망)의 수가 이 론적 예측에 비해 현저하게 적게 관측된다. 우리는 이와 같은 "어두운 은하들의 결핍 현상"을 설명하기위해 은하단 간의 충돌/병합과 같은 역학적 기원론을 제시하고자 한다. 본 연구는 은하단 간의 충돌/병합 과정에서 비교적 작은 질량의 은하들이 은하단의 중력적 구속에서 벗어날 가능성이 높다는 점에 착안하였다. 이러한 가능성을 검증하기 위해 (ㄱ) 우주론적 다. 체수치모사의 방법을 활용하고, (ㄴ) 유체수치모사에서 도입하여 발전시킨 "어떤 주어진 입자로부터 N번째 떨어진 입자의 거리 분석(N-th Particle)"이라는 새로운 방법으로 다체입자들의 공간분포 해석을 시도하였다. 이러한 방대한 자료를 효과적으로 분석하기 위해, GPU(Graphic Processing Unit)를 기반으로 설계된 분석 알고리즘을 독자 개발하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3469-3476
• /
• 1999

In spatial database based on spatial data structures, instead of one-dimensional indexing structure, new indexing structure which corresponds to multi-dimensional features of spatial objects is required. In order to meet those requirements, in this paper we proposed new indexing structure for efficient retrieval of spatial database by carrying through the feature analysis of conventional multi-dimensional indexing structures. To improve the sequential search method of supernodes in the conventional X-tree and to reduce the retrieval time in case of generating the huge supernode, we proposed a indexing structure integrating the kd-tree based on point index structure into the X-tree. We implemented the proposed indexing structure and analyzed its retrieval time according to the dimension and distribution of experimental data.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.350-350
• /
• 2021

한국건설기술연구원의 돌발홍수연구센터는 돌발홍수예측 시스템을 구축하여 2019년부터 전국에서의 돌발홍수정보를 제공하고 있다. 2019년에는 초단기 예측 모델인 Macgill Algorithm for Precipitation-nowcast by Lagrangian Extrapolation(MAPLE) 알고리즘으로부터 생산된 초단기 예측 강우를 활용하여 동(읍/면) 단위로 1시간 선행 예보를 제공하였다. 2020년에는 추가로 초단기 예측 강우와 수치예보 자료를 병합한 예측 병합 강우 자료를 생산하여 예측 선행시간을 1시간에서 3시간까지 확장하였다. 돌발홍수예측 시스템의 목표는 도시 및 산지소하천에서의 돌발홍수에 대응하기 위한 정보를 실시간으로 사용자에게 제공하여 수재해에 빠르게 대응하는 것이다. 이에 돌발홍수예측 시스템은 2019년부터 실시간으로 운영하여 홍수기에 보다 빠른 돌발홍수정보를 제공해왔다. 본 연구에서는 2020년 우기에 운영된 돌발홍수시스템에 대한 평가를 수행하였다. 이를 위해 부산(07.23), 대전(07.29), 서울(08.01), 경기-충북(08.02)에서 발생한 수재해 사례를 분석하였다.