• Title/Summary/Keyword: k-means clustering Algorithm

Search Result 545, Processing Time 0.029 seconds

Research on Characterizing Urban Color Analysis based on Tourists-Shared Photos and Machine Learning - Focused on Dali City, China - (관광객 공유한 사진 및 머신 러닝을 활용한 도시 색채 특성 분석 연구 - 중국 대리시를 대상으로 -)

  • Yin, Xiaoyan;Jung, Taeyeol
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.52 no.2
    • /
    • pp.39-50
    • /
    • 2024
  • Color is an essential visual element that has a significant impact on the formation of a city's image and people's perceptions. Quantitative analysis of color in urban environments is a complex process that has been difficult to implement in the past. However, with recent rapid advances in Machine Learning, it has become possible to analyze city colors using photos shared by tourists. This study selected Dali City, a popular tourist destination in China, as a case study. Photos of Dali City shared by tourists were collected, and a method to measure large-scale city colors was explored by combining machine learning techniques. Specifically, the DeepLabv3+ model was first applied to perform a semantic segmentation of tourist sharing photos based on the ADE20k dataset, thereby separating artificial elements in the photos. Next, the K-means clustering algorithm was used to extract colors from the artificial elements in Dali City, and an adjacency matrix was constructed to analyze the correlations between the dominant colors. The research results indicate that the main color of the artificial elements in Dali City has the highest percentage of orange-grey. Furthermore, gray tones are often used in combination with other colors. The results indicated that local ethnic and Buddhist cultures influence the color characteristics of artificial elements in Dali City. This research provides a new method of color analysis, and the results not only help Dali City to shape an urban color image that meets the expectations of tourists but also provide reference materials for future urban color planning in Dali City.

Face Detection for Automatic Avatar Creation by using Deformable Template and GA

  • Park, Tae-Young;Lee, Ja-Yong;Kang, Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1534-1538
    • /
    • 2005
  • In this paper, we propose a method to detect contours of a face, eyes, and a mouth of a person in the color image in order to make an avatar automatically. First, we use the HSI color model to exclude the effect of various light conditions, and find skin regions in the input image by using the skin color defined on HS-plane. And then, we use deformable templates and genetic algorithm (GA) to detect contours of a face, eyes, and a mouth. Deformable templates consist of B-spline curves and control point vectors. Those represent various shapes of a face, eyes and a mouth. GA is a very useful search algorithm based on the principals of natural selection and genetics. Second, the avatar is automatically created by using GA-detected contours and Fuzzy C-Means clustering (FCM). FCM is used to reduce the number of face colors. In result, we could create avatars which look like handmade caricatures representing user's identity. Our approach differs from those generated by existing methods.

  • PDF

On Constructing NURBS Surface Model from Scattered and Unorganized 3-D Range Data (정렬되지 않은 3차원 거리 데이터로부터의 NURBS 곡면 모델 생성 기법)

  • Park, In-Kyu;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.3
    • /
    • pp.17-30
    • /
    • 2000
  • In this paper, we propose an efficient algorithm to produce 3-D surface model from a set of range data, based on NURBS (Non-Uniform Rational B-Splines) surface fitting technique. It is assumed that the range data is initially unorganized and scattered 3-D points, while their connectivity is also unknown. The proposed algorithm consists of three steps: initial model approximation, hierarchical representation, and construction of the NURBS patch network. The mitral model is approximated by polyhedral and triangular model using K-means clustering technique Then, the initial model is represented by hierarchically decomposed tree structure. Based on this, $G^1$ continuous NURBS patch network is constructed efficiently. The computational complexity as well as the modeling error is much reduced by means of hierarchical decomposition and precise approximation of the NURBS control mesh Experimental results show that the initial model as well as the NURBS patch network are constructed automatically, while the modeling error is observed to be negligible.

  • PDF

Adaptive Clustering Algorithm for Recycling Cell Formation: An Application of the Modified Fuzzy ART Neural Network

  • Park, Ji-Hyung;Seo, Kwang-Kyu
    • Proceedings of the Korea Database Society Conference
    • /
    • 1999.06a
    • /
    • pp.253-260
    • /
    • 1999
  • The recycling cell formation problem means that disposal products me classified into recycling part families using group technology in their end of life phase. Disposal products have the uncertainties of product status by usage influences during product use phase and recycling cells are formed design, process and usage attributes. In order to treat the uncertainties, fuzzy set theory and fuzzy logic-based neural network model are applied to recycling cell formation problem far disposal products. In this paper, a heuristic approach fuzzy ART neural network is suggested. The modified fuzzy ART neural network is shown that it has a great efficiency and give an extension for systematically generating alternative solutions in the recycling cell formation problem. We present the results of this approach applied to disposal refrigerators and the comparison of performances between other algorithms. This paper introduced a procedure which integrates economic and environmental factors into the disassembly of disposal products for recycling in recycling cells. A qualitative method of disassembly analysis is developed and its ai is to improve the efficiency of the disassembly and to generated an optimal disassembly which maximize profits and minimize environmental impact. Three criteria established to reduce the search space and facilitate recycling opportunities.

  • PDF

Distribution Analysis of Optimal Equipment Assignment Using a Genetic Algorithm (유전알고리즘을 이용하여 최적화된 방제 자원 배치안의 분포도 분석)

  • Kim, Hye-Jin;Kim, Yong-Hyuk
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.4
    • /
    • pp.11-16
    • /
    • 2020
  • As a plan for oil spill accidents, research to collect and analyze optimal equipment assignments is essential. However, studies that have diversified and analyzed the optimal equipment assignments for responding to oil spill accidents have not been preceded. In response to the need for analyzing optimal equipment assignments study, we devised a genetic algorithm for optimal equipment assignments. The designed genetic algorithm yielded 10,000 optimal equipment assignments. We clustered using the k-means algorithm. As a result, the two clusters of Yeosu, Daesan, and Ulsan, which are expected to be the largest spills, were clearly identified. We also projected 16-dimensional data in two dimensions via Sammon's mapping. The projected data were analyzed for distribution. We confirmed that results of the simulation were better than those of optimal equipment assignments included in the cluster.In the future, it will be possible to implement an approximate model with excellent performance based on this study.

Development of a Knowledge Discovery System using Hierarchical Self-Organizing Map and Fuzzy Rule Generation

  • Koo, Taehoon;Rhee, Jongtae
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.431-434
    • /
    • 2001
  • Knowledge discovery in databases(KDD) is the process for extracting valid, novel, potentially useful and understandable knowledge form real data. There are many academic and industrial activities with new technologies and application areas. Particularly, data mining is the core step in the KDD process, consisting of many algorithms to perform clustering, pattern recognition and rule induction functions. The main goal of these algorithms is prediction and description. Prediction means the assessment of unknown variables. Description is concerned with providing understandable results in a compatible format to human users. We introduce an efficient data mining algorithm considering predictive and descriptive capability. Reasonable pattern is derived from real world data by a revised neural network model and a proposed fuzzy rule extraction technique is applied to obtain understandable knowledge. The proposed neural network model is a hierarchical self-organizing system. The rule base is compatible to decision makers perception because the generated fuzzy rule set reflects the human information process. Results from real world application are analyzed to evaluate the system\`s performance.

  • PDF

Design of HCBKA-Based TSK Fuzzy Prediction System with Error Compensation (HCBKA 기반 오차 보정형 TSK 퍼지 예측시스템 설계)

  • Bang, Young-Keun;Lee, Chul-Heui
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.6
    • /
    • pp.1159-1166
    • /
    • 2010
  • To improve prediction quality of a nonlinear prediction system, the system's capability for uncertainty of nonlinear data should be satisfactory. This paper presents a TSK fuzzy prediction system that can consider and deal with the uncertainty of nonlinear data sufficiently. In the design procedures of the proposed system, HCBKA(Hierarchical Correlationship-Based K-means clustering Algorithm) was used to generate the accurate fuzzy rule base that can control output according to input efficiently, and the first-order difference method was applied to reflect various characteristics of the nonlinear data. Also, multiple prediction systems were designed to analyze the prediction tendencies of each difference data generated by the difference method. In addition, to enhance the prediction quality of the proposed system, an error compensation method was proposed and it compensated the prediction error of the systems suitably. Finally, the prediction performance of the proposed system was verified by simulating two typical time series examples.

Multiple Model Prediction System Based on Optimal TS Fuzzy Model and Its Applications to Time Series Forecasting (최적 TS 퍼지 모델 기반 다중 모델 예측 시스템의 구현과 시계열 예측 응용)

  • Bang, Young-Keun;Lee, Chul-Heui
    • Journal of Industrial Technology
    • /
    • v.28 no.B
    • /
    • pp.101-109
    • /
    • 2008
  • In general, non-stationary or chaos time series forecasting is very difficult since there exists a drift and/or nonlinearities in them. To overcome this situation, we suggest a new prediction method based on multiple model TS fuzzy predictors combined with preprocessing of time series data, where, instead of time series data, the differences of them are applied to predictors as input. In preprocessing procedure, the candidates of optimal difference interval are determined by using con-elation analysis and corresponding difference data are generated. And then, for each of them, TS fuzzy predictor is constructed by using k-means clustering algorithm and least squares method. Finally, the best predictor which minimizes the performance index is selected and it works on hereafter for prediction. Computer simulation is performed to show the effectiveness and usefulness of our method.

  • PDF

The use of support vector machines in semi-supervised classification

  • Bae, Hyunjoo;Kim, Hyungwoo;Shin, Seung Jun
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.2
    • /
    • pp.193-202
    • /
    • 2022
  • Semi-supervised learning has gained significant attention in recent applications. In this article, we provide a selective overview of popular semi-supervised methods and then propose a simple but effective algorithm for semi-supervised classification using support vector machines (SVM), one of the most popular binary classifiers in a machine learning community. The idea is simple as follows. First, we apply the dimension reduction to the unlabeled observations and cluster them to assign labels on the reduced space. SVM is then employed to the combined set of labeled and unlabeled observations to construct a classification rule. The use of SVM enables us to extend it to the nonlinear counterpart via kernel trick. Our numerical experiments under various scenarios demonstrate that the proposed method is promising in semi-supervised classification.

A Study for Load Profile Generation of Electric Power Customer using Clustering Algorithm (클러스터링 기법을 이용한 전력 고객의 대표 부하패턴 생성에 대한 연구)

  • Kim, Young-Il;Choi, Hoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.435-438
    • /
    • 2008
  • 한전에서는 연간 전력 사용량이 높은 고압 고객에 대하여 전자식 전력량계를 설치하여 15분 단위로 전력 사용량을 수집하는 자동검침시스템을 운영하고 있다. 본 연구에서는 자동검침시스템을 통해 수집된 데이터를 이용하여 배전선로에 대한 부하를 분석하기 위해 자동검침 고객의 부하 데이터를 이용하여 클러스터링 기법을 통해 대표 부하패턴을 생성하는 방식을 제안하였다. 기존에는 계약종별 코드가 동일한 고객들의 부하패턴을 이용하여 15분 단위의 평균 사용량을 계산하여 대표 부하패턴을 생성하는 방식을 사용하였으나, 같은 계약종별 코드를 갖는 고객이라 할지라도 부하패턴이 다른 경우가 많아서 부하분석의 정확도를 떨어뜨렸다. 본 연구에서는 동일한 계약종별 코드를 갖는 고객에 대하여 15분 단위 자동검침 데이터를 이용하여 k-means 기법을 통해 고객을 분류하고 각 그룹마다 대표 부하패턴을 생성하는 방식을 제안하였다.