• 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 information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.487-490
• /
• 2011

This paper presents splitting and merging algorithm based on adaptive thresholding. The algorithm first divides the image into blocks, and then compares each block using the calculated thresholding value. The blocks which are same are merged using the certain threshold value and different blocks are split unless it satisfies the threshold value. When the block has been merged, maximum and minimum block sizes are determined then the average block size is determined. After the average block size is determined the average intensity and standard deviation of average block is calculated. The process of thresholding is applied to binarize the image. Finally, the experimental results show that the proposed method distinguishes clearly the background with text in the document image.

• International Journal of Aeronautical and Space Sciences
• /
• v.2 no.2
• /
• pp.39-45
• /
• 2001

To reduce the strength of tip vortex of the fixed wing, a horizontal wing-let splitted into two parts was utilized, and the interaction between vortices generated by these wing-lets was investigated by the hot-wire anemometry. The process of vortex forming and merging was clarified by measurements of velocity vectors and their contours at five downstream cross-sections; 0.05C(chord length), 0.2C, 0.5C, 1.0C and 2.0C. Both vortex-lets formed by each wing-lets rotate counterclockwise and merge into a larger single vortex within a short downstream distance, 0.5C in this case. The strength of the merged tip vortex turned out to become smaller than that of the plain wing tip near the vortex core.

• 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 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 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.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.2
• /
• pp.175-185
• /
• 2012

Predictive watershed transform is a popular object segmentation algorithm which achieves a speed-up by identifying image regions that are different from the previous frame and performing object segmentation only for those regions. However, incorrect segmentation is often generated by the predictive watershed transform which uses only local information in merge-split decision on boundary regions. This paper improves the predictive watershed transform to increase the accuracy of segmentation results by using the additional information about the root of boundary regions. Furthermore, the proposed algorithm is processed in a block-based manner such that an image frame is decomposed into blocks and each block is processed independently of the other blocks. The block-based approach makes it easy to implement the algorithm in hardware and also permits an extension for parallel execution. Experimental results show that the proposed watershed transform produces more accurate segmentation results than the predictive watershed transform.

• 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.