...
首页> 外文期刊>Pattern Analysis and Applications >An accurate HMM-based similarity measure between finite sets of histograms
【24h】

An accurate HMM-based similarity measure between finite sets of histograms

机译:有限直方图集之间基于HMM的精确相似度度量

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

获取外文期刊封面封底 >>

       

摘要

Histogram analysis has nowadays gain in interest, and a lot of work yet address this task. In most of the existing approaches, histograms are manipulated as simple vectors or as statistic distributions. As a consequence, only the bin values of the histograms are mostly considered and the histograms visual shapes are generally neglected. In this paper, hidden Markov models (HMMs) are associated with finite sets of histograms to capture both: the bin values and the visual shapes of the histograms contained in these sets, regardless of their bin sizes. The similarity rate between these HMMs isthen used to compare two finite sets of histograms. Experimented in several areas within and beyond machine learning, the proposed approach exhibited relevant performances which outperformed the existing work in the hierarchical classification of the databases GTZAN+ and Corel.
机译:直方图分析如今引起了人们的兴趣,并且许多工作尚未解决。在大多数现有方法中,将直方图作为简单矢量或统计分布进行处理。结果,仅主要考虑直方图的bin值,并且通常忽略直方图的视觉形状。在本文中,隐马尔可夫模型(HMM)与直方图的有限集合相关联,以捕获:箱值和这些集合中包含的直方图的可视形状,而不论它们的箱大小如何。然后,将这些HMM之间的相似率用于比较两个有限的直方图集。在机器学习内外的多个领域进行了实验,所提出的方法在GTZAN +和Corel数据库的分层分类中表现出了优于现有工作的相关性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号