Choi Jaesung, Song Eungyeol, Lee Sangyoun
Department of Electrical and Electronic Engineering, Yonsei University, Seoul 03722, Korea.
Sensors (Basel). 2018 Jan 20;18(1):306. doi: 10.3390/s18010306.
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.
决策树是从视觉传感器获取的图像数据中得出有意义结果的最有效工具之一。由于其可靠性、卓越的泛化能力和易于实现的特点,树模型已在各种应用中得到广泛使用。然而,在图像分类问题中,传统的树方法仅使用少数稀疏属性作为分裂标准。因此,它们在性能和环境敏感性方面存在几个缺点。为了克服这些限制,本文介绍了一种新的树归纳算法,该算法基于局部区域学习对图像进行分类。为了训练我们的预测模型,我们在图像中提取一个随机局部区域,并将其用作分类特征。此外,作为一种聚类技术的自组织映射用于节点学习。我们还采用随机采样优化技术来搜索最优节点。最后,每个经过训练的节点存储表示训练数据和类别概率的权重。因此,一个经过递归训练的树根据每个节点处的局部相似性对数据进行分层分类。与传统树方法相比,所提出的树是一种预测模型,在图像的语义能量守恒方面具有优势。因此,它在各种条件下,如噪声和光照变化下,都表现出改进的性能。此外,所提出的算法由于其随机性可以提高泛化能力。此外,它可以很容易地应用于集成技术。为了评估所提出算法的性能,我们使用四个图像数据集与各种基于树的方法进行定量和定性比较。结果表明,我们的算法不仅比传统方法具有更低的分类误差,而且即使在噪声和光照变化等不利条件下也表现出稳定的性能。