• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.51 no.1
• /
• pp.39-44
• /
• 2002

In this paper, implementation mode image segmentation method for separate image is presented. The method of segmentation image in conventional method, the error are generated by the threshold values. To improve these problem for segmentation image, the calculation of weighting factor using brightness distribution by histogram of stored images are proposed. For safe image of object and laser image, the computed weighting factor is set to the threshold value. Therefore the image erosion and spread are improved, the correct and reliable informations can be measured. In this paper, the system of 3-D extracting information using the proposed algorithm can be applied to manufactory automation, building automation, security guard system, and detecting information system for all of the industry areas.

• Korean Journal of Remote Sensing
• /
• v.26 no.6
• /
• pp.731-740
• /
• 2010

A region merging technique is suggested in this paper for the segmentation of high-spatial resolution imagery. It employs a region growing scheme based on the region adjacency graph (RAG). The proposed algorithm uses directional neighbor-line average feature vectors to improve the quality of segmentation. The feature vector consists of 9 components which includes an observation and 8 directional averages. Each directional average is the average of the pixel values along the neighbor line for a given neighbor line length at each direction. The merging coefficients of the segmentation process use a part of the feature components according to a given merging coefficient order. This study performed the extensive experiments using simulation data and a real high-spatial resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for the object-based analysis of high-spatial resolution images.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.7-21
• /
• 2019

In order to improve the edge segmentation effect of the level set image segmentation and avoid the influence of the initial contour on the level set method, a saliency level set image segmentation model based on local Renyi entropy is proposed. Firstly, the saliency map of the original image is extracted by using saliency detection algorithm. And the outline of the saliency map can be used to initialize the level set. Secondly, the local energy and edge energy of the image are obtained by using local Renyi entropy and Canny operator respectively. At the same time, new adaptive weight coefficient and boundary indication function are constructed. Finally, the local binary fitting energy model (LBF) as an external energy term is introduced. In this paper, the contrast experiments are implemented in different image database. The robustness of the proposed model for segmentation of images with intensity inhomogeneity and complicated edges is verified.

• International Journal of Computer Science & Network Security
• /
• v.22 no.8
• /
• pp.343-351
• /
• 2022

A brain tumor forms when some tissue becomes old or damaged but does not die when it must, preventing new tissue from being born. Manually finding such masses in the brain by analyzing MRI images is challenging and time-consuming for experts. In this study, our main objective is to detect the brain's tumorous part, allowing rapid diagnosis to treat the primary disease instantly. With image processing techniques and deep learning prediction algorithms, our research makes a system capable of finding a tumor in MRI images of a brain automatically and accurately. Our tumor segmentation adopts the U-Net deep learning segmentation on the standard MICCAI BRATS 2018 dataset, which has MRI images with different modalities. The proposed approach was evaluated and achieved Dice Coefficients of 0.9795, 0.9855, 0.9793, and 0.9950 across several test datasets. These results show that the proposed system achieves excellent segmentation of tumors in MRIs using deep learning techniques such as the U-Net algorithm.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.324-333
• /
• 2001

In this paper we present a novel color image segmentation algorithm based on a Gaussian Mixture Model(GMM). It is introduced a Deterministic Annealing Expectation Maximization(DAEM) algorithm which is developed using the principle of maximum entropy to overcome the local maxima problem associated with the standard EM algorithm. In our approach, the GMM is used to represent the multi-colored objects statistically and its parameters are estimated by DAEM algorithm. We also develop the automatic determination method of the number of components in Gaussian mixtures models. The segmentation of image is based on the maximum posterior probability distribution which is calculated by using the GMM. The experimental results show that the proposed DAEM can estimate the parameters more accurately than the standard EM and the determination method of the number of mixture models is very efficient. When tested on two natural images, the proposed algorithm performs much better than the traditional algorithm in segmenting the image fields.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.931-934
• /
• 2013

The weight calculation in an iterative algorithm is the most computationally costly task in computed tomography image reconstruction. In this letter, a fast algorithm to speed up the weight calculation is proposed. The classic square pixel rotation approximate calculation method for computing the weights in the iterative algorithm is first analyzed and then improved by replacing the square pixel model with a circular pixel model and the square rotation approximation with a segmentation method of a circular area. Software simulation and hardware implementation results show that our proposed scheme can not only improve the definition of the reconstructed image but also accelerate the reconstruction.

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

This paper presents a method to segment wafer ID marks on poor quality images under uncontrolled lighting conditions of the semiconductor process. The active multiple templates matching method is suggested to search ID areas on wafers and segment them into meaningful regions and it would have been impossible to recognize characters using general OCR algorithms. This active template model is designed by applying a snake model that is used for active contour tracking. Active multiple template model searches character areas and segments them into single characters optimally, tracking each character that can vary in a flexible manner according to string configurations. Applying active multiple templates, the optimization of the snake energy is done using Greedy algorithm, to maximize its efficiency by automatically controlling each template gap. These vary according to the configuration of character string. Experimental results using wafer images from real FA environment are presented.

• Journal of Korea Multimedia Society
• /
• v.23 no.7
• /
• pp.883-890
• /
• 2020

In this paper, we propose a variational expectation-maximization algorithm that computes posterior probabilities from Latent Dirichlet Allocation (LDA) model. The algorithm approximates the intractable posterior distribution of a document term matrix generated from a corpus made up by 50 papers. It approximates the posterior by searching the local optima using lower bound of the true posterior distribution. Moreover, it maximizes the lower bound of the log-likelihood of the true posterior by minimizing the relative entropy of the prior and the posterior distribution known as KL-Divergence. The experimental results indicate that documents clustered to image classification and segmentation are correlated at 0.79 while those clustered to object detection and image segmentation are highly correlated at 0.96. The proposed variational inference algorithm performs efficiently and faster than Gibbs sampling at a computational time of 0.029s.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.203-206
• /
• 2009

This paper represents an efficient algorithm to segment objects from the background using multiple images of distinct luminous intensities. The proposed algorithm obtains images with different luminous intensities using a camera flash. From the multiple intensities for a pixel, a saturated luminous intensity is estimated together with the slope of intensity rate. Then, we measure the sensitivities of pixels from their slopes. The sensitivities show different patterns according to the distances from the light source. Therefore, the proposed algorithm segments near objects using the sensitivity information by minimizing an energy function. Experimental results on various objects show that the proposed algorithm provides accurate results without any user interaction.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.29-33
• /
• 1998

In this paper, we propose a hierarchical segmentation method for tracking a semantic video object using a watershed algorithm based on morphological filtering. In the proposed method, each hierarchy consists of three steps: First, markers are extracted on the simplified current frame. Second, region growing by a modified watershed algorithm is performed for segmentation. Finally, the segmented regions are classified into 3 categories, i.e., inside, outside, and uncertain regions according to region probability values, which are acquired by the probability map calculated from a estimated motion field. Then, for the remaining uncertain regions, the above three steps are repeated at lower hierarchies with less simplified frames until every region is decided to a certain region. The proposed algorithm provides prospective results in video sequences such as Miss America, Clair, and Akiyo.