• Title/Summary/Keyword: classification algorithm

Search Result 2,909, Processing Time 0.032 seconds

Study on Classification of Fog Type based on Its Generation Mechanism and Fog Predictability Using Empirical Method (경험적 방법을 통한 발생학적 한반도 안개 구분과 안개 발생 예측가능성 연구)

  • Lee, Hyun-Dong;Ahn, Joong-Bae
    • Atmosphere
    • /
    • v.23 no.1
    • /
    • pp.103-112
    • /
    • 2013
  • In this study, we developed a fog classification algorithm to classify fog type based on fog generation mechanism. For the analysis period of 1986-2005, 15,748 fog events had been reported from the 40 observational sites in South Korea. Thus, practically, it is almost impossible to individually classify the fog type of the whole fog events occurred in South Korea manually. In this study, the characteristics of fog during the research period were investigated and the fog classification flowchart were developed base on the analysis, and the fog classification algorithm was applied for the classification of fogs occurred at the observational sites. Finally, the classified fog-type and hindcasted fog occurance results obtained from the flowchart were evaluated for verification.

Pattern Classification with the Analog Cellular Parallel Processing Networks (아날로그 셀룰라 병렬 처리 회로망(CPPN)을 이용한 Pattern Classification)

  • 오태완;이혜정;김형석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2367-2370
    • /
    • 2003
  • A fast pattern classification algorithm with Cellular Parallel Processing Network-based dynamic programming is proposed. The Cellular Parallel Processing Networks is an analog parallel processing architecture and the dynamic programming is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast Pattern classification with optimization is formed. On such CPPN-based dynamic programming, if exemplars and test patterns are presented as the goals and the start positions, respectively, the optimal paths from test patterns to their closest exemplars are found. Such paths are utilized as aggregating keys for the classification. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

  • PDF

Soft Computing Optimized Models for Plant Leaf Classification Using Small Datasets

  • Priya;Jasmeen Gill
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.8
    • /
    • pp.72-84
    • /
    • 2024
  • Plant leaf classification is an imperative task when their use in real world is considered either for medicinal purposes or in agricultural sector. Accurate identification of plants is, therefore, quite important, since there are numerous poisonous plants which if by mistake consumed or used by humans can prove fatal to their lives. Furthermore, in agriculture, detection of certain kinds of weeds can prove to be quite significant for saving crops against such unwanted plants. In general, Artificial Neural Networks (ANN) are a suitable candidate for classification of images when small datasets are available. However, these suffer from local minima problems which can be effectively resolved using some global optimization techniques. Considering this issue, the present research paper presents an automated plant leaf classification system using optimized soft computing models in which ANNs are optimized using Grasshopper Optimization algorithm (GOA). In addition, the proposed model outperformed the state-of-the-art techniques when compared with simple ANN and particle swarm optimization based ANN. Results show that proposed GOA-ANN based plant leaf classification system is a promising technique for small image datasets.

Object Classification Method Using Dynamic Random Forests and Genetic Optimization

  • Kim, Jae Hyup;Kim, Hun Ki;Jang, Kyung Hyun;Lee, Jong Min;Moon, Young Shik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.5
    • /
    • pp.79-89
    • /
    • 2016
  • In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees.

A Study on the Performance of Parallelepiped Classification Algorithm (평행사변형 분류 알고리즘의 성능에 대한 연구)

  • Yong, Whan-Ki
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.4 no.4
    • /
    • pp.1-7
    • /
    • 2001
  • Remotely sensed data is the most fundamental data in acquiring the GIS informations, and may be analyzed to extract useful thematic information. Multi-spectral classification is one of the most often used methods of information extraction. The actual multi-spectral classification may be performed using either supervised or unsupervised approaches. This paper analyze the effect of assigning clever initial values to image classes on the performance of parallelepiped classification algorithm, which is one of the supervised classification algorithms. First, we investigate the effect on serial computing model, then expand it on MIMD(Multiple Instruction Multiple Data) parallel computing model. On serial computing model, the performance of the parallel pipe algorithm improved 2.4 times at most and, on MIMD parallel computing model the performance improved about 2.5 times as clever initial values are assigned to image class. Through computer simulation we find that initial values of image class greatly affect the performance of parallelepiped classification algorithms, and it can be improved greatly when classes on both serial computing model and MIMD parallel computation model.

  • PDF

Two-dimensional Binary Search Tree for Packet Classification at Internet Routers (인터넷 라우터에서의 패킷 분류를 위한 2차원 이진 검색 트리)

  • Lee, Goeun;Lim, Hyesook
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.21-31
    • /
    • 2015
  • The Internet users want to get real-time services for various multi-media applications. Network traffic rate has been rapidly increased, and data amounts that the Internet has to carry have been exponentially increased. A packet is the basic unit in transferring data at the Internet, and packet classification is one of the most challenging functionalities that routers should perform at wire-speed. Among various known packet classification algorithms, area-based quad-trie (AQT) algorithm is one of the efficient algorithms which can lookup five header fields simultaneously. As a representative space decomposition algorithm, the AQT requires a small amount of memory in storing classification rules, but it does not provide high-speed classification performance. In this paper, we propose a new packet classification algorithm by applying a binary search for the codewords of the AQT to overcome the issue of the AQT. Throughout simulation, it is shown that the proposed algorithm provides a better performance than the AQT in the number of rule comparisons with each input packet.

The Development of the Vehicles Information Detector (Al 기법을 이용한 차량 정보 수집 장비 개발)

  • Moon, Hak-Yong;Ryu, Seung-Ki;Kim, Young-Chun;Byeon, Sang-Cheol;Choi, Do-Hyuk
    • Proceedings of the KIEE Conference
    • /
    • 2002.07b
    • /
    • pp.1283-1285
    • /
    • 2002
  • This study is developed vehicle information detector using loop and piezo sensors. This study would analyze the over all problems concerning our road conditions, environmental matters and unique features of our traffic matters; moreover, with these it would develope the hardware, software, car classification algorithm applied by artificial intelligence and traffic monitoring program which can be easily fixed. This can be divided into traffic detecting algorithm and car classification algorithm. Especially, we have developed the car classification algorithm used by C-means Fuzzy Clustering method.

  • PDF

Performance Comparison of Algorithm through Classification of Parkinson's Disease According to the Speech Feature (음성 특징에 따른 파킨슨병 분류를 위한 알고리즘 성능 비교)

  • Chung, Jae Woo
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.2
    • /
    • pp.209-214
    • /
    • 2016
  • The purpose of this study was to classify healty persons and Parkinson disease patients from the vocal characteristics of healty persons and the of Parkinson disease patients using Machine Learning algorithms. So, we compared the most widely used algorithms for Machine Learning such as J48 algorithm and REPTree algorithm. In order to evaluate the classification performance of the two algorithms, the results were compared with depending on vocal characteristics. The classification performance of depending on vocal characteristics show 88.72% and 84.62%. The test results showed that the J48 algorithms was superior to REPTree algorithms.

Number Recognition Using Accelerometer of Smartphone (스마트폰 가속도 센서를 이용한 숫자인식)

  • Bae, Seok-Chan;Kang, Bo-Gyung
    • Journal of The Korean Association of Information Education
    • /
    • v.15 no.1
    • /
    • pp.147-154
    • /
    • 2011
  • In this Paper, we suggest the effective pre-correction algorithm on sensor values and the classification algorithm for gesture recognition that use values for each axis of the accelerometer to send data(a number or specific input data) to device. we know that creation of reliable preprocessed data in experimental results through the error rate of X-Axis and Y-Axis for pre-correction and post-correction. we can show high recognition rate through recognizer using the normalization and classification algorithm for the preprocessed data.

  • PDF

Recognize Handwritten Urdu Script Using Kohenen Som Algorithm

  • Khan, Yunus;Nagar, Chetan
    • International Journal of Ocean System Engineering
    • /
    • v.2 no.1
    • /
    • pp.57-61
    • /
    • 2012
  • In this paper we use the Kohonen neural network based Self Organizing Map (SOM) algorithm for Urdu Character Recognition. Kohenen NN have more efficient in terms of performance as compare to other approaches. Classification is used to recognize hand written Urdu character. The number of possible unknown character is reducing by pre-classification with respect to subset of the total character set. So the proposed algorithm is attempt to group similar character. Members of pre-classified group are further analyzed using a statistical classifier for final recognition. A recognition rate of around 79.9% was achieved for the first choice and more than 98.5% for the top three choices. The result of this paper shows that the proposed Kohonen SOM algorithm yields promising output and feasible with other existing techniques.