• Journal of Biomedical Engineering Research
• /
• v.42 no.4
• /
• pp.159-166
• /
• 2021

In order to analyze cell images, accurate segmentation of each cell is indispensable. However, the reality is that accurate cell image segmentation is not easy due to various noises, dense cells, and inconsistent shape of cells. Therefore, in this paper, we propose an algorithm that combines marker-based watershed segmentation and ellipse fitting method for glioblastoma cell segmentation. In the proposed algorithm, in order to solve the over-segmentation problem of the existing watershed method, the marker-based watershed technique is primarily performed through "seeding using local minima". In addition, as a second process, the concave point search using ellipse fitting for final segmentation based on the connection line between the concave points has been performed. To evaluate the performance of the proposed algorithm, we compared three algorithms with other algorithms along with the calculation of segmentation accuracy, and we applied the algorithm to other cell image data to check the generalization and propose a solution.

• Journal of Biomedical Engineering Research
• /
• v.38 no.2
• /
• pp.82-88
• /
• 2017

Enlargement of the lateral ventricles have been identified as a surrogate marker of neurological disorders. Quantitative measure of the lateral ventricle from MRI would enable earlier and more accurate clinical diagnosis in monitoring disease progression. Even though it requires an automated or semi-automated segmentation method for objective quantification, it is difficult to define lateral ventricles due to insufficient contrast and brightness of structural imaging. In this study, we proposed a fully automated lateral ventricle segmentation method based on a graph cuts algorithm combined with atlas-based segmentation and connected component labeling. Initially, initial seeds for graph cuts were defined by atlas-based segmentation (ATS). They were adjusted by partial volume images in order to provide accurate a priori information on graph cuts. A graph cuts algorithm is to finds a global minimum of energy with minimum cut/maximum flow algorithm function on graph. In addition, connected component labeling used to remove false ventricle regions. The proposed method was validated with the well-known tools using the dice similarity index, recall and precision values. The proposed method was significantly higher dice similarity index ($0.860{\pm}0.036$, p < 0.001) and recall ($0.833{\pm}0.037$, p < 0.001) compared with other tools. Therefore, the proposed method yielded a robust and reliable segmentation result.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.21 no.2
• /
• pp.63-73
• /
• 2017

Segmenting the image into multiple regions is at the core of image processing. Many segmentation formulations of an images with multiple regions have been suggested over the years. We consider segmentation algorithm based on the multi-phase level set method in this work. Proposed method gives the best result upon other methods found in the references. Moreover it can segment images with intensity inhomogeneity and have multiple junction. We extend our method (GLIF) in [T. Dultuya, and M. Kang, Segmentation with shape prior using global and local image fitting energy, J.KSIAM Vol.18, No.3, 225-244, 2014.] using a multiphase level set formulation to segment images with multiple regions and junction. We test our method on different images and compare the method to other existing methods.

• Journal of Digital Convergence
• /
• v.19 no.6
• /
• pp.251-258
• /
• 2021

In this paper, we proposed an encoder-decoder model utilizing residual learning to improve the accuracy of the U-Net-based semantic segmentation method. U-Net is a deep learning-based semantic segmentation method and is mainly used in applications such as autonomous vehicles and medical image analysis. The conventional U-Net occurs loss in feature compression process due to the shallow structure of the encoder. The loss of features causes a lack of context information necessary for classifying objects and has a problem of reducing segmentation accuracy. To improve this, The proposed method efficiently extracted context information through an encoder using residual learning, which is effective in preventing feature loss and gradient vanishing problems in the conventional U-Net. Furthermore, we reduced down-sampling operations in the encoder to reduce the loss of spatial information included in the feature maps. The proposed method showed an improved segmentation result of about 12% compared to the conventional U-Net in the Cityscapes dataset experiment.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2216-2219
• /
• 2003

Accurate speech region detection and automatic syllable segmentation is important part of speech recognition system. In automatic speech recognition system, they are needed for the purpose of accurate recognition and less computational complexity, In this paper, we Propose improved syllable segmentation method using ramp edge detection method and residual signal Peak energy. These methods were used to ensure accuracy and robustness for endpoint detection and syllable segmentation system. They have almost invariant response to various background noise levels. As experimental results, we obtained the rate of 90.7％ accuracy in syllable segmentation in a condition of accurate endpoint detection environments.

• The Journal of the Acoustical Society of Korea
• /
• v.31 no.4
• /
• pp.260-265
• /
• 2012

A robust audio fingerprinting method is presented based on segmentation boundaries. In order to obtain robustness against linear speed changes, fingerprint extraction and matching are synchronized with the segmentation boundaries. Experimental results show that the proposed method is also robust against other common audio processing steps including low bit-rate compression, equalization, and time-scale modification.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.9
• /
• pp.719-726
• /
• 1991

The symplified segmentation method was proposed for hardware implementation based on the human visual system. The segmentation method using fuzzy logic and just noticeable difference(JND) is composed of pre-filtering, initial segmentation and post processing. Experimental coding results show that reconstructed image using the proposed method is good on visual percerption even at a high compression ratio of 30:1.

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

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.19 no.4
• /
• pp.1-11
• /
• 2023

Clustering analysis is used in various fields including customer segmentation and clustering methods such as k-means are actively applied in the credit card customer segmentation. In this paper, we summarized the input features selection method of k-means clustering for the case of the credit card customer segmentation problem, and evaluated its feasibility through the analysis results. By using the label values of k-means clustering results as target features of a decision tree classification, we composed a method for prioritizing input features using the information gain of the branch. It is not easy to determine effectiveness with the clustering effectiveness index, but in the case of the CH index, cluster effectiveness is improved evidently in the method presented in this paper compared to the case of randomly determining priorities. The suggested method can be used for effectiveness of actively used clustering analysis including k-means method.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.869-877
• /
• 2016

In this paper, we propose an automated segmentation method of femoral cartilage in knee MR images using multi-atlas-based locally-weighted voting. The proposed method involves two steps. First, to utilize the shape information to show that the femoral cartilage is attached to a femur, the femur is segmented via volume and object-based locally-weighted voting and narrow-band region growing. Second, the object-based affine transformation of the femur is applied to the registration of femoral cartilage, and the femoral cartilage is segmented via multi-atlas shape-based locally-weighted voting. To evaluate the performance of the proposed method, we compared the segmentation results of majority voting method, intensity-based locally-weighted voting method, and the proposed method with manual segmentation results defined by expert. In our experimental results, the newly proposed method avoids a leakage into the neighboring regions having similar intensity of femoral cartilage, and shows improved segmentation accuracy.