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

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.241-241
• /
• 2000

In this Paper, we present a new efficient algorithm that can segment an object in the image. There are many algorithms for segmentation and many studies for criteria or threshold value. But, if the environment or brightness is changed, their would not be suitable. Accordingly, we apply a clustering algorithm for adopting and compensating environmental factors. And applying labeling method, we try arranging segment by the similarity that calculated with the fuzzy algorithm. we also present simulations for searching an object and show that the algorithm is somewhat more efficient than the other algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1548-1558
• /
• 1988

In this paper, a segmentation algorithm for color images based on the scale-space filter and the Fuzzy c-means (FCM) techniques is proposed. The methodology uses a coarse-fine concept to reduce the computational burden required for the FCM. The coarse segmentation attempts to segment coarsely using a thresholding technique, while a fine segmentation assigns the unclassified pixels by a coarse segmentation to the closest class using the FCM. Attempts also have been made to compare the performance of the proposed algorithm with other algorithms such as Ohlander's, Rosenfeld's, and Bezdek's. Intensive computer simulations has been done and the results are discussed in the paper. The simulation results indicate that the proposed algorithm produces the most accurate segmentation on the O-K-S color coordinate while requiring a reasonable amount of computational effort.

• IE interfaces
• /
• v.21 no.4
• /
• pp.394-402
• /
• 2008

The objective of this paper is to design segmentation algorithm for applying the breast ultrasound image to CAD(Computer Aided Diagnosis). This study is conducted after understanding limits, used algorithm and demands of CAD system by interviewing with a medical doctor and analyzing related works based on a general CAD framework that is consisted of five step-establishment of plan, analysis of needs, design, implementation and test & maintenance. Detection function of CAD is accomplished by Canny algorithm and arithmetic operations for segmentation. In addition to, long computing time is solved by extracting ROI (Region Of Interests) and applying segmentation technical methods based morphology algorithm. Overall course of study is conducted by verification of medical doctor. And validity and verification are satisfied by medical doctor's confirmation. Moreover, manual segmentation of related works, restrictions on the number of tumor and dependency of image resolution etc. was solved. This study is utilized as a support system aided doctors' subjective diagnosis even though a lot of future studies is needed for entire application of CAD system.

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

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.670-675
• /
• 2001

This paper is to propose image segmentation method based on chamfer algorithm. First, we get original image from CCD camera and transform it into gray image. Second, we extract maximum gray value of background and reconstruct and eliminate the background using surface fitting method and bilinear interpolation. Third, we subtract the reconstructed background from gray image to remove noises in gray image. Fourth, we transform the subtracted image into binary image using Otsu's optimal thresholding method. Fifth, we use morphological filters such as areaopen, opening, filling filter etc. to remove noises and isolated points. Sixth, we use chamfer distance or Euclidean distance to this filtered image. Finally, we use watershed algorithm and count microorganisms in image by labeling. To prove the effectiveness, we apply the proposed algorithm to one of Ammonia-oxidizing bacteria, Acinetobacter sp. It is shown that both Euclidean algorithm and chamfer algorithm show over-segmentation. But Chamfer algorithm shows less over-segmentation than Euclidean algorithm.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.450-453
• /
• 2000

In this paper, an automated segmentation algorithm is proposed for MR brain images using T1-weighted, T2-weighted, and PD images complementarily. The proposed segmentation algorithm is composed of 3 steps. In the first step, cerebrum images are extracted by putting a cerebrum mask upon the three input images. In the second step, outstanding clusters that represent inner tissues of the cerebrum are chosen among 3-dimensional (3D) clusters. 3D clusters are determined by intersecting densely distributed parts of 2D histogram in the 3D space formed with three optimal scale images. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram. In the final step, cerebrum images are segmented using FCM algorithm with it’s initial centroid value as the outstanding cluster’s centroid value. The proposed segmentation algorithm complements the defect of FCM algorithm, being influenced upon initial centroid, by calculating cluster’s centroid accurately And also can get better segmentation results from the proposed segmentation algorithm with multi spectral analysis than the results of single spectral analysis.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.203-206
• /
• 2002

We propose the new algorithm for scene segmentation. The proposed system consists motion estimation module and motion segmentation module. The former estimates 2D-motion value for each pixel position from two images transformed by wavelet. The latter determine scene segments well fitting on dominant affine motion models. What distinguishes proposed algorithm from other methods is that it needs not other post-processing for scene segmentation. We can manipulate both multimedia data and objects in virtual environment using proposed algorithm.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.505-510
• /
• 2004

This paper suggests a new CT-image segmentation algorithm. This algorithm uses morphological filters and the watershed algorithms. The proposed CT-image segmentation algorithm consists of six parts: preprocessing, image simplification, feature extraction, decision making, region merging, and postprocessing. By combining spatial and temporal information, we can get more accurate segmentation results. The simulation results illustrate not only the segmentation results of the conventional scheme but also the results of the proposed scheme; this comparison illustrates the efficacy of the proposed technique. Furthermore, we compare the various medical images of the structuring elements. Indeed, to illustrate the improvement of coding efficiency in postprocessing, we use differential chain coding for the shape coding of results.

• Journal of Korea Multimedia Society
• /
• v.19 no.7
• /
• pp.1116-1126
• /
• 2016

Image segmentation is widely used in the pre-processing stage of image analysis and, therefore, the accuracy of image segmentation is important for performance of an image-based analysis system. An efficient image segmentation method is proposed, including a filtering process for super-pixels, improved saliency map information, and a merge process. The proposed algorithm removes areas that are not equal or of small size based on comparison of the area of smoothed superpixels in order to maintain generation of a similar size super pixel area. In addition, application of a bilateral filter to an existing saliency map that represents human visual attention allows improvement of separation between objects and background. Finally, a segmented result is obtained based on the suggested merging process without any prior knowledge or information. Performance of the proposed algorithm is verified experimentally.