• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.299-300
• /
• 2006

In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region merging algorithm based hierarchical queue. Only the process of watershed and region merging algorithm can be restricted area. A fast region merging approach is proposed to extract the video object from the regions of watershed segmentation. Results show the effectiveness and convenience of the approach.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.8
• /
• pp.907-913
• /
• 1999

For an automated transportation system like PRT(Personal Rapid Transit) system or IVHS, an efficient vehicle-merging algorithm is required for smooth operation of the network. For management of merging, collision avoidance between vehicles, ride comfort, and the effect on traffic should be considered. This paper proposes an unmanned vehicle-merging algorithm that consists of two procedures. First, a longitudinal control algorithm is designed to keep a safe headway between vehicles in a single lane. Secondly, 'vacant slot and ghost vehicle' concept is introduced and a decision algorithm is designed to determine the sequence of vehicles entering a converging section considering energy consumption, ride comfort, and total traffic flow. The sequencing algorithm is based on fuzzy rules and the membership functions are determined first by an intuitive method and then trained by a learning method using a neural network. The vehicle-merging algorithm is shown to be effective through simulations based on a PRT model.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.827-828
• /
• 2006

This paper presents a vehicle control algorithm for Personal Rapid Transit (PRT) system. PRT system is a one-way direction network system which is composed of guideway branches, merging/diverging points. Vehicle control algorithm can be divided into two kinds. Those are merging control algorithm and the other. We emphasized on the merging control algorithm. For that, we first devised a front/virtual front vehicle finding strategies. Properly determined front/virtual front vehicle is the starting point of vehicle control. The objects of merging control are to avoid collision and to pass the merging point fluently. Which implies that jerk constraint and limits of acceleration and deceleration etc. are should be considered. To verify the validation of the vehicle algorithm, we executed simulations and presented test results.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.53-56
• /
• 2007

Symmerge is a stable minimum storage algorithm for merging that needs $O(mlog\frac{n}{m})$ element comparisons, where m and n are the sizes of the input sequences with m ${\leqq}$ n. According to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The objective of this paper is to consider the relationship between m and n for the spanning case with the recursion level m-1.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.176-180
• /
• 2011

Even though algorithms for watermark embedding and extraction step are important issue for digital watermarking, watermark selection and post-processing can give us an opportunity to improve our algorithms and achieve higher performance. For this reason, we summarized the possibilities of improvements for digital watermarking by referring to the watermark merging techniques rather than embedding and extraction algorithms in this paper. We chose Cox's function as main embedding and extraction algorithm, and multiple barcode watermarks as a watermark. Each bit of the multiple copies of barcode watermark was embedded into a gray-scale image with Cox's embedding function. After extracting the numbers of watermark, we applied the watermark merging techniques; including the simple merging, N-step iterated merging, recover merging and combination of iterated-recover merging. Main consequence of our paper was the fact of finding out how multiple barcode watermarks and merging techniques can give us opportunities to improve the performance of algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1661-1667
• /
• 1999

In this paper, we propose an efficient VP extension algorithm for ABR multipoint-to-point connection in ATM networks. The VC merging or VP merging is used to implement ABR multipoint-to-point connection. We use the VP merging technique. To solve the scarcity problem of VP resources, we propose an efficient VP extension algorithm. Since the proposed scheme follows the standard VPI/VCI format, it doesn’t require another table according to the VP extension. We compare the proposed scheme with VC merging algorithm. The result shows that the proposed method can provide fair bandwidth allocation among the sources in multipoint-to-point connection.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.392-394
• /
• 2003

There is a well-known simple, stable standard merge algorithm, which uses only linear time but for the price of double space. This extra space consumption has been often remarked as lack of the standard merge sort algorithm that covers a merge process as central operation. In-place merging is a way to overcome this lack and so is a topic with a long tradition of inspection in the area of theoretical computer science. We present an in-place merging algorithm that rear-ranges the elements to be merged by rotation, a special form of block interchanging. Our algorithm is novel, due to its technique of determination of the rotation-areas. Further it has a short and transparent definition. We will give a presentation of our algorithm and prove that it needs in the worst case not more than twice as much comparisons as the standard merge algorithm. Experimental work has shown that our algorithm is efficient and so might be of high practical interest.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.59-62
• /
• 2002

Watershed Segmentation with Multiple Merging Conditions in Region Growing Process The watershed segmentation method holds the merits of edge-based and region-based methods together, but still shows some problems such as over segmentation and merging fault. We propose an algorithm which overcomes the problems of the watershed method and shows efficient performance for .general images, not for specific ones. The algorithm segments or merges regions by thresholding the depths of the catchment basins, the similarities and the sizes of the regions. The experimental results shows the reduction of the number of the segmented regions that are suitable to human visual system and consciousness.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.63-71
• /
• 2003

This paper describes a color image segmentation algorithm based on region merging using hue difference as a restrictive condition. The proposed algorithm using mathematical morphology and a modified watershed algorithm does over-segmentation in the RGB space to preserve contour information of regions. Then, the segmentation result of color image is acquired by repeated region merging using hue differences as a restrictive condition. This stems from human visual system based on hue, saturation, and intensity. Hue difference between two regions is used as a restrictive condition for region merging because it becomes more important factor than color difference if intensity is not low. Simulation results show that the proposed color image segmentation algorithm provides efficient segmentation results with the predefined number of regions for various color images.