• 컴퓨터교육학회논문지
• /
• 제10권6호
• /
• pp.91-105
• /
• 2007

이미지로부터 타원을 추출하기 위하여 Hough transform을 많이 이용하고 있다. 그러나 이 방법은 시간과 기억 공간을 많이 소모한다. 그리고 기존의 타원분리 방법은 잡음에 예민하거나 많은 breakpoint를 발생시키는 단점이 있다. 이 논문에서는 면적을 이용하여 잡음이 있는 디지털 곡선으로부터 타원을 분리 및 추출하는 빠른 방법을 제시한다. 실험 결과로, 제시된 방법이 잡음을 가지고 있는 곡선으로부터 타원 호의 분리 및 추출이 가능하며, 추출된 타원과 주어진 곡선간의 거리오차평균이 일정 임계값 범위 내에 있는 것을 보여준다.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2003년도 춘계학술발표대회논문집
• /
• pp.431-434
• /
• 2003

In this paper, we propose an efficient method not only f3r producing accurate region segmentation, solving the over-segmentation problem of watershed algorithm but also f3r reducing post-processing time by reducing computation loads. Through this proposed method, region segmentation of neighboring objects and discrimination of similar intensities were effectively obtained. Input image of watershed algorithm has used the derivative-based detectors such as Sobel and Canny. But proposed method uses the pixels-similarity-based detector, that is, SUSAN. By adopting this proposed method, we can reduce the noise problem and solve the problem of over-segmentation and not lose the edge information of objects. We also propose Zero-Crossing SUSAN. With Zero-Crossing SUSAN, the edge localization, times and computation loads can be improved over those obtained from existing SUSAN

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권7호
• /
• pp.2400-2419
• /
• 2014

Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4624-4644
• /
• 2019

With the development of films, games and animation industry, analysis and reuse of human motion capture data become more and more important. Human motion segmentation, which divides a long motion sequence into different types of fragments, is a key part of mocap-based techniques. However, most of the segmentation methods only take into account low-level physical information (motion characteristics) or high-level data information (statistical characteristics) of motion data. They cannot use the data information fully. In this paper, we propose an unsupervised framework using both low-level physical information and high-level data information of human motion data to solve the human segmentation problem. First, we introduce the algorithm of CFSFDP and optimize it to carry out initial segmentation and obtain a good result quickly. Second, we use the ACA method to perform optimized segmentation for improving the result of segmentation. The experiments demonstrate that our framework has an excellent performance.

• 한국산학기술학회논문지
• /
• 제4권3호
• /
• pp.248-251
• /
• 2003

본 연구에서는 접합 문자를 분할하는 알고리듬을 소개한다. 문자 인식기는 문자를 인식하기 위해 문자 분할을 전처리 단계에 필요로 하는데, 문자 분할은 높은 수행력을 위해 문자 인식 결과를 필요로 한다. 이 딜레마를 해결하기 위해서는 문자 분할과 문자 인식, 이 두 문제를 동시에 해결하는 방법이 필요하다. 이를 위해 본 논문에서는 문자 분할 전에 접합문자 내에 있는 소속 문자를 인식하고 문자를 분할하는 새로운 문자 분할 방법을 제시한다. 본 연구에서 제시한 문자 분할알고리즘은 접합 문자 내에 있는 소속 문자를 문자 분할 전에 인식하기 위해 측면 윤곽을 정의하고, 그 히스토그램을 구해 프로토타입에 있는 단일 문자의 측면 윤곽 히스토그램과 비교 계산하여 가장 적은 거리차를 가지는 단일 문자를 분할 문자의 일차 후보로 내정하여, 분할 비용을 가지고 접합 문자를 분할한다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권6호
• /
• pp.523-531
• /
• 2005

확산(Diffusion)을 이용한 기존의 칼라영상 분할은 확산의 횟수가 반복될수록 경계선 정보가 적절히 유지되지 못하거나 잡음을 제거하지 못함으로써 워터쉐드(Watershed) 알고리즘을 적용하는 경우, 과분할을 피할 수 없다는 단점을 갖고 있다. 본 논문에서는 수리 형태학(Mathematical Morphology)과 비선형 확산(Non-Linear Diffusion)을 함께 적용하여 과분할의 문제점을 제거한 워터쉐드 결과를 얻을 수 있는 칼라영상 분할방법을 제안한다. 임의의 칼라 영상을 LUV 색상공간으로 변환하여, 그 각각의 색상공간에 수리 형태학을 응용한 재구성에 의한 닫힘(Reconstruction) 연산과 비선형 확산을 함께 적용하여 경계선을 적절히 유지하면서 잡음을 제거한 단순 영상을 획득할 수 있다. 이 영상에서 칼라 영상의 기울기(Gradient) 정보를 획득하고, 워터쉐드 알고리즘을 적용하여 영상을 분할한다. 실험 결과, 기존의 방법보다 과분할이 현저히 제거되고, 칼라 영상이 매우 효과적으로 분할됨을 확인하였다

• 산업경영시스템학회지
• /
• 제43권1호
• /
• pp.16-25
• /
• 2020

Vegetation segmentation in a field color image is a process of distinguishing vegetation objects of interests like crops and weeds from a background of soil and/or other residues. The performance of the process is crucial in automatic precision agriculture which includes weed control and crop status monitoring. To facilitate the segmentation, color indices have predominantly been used to transform the color image into its gray-scale image. A thresholding technique like the Otsu method is then applied to distinguish vegetation parts from the background. An obvious demerit of the thresholding based segmentation will be that classification of each pixel into vegetation or background is carried out solely by using the color feature of the pixel itself without taking into account color features of its neighboring pixels. This paper presents a new pixel-based segmentation method which employs a multi-layer perceptron neural network to classify the gray-scale image into vegetation and nonvegetation pixels. The input data of the neural network for each pixel are 2-dimensional gray-level values surrounding the pixel. To generate a gray-scale image from a raw RGB color image, a well-known color index called Excess Green minus Excess Red Index was used. Experimental results using 80 field images of 4 vegetation species demonstrate the superiority of the neural network to existing threshold-based segmentation methods in terms of accuracy, precision, recall, and harmonic mean.

• Journal of Computational Design and Engineering
• /
• 제2권2호
• /
• pp.79-87
• /
• 2015

Surface segmentation and edge feature lines extraction from fractured fragments of relics are essential steps for computer assisted restoration of fragmented relics. As these fragments were heavily eroded, it is a challenging work to segment surface and extract edge feature lines. This paper presents a novel method to segment surface and extract edge feature lines from triangular meshes of irregular fractured fragments. Firstly, a rough surface segmentation is accomplished by using a clustering algorithm based on the vertex normal vector. Secondly, in order to differentiate between original and fracture faces, a novel integral invariant is introduced to compute the surface roughness. Thirdly, an accurate surface segmentation is implemented by merging faces based on face normal vector and roughness. Finally, edge feature lines are extracted based on the surface segmentation. Some experiments are made and analyzed, and the results show that our method can achieve surface segmentation and edge extraction effectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1434-1449
• /
• 2019

Video object segmentation is a significant task in computer vision, but its performance is not very satisfactory. A method of video object segmentation using weakly temporal information is presented in this paper. Motivated by the phenomenon in reality that the motion of the object is a continuous and smooth process and the appearance of the object does not change much between adjacent frames in the video sequences, we use a feed-forward architecture with motion estimation to predict the mask of the current frame. We extend an additional mask channel for the previous frame segmentation result. The mask of the previous frame is treated as the input of the expanded channel after processing, and then we extract the temporal feature of the object and fuse it with other feature maps to generate the final mask. In addition, we introduce multi-mask guidance to improve the stability of the model. Moreover, we enhance segmentation performance by further training with the masks already obtained. Experiments show that our method achieves competitive results on DAVIS-2016 on single object segmentation compared to some state-of-the-art algorithms.

• International Journal of Computer Science & Network Security
• /
• 제23권7호
• /
• pp.61-70
• /
• 2023

Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.