• Title/Summary/Keyword: 분류화

Search Result 4,805, Processing Time 0.047 seconds

Parallel Processing of K-means Clustering Algorithm for Unsupervised Classification of Large Satellite Imagery (대용량 위성영상의 무감독 분류를 위한 K-means 군집화 알고리즘의 병렬처리)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.35 no.3
    • /
    • pp.187-194
    • /
    • 2017
  • The present study introduces a method to parallelize k-means clustering algorithm for fast unsupervised classification of large satellite imagery. Known as a representative algorithm for unsupervised classification, k-means clustering is usually applied to a preprocessing step before supervised classification, but can show the evident advantages of parallel processing due to its high computational intensity and less human intervention. Parallel processing codes are developed by using multi-threading based on OpenMP. In experiments, a PC of 8 multi-core integrated CPU is involved. A 7 band and 30m resolution image from LANDSAT 8 OLI and a 8 band and 10m resolution image from Sentinel-2A are tested. Parallel processing has shown 6 time faster speed than sequential processing when using 10 classes. To check the consistency of parallel and sequential processing, centers, numbers of classified pixels of classes, classified images are mutually compared, resulting in the same results. The present study is meaningful because it has proved that performance of large satellite processing can be significantly improved by using parallel processing. And it is also revealed that it easy to implement parallel processing by using multi-threading based on OpenMP but it should be carefully designed to control the occurrence of false sharing.

Comparison of journal clustering methods based on citation structure (논문 인용에 따른 학술지 군집화 방법의 비교)

  • Kim, Jinkwang;Kim, Sohyung;Oh, Changhyuck
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.4
    • /
    • pp.827-839
    • /
    • 2015
  • Extraction of communities from a journal citation database by the citation structure is a useful tool to see closely related groups of the journals. SCI of Thomson Reuters or SCOPUS of Elsevier have had tried to grasp community structure of the journals in their indices according to citation relationships, but such a trial has not been made yet with the Korean Citation Index, KCI. Therefore, in this study, we extracted communities of the journals of the natural science area in KCI, using various clustering algorithms for a social network based on citations among the journals and compared the groups obtained with the classfication of KCI. The infomap algorithm, one of the clustering methods applied in this article, showed the best grouping result in the sense that groups obtained by it are closer to the KCI classification than by other algorithms considered and reflect well the citation structure of the journals. The classification results obtained in this study might be taken consideration when reclassification of the KCI journals will be made in the future.

Adaptive Blocking Artifacts Reduction in Block-Coded Images Using Block Classification and MLP (블록 분류와 MLP를 이용한 블록 부호화 영상에서의 적응적 블록화 현상 제거)

  • Kwon, Kee-Koo;Kim, Byung-Ju;Lee, Suk-Hwan;Lee, Jong-Won;Kwon, Seong-Geun;Lee, Kuhn-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.399-407
    • /
    • 2002
  • In this paper, a novel algorithm is proposed to reduce the blocking artifacts of block-based coded images by using block classification and MLP. In the proposed algorithm, we classify the block into four classes based on a characteristic of DCT coefficients. And then, according to the class information of neighborhood block, adaptive neural network filter is performed in horizontal and vertical block boundary. That is, for smooth region, horizontal edge region, vertical edge region, and complex region, we use a different two-layer neural network filter to remove blocking artifacts. Experimental results show that the proposed algorithm gives better results than the conventional algorithms both subjectively and objectively.

Feature-based Gene Classification and Region Clustering using Gene Expression Grid Data in Mouse Hippocampal Region (쥐 해마의 유전자 발현 그리드 데이터를 이용한 특징기반 유전자 분류 및 영역 군집화)

  • Kang, Mi-Sun;Kim, HyeRyun;Lee, Sukchan;Kim, Myoung-Hee
    • Journal of KIISE
    • /
    • v.43 no.1
    • /
    • pp.54-60
    • /
    • 2016
  • Brain gene expression information is closely related to the structural and functional characteristics of the brain. Thus, extensive research has been carried out on the relationship between gene expression patterns and the brain's structural organization. In this study, Principal Component Analysis was used to extract features of gene expression patterns, and genes were automatically classified by spatial distribution. Voxels were then clustered with classified specific region expressed genes. Finally, we visualized the clustering results for mouse hippocampal region gene expression with the Allen Brain Atlas. This experiment allowed us to classify the region-specific gene expression of the mouse hippocampal region and provided visualization of clustering results and a brain atlas in an integrated manner. This study has the potential to allow neuroscientists to search for experimental groups of genes more quickly and design an effective test according to the new form of data. It is also expected that it will enable the discovery of a more specific sub-region beyond the current known anatomical regions of the brain.

A Study on Research Paper Classification Using Keyword Clustering (키워드 군집화를 이용한 연구 논문 분류에 관한 연구)

  • Lee, Yun-Soo;Pheaktra, They;Lee, JongHyuk;Gil, Joon-Min
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.12
    • /
    • pp.477-484
    • /
    • 2018
  • Due to the advancement of computer and information technologies, numerous papers have been published. As new research fields continue to be created, users have a lot of trouble finding and categorizing their interesting papers. In order to alleviate users' this difficulty, this paper presents a method of grouping similar papers and clustering them. The presented method extracts primary keywords from the abstracts of each paper by using TF-IDF. Based on TF-IDF values extracted using K-means clustering algorithm, our method clusters papers to the ones that have similar contents. To demonstrate the practicality of the proposed method, we use paper data in FGCS journal as actual data. Based on these data, we derive the number of clusters using Elbow scheme and show clustering performance using Silhouette scheme.

Malicious Codes Re-grouping Methods using Fuzzy Clustering based on Native API Frequency (Native API 빈도 기반의 퍼지 군집화를 이용한 악성코드 재그룹화 기법연구)

  • Kwon, O-Chul;Bae, Seong-Jae;Cho, Jae-Ik;Moon, Jung-Sub
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.6A
    • /
    • pp.115-127
    • /
    • 2008
  • The Native API is a system call which can only be accessed with the authentication of the administrator. It can be used to detect a variety of malicious codes which can only be executed with the administrator's authority. Therefore, much research is being done on detection methods using the characteristics of the Native API. Most of these researches are being done by using supervised learning methods of machine learning. However, the classification standards of Anti-Virus companies do not reflect the characteristics of the Native API. As a result the population data used in the supervised learning methods are not accurate. Therefore, more research is needed on the topic of classification standards using the Native API for detection. This paper proposes a method for re-grouping malicious codes using fuzzy clustering methods with the Native API standard. The accuracy of the proposed re-grouping method uses machine learning to compare detection rates with previous classifying methods for evaluation.

Development of Classification Model on SAC Refrigerant Charge Level Using Clustering-based Steady-state Identification (군집화 기반 정상상태 식별을 활용한 시스템 에어컨의 냉매 충전량 분류 모델 개발)

  • Jae-Hee, Kim;Yoojeong, Noh;Jong-Hwan, Jeung;Bong-Soo, Choi;Seok-Hoon, Jang
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.6
    • /
    • pp.357-365
    • /
    • 2022
  • Refrigerant mischarging is one of the most frequently occurring failure modes in air conditioners, and both undercharging and overcharging degrade cooling performance. Therefore, it is important to accurately determine the amount of charged refrigerant. In this study, a support vector machine (SVM) model was developed to multi-classify the refrigerant mischarge through steady-state identification via fuzzy clustering techniques. For steady-state identification, a fuzzy clustering algorithm was applied to the air conditioner operation data using the difference between moving averages. The identification results using the proposed method were compared with those using existing steady-state determination techniques studied through the inversed Fisher's discriminant ratio (IFDR). Subsequently, the main features were selected using minimum redundancy maximum relevance (mRMR) considering the correlation among candidate features, and an SVM multi-classification model was devised using the derived features. The proposed method achieves satisfactory accuracy and robustness from test data collected in the new domain.

Deblocking Filter Based on Edge-Preserving Algorithm And an Efficient VLSI Architecture (경계선 보존 알고리즘 기반의 디블로킹 필터와 효율적인 VLSI 구조)

  • Vinh, Truong Quang;Kim, Ji-Hoon;Kim, Young-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11C
    • /
    • pp.662-672
    • /
    • 2011
  • This paper presents a new edge-preserving algorithm and its VLSI architecture for block artifact reduction. Unlike previous approaches using block classification, our algorithm utilizes pixel classification to categorize each pixel into one of two classes, namely smooth region and edge region, which are described by the edge-preserving maps. Based on these maps, a two-step adaptive filter which includes offset filtering and edge-preserving filtering is used to remove block artifacts. A pipelined VLSI architecture of the proposed deblocking algorithm for HD video processing is also presented in this paper. A memory-reduced architecture for a block buffer is used to optimize memory usage. The architecture of the proposed deblocking filter is prototyped on FPGA Cyclone II, and then we estimated performance when the filter is synthesized on ANAM 0.25 ${\mu}m$ CMOS cell library using Synopsys Design Compiler. Our experimental results show that our proposed algorithm effectively reduces block artifacts while preserving the details.