• Title/Summary/Keyword: Classification for Each

Search Result 3,936, Processing Time 0.028 seconds

A Rule-based Urban Image Classification System for Time Series Landsat Data

  • Lee, Jin-A;Lee, Sung-Soon;Chi, Kwang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.6
    • /
    • pp.637-651
    • /
    • 2011
  • This study presents a rule-based urban image classification method for time series analysis of changes in the vicinity of Asan-si and Cheonan-si in Chungcheongnam-do, using Landsat satellite images (1991-2006). The area has been highly developed through the relocation of industrial facilities, land development, construction of a high-speed railroad, and an extension of the subway. To determine the yearly changing pattern of the urban area, eleven classes were made depending on the trend of development. An algorithm was generalized for the rules to be applied as an unsupervised classification, without the need of training area. The analysis results show that the urban zone of the research area has increased by about 1.53 times, and each correlation graph confirmed the distribution of the Built Up Index (BUI) values for each class. To evaluate the rule-based classification, coverage and accuracy were assessed. When Optimal allowable factor=0.36, the coverage of the rule was 98.4%, and for the test using ground data from 1991 to 2006, overall accuracy was 99.49%. It was confirmed that the method suggested to determine the maximum allowable factor correlates to the accuracy test results using ground data. Among the multiple images, available data was used as best as possible and classification accuracy could be improved since optimal classification to suit objectives was possible. The rule-based urban image classification method is expected to be applied to time series image analyses such as thematic mapping for urban development, urban development, and monitoring of environmental changes.

Calculation and Regulation Proposal of Light Pollution from Road Lightings (도로조명의 빛공해 계산 및 규제안 제안)

  • Cho, Sook-Hyun;Lee, Min-Wook;Choi, Hyeon-Seok;Kim, Hoon
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.25 no.12
    • /
    • pp.21-26
    • /
    • 2011
  • This is a study to establish regulations against light pollution for lighting on roads. Many kinds of light pollution by luminaire on roads was calculated and analyzed by applying the classification method of luminaires(Cut-off classification of IDA-IESNA, BUG Rating Classification) and the calculation method of Upward Lighting Ratio of CIE among measures to prevent light pollution that international lighting organizations suggest. As a result of the analysis, it was found that the regulation by Cutoff of IESNA and ULR classification of CIE could be one for scattered light of light pollution compared to BUG classification but is not sufficient for the regulation of light tresspass or glare. BUG classification by each lighting zone was suggested as threshold value of the light pollution regulation considering domestic conditions.

Optimization of Domain-Independent Classification Framework for Mood Classification

  • Choi, Sung-Pil;Jung, Yu-Chul;Myaeng, Sung-Hyon
    • Journal of Information Processing Systems
    • /
    • v.3 no.2
    • /
    • pp.73-81
    • /
    • 2007
  • In this paper, we introduce a domain-independent classification framework based on both k-nearest neighbor and Naive Bayesian classification algorithms. The architecture of our system is simple and modularized in that each sub-module of the system could be changed or improved efficiently. Moreover, it provides various feature selection mechanisms to be applied to optimize the general-purpose classifiers for a specific domain. As for the enhanced classification performance, our system provides conditional probability boosting (CPB) mechanism which could be used in various domains. In the mood classification domain, our optimized framework using the CPB algorithm showed 1% of improvement in precision and 2% in recall compared with the baseline.

Method for classification and delimitation of forest cover using IKONOS imagery

  • Lee, W.K.;Chong, J.S.;Cho, H.K.;Kim, S.W.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.198-200
    • /
    • 2003
  • This study proved if the high resolution satellite imagery of IKONOS is suitable for preparing digital forest cover map. Three methods, the pixel based classification with maximum likelihood (PML), the segment based classification with majority principle(SMP), and the segment based classification with maximum likelihood(SML), were applied to classify and delimitate forest cover of IKONOS imagery taken in May 2000 in a forested area in the central Korea. The segment-based classification was more suitable for classifying and deliminating forest cover in Korea using IKONOS imagery. The digital forest cover map in which each class is delimitated in the form of a polygon can be prepared on the basis of the segment-based classification.

  • PDF

Filtering Effect in Supervised Classification of Polarimetric Ground Based SAR Images

  • Kang, Moon-Kyung;Kim, Kwang-Eun;Cho, Seong-Jun;Lee, Hoon-Yol;Lee, Jae-Hee
    • Korean Journal of Remote Sensing
    • /
    • v.26 no.6
    • /
    • pp.705-719
    • /
    • 2010
  • We investigated the speckle filtering effect in supervised classification of the C-band polarimetric Ground Based SAR image data. Wishart classification method was used for the supervised classification of the polarimetric GB-SAR image data and total of 6 kinds of speckle filters were applied before supervised classification, which are boxcar, Gaussian, Lopez, IDAN, the refined Lee, and the refined Lee sigma filters. For each filters, we changed the filtering kernel size from $3{\times}3$ to $9{\times}9$ to investigate the filtering size effect also. The refined Lee filter with the kernel size of bigger than $5{\times}5$ showed the best result for the Wishart supervised classification of polarimetric GB-SAR image data. The result also showed that the type of trees could be discriminated by Wishart supervised classification of polarimetric GB-SAR image data.

Classification of Korean Character Type using Multi Neural Network and Fuzzy Inference based on Block Partition for Each Type (형식별 블럭분할에 기초한 다중신경망과 퍼지추론에 의한 한글 형식분류)

  • Pyeon, Seok-Beom;Park, Jong-An
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.4
    • /
    • pp.5-11
    • /
    • 1994
  • In this paper, the ciassification of Korean character type using multi neural network and fuzzy inference based on block partition is studied. For the effective classification of a consonant and a vowel, block partition method which devide the region of a consonant and a vowel for each type in the character is proposed. And the partitioned block can be changed according to the each type adaptively. For the improvement of classification rate, the multi neural network with a whole and a part neural network is consisted, and the character type by using fuzzy inference is decided. To verify the validity of the proposed method, computer simulation is accomplished, and from the classification rate $92.6\%$, the effectivity of the method is confirmed.

  • PDF

A Clustering Approach for Feature Selection in Microarray Data Classification Using Random Forest

  • Aydadenta, Husna;Adiwijaya, Adiwijaya
    • Journal of Information Processing Systems
    • /
    • v.14 no.5
    • /
    • pp.1167-1175
    • /
    • 2018
  • Microarray data plays an essential role in diagnosing and detecting cancer. Microarray analysis allows the examination of levels of gene expression in specific cell samples, where thousands of genes can be analyzed simultaneously. However, microarray data have very little sample data and high data dimensionality. Therefore, to classify microarray data, a dimensional reduction process is required. Dimensional reduction can eliminate redundancy of data; thus, features used in classification are features that only have a high correlation with their class. There are two types of dimensional reduction, namely feature selection and feature extraction. In this paper, we used k-means algorithm as the clustering approach for feature selection. The proposed approach can be used to categorize features that have the same characteristics in one cluster, so that redundancy in microarray data is removed. The result of clustering is ranked using the Relief algorithm such that the best scoring element for each cluster is obtained. All best elements of each cluster are selected and used as features in the classification process. Next, the Random Forest algorithm is used. Based on the simulation, the accuracy of the proposed approach for each dataset, namely Colon, Lung Cancer, and Prostate Tumor, achieved 85.87%, 98.9%, and 89% accuracy, respectively. The accuracy of the proposed approach is therefore higher than the approach using Random Forest without clustering.

Spherical Signature Description of 3D Point Cloud and Environmental Feature Learning based on Deep Belief Nets for Urban Structure Classification (도시 구조물 분류를 위한 3차원 점 군의 구형 특징 표현과 심층 신뢰 신경망 기반의 환경 형상 학습)

  • Lee, Sejin;Kim, Donghyun
    • The Journal of Korea Robotics Society
    • /
    • v.11 no.3
    • /
    • pp.115-126
    • /
    • 2016
  • This paper suggests the method of the spherical signature description of 3D point clouds taken from the laser range scanner on the ground vehicle. Based on the spherical signature description of each point, the extractor of significant environmental features is learned by the Deep Belief Nets for the urban structure classification. Arbitrary point among the 3D point cloud can represents its signature in its sky surface by using several neighborhood points. The unit spherical surface centered on that point can be considered to accumulate the evidence of each angular tessellation. According to a kind of point area such as wall, ground, tree, car, and so on, the results of spherical signature description look so different each other. These data can be applied into the Deep Belief Nets, which is one of the Deep Neural Networks, for learning the environmental feature extractor. With this learned feature extractor, 3D points can be classified due to its urban structures well. Experimental results prove that the proposed method based on the spherical signature description and the Deep Belief Nets is suitable for the mobile robots in terms of the classification accuracy.

Support Vector Machine Based Phoneme Segmentation for Lip Synch Application

  • Lee, Kun-Young;Ko, Han-Seok
    • Speech Sciences
    • /
    • v.11 no.2
    • /
    • pp.193-210
    • /
    • 2004
  • In this paper, we develop a real time lip-synch system that activates 2-D avatar's lip motion in synch with an incoming speech utterance. To realize the 'real time' operation of the system, we contain the processing time by invoking merge and split procedures performing coarse-to-fine phoneme classification. At each stage of phoneme classification, we apply the support vector machine (SVM) to reduce the computational load while retraining the desired accuracy. The coarse-to-fine phoneme classification is accomplished via two stages of feature extraction: first, each speech frame is acoustically analyzed for 3 classes of lip opening using Mel Frequency Cepstral Coefficients (MFCC) as a feature; secondly, each frame is further refined in classification for detailed lip shape using formant information. We implemented the system with 2-D lip animation that shows the effectiveness of the proposed two-stage procedure in accomplishing a real-time lip-synch task. It was observed that the method of using phoneme merging and SVM achieved about twice faster speed in recognition than the method employing the Hidden Markov Model (HMM). A typical latency time per a single frame observed for our method was in the order of 18.22 milliseconds while an HMM method applied under identical conditions resulted about 30.67 milliseconds.

  • PDF

Mapping the Terms of Medicinal Material and Formula Classification to International Standard Terminology

  • Kim, Jin-Hyun;Kim, Chul;Yea, Sang-Jun;Jang, Hyun-Chul;Kim, Sang-Kyun;Kim, Young-Eun;Kim, Chang-Seok;Song, Mi-Young
    • International Journal of Contents
    • /
    • v.7 no.4
    • /
    • pp.108-115
    • /
    • 2011
  • The current study aims to analyze the acceptance of International Standard Terminology (IST) related to herbs and formulas used in Korea. It also intends to examine limitations of each term source by linking texts for herbal medicine research and formula research used in schools of oriental medicine with medicinal substance-formula classification names within the IST framework. This study examined 64 medicinal classification names of IST, including synonyms, 41 formula classification names, 65 classification names of "Herbal Medicine Study," 89 medicinal classification names of "Shin's Clinical Herbal Medicine Study," and lastly 83 formula classification names of "Formula Study." Data on their chief virtue, efficacy and characteristics as medicinal substances were extracted from their definitions, and such data were used to perform Chinese character-English mapping using the IST. The outcomes of the mapping were then analyzed in terms of both lexical matching and semantic matching. In terms of classification names for medicinal substances, "Herbal Medicine Study" had 60.0% lexical matching, whereas "Shin's Clinical Herbal Medicine Study" had 48.3% lexical matching. When semantic matching was also applied, "Herbal Medicine Study" showed a value of 87.7% and "Shin's Clinical Herbal Medicine Study" 74.2%. In terms of formula classification names, lexical matching was 28.9% of 83 subjects, and when semantic matching was also considered, the value was 30.1%. When the conceptual elements of this study were applied, some IST terms that are classified with other codes were found to be conceptually consistent, and some terms were not accepted due to different depths in the classification systems of each source.