• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 1999년도 춘계종합학술대회
• /
• 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.

• 한국통신학회논문지
• /
• 제30권11C호
• /
• pp.1076-1082
• /
• 2005

최근 수리형태학적 접근 방법을 이용하여 영상을 분할하고자 하는 연구가 계속되고 있다. 그 중에서도 분수경계 알고리듬은 기존의 에지 기반의 영상 분할 방법과 영역기반의 영상분할 방법의 장점을 모두 가지고 있는 효과적인 영상 분할 기법 중에 하나이다. 분수경계 알고리듬의 기본적인 개념은 지형학적 해석에 기반을 두고 있으며 항상 영역의 외곽에 폐곡선을 형성한다. 그러나 잡영에 매우 민감하게 반응하여 수많은 영역으로 분할되는 과분할 현상을 초래한다. 따라서 본 논문에서는 중요하지 많은 국부 최소점과 국부 최대점을 모두 제거함으로써 과분할 현상을 줄이는 제한적 워터폴 알고리듬을 제안한다. 실험결과 제안한 제한적 워터폴 방법이 다른 과분할 억제 방법보다 평균분할 영역수와 외곽선 소실 측면에서 효과적으로 영상을 분할할 수 있었다.

• 한국콘텐츠학회논문지
• /
• 제14권3호
• /
• pp.11-21
• /
• 2014

다중 스케일 영상 분할은 영상 스타일링과 의료진단과 같은 여러 응용에서 매우 중요하다. 이 논문은 다중 스케일 구조를 확보하며 안정적이고 효율적인 MSER에 기반을 둔 새로운 알고리즘을 제안한다. 이 알고리즘은 영상에서 MSER를 수집한 후, 이것들을 특정한 순서대로 영상에 다시 그려 넣음으로써 영상을 분할한다. 영상 경계를 평활화하고 잡음을 제거하기 위한 계층적 모폴로지 연산을 제안한다. 알고리즘의 다중 스케일 특성을 보이기 위해, 여러 종류의 상세 단계 제어의 효과를 영상 스타일링에 적용한다. 제안한 기법은 이러한 효과를 시간이 많이 걸리는 다중 가우시언 평활화없이 수행한다. 분할 품질과 계산 시간 측면에서 민쉬프트-기반 Edison 시스템과 비교 결과를 제시한다.

• 한국컴퓨터그래픽스학회논문지
• /
• 제28권4호
• /
• pp.23-30
• /
• 2022

본 논문에서는 불이 비슷한 색의 연기로 둘러싸여 있더라도 정확하게 검출할 수 있는 알고리즘을 제안한다. 기존 불 영역 검출 알고리즘들은 화재 이미지에서 불과 연기를 잘 분리해내지 못하는 문제점이 있었다. 본 논문에서는 불 영역 검출 알고리즘을 적용하기 전에 전처리 과정으로써 색상 보정 기법과 안개 제거 기법을 적용함으로써 성공적으로 불을 연기로부터 분리해냈다. 실제로 연기로 뒤덮인 화재 현장의 이미지들에서 기존 기법들보다 불을 더 효과적으로 검출하는 것을 확인할 수 있었다. 또한 제안한 화재 검출 알고리즘을 공장, 가정 등에서 효율적인 화재 탐지를 위해 사용할 수 있는 방법을 제안한다.

• 대한의용생체공학회:의공학회지
• /
• 제43권5호
• /
• pp.341-352
• /
• 2022

Medical image segmentation is the most important task in radiation therapy. Especially, when segmenting medical images, the liver is one of the most difficult organs to segment because it has various shapes and is close to other organs. Therefore, automatic segmentation of the liver in computed tomography (CT) images is a difficult task. Since tumors also have low contrast in surrounding tissues, and the shape, location, size, and number of tumors vary from patient to patient, accurate tumor segmentation takes a long time. In this study, we propose a method algorithm for automatically segmenting the liver and tumor for this purpose. As an advantage of setting the boundaries of the tumor, the liver and tumor were automatically segmented from the CT image using the 2D CoordConv DeepLab V3+ model using the CoordConv layer. For tumors, only cropped liver images were used to improve accuracy. Additionally, to increase the segmentation accuracy, augmentation, preprocess, loss function, and hyperparameter were used to find optimal values. We compared the CoordConv DeepLab v3+ model using the CoordConv layer and the DeepLab V3+ model without the CoordConv layer to determine whether they affected the segmentation accuracy. The data sets used included 131 hepatic tumor segmentation (LiTS) challenge data sets (100 train sets, 16 validation sets, and 15 test sets). Additional learned data were tested using 15 clinical data from Seoul St. Mary's Hospital. The evaluation was compared with the study results learned with a two-dimensional deep learning-based model. Dice values without the CoordConv layer achieved 0.965 ± 0.01 for liver segmentation and 0.925 ± 0.04 for tumor segmentation using the LiTS data set. Results from the clinical data set achieved 0.927 ± 0.02 for liver division and 0.903 ± 0.05 for tumor division. The dice values using the CoordConv layer achieved 0.989 ± 0.02 for liver segmentation and 0.937 ± 0.07 for tumor segmentation using the LiTS data set. Results from the clinical data set achieved 0.944 ± 0.02 for liver division and 0.916 ± 0.18 for tumor division. The use of CoordConv layers improves the segmentation accuracy. The highest of the most recently published values were 0.960 and 0.749 for liver and tumor division, respectively. However, better performance was achieved with 0.989 and 0.937 results for liver and tumor, which would have been used with the algorithm proposed in this study. The algorithm proposed in this study can play a useful role in treatment planning by improving contouring accuracy and reducing time when segmentation evaluation of liver and tumor is performed. And accurate identification of liver anatomy in medical imaging applications, such as surgical planning, as well as radiotherapy, which can leverage the findings of this study, can help clinical evaluation of the risks and benefits of liver intervention.

• The Journal of the Acoustical Society of Korea
• /
• 제24권4E호
• /
• pp.128-131
• /
• 2005

A new algorithm for speech signal segmentation is proposed. This algorithm is based on finding successive similar frames belonging to a segment and represents it by an average spectrum. The speech signal is a slowly time varying signal in the sense that, when examined over a sufficiently short period of time (between 10 and 100 ms), its characteristics are fairly stationary. Generally this approach is based on finding these fairly stationary periods. Advantages of the. algorithm are accurate border decision of segments and simple computation. The automatic segmentations using frame averaging show as much as $82.20\%$ coincided with manually verified segmentation of CMU ARCTIC corpus within time range 16 ms. More than $90\%$ segment boundaries are coincided within a range of 32 ms. Also it can be combined with many types of automatic segmentations (HMM based, acoustic cues or feature based etc.).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(4)
• /
• pp.219-222
• /
• 2001

Moving objects in video data are main elements for video analysis and retrieval. In this paper, we propose a new algorithm for tracking and segmenting moving objects in color image sequences that include complex camera motion such as zoom, pan and rotating. The Proposed algorithm is based on the Mean-shift color segmentation and stochastic region matching method. For segmenting moving objects, each sequence is divided into a set of similar color regions using Mean-shift color segmentation algorithm. Each segmented region is matched to the corresponding region in the subsequent frame. The motion vector of each matched region is then estimated and these motion vectors are summed to estimate global motion. Once motion vectors are estimated for all frame of video sequences, independently moving regions can be segmented by comparing their trajectories with that of global motion. Finally, segmented regions are merged into the independently moving object by comparing the similarities of trajectories, positions and emerging period. The experimental results show that the proposed algorithm is capable of segmenting independently moving objects in the video sequences including complex camera motion.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.126-129
• /
• 2008

In this paper, we proposed a method extracting an object from background of the satellite image. The image segmentation techniques have been widely studied for the technology to segment image and to synthesis segment object with other images. Proposed algorithm is to perform the edge detection of a selected object using genetic algorithm. We segment region of object based on detection edge using watershed algorithm. We separated background and object in indefinite region using gradual region merge from segment object. And, we make GUI for the application of the proposed algorithm to various tests. To demonstrate the effectiveness of the proposed method, several analysis on the satellite images are performed.

• Journal of Information Processing Systems
• /
• 제5권1호
• /
• pp.1-4
• /
• 2009

Level set methods are the numerical techniques for tracking interfaces and shapes. They have been successfully used in image segmentation. A new variational level set evolving algorithm without re-initialization is presented in this paper. It consists of an internal energy term that penalizes deviations of the level set function from a signed distance function, and an external energy term that drives the motion of the zero level set toward the desired image feature. This algorithm can be easily implemented using a simple finite difference scheme. Meanwhile, not only can the initial contour can be shown anywhere in the image, but the interior contours can also be automatically detected.

• 한국멀티미디어학회논문지
• /
• 제24권11호
• /
• pp.1461-1471
• /
• 2021

This paper presents a light exposure correction algorithm for less pleasant images, acquired with a light metering failure. Since conventional tone mapping and gamma correction methods adopt a function mapping with the same range of input and output, the results are pleasurable for almost symmetric distributions to their intensity average. However, their corrections gave insufficient outputs for asymmetric cases at either bright or dark regions. Also, histogram modification approaches show good results on varied pattern images, but these generate unintentional noises at flat regions because of the compulsive shift of the intensity distribution. Therefore, in order to sufficient corrections for both bright and dark areas, the proposed algorithm calculates the gamma coefficients using primary parameters extracted from the global distribution. And the fusion weights are adaptively determined with complementary parameters, considering the classification information of a binary segmentation. As the result, the proposed algorithm can obtain a good output about both the symmetric and the asymmetric distribution images even with severe exposure values.