• Title/Summary/Keyword: 지도 군집화

Search Result 593, Processing Time 0.039 seconds

Automatic Clustering on Trained Self-organizing Feature Maps via Graph Cuts (그래프 컷을 이용한 학습된 자기 조직화 맵의 자동 군집화)

  • Park, An-Jin;Jung, Kee-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.9
    • /
    • pp.572-587
    • /
    • 2008
  • The Self-organizing Feature Map(SOFM) that is one of unsupervised neural networks is a very powerful tool for data clustering and visualization in high-dimensional data sets. Although the SOFM has been applied in many engineering problems, it needs to cluster similar weights into one class on the trained SOFM as a post-processing, which is manually performed in many cases. The traditional clustering algorithms, such as t-means, on the trained SOFM however do not yield satisfactory results, especially when clusters have arbitrary shapes. This paper proposes automatic clustering on trained SOFM, which can deal with arbitrary cluster shapes and be globally optimized by graph cuts. When using the graph cuts, the graph must have two additional vertices, called terminals, and weights between the terminals and vertices of the graph are generally set based on data manually obtained by users. The Proposed method automatically sets the weights based on mode-seeking on a distance matrix. Experimental results demonstrated the effectiveness of the proposed method in texture segmentation. In the experimental results, the proposed method improved precision rates compared with previous traditional clustering algorithm, as the method can deal with arbitrary cluster shapes based on the graph-theoretic clustering.

Image Recognition and Clustering for Virtual Reality based on Cognitive Rehabilitation Contents (가상현실 기반 인지재활 콘텐츠를 위한 영상 인식 및 군집화)

  • Choi, KwonTaeg
    • Journal of Digital Contents Society
    • /
    • v.18 no.7
    • /
    • pp.1249-1257
    • /
    • 2017
  • Due to the 4th industrial revolution and an aged society, many studies are being conducted to apply virtual reality to medical field. Research on dementia is especially active. This paper proposes virtual reality based on cognitive rehabilitation contents using image recognition and clustering method to improve cognitive and physical disabilities caused by dementia. Unlike the existing cognitive rehabilitation system, this paper uses travel photos that reflect the memories of the subjects to be treated. In order to generate automated cognitive rehabilitation contents, we extract face information, food pictures, place information, and time information from photographs, and normalization is performed for clustering. And we present scenarios that can be used as cognitive rehabilitation contents using travel photos in virtual reality space.

An Efficient Deep Learning Ensemble Using a Distribution of Label Embedding

  • Park, Saerom
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.27-35
    • /
    • 2021
  • In this paper, we propose a new stacking ensemble framework for deep learning models which reflects the distribution of label embeddings. Our ensemble framework consists of two phases: training the baseline deep learning classifier, and training the sub-classifiers based on the clustering results of label embeddings. Our framework aims to divide a multi-class classification problem into small sub-problems based on the clustering results. The clustering is conducted on the label embeddings obtained from the weight of the last layer of the baseline classifier. After clustering, sub-classifiers are constructed to classify the sub-classes in each cluster. From the experimental results, we found that the label embeddings well reflect the relationships between classification labels, and our ensemble framework can improve the classification performance on a CIFAR 100 dataset.

Elliptical Clustering with Incremental Growth and its Application to Skin Color Region Segmentation (점증적으로 증가하는 타원형 군집화 : 피부색 영역 검출에의 적용)

  • Lee Kyoung-Mi
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.9
    • /
    • pp.1161-1170
    • /
    • 2004
  • This paper proposes to segment skin color areas using a clustering algorithm. Most of previously proposed clustering algorithms have some difficulties, since they generally detect hyperspherical clusters, run in a batch mode, and predefine a number of clusters. In this paper, we use a well-known elliptical clustering algorithm, an EM algorithm, and modify it to learn on-line and find automatically the number of clusters, called to an EAM algorithm. The effectiveness of the EAM algorithm is demonstrated on a task of skin color region segmentation. Experimental results present the EAM algorithm automatically finds a right number of clusters in a given image without any information on the number. Comparing with the EM algorithm, we achieved better segmentation results with the EAM algorithm. Successful results were achieved to detect and segment skin color regions using a conditional probability on a region. Also, we applied to classify images with persons and got good classification results.

Clustering In Tied Mixture HMM Using Homogeneous Centroid Neural Network (Homogeneous Centroid Neural Network에 의한 Tied Mixture HMM의 군집화)

  • Park Dong-Chul;Kim Woo-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9C
    • /
    • pp.853-858
    • /
    • 2006
  • TMHMM(Tied Mixture Hidden Markov Model) is an important approach to reduce the number of free parameters in speech recognition. However, this model suffers from a degradation in recognition accuracy due to its GPDF (Gaussian Probability Density Function) clustering error. This paper proposes a clustering algorithm, called HCNN(Homogeneous Centroid Neural network), to cluster acoustic feature vectors in TMHMM. Moreover, the HCNN uses the heterogeneous distance measure to allocate more code vectors in the heterogeneous areas where probability densities of different states overlap each other. When applied to Korean digit isolated word recognition, the HCNN reduces the error rate by 9.39% over CNN clustering, and 14.63% over the traditional K-means clustering.

Identifying the Optimal Number of Homogeneous Regions for Regional Frequency Analysis Using Self-Organizing Map (자기조직화지도를 활용한 동일강수지역 최적군집수 분석)

  • Kim, Hyun Uk;Sohn, Chul;Han, Sang-Ok
    • Spatial Information Research
    • /
    • v.20 no.6
    • /
    • pp.13-21
    • /
    • 2012
  • In this study, homogeneous regions for regional frequency analysis were identified using rainfall data from 61 observation points in Korea. The used data were gathered from 1980 to 2010. Self organizing map and K-means clustering based on Davies-Bouldin Index were used to make clusters showing similar rainfall patterns and to decide the optimum number of the homogeneous regions. The results from this analysis showed that the 61 observation points can be optimally grouped into 6 geographical clusters. Finally, the 61 observations points grouped into 6 clusters were mapped regionally using Thiessen polygon method.

Fingerprint classification using the clustering of the orientation of the ridges (융선의 방향성분 군집화를 통한 효과적인 지문분류기법)

  • Park, Chang-Hee;Yoon, Kyung-Bae;Choi, Jun-Hyeog
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.679-685
    • /
    • 2003
  • The cores and deltas of fingerprints designate the parts where the flow of the ridges change radically. Observations on the change of the orientation of the ridges around the cores and deltas enable us to guess the location of the cores and deltas. According]y clustering the orientation flowing to the same direction after doing research on the orientation of the ridges on the whole makes us see that the cores and deltas are shaping around the boundaries of the clustering area. It is also observed that The patterns of clustering of the orientation of the ridges classified as Arch, Tented Arch, Left loop, Right Loop and Whorl have its own characteristics respectively. In this paper the method of classifying the fingerprints effectively is proposed and proved its effectiveness by using the clustering of the orientation of the ridges, finding the cores of the fingerprints which don't secure the deltas.

Hierarchical Grouping of Line Segments for Building Model Generation (건물 형태 발생을 위한 3차원 선소의 계층적 군집화)

  • Han, Ji-Ho;Park, Dong-Chul;Woo, Dong-Min;Jeong, Tai-Kyeong;Lee, Yun-Sik;Min, Soo-Young
    • Journal of IKEEE
    • /
    • v.16 no.2
    • /
    • pp.95-101
    • /
    • 2012
  • A novel approach for the reconstruction of 3D building model from aerial image data is proposed in this paper. In this approach, a Centroid Neural Network (CNN) with a metric of line segments is proposed for connecting low-level linear structures. After the straight lines are extracted from an edge image using the CNN, rectangular boundaries are then found by using an edge-based grouping approach. In order to avoid producing unrealistic building models from grouping lined segments, a hierarchical grouping method is proposed in this paper. The proposed hierarchical grouping method is evaluated with a set of aerial image data in the experiment. The results show that the proposed method can be successfully applied for the reconstruction of 3D building model from satellite images.

Extraction of Basic Insect Footprint Segments Using ART2 of Automatic Threshold Setting (자동 임계값 설정 ART2를 이용한 곤충 발자국의 인식 대상 영역 추출)

  • Shin, Bok-Suk;Cha, Eui-Young;Woo, Young-Woon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.8
    • /
    • pp.1604-1611
    • /
    • 2007
  • In a process of insect footprint recognition, basic footprint segments should be extracted from a whole insect footprint image in order to find out appropriate features for classification. In this paper, we used a clustering method as a preprocessing stage for extraction of basic insect footprint segments. In general, sizes and strides of footprints may be different according to type and sire of an insect for recognition. Therefore we proposed an improved ART2 algorithm for extraction or basic insect footprint segments regardless of size and stride or footprint pattern. In the proposed ART2 algorithm, threshold value for clustering is determined automatically using contour shape of the graph created by accumulating distances between all the spots of footprint pattern. In the experimental results applying the proposed method to two kinds of insect footprint patterns, we could see that all the clustering results were accomplished correctly.

A Similar Price Zone Determination of Public Land Price Using K-means Clustering Technique (K-평균 군집화 기법을 이용한 공시지가 유사가격권의 설정)

  • 이성규;홍성언;박수홍
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2004.03a
    • /
    • pp.367-372
    • /
    • 2004
  • 비교표준지를 이용하여 개별공시지가를 산정하는 우리나라 제도 하에서 가장 중요한 문제는 개별필지 주변의 표준지 중에서 어떤 표준지를 선택ㆍ이용하여 지가를 산정해야 하는가이다. 그러나 지침상에서는 비교표준지 선정시 중요 요인으로 작용하고 있는 유사가격권에 대하여 수치적인 기준이 아닌 모호한 개념상으로 규정하고 있어 비교표준지 선정에 있어 부정확성을 초래하고 있다. 따라서, 본 연구에서는 객관적인 기준과 수치적인 기준의 부재로 많은 문제점을 발생시키고 있는 유사가격권 설정의 문제를 해결하고자 K-평균 군집화 기법을 활용하여 가격권을 설정하고 이에 대한 타당성을 제시하고자 한다.

  • PDF