Ant-based clustering of visual-words for unsupervised human action recognition

Wang Kejun
{"title":"Ant-based clustering of visual-words for unsupervised human action recognition","authors":"Wang Kejun","doi":"10.1109/NABIC.2010.5716377","DOIUrl":null,"url":null,"abstract":"Ant-based clustering is a biologically-inspired computational heuristic that has been used in various domains for general clustering tasks. In this paper we propose its use as the tool for clustering high-dimensional vectors (visual words) which are descriptive features for human actions extracted from video sequences. This codebook generation stage is critical in the popular ‘Bag-of-Words’ framework in which a visual codebook is constructed on the statistics of various features in images or videos. K-means algorithm is widely used in this process but this has two major shortcomings namely: it requires user specification of input parameter k which can bias the algorithm and make it converge at a sub-optimal number of clusters. Also, optimal value of k needs to be determined empirically. Our method generates a codebook of highly descriptive spatio-temporal ‘words’ using ant-based clustering to determine the optimal number of clusters in the dataset. The number of clusters generated was set as the number of codewords for the vocabulary. The limitations of k-means were overcome with the robustness of ant-based clustering heuristic. This idea when applied to the benchmark KTH database produced codewords that produced a compact representation of human actions which gave the desired recognition result when compared to similar approach based on k-means clustering.","PeriodicalId":129539,"journal":{"name":"World Congress on Nature and Biologically Inspired Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Congress on Nature and Biologically Inspired Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NABIC.2010.5716377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Ant-based clustering is a biologically-inspired computational heuristic that has been used in various domains for general clustering tasks. In this paper we propose its use as the tool for clustering high-dimensional vectors (visual words) which are descriptive features for human actions extracted from video sequences. This codebook generation stage is critical in the popular ‘Bag-of-Words’ framework in which a visual codebook is constructed on the statistics of various features in images or videos. K-means algorithm is widely used in this process but this has two major shortcomings namely: it requires user specification of input parameter k which can bias the algorithm and make it converge at a sub-optimal number of clusters. Also, optimal value of k needs to be determined empirically. Our method generates a codebook of highly descriptive spatio-temporal ‘words’ using ant-based clustering to determine the optimal number of clusters in the dataset. The number of clusters generated was set as the number of codewords for the vocabulary. The limitations of k-means were overcome with the robustness of ant-based clustering heuristic. This idea when applied to the benchmark KTH database produced codewords that produced a compact representation of human actions which gave the desired recognition result when compared to similar approach based on k-means clustering.
基于蚁群的视觉词聚类在无监督人类行为识别中的应用
基于蚁群的聚类是一种受生物学启发的计算启发式算法,已被用于各种领域的一般聚类任务。在本文中,我们提出了将其用作聚类工具的高维向量(视觉词),这些向量是从视频序列中提取的人类行为的描述性特征。这个码本生成阶段在流行的“词袋”框架中是至关重要的,在这个框架中,视觉码本是基于图像或视频中各种特征的统计而构建的。k -means算法在此过程中被广泛使用,但它有两个主要缺点,即:它需要用户指定输入参数k,这可能会使算法产生偏差,并使其收敛于次优数量的聚类。同时,k的最优值需要经验确定。我们的方法使用基于蚁群的聚类来生成一个高度描述性时空“词”的码本,以确定数据集中的最佳聚类数量。生成的簇数被设置为词汇表的码字数。该算法的鲁棒性克服了k-means算法的局限性。当将这个想法应用到基准KTH数据库时,产生的码字产生了人类行为的紧凑表示,与基于k-means聚类的类似方法相比,它提供了所需的识别结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信