Abstract

The decision tree is one of the most effective tools for deriving meaningful outcomes from image data acquired from the visual sensors. Owing to its reliability, superior generalization abilities, and easy implementation, the tree model has been widely used in various applications. However, in image classification problems, conventional tree methods use only a few sparse attributes as the splitting criterion. Consequently, they suffer from several drawbacks in terms of performance and environmental sensitivity. To overcome these limitations, this paper introduces a new tree induction algorithm that classifies images on the basis of local area learning. To train our predictive model, we extract a random local area within the image and use it as a feature for classification. In addition, the self-organizing map, which is a clustering technique, is used for node learning. We also adopt a random sampled optimization technique to search for the optimal node. Finally, each trained node stores the weights that represent the training data and class probabilities. Thus, a recursively trained tree classifies the data hierarchically based on the local similarity at each node. The proposed tree is a type of predictive model that offers benefits in terms of image’s semantic energy conservation compared with conventional tree methods. Consequently, it exhibits improved performance under various conditions, such as noise and illumination changes. Moreover, the proposed algorithm can improve the generalization ability owing to its randomness. In addition, it can be easily applied to ensemble techniques. To evaluate the performance of the proposed algorithm, we perform quantitative and qualitative comparisons with various tree-based methods using four image datasets. The results show that our algorithm not only involves a lower classification error than the conventional methods but also exhibits stable performance even under unfavorable conditions such as noise and illumination changes.

Highlights

  • Over the past decade, the development and dissemination of low-cost commercial visual sensors has led to numerous research related to computer vision

  • We implemented nine different tree-based methods: C4.5 [27], trees constructed by information gain (UTCDT1) and gain ratio (UTCDT2) based on the unified

  • We proposed a new tree model and learning framework that learns information from local image areas for classification

Read more

Summary

Introduction

The development and dissemination of low-cost commercial visual sensors has led to numerous research related to computer vision. The decision tree is a one of renowned predictive model that analyzes data by recursive separation according to a certain splitting criterion. A decision tree model offers the advantage of high generalization at a relatively low computational cost for small-scale as well as large-scale data. It has exceptional and wide-ranging data interpretation capabilities. Each node contains the information of the best splitting attribute that is used as a criterion to identify unseen input data entering the tree. The following parameters are used as a splitting criterion to search for the best attribute: information gain, gain ratio, and the Gini impurity. Farid et al [29]

Methods
Results
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call