• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.286-295
• /
• 2000

We present a novel statistically adaptive method using the Minimum Description Length(MDL) principle for unsupervised segmentation of magnetic resonance(MR) images. In the method, Markov random filed(MRF) modeling of tissue region accounts for random noise. Intensity measurements on the local region defined by a window are modeled by a finite Gaussian mixture, which accounts for image inhomogeneities. The segmentation algorithm is based on an iterative conditional modes(ICM) algorithm, approximately finds maximum ${\alpha}$ posteriori(MAP) estimation, and estimates model parameters on the local region. The size of the window for parameter estimation and segmentation is estimated from the image using the MDL principle. In the experiments, the technique well reflected image characteristic of the local region and showed better results than conventional methods in segmentation of MR images with inhomogeneities, especially.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.225-230
• /
• 2011

In this paper, we propose the segmentation method for detecting the facial region by using watershed based on depth information and merge algorithm. The method consists of three steps: watershed segmentation, seed region detection, and merge. The input color image is segmented into the small uniform regions by watershed. The facial region can be detected by merging the uniform regions with chromaticity and edge constraints. The problem in the existing method using only chromaticity or edge can solved by the proposed method. The computer simulation is performed to evaluate the performance of the proposed method. The simulation results shows that the proposed method is superior to segmentation facial region.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.221-230
• /
• 2002

This paper presents a new moving object segmentation algorithm using markov random field. The algorithm is based on signal detection theory. That is to say, motion of moving object is decided by binary decision rule, and false decision is corrected by markov random field model. The procedure toward complete segmentation consists of two steps: motion detection and object segmentation. First, motion detection decides the presence of motion on velocity vector by binary decision rule. And velocity vector is generated by optical flow. Second, object segmentation cancels noise by Bayes rule. Experimental results demonstrate the efficiency of the presented method.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.421-437
• /
• 2015

This paper aims to present a supervised classification algorithm based on data fusion for the segmentation of the textured images. The feature extraction method we used is based on discrete wavelet transform (DWT). In the segmentation stage, the estimated feature vector of each pixel is sent to the support vector machine (SVM) classifier for initial labeling. To obtain a more accurate segmentation result, two strategies based on information fusion were used. We first integrated decision-level fusion strategies by combining decisions made by the SVM classifier within a sliding window. In the second strategy, the fuzzy set theory and rules based on probability theory were used to combine the scores obtained by SVM over a sliding window. Finally, the performance of the proposed segmentation algorithm was demonstrated on a variety of synthetic and real images and showed that the proposed data fusion method improved the classification accuracy compared to applying a SVM classifier. The results revealed that the overall accuracies of SVM classification of textured images is 88%, while our fusion methodology obtained an accuracy of up to 96%, depending on the size of the data base.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1426-1436
• /
• 2014

In this article, we present a new grey scale image segmentation method based on Fuzzy logic and bitplane techniques which combines the bits of different bitplanes of a pixel inorder to increase the segmentation quality and to get a more reliable and accurate segmentation result. The proposed segmentation approach is conceptually different and explores a new strategy. Infact, our technique consists in combining many realizations of the image together inorder to increase the information quality and to get an optimal segmented image. For segmentation, we proceed in two steps. In the first step, we begin by identifying the bitplanes that represent the lungs clearly. For this purpose, the intensity value of a pixel is separated into bitplanes. In the second step, segmentation values are assigned for each bitplane based on membership table. The segmented values of foreground are combined and the segmentation values of background are combined. The algorithm is demonstrated through the medical computed tomography (CT) images. The segmentation accuracy of the proposed method is compared with two existing techniques. Satisfactory segmentation results have been obtained showing the effectiveness and superiority of the proposed method.

• Computers and Concrete
• /
• v.21 no.6
• /
• pp.727-739
• /
• 2018

Crack is the most common typical feature of concrete deterioration, so routine monitoring and health assessment become essential for identifying failures and to set up an appropriate rehabilitation strategy in order to extend the service life of concrete structures. At present, image segmentation algorithms have been applied to crack analysis based on inspection images of concrete structures. The results of crack segmentation offering crack information, including length, width, and area is helpful to assist inspectors in surface inspection of concrete structures. This study proposed an algorithm of image segmentation enhancement, named morphological segmentation based on edge detection-II (MSED-II), to concrete crack segmentation. Several concrete pavement and building surfaces were imaged as the study materials. In addition, morphological operations followed by cross-curvature evaluation (CCE), an image segmentation technique of linear patterns, were also tested to evaluate their performance in concrete crack segmentation. The result indicates that MSED-II compared to CCE can lead to better quality of concrete crack segmentation. The least area, length, and width measurement errors of the concrete cracks are 5.68%, 0.23%, and 0.00%, respectively, that proves MSED-II effective for automatic measurement of concrete cracks.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.99-111
• /
• 2009

The result of Image segmentation, an indispensable process in image processing, significantly affects the analysis of an image. Despite the significance of image segmentation, it produces some problems when the variation of pixel values is large, or the boundary between background and an object is not clear. Also, these problems occur frequently when many objects in an image are placed very close by. In this paper, when the shape of objects in an image is circular, we proposed an algorithm which segment an each object in an image using the geometric characteristic of circular shape. The proposed algorithm is composed of 4 steps. First is the boundary edge extraction of whole object. Second step is to find the candidate points for further segmentation using the boundary edge in the first step. Calculating the representative circles using the candidate points is the third step. Final step is to draw the line connecting the overlapped points produced by the several erosions and dilations of the representative circles. To verify the efficiency of the proposed algorithm, the algorithm is compared with the three well-known cell segmentation algorithms. Comparison is conducted by the number of segmented region and the correctness of the inner segment line. As the result, the proposed algorithm is better than the well-known algorithms in both the number of segmented region and the correctness of the inner segment line by 16.7% and 21.8%, respectively.

• Journal of Korea Multimedia Society
• /
• v.16 no.10
• /
• pp.1135-1146
• /
• 2013

In this paper, we proposed a new algorithm for individual tooth region segmentation on tooth color images. The proposed algorithm used oral cavity model based on structural feature of tooth and new boundary of watershed algorithm. First, the gray scale image is obtained with emphasized tooth regions from the color images and unnecessary regions are removed on tooth images. Next, the image enhancement of tooth images is implemented using the proposed oral cavity model, and the individual tooth regions are segmented by watershed algorithm on the enhanced images. Boundary and seeds necessary to watershed algorithm are applied boundary of binary image using minimum thresholding and region maximum value. In order to evaluate performance of proposed algorithm, we conduct experiment to compare conventional algorithm with proposed algorithm. As a result of experiment, we confirmed that the proposed algorithm is more improved detection ratio than conventional algorithm at molar regions and the tooth region detection performance is improved by preventing overlap detection on oral cavity.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1031-1043
• /
• 2013

Extracting hand region from images is the first part in the process to recognize hand posture and gesture interaction. Therefore, a good segmenting method is important because it determines the overall performance of hand recognition systems. Conventional hand segmentation researches were prone to changing illumination conditions or limited to the ability to detect multiple people. In this paper, we propose a robust technique based on the fusion of skin-color data and depth information for hand segmentation process. The proposed algorithm uses skin-color data to localize accurate seed location for region-growing from a complicated background. Based on the seed location, our algorithm adjusts each detected blob to fill up the hole region. A region-growing algorithm is applied to the adjusted blob boundary at the detected depth image to obtain a robust hand region against illumination effects. Also, the resulting hand region is used to train our skin-model adaptively which further reduces the effects of changing illumination. We conducted experiments to compare our results with conventional techniques which validates the robustness of the proposed algorithm and in addition we show our method works well even in a counter light condition.