• Title/Summary/Keyword: k-means 군집 알고리즘

Search Result 191, Processing Time 0.041 seconds

The correction of Lens distortion based on Image division using Artificial Neural Network (영상분할 방법 기반의 인공신경망을 적용한 카메라의 렌즈왜곡 보정)

  • Shin, Ki-Young;Bae, Jang-Han;Mun, Joung-H.
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.4
    • /
    • pp.31-38
    • /
    • 2009
  • Lens distortion is inevitable phenomenon in machine vision system. More and more distortion phenomenon is occurring in order to choice of lens for minimizing cost and system size. As shown above, correction of lens distortion is critical issue. However previous lens correction methods using camera model have problem such as nonlinear property and complicated operation. And recent lens correction methods using neural network also have accuracy and efficiency problem. In this study, I propose new algorithms for correction of lens distortion. Distorted image is divided based on the distortion quantity using k-means. And each divided image region is corrected by using neural network. As a result, the proposed algorithms have better accuracy than previous methods without image division.

How to Generate Term Vectors to Support the Automatic Generation of Taxonomy (분류체계 자동 생성 지원을 위한 용어 벡터 생성 방법 탐색)

  • Su-Jin Seong;Jeong-Won Cha
    • Annual Conference on Human and Language Technology
    • /
    • 2022.10a
    • /
    • pp.600-603
    • /
    • 2022
  • 분류체계를 결정하는 일은 매우 중요하지만 어려운 일이다. 우리는 수집된 용어 목록에 클러스터링을 적용하여 상위 범주의 범위를 자동으로 설정하고자 하였다. 용어 클러스터링은 용어를 나타내는 벡터에 큰 의존성을 갖는다. 이에 클러스터링의 성능 향상을 위해 다양한 용어 임베딩 방법을 비교하였으며 용어에 대한 정의문의 벡터를 용어 벡터로 사용하여 가장 우수한 클러스터링 결과를 얻었다. 또한 실험을 통해 클러스터링 알고리즘 중 k-means clustering이 고차원의 벡터에 대해 좋은 성능의 군집을 생성함을 확인하였다.

  • PDF

Automated Cell Counting Method for HeLa Cells Image based on Cell Membrane Extraction and Back-tracking Algorithm (세포막 추출과 역추적 알고리즘 기반의 HeLa 세포 이미지 자동 셀 카운팅 기법)

  • Kyoung, Minyoung;Park, Jeong-Hoh;Kim, Myoung gu;Shin, Sang-Mo;Yi, Hyunbean
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1239-1246
    • /
    • 2015
  • Cell counting is extensively used to analyze cell growth in biomedical research, and as a result automated cell counting methods have been developed to provide a more convenient and means to analyze cell growth. However, there are still many challenges to improving the accuracy of the cell counting for cells that proliferate abnormally, divide rapidly, and cluster easily, such as cancer cells. In this paper, we present an automated cell counting method for HeLa cells, which are used as reference for cancer research. We recognize and classify the morphological conditions of the cells by using a cell segmentation algorithm based on cell membrane extraction, and we then apply a cell back-tracking algorithm to improve the cell counting accuracy in cell clusters that have indistinct cell boundary lines. The experimental results indicate that our proposed segmentation method can identify each of the cells more accurately when compared to existing methods and, consequently, can improve the cell counting accuracy.

Text extraction in images using simplify color and edges pattern analysis (색상 단순화와 윤곽선 패턴 분석을 통한 이미지에서의 글자추출)

  • Yang, Jae-Ho;Park, Young-Soo;Lee, Sang-Hun
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.8
    • /
    • pp.33-40
    • /
    • 2017
  • In this paper, we propose a text extraction method by pattern analysis on contour for effective text detection in image. Text extraction algorithms using edge based methods show good performance in images with simple backgrounds, The images of complex background has a poor performance shortcomings. The proposed method simplifies the color of the image by using K-means clustering in the preprocessing process to detect the character region in the image. Enhance the boundaries of the object through the High pass filter to improve the inaccuracy of the boundary of the object in the color simplification process. Then, by using the difference between the expansion and erosion of the morphology technique, the edges of the object is detected, and the character candidate region is discriminated by analyzing the pattern of the contour portion of the acquired region to remove the unnecessary region (picture, background). As a final result, we have shown that the characters included in the candidate character region are extracted by removing unnecessary regions.

Extracting Typical Group Preferences through User-Item Optimization and User Profiles in Collaborative Filtering System (사용자-상품 행렬의 최적화와 협력적 사용자 프로파일을 이용한 그룹의 대표 선호도 추출)

  • Ko Su-Jeong
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.581-591
    • /
    • 2005
  • Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.

Health Risk Management using Feature Extraction and Cluster Analysis considering Time Flow (시간흐름을 고려한 특징 추출과 군집 분석을 이용한 헬스 리스크 관리)

  • Kang, Ji-Soo;Chung, Kyungyong;Jung, Hoill
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.1
    • /
    • pp.99-104
    • /
    • 2021
  • In this paper, we propose health risk management using feature extraction and cluster analysis considering time flow. The proposed method proceeds in three steps. The first is the pre-processing and feature extraction step. It collects user's lifelog using a wearable device, removes incomplete data, errors, noise, and contradictory data, and processes missing values. Then, for feature extraction, important variables are selected through principal component analysis, and data similar to the relationship between the data are classified through correlation coefficient and covariance. In order to analyze the features extracted from the lifelog, dynamic clustering is performed through the K-means algorithm in consideration of the passage of time. The new data is clustered through the similarity distance measurement method based on the increment of the sum of squared errors. Next is to extract information about the cluster by considering the passage of time. Therefore, using the health decision-making system through feature clusters, risks able to managed through factors such as physical characteristics, lifestyle habits, disease status, health care event occurrence risk, and predictability. The performance evaluation compares the proposed method using Precision, Recall, and F-measure with the fuzzy and kernel-based clustering. As a result of the evaluation, the proposed method is excellently evaluated. Therefore, through the proposed method, it is possible to accurately predict and appropriately manage the user's potential health risk by using the similarity with the patient.

A Comparison of Public Transportation Competitiveness in World Major Cities (세계주요도시의 대중교통 경쟁력 비교)

  • Kim, Dong-Jun;Kim, Hye-Ja;Jang, Won-Jae;Seong, Hyeon-Gon
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.4 s.90
    • /
    • pp.81-91
    • /
    • 2006
  • As public transportation is significant mode to make sustainable urban transportation system, the importance of Public transportation has grown gradually. Nowadays the central and local government make various policies which help to raise modal sp)it of public transportation. To understand previous public transportation Policies and make more efficient policies, it is important to know the current level of public transportation exactly. The main aim of this study is assess the competitiveness of public transportation in world major cities We select assessment indexes and have grouping use factor analysis. Then we have 8 clusters of cities by cluster analysis, Also, we analyze the relationship between public transportation characteristics and modal split.

Detection of the Defected Regions in Manufacturing Process Data using DBSCAN (DBSCAN 기반의 제조 공정 데이터 불량 위치의 검출)

  • Choi, Eun-Suk;Kim, Jeong-Hun;Nasridinov, Aziz;Lee, Sang-Hyun;Kang, Jeong-Tae;Yoo, Kwan-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.7
    • /
    • pp.182-192
    • /
    • 2017
  • Recently, there is an increasing interest in analysis of big data that is coming from manufacturing industry. In this paper, we use PCB (Printed Circuit Board) manufacturing data to provide manufacturers with information on areas with high PCB defect rates, and to visualize them to facilitate production and quality control. We use the K-means and DBSCAN clustering algorithms to derive the high fraction of PCB defects, and compare which of the two algorithms provides more accurate results. Finally, we develop a system of MVC structure to visualize the information about bad clusters obtained through clustering, and visualize the defected areas on actual PCB images.

Design of Radial Basis Function Neural Network Driven to TYPE-2 Fuzzy Inference and Its Optimization (TYPE-2 퍼지 추론 구동형 RBF 신경 회로망 설계 및 최적화)

  • Baek, Jin-Yeol;Kim, Woong-Ki;Oh, Sung-Kwun;Kim, Hyun-Ki
    • Proceedings of the KIEE Conference
    • /
    • 2008.10b
    • /
    • pp.247-248
    • /
    • 2008
  • 본 논문에서는 TYPE-2 퍼지 추론 기반의 RBF 뉴럴 네트워크(TYPE-2 Radial Basis Function Neural Network, T2RBFNN)를 설계하고 PSO(Particle Swarm Optimization) 알고리즘을 이용하여 모델의 파라미터를 동정한다. 제안된 모델의 은닉층은 TYPE-2 가우시안 활성 함수로 구성되며, 출력층은 Interval set 형태의 연결가중치를 갖는다. 여기에서 규칙 전반부 활성함수의 중심 선택은 C-means 클러스터링 알고리즘을 이용하고, 규칙 후반부 Interval set 형태의 연결가중치 결정에는 경사 하강법(Gradient descent method)을 이용한 오류 역전파 알고리즘을 사용하여 학습한다. 또한, 최적의 모델을 설계하기 위한 학습율 및 활성함수의 활성화 영역 결정에는 입자 군집 최적화(PSO; Particle Swarm Optimization) 알고리즘으로 동조한다. 마지막으로, 제안된 모델의 평가를 위하여 모의 데이터 집합(Synthetic dadaset)을 적용하고 근사화 및 일반화 능력에 대하여 토의한다.

  • PDF

Creation and clustering of proximity data for text data analysis (텍스트 데이터 분석을 위한 근접성 데이터의 생성과 군집화)

  • Jung, Min-Ji;Shin, Sang Min;Choi, Yong-Seok
    • The Korean Journal of Applied Statistics
    • /
    • v.32 no.3
    • /
    • pp.451-462
    • /
    • 2019
  • Document-term frequency matrix is a type of data used in text mining. This matrix is often based on various documents provided by the objects to be analyzed. When analyzing objects using this matrix, researchers generally select only terms that are common in documents belonging to one object as keywords. Keywords are used to analyze the object. However, this method misses the unique information of the individual document as well as causes a problem of removing potential keywords that occur frequently in a specific document. In this study, we define data that can overcome this problem as proximity data. We introduce twelve methods that generate proximity data and cluster the objects through two clustering methods of multidimensional scaling and k-means cluster analysis. Finally, we choose the best method to be optimized for clustering the object.