• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.2
• /
• pp.156-164
• /
• 2019

In this paper, we propose an efficient dynamic slot re-assignment scheme for swarming drone networks in which networks members merged and split frequently. The leader drone of each network recognizes the slot allocation information of neighbor networks by periodic information exchange among between the drones. Using the information, the leader drone makes a decision how to reallocate the slots between members in case of network merge. The non-competitive method in the proposed scheme can re-assign the slots without any slot collision and shows always superior performance than competitive scheme. The competitive method in the proposed scheme reduces the number of slots that should be re-assigned in case of network merge. The experimental performance analysis shows that the proposed scheme performs better or at least equal to the performance of the competitive scheme in a swarming drone network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.424-426
• /
• 2001

신문, 잡지, 공문서, 영수증 등의 문서로부터 필요한 정보를 자동화하여 처리할 수 있는 문서영상 이해 시스템의 구현에 있어서 문서영상에 존재하는 문자를 추출하는 연구는 문자 인식의 전처리 단계로서 매우 중요한 의미를 지니고 있다. 하지만 현 시점에서 문서 자체가 가지는 다양한 형태 및 배경 등에 의하여 범용화되고 일반화된 방법을 찾기란 매우 어려운 실정이다. 본 논문에서는 특히 배경이 선이나 도표 등으로 이루어진 문서 영상에서 Hough Transform을 사용하여 기울어짐을 보정하고 문자들이 선에 겹친 부분을 효과적으로 보정하며 추출된 영역에 대한 분할 및 합병 과정을 거쳐 최종적으로 완전한 문자 영역을 추출하는 방법에 대하여 다룬다.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.925-927
• /
• 1995

The purpose of extaction of edges of buildings is an extraction of 3-dimensional imformation. The performance of an exact extraction of edges of buildings using several classic algorithms was not so good. In this study we merged several exposed algorithms-----split-and-merge, anisotropic diffusion, modified canny operation, least mean sqare. Results of this extraction algorithm show better performance than any other detection algorithms of edges of buildings.

• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.632-641
• /
• 2000

Conventional character extraction methods extract character regions using methods such as color reduction, region split and merge and texture analysis from the whole image. Because these methods use many heuristic variables and thresholding values derived from a priori knowledge, it is difficult to generalize them algorithmically. In this paper, we propose a method that can extract character regions using a topographical feature extraction method and a point-line-region extension method. The proposed method can also solve the problems of conventional methods by reducing heuristic variables and generalizing thresholding values. We see that character regions can be extracted by generalized variables and thresolding values without using a priori knowledge of character region. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is over 98%.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.488-498
• /
• 2007

This paper presents a novel approach for representing the spatio-temporal topology of the camera network with overlapping and non-overlapping fields of view (FOVs) in Ubiquitous Smart Space (USS). The topology is determined by tracking moving objects and establishing object correspondence across multiple cameras. To track people successfully in multiple camera views, we used the Merge-Split (MS) approach for object occlusion in a single camera and the grid-based approach for extracting the accurate object feature. In addition, we considered the appearance of people and the transition time between entry and exit zones for tracking objects across blind regions of multiple cameras with non-overlapping FOVs. The main contribution of this paper is to estimate transition times between various entry and exit zones, and to graphically represent the camera topology as an undirected weighted graph using the transition probabilities.

• Journal of Advanced Navigation Technology
• /
• v.21 no.1
• /
• pp.119-125
• /
• 2017

In this paper, we propose a method that merges and splits players in the MeanShift tracking framework. The MeanShift tracking moves the center of tracking window to the maximum probability location given the target probability distribution. This tracking method has been widely used for real-time tracking problems because of its fast processing speed. However, it hardly handles occlusions in multiple object tracking systems. Occlusions can be usually solved by applying data association methods. In this paper, we propose a method that can be applied before data association methods. The proposed method automatically merges and splits the overlapped players by adjusting the each player's tracking map. We have compared the tracking performance of the MeanSfhit tracking algorithm and the proposed method.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.55-65
• /
• 2005

This paper presents a bulk insertion technique for efficiently inserting data items. Traditional moving object database focused on efficient query processing that happens mainly after index building. Traditional index structures rarely considered disk I/O overhead for index rebuilding by inserting data items. This paper, to solve this problem, describes a new bulk insertion technique which efficiently induces the current positions of moving objects and reduces update cost greatly. This technique uses buffering technique for bulk insertion in spatial index structures such as R-tree. To analyze split or merge node, we add a secondary index for information management on leaf node of primary index. And operations are classified to reduce unnecessary insertion and deletion. This technique decides processing order of moving objects, which minimize split and merge cost as a result of update operations. Experimental results show that this technique reduces insertion cost as compared with existing insertion techniques.

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

This study considers the implementation issues of the inter-vehicle communication system for the vehicle platoon experiments via a testbed. The testbed, which consists of three scale vehicles and one RCS(remote control station), is developed as a tool for functions evaluation between simulation studies and full-sized vehicle researches in the previous study. The cooperative communication of the vehicle-to-vehicle or the vehicle-to-roadside plays a key role for keeping the relative spacing of vehicles small in a vehicle platoon. The static platoon control, where the number of vehicles remains constant, is sufficient for the information to be transmitted in the suitably fixed interval, while the dynamic platoon control such as merge or split requires more flexible network architecture for the dynamical coordination of the communication sequence. In this study, the wireless communication device and the reliable protocol of the flexible network architecture are implemented for our testbed, using the low-cost, ISM band transceiver and the 8-bit microcontroller.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3E
• /
• pp.118-135
• /
• 2009

The level set based approach is one of active methods for contour extraction in image segmentation. Since Osher and Sethian introduced the level set framework in 1988, the method has made the great impact on image segmentation. However, there are some problems to be solved; such as multi-objects segmentation, noise filtering and much calculation amount. In this paper we address the drawbacks of the previous level set methods and propose an extension of the traditional fast level set to cope with the limitations. We introduce a relationship matrix, a new split-and-merge criterion, a modified Chan-Vese criterion and a novel filtering criterion into the traditional fast level set approach. With the segmentation experiments we evaluate the proposed method and show the promising results of the proposed method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.420-423
• /
• 1999

In this paper, we propose the method which efficiently obtain information through edit and retrieval of video data easily and rapidly. To support this method, extract the candidate representative frame using existing scene change detection method and the user selects representative frame for video segmentation at his desire, and then visualization indexing methods supported by logical-links enable users to freely merge and split each scene.