首页> 外文期刊>Knowledge-Based Systems >Fast multi-class recognition of piecewise regular objects based on sequential three-way decisions and granular computing
【24h】

Fast multi-class recognition of piecewise regular objects based on sequential three-way decisions and granular computing

机译:基于顺序三路决策和粒度计算的分段常规对象的快速多类识别

获取原文
获取原文并翻译 | 示例

摘要

The paper is focused on an application of sequential three-way decisions and granular computing to the problem of multi-class statistical recognition of the objects, which can be represented as a sequence of independent homogeneous (regular) segments. As the segmentation algorithms usually make it possible to choose the degree of homogeneity of the features in a segment, we propose to associate each object with a set of such piecewise regular representations (granules). The coarse-grained granules stand for a low number of weakly homogeneous segments. On the contrary, a sequence with a large count of high-homogeneous small segments is considered as a fine-grained granule. During recognition, the sequential analysis of each granularity level is performed. The next level with the finer granularity is processed, only if the decision at the current level is unreliable. The conventional Chow's rule is used for a non-commitment option. The decision on each granularity level is proposed to be also sequential. The probabilistic rough set of the distance of objects from different classes at each level is created. If the distance between the query object and the next checked reference object is included in the negative region (i.e., it is less than a fixed threshold), the search procedure is terminated. Experimental results in face recognition with the Essex dataset and the state-of-theart HOG features are presented. It is demonstrated, that the proposed approach can increase the recognition performance in 2.5-6.5 times, in comparison with the conventional PHOG (pyramid HOG) method. (C) 2015 Elsevier B.V. All rights reserved.
机译:本文着重于将顺序三向决策和粒度计算应用于对象的多类统计识别问题,该问题可以表示为一系列独立的同质(规则)段。由于分割算法通常可以选择片段中特征的均匀度,因此我们建议将每个对象与一组此类分段规则表示(颗粒)相关联。粗粒颗粒代表少量的弱均质链段。相反,具有大量高度均匀的小片段的序列被认为是细颗粒。在识别期间,将对每个粒度级别进行顺序分析。仅当当前级别的决策不可靠时,才会处理具有更精细粒度的下一个级别。传统的Chow规则用于非承诺选项。建议在每个粒度级别上的决定也是顺序的。创建每个级别上不同类别对象的距离的概率粗集。如果查询对象与下一个检查的参考对象之间的距离包括在负区域中(即,它小于固定阈值),则搜索过程终止。介绍了使用Essex数据集和最新的HOG功能进行人脸识别的实验结果。结果表明,与传统的PHOG(金字塔HOG)方法相比,该方法可以将识别性能提高2.5-6.5倍。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号