• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.109-112
• /
• 1999

Image segmentation is the critical first step in image information extraction for computer vision systems. Clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are divided from the fuzzy c-means(FCM) algorithm. The FCM algorithm uses fie probabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belonging or compatibility. Moreover, the FCM algorithm has considerable trouble under noisy environments in the feature space. Recently, a possibilistic approach to clustering(PCM) for solving above problems was proposed. In this paper, we used the PCM for color image segmentation. This approach differs from existing fuzzy clustering methods for color image segmentation in that the resulting partition of the data can be interpreted as a possibilistic partition. So, the problems in the FCM can be solved by the PCM. But, the clustering results by the PCM are not smoothly bounded, and they often have holes. The region growing was used as a postprocessing after smoothing the noise points in the pixel seeds. In our experiments, we illustrate that the PCM us reasonable than the FCM in noisy environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3121-3143
• /
• 2019

Segmentation plays an important role in the field of image processing and computer vision. Intuitionistic fuzzy C-means (IFCM) clustering algorithm emerged as an effective technique for image segmentation in recent years. However, standard fuzzy C-means (FCM) and IFCM algorithms are sensitive to noise and initial cluster centers, and they ignore the spatial relationship of pixels. In view of these shortcomings, an improved algorithm based on IFCM is proposed in this paper. Firstly, we propose a modified non-membership function to generate intuitionistic fuzzy set and a method of determining initial clustering centers based on grayscale features, they highlight the effect of uncertainty in intuitionistic fuzzy set and improve the robustness to noise. Secondly, an improved nonlinear kernel function is proposed to map data into kernel space to measure the distance between data and the cluster centers more accurately. Thirdly, the local spatial-gray information measure is introduced, which considers membership degree, gray features and spatial position information at the same time. Finally, we propose a new measure of intuitionistic fuzzy entropy, it takes into account fuzziness and intuition of intuitionistic fuzzy set. The experimental results show that compared with other IFCM based algorithms, the proposed algorithm has better segmentation and clustering performance.

• Journal of Korea Multimedia Society
• /
• v.21 no.12
• /
• pp.1363-1369
• /
• 2018

Breast cancer is one of the most common cancers in women worldwide. In Korea, breast cancer is most common cancer in women followed by thyroid cancer. The purpose of this study is to evaluate the possibility of using deep - run model for segmentation of breast masses and to identify the best deep-run model for breast mass segmentation. In this study, data of patients with breast masses were collected at Asan Medical Center. We used 596 images of mammography and 596 images of gold standard. In the area of interest of the medical image, it was cut into a rectangular shape with a margin of about 10% up and down, and then converted into an 8-bit image by adjusting the window width and level. Also, the size of the image was resampled to $150{\times}150$. In Deconvolution net, the average accuracy is 91.78%. In U-net, the average accuracy is 90.09%. Deconvolution net showed slightly better performance than U-net in this study, so it is expected that deconvolution net will be better for breast mass segmentation. However, because of few cases, there are a few images that are not accurately segmented. Therefore, more research is needed with various training data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.105-125
• /
• 2024

Gliomas are the most common malignant brain tumor and cause the most deaths. Manual brain tumor segmentation is expensive, time-consuming, error-prone, and dependent on the radiologist's expertise and experience. Manual brain tumor segmentation outcomes by different radiologists for the same patient may differ. Thus, more robust, and dependable methods are needed. Medical imaging researchers produced numerous semi-automatic and fully automatic brain tumor segmentation algorithms using ML pipelines and accurate (handcrafted feature-based, etc.) or data-driven strategies. Current methods use CNN or handmade features such symmetry analysis, alignment-based features analysis, or textural qualities. CNN approaches provide unsupervised features, while manual features model domain knowledge. Cascaded algorithms may outperform feature-based or data-driven like CNN methods. A revolutionary cascaded strategy is presented that intelligently supplies CNN with past information from handmade feature-based ML algorithms. Each patient receives manual ground truth and four MRI modalities (T1, T1c, T2, and FLAIR). Handcrafted characteristics and deep learning are used to segment brain tumors in a Global Convolutional Neural Network (GCNN). The proposed GCNN architecture with two parallel CNNs, CSPathways CNN (CSPCNN) and MRI Pathways CNN (MRIPCNN), segmented BraTS brain tumors with high accuracy. The proposed model achieved a Dice score of 87% higher than the state of the art. This research could improve brain tumor segmentation, helping clinicians diagnose and treat patients.

• The Journal of Korea Robotics Society
• /
• v.19 no.1
• /
• pp.130-138
• /
• 2024

High-precision 3D Object Detection is a crucial component within autonomous driving systems, with far-reaching implications for subsequent tasks like multi-object tracking and path planning. In this paper, we propose a novel approach designed to enhance the performance of 3D Object Detection, especially in heading angle estimation by employing a moving object segmentation technique. Our method starts with extracting point-wise moving labels via a process of moving object segmentation. Subsequently, these labels are integrated into the LiDAR Pointcloud data and integrated data is used as inputs for 3D Object Detection. We conducted an extensive evaluation of our approach using the KITTI-road dataset and achieved notably superior performance, particularly in terms of AOS, a pivotal metric for assessing the precision of 3D Object Detection. Our findings not only underscore the positive impact of our proposed method on the advancement of detection performance in lidar-based 3D Object Detection methods, but also suggest substantial potential in augmenting the overall perception task capabilities of autonomous driving systems.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.385-395
• /
• 2005

Long sentence analysis has been a critical problem in machine translation because of high complexity. The methods of intra-sentence segmentation have been proposed to reduce parsing complexity. This paper presents the intra-sentence segmentation method based on maximum entropy probability model to increase the coverage and accuracy of the segmentation. We construct the rules for choosing candidate segmentation positions by a teaming method using the lexical context of the words tagged as segmentation position. We also generate the model that gives probability value to each candidate segmentation positions. The lexical contexts are extracted from the corpus tagged with segmentation positions and are incorporated into the probability model. We construct training data using the sentences from Wall Street Journal and experiment the intra-sentence segmentation on the sentences from four different domains. The experiments show about $88\%$ accuracy and about $98\%$ coverage of the segmentation. Also, the proposed method results in parsing efficiency improvement by 4.8 times in speed and 3.6 times in space.

• Journal of the Korean Society of Industry Convergence
• /
• v.27 no.3
• /
• pp.563-572
• /
• 2024

Image processing and computer vision technologies are becoming increasingly important in a variety of application fields that require techniques and tools for sophisticated image analysis. In particular, image segmentation is a technology that plays an important role in image analysis. In this study, in order to identify recent research trends on image segmentation techniques, we used the Web of Science(WoS) database to analyze the R&D topography based on the network structure of the author's keyword co-occurrence matrix. As a result, from 2015 to 2023, as a result of the analysis of the R&D map of research articles on image segmentation, R&D in this field is largely focused on four areas of research and development: (1) researches on collecting and preprocessing image data to build higher-performance image segmentation models, (2) the researches on image segmentation using statistics-based models or machine learning algorithms, (3) the researches on image segmentation for medical image analysis, and (4) deep learning-based image segmentation-related R&D. The scientometrics-based analysis performed in this study can not only map the trajectory of R&D related to image segmentation, but can also serve as a marker for future exploration in this dynamic field.

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.905-917
• /
• 2021

In recent years, edge computing technology consists of several Internet of Things (IoT) devices with embedded sensors that have improved significantly for monitoring, detection, and management in an environment where big data is commercialized. The main focus of edge computing is data optimization or task offloading due to data and task-intensive application development. However, existing offloading approaches do not consider correlations and associations between data and tasks involving edge computing. The extent of collaborative offloading segmented without considering the interaction between data and task can lead to data loss and delays when moving from edge to edge. This article proposes a range segmentation of dynamic offloading (RSDO) algorithm that isolates the offload range and collaborative edge node around the edge node function to address the offloading issue.The RSDO algorithm groups highly correlated data and tasks according to the cause of the overload and dynamically distributes offloading ranges according to the state of cooperating nodes. The segmentation improves the overall performance of edge nodes, balances edge computing, and solves data loss and average latency.

• Journal of Biomedical Engineering Research
• /
• v.28 no.3
• /
• pp.332-337
• /
• 2007

In the early twenty-first century, minimally invasive surgery is the mainstay of various kinds of surgical fields. Surgeons gave percutaneously surgical treatment of the screw directly using a fluoroscopic view in the past. The latest date, they began to operate the fractured carpal bone surgery using Computerized Tomography (CT). Carpal bones composed of wrist joint consist of eight small bones which have hexahedron and sponge shape. Because of these shape, it is difficult to grasp the shape of carpal bones using only CT image data. Although several image segmentation studies have been conducted with carpal bone CT image data, more studies about carpal bone using CT data are still required. Especially, to apply the software implemented from the studies to clinical fIeld, the outcomes should be user friendly and very accurate. To satisfy those conditions, we propose modified multi-seed region growing segmentation method which uses simple threshold and the canny edge detector for finding edge information more accurately. This method is able to use very easily and gives us high accuracy and high speed for extracting the edge information of carpal bones. Especially, using multi-seed points, multi-bone objects of the carpal bone are extracted simultaneously.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.493-500
• /
• 2001

Video scene segmentation is fundamental role for content based video analysis. In this paper, we propose a new region based video scene segmentation method using continuity test for each object region which is segmented by the watershed algorithm for all frames in video data. For this purpose, we first classify video data segments into classes that are the dynamic and static sections according to the object movement rate by comparing the spatial and shape similarity of each region. And then, try to segment each sections by grouping each sections by comparing the neighbor section sections by comparing the neighbor section similarity. Because, this method uses the region which represented on object as a similarity measure, it can segment video scenes efficiently without undesirable fault alarms by illumination and partial changes.