• Journal of Korea Society of Industrial Information Systems
• /
• v.3 no.1
• /
• pp.258-268
• /
• 1998

This paper presents two sequential advanced split and merge algorithms and a parallel image segmentation algorithm based on them. First, the two advanced methods are obtained from the combination of edge detection and classic split and merge to solve the inherent problems of the classical method. Besides, the parallel image segmentation algorithm on mesh-connected MIMD system considers three types in the merge stage to reduce the communication overhead between processors, such as intraprocessor merge, interprocessor with boundary merge, and interprocessor without boundary merge. Finally , we prove that the proposed algorithms achieve the improved performance by implementing them.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.11-28
• /
• 2016

In this paper, we proposed a dictionary extension and a ternary decomposition technique to improve the effectiveness of Khmer word segmentation. Most word segmentation approaches depend on a dictionary. However, the dictionary being used is not fully reliable and cannot cover all the words of the Khmer language. This causes an issue of unknown words or out-of-vocabulary words. Our approach is to extend the original dictionary to be more reliable with new words. In addition, we use ternary decomposition for the segmentation process. In this research, we also introduced the invisible space of the Khmer Unicode (char\u200B) in order to segment our training corpus. With our segmentation algorithm, based on ternary decomposition and invisible space, we can extract new words from our training text and then input the new words into the dictionary. We used an extended wordlist and a segmentation algorithm regardless of the invisible space to test an unannotated text. Our results remarkably outperformed other approaches. We have achieved 88.8%, 91.8% and 90.6% rates of precision, recall and F-measurement.

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

A new video segmentation algorithm for segmentation-based video coding is proposed. The method uses a new criterion based on similarities in both motion and brightness. Brightness and motion information are incorporated in a single segmentation procedure. The actual segmentation is accomplished using a region-growing technique based on the watershed algorithm. In addition, a tracking technique is used in subsequent frames to achieve a coherent segmentation through time. Simulation results show that the proposed method is effective in determining object boundaries not easily found using the statistic criterion alone.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.273-275
• /
• 2022

Deep Learning is used nowadays in Nuclei segmentation. While recent developments in theory and open-source software have made these tools easier to implement, expert knowledge is still required to choose the exemplary model architecture and training setup. We compare two popular segmentation frameworks, U-Net and Mask-RCNN, in the nuclei segmentation task and find that they have different strengths and failures. we compared both models aiming for the best nuclei segmentation performance. Experimental Results of Nuclei Medical Images Segmentation using U-NET algorithm Outperform Mask R-CNN Algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.10
• /
• pp.707-716
• /
• 2017

The advances in image display devices necessitate display images suitable for the user's purpose. The display devices should be able to provide object-based image information when a depthmap is required. In this paper, we represent the algorithm using a histogram-based image segmentation method for depthmap generation. In the conventional K-means clustering algorithm, the number of centroids is parameterized, so existing K-means algorithms cannot adaptively determine the number of clusters. Further, the problem of K-means algorithm tends to sink into the local minima, which causes over-segmentation. On the other hand, the proposed algorithm is adaptively able to select centroids and can stand on the basis of the histogram-based algorithm considering the amount of computational complexity. It is designed to show object-based results by preventing the existing algorithm from falling into the local minimum point. Finally, we remove the over-segmentation components through connected-component labeling algorithm. The results of proposed algorithm show object-based results and better segmentation results of 0.017 and 0.051, compared to the benchmark method in terms of Probabilistic Rand Index(PRI) and Segmentation Covering(SC), respectively.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.46-54
• /
• 2003

In this paper, we propose segmentation algorithm for MR brain images using the histogram of T1-weighted, T2-weighted and PD images. Segmentation algorithm is composed of 3 steps. The first step involves the extraction of cerebrum images by ram a cerebrum mask over three input images. In the second step, peak ranges are determined from the histogram of the cerebrum image. In the final step, cerebrum images are segmented using coarse to fine clustering technique. We compare the segmentation result and processing time according to peak ranges. Also compare with the other segmentation methods. The proposed algorithm achieved better segmentation results than the other methods.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.23 no.6
• /
• pp.565-574
• /
• 2015

Recently, a medium-level representation named "Stixel" has been extensively researched in stereo vision-based environmental perception. Obstacle detection using Stixel representation consists of three steps: static Stixel generation, dynamic Stixel generation, and Stixel segmentation. This paper focuses on the Stixel segmentation step and has two contributions. One is that it shows that Stixel segmentation performance can be enhanced by utilizing both image domain and real world domain features. The other is that it suggests that parameters used for Stixel segmentation can be effectively tuned based on genetic algorithm. The proposed method was quantitatively evaluated and the result showed that the proposed method increased Stixel segmentation accuracy compared with the previous method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1195-1209
• /
• 1997

This paper presents a new morphological spatio-temporal segmentation algorithm. The algorithm incorporates luminance and motion information simultaneously, and uses morphological tools such as morphological filtersand watershed algorithm. The procedure toward complete segmentation consists of three steps:joint marker extraction, boundary decision, and motion-based region fusion. First, the joint marker extraction identifies the presence of homogeneours regions in both motion and luminance, where a simple joint marker extraction technique is proposed. Second, the spatio-temporal boundaries are decided by the watershed algorithm. For this purposek, a new joint similarity measure is proposed. Finally, an elimination ofredundant regions is done using motion-based region function. By incorporating spatial and temporal information simultaneously, we can obtain visually meaningful segmentation results. Simulation results demonstratesthe efficiency of the proposed method.

• Speech Sciences
• /
• v.9 no.4
• /
• pp.265-274
• /
• 2002

In this paper we propose an automatic segmentation system that outputs the time alignment information of phoneme boundary using Viterbi search with HMM (Hidden Markov Model) and corrects these results by an UVS (unvoiced/voiced/silence) classification algorithm. We selecte a set of 39 monophones and a set of 647 extended phones for HMM models. For the UVS classification we use the feature parameters such as ZCR (Zero Crossing Rate), log energy, spectral distribution. The result of forced alignment using the extended phone set is 11% better than that of the monophone set. The UVS classification algorithm shows high performance to correct the segmentation results.

• The Korean Journal of Applied Statistics
• /
• v.16 no.2
• /
• pp.305-319
• /
• 2003

This paper provides a non-Bayesian method based on the expanded EM algorithm for segmenting the magnetic resonance images degraded by bias field. For the images with the intensity as a pixel value, many segmentation methods often fail to segment it because of the bias field(with low frequency) as well as noise(with high frequency). Our contextual approach is appropriately designed by using normal mixture model incorporated with Markov random field for noise-corrective segmentation and by using the penalized likelihood to estimate bias field for efficient bias filed-correction.