首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >L-Tree: A Local-Area-Learning-Based Tree Induction Algorithm for Image Classification
【2h】

L-Tree: A Local-Area-Learning-Based Tree Induction Algorithm for Image Classification

机译:L树:一种基于局部学习的树归纳算法进行图像分类

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

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.
机译:决策树是从视觉传感器获取的图像数据中得出有意义结果的最有效工具之一。由于其可靠性,出色的泛化能力和易于实现的特性,树模型已被广泛应用于各种应用中。然而,在图像分类问题中,常规的树方法仅使用一些稀疏属性作为分割标准。因此,它们在性能和环境敏感性方面遭受若干缺点。为了克服这些限制,本文引入了一种新的树归纳算法,该算法基于局部学习对图像进行分类。为了训练我们的预测模型,我们提取图像中的随机局部区域并将其用作分类的特征。另外,作为聚类技术的自组织图被用于节点学习。我们还采用随机采样的优化技术来搜索最佳节点。最后,每个受训练的节点都存储代表训练数据和类别概率的权重。因此,递归训练树根据每个节点的局部相似性对数据进行分层分类。提出的树是一种预测模型,与传统的树方法相比,它在图像的语义能量守恒方面具有优势。因此,在各种条件下,例如噪声和照度变化,它表现出改进的性能。此外,该算法具有随机性,可以提高泛化能力。此外,它可以轻松地应用于集成技术。为了评估所提出算法的性能,我们使用四个基于图像的数据集,对各种基于树的方法进行了定量和定性的比较。结果表明,我们的算法不仅比传统方法具有更低的分类误差,而且即使在不利条件下(例如噪声和光照变化)也表现出稳定的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号