• Title/Summary/Keyword: 영역확장 Clustering

Search Result 49, Processing Time 0.031 seconds

Expansion Clustering For Initialized Set (초기 클러스터를 위한 확장 클러스터링)

  • Lee, Jae-Seong;Kim, Dae-Won
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2006.11a
    • /
    • pp.79-82
    • /
    • 2006
  • 본 논문에서는 사용자가 결과를 얻고자 하는 목적 집단의 초기 클러스터를 생성하는 알고리즘을 제안한다. 알고리즘이 생성하는 클러스터는 사용자의 입력을 받지 않고 생성되며, 목적 집단에 포함되는 임의의 두 점을 이용한 확장을 통해 초기 클러스터를 생성한다. 이에 따라 서로의 영역을 침범하지 않는 일반적인 클러스터를 생성하는 것이 가능하다.

  • PDF

A Design of Clustering Classification Systems using Satellite Remote Sensing Images Based on Design Patterns (디자인 패턴을 적용한 위성영상처리를 위한 군집화 분류시스템의 설계)

  • Kim, Dong-Yeon;Kim, Jin-Il
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.319-326
    • /
    • 2002
  • In this paper, we have designed and implemented cluttering classification systems- unsupervised classifiers-for the processing of satellite remote sensing images. Implemented systems adopt various design patterns which include a factory pattern and a strategy pattern to support various satellite images'formats and to design compatible systems. The clustering systems consist of sequential clustering, K-Means clustering, ISODATA clustering and Fuzzy C-Means clustering classifiers. The systems are tested by using a Landsat TM satellite image for the classification input. As results, these clustering systems are well designed to extract sample data for the classification of satellite images of which there is no previous knowledge. The systems can be provided with real-time base clustering tools, compatibilities and components' reusabilities as well.

Backlit Region Detection Using Adaptively Partitioned Block and Fuzzy C-means Clustering for Backlit Image Enhancement (역광 영상 개선을 위한 퍼지 C-평균 분류기와 적응적 블록 분할을 사용한 역광 영역 검출)

  • Kim, Nahyun;Lee, Seungwon;Paik, Joonki
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.124-132
    • /
    • 2014
  • In this paper, we present a novel backlit region detection and contrast enhancement method using fuzzy C-means clustering and adaptively partitioned block based contrast stretching. The proposed method separates an image into both dark backlit and bright background regions using adaptively partitioned blocks based on the optimal threshold value computed by fuzzy logic. The detected block-wise backlit region is refined using the guided filter for removing block artifacts. Contrast stretching algorithm is then applied to adaptively enhance the detected backlit region. Experimental results show that the proposed method can successfully detect the backlit region without a complicated segmentation algorithm and enhance the object information in the backlit region.

Nucleus Segmentation and Recognition of Uterine Cervical Pop-Smears using Region Growing Technique and Backpropagation Algorithm (영역 확장 기법과 오류 역전파 알고리즘을 이용한 자궁경부 세포진 영역 분할 및 인식)

  • Kim Kwang-Baek;Kim Sung-Shin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.6
    • /
    • pp.1153-1158
    • /
    • 2006
  • The classification of the background and cell areas is very important research area because of the ambiguous boundary. In this paper, the region of cell is extracted from an image of uterine cervical cytodiagnosis using the region growing method that increases the region of interest based on similarity between pixels. Segmented image from background and cell areas is binarized using a threshold value. And then 8-directional tracking algorithm for contour lines is applied to extract the cell area. First, the extracted nucleus is transformed to RGB color that is the original image. Second, the K-means clustering algorithm is employed to classify RGB pixels to the R, G, and B channels, respectively. Third, the Hue information of nucleus is extracted from the HSI models that is the transformation of the clustering values in R, G, and B channels. The backpropagation algorithm is employed to classify and identify the normal or abnormal nucleus.

Multi-level Thresholding using Fuzzy Clustering Algorithm in Local Entropy-based Transition Region (지역적 엔트로피 기반 전이 영역에서 퍼지 클러스터링 알고리즘을 이용한 Multi-Level Thresholding)

  • Oh, Jun-Taek;Kim, Bo-Ram;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.12B no.5 s.101
    • /
    • pp.587-594
    • /
    • 2005
  • This paper proposes a multi-level thresholding method for image segmentation using fuzzy clustering algorithm in transition region. Most of threshold-based image segmentation methods determine thresholds based on the histogram distribution of a given image. Therefore, the methods have difficulty in determining thresholds for real-image, which has a complex and undistinguished distribution, and demand much computational time and memory size. To solve these problems, we determine thresholds for real-image using fuzzy clustering algorithm after extracting transition region consisting of essential and important components in image. Transition region is extracted based on Inか entropy, which is robust to noise and is well-known as a tool that describes image information. And fuzzy clustering algorithm can determine optimal thresholds for real-image and be easily extended to multi-level thresholding. The experimental results demonstrate the effectiveness of the proposed method for performance.

Color image segmentation using the possibilistic C-mean clustering and region growing (Possibilistic C-mean 클러스터링과 영역 확장을 이용한 칼라 영상 분할)

  • 엄경배;이준환
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.3
    • /
    • pp.97-107
    • /
    • 1997
  • Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic 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 belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.

  • PDF

An Enhanced Density and Grid based Spatial Clustering Algorithm for Large Spatial Database (대용량 공간데이터베이스를 위한 확장된 밀도-격자 기반의 공간 클러스터링 알고리즘)

  • Gao, Song;Kim, Ho-Seok;Xia, Ying;Kim, Gyoung-Bae;Bae, Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.13D no.5 s.108
    • /
    • pp.633-640
    • /
    • 2006
  • Spatial clustering, which groups similar objects based on their distance, connectivity, or their relative density in space, is an important component of spatial data mining. Density-based and grid-based clustering are two main clustering approaches. The former is famous for its capability of discovering clusters of various shapes and eliminating noises, while the latter is well known for its high speed. Clustering large data sets has always been a serious challenge for clustering algorithms, because huge data set would make the clustering process extremely costly. In this paper, we propose an enhanced Density-Grid based Clustering algorithm for Large spatial database by setting a default number of intervals and removing the outliers effectively with the help of a proper measurement to identify areas of high density in the input data space. We use a density threshold DT to recognize dense cells before neighbor dense cells are combined to form clusters. When proposed algorithm is performed on large dataset, a proper granularity of each dimension in data space and a density threshold for recognizing dense areas can improve the performance of this algorithm. We combine grid-based and density-based methods together to not only increase the efficiency but also find clusters with arbitrary shape. Synthetic datasets are used for experimental evaluation which shows that proposed method has high performance and accuracy in the experiments.

A Watershed-based Texture Segmentation Method Using Marker Clustering (마커 클러스터링을 이용한 유역변환 기반의 질감 분할 기법)

  • Hwang, Jin-Ho;Kim, Won-Hee;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.4
    • /
    • pp.441-449
    • /
    • 2007
  • In clustering for image segmentation, large amount of computation and typical segmentation errors have been important problems. In the paper, we suggest a new method for minimizing these problems. Markers in marker-controlled watershed transform represent segmented areas because they are starting-points of extending areas. Thus, clustering restricted by marker pixels can reduce computational complexity. In our proposed method, the markers are selected by Gabor texture energy, and cluster information of them are generated by FCM (fuzzy c-mean) clustering. Generated areas from watershed transform are merged by using cluster information of markers. In the test of Brodatz' texture images, we improved typical partition-errors obviously and obtained less computational complexity compared with previous FCM clustering algorithms. Overall, it also took regular computational time.

  • PDF

Feature Weighting in Projected Clustering for High Dimensional Data (고차원 데이타에 대한 투영 클러스터링에서 특성 가중치 부여)

  • Park, Jong-Soo
    • Journal of KIISE:Databases
    • /
    • v.32 no.3
    • /
    • pp.228-242
    • /
    • 2005
  • The projected clustering seeks to find clusters in different subspaces within a high dimensional dataset. We propose an algorithm to discover near optimal projected clusters without user specified parameters such as the number of output clusters and the average cardinality of subspaces of projected clusters. The objective function of the algorithm computes projected energy, quality, and the number of outliers in each process of clustering. In order to minimize the projected energy and to maximize the quality in clustering, we start to find best subspace of each cluster on the density of input points by comparing standard deviations of the full dimension. The weighting factor for each dimension of the subspace is used to get id of probable error in measuring projected distances. Our extensive experiments show that our algorithm discovers projected clusters accurately and it is scalable to large volume of data sets.

An Image Segmentation Method and Similarity Measurement Using fuzzy Algorithm for Object Recognition (물체인식을 위한 영상분할 기법과 퍼지 알고리듬을 이용한 유사도 측정)

  • Kim, Dong-Gi;Lee, Seong-Gyu;Lee, Moon-Wook;Kang, E-Sok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.2
    • /
    • pp.125-132
    • /
    • 2004
  • In this paper, we propose a new two-stage segmentation method for the effective object recognition which uses region-growing algorithm and k-means clustering method. At first, an image is segmented into many small regions via region growing algorithm. And then the segmented small regions are merged in several regions so that the regions of an object may be included in the same region using typical k-means clustering method. This paper also establishes similarity measurement which is useful for object recognition in an image. Similarity is measured by fuzzy system whose input variables are compactness, magnitude of biasness and orientation of biasness of the object image, which are geometrical features of the object. To verify the effectiveness of the proposed two-stage segmentation method and similarity measurement, experiments for object recognition were made and the results show that they are applicable to object recognition under normal circumstance as well as under abnormal circumstance of being.