检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学数字技术及仪器研究所,杭州310027
出 处:《吉林大学学报(工学版)》2009年第6期1618-1624,共7页Journal of Jilin University:Engineering and Technology Edition
基 金:"863"国家高技术研究发展计划项目(2003AA1Z2130);浙江省重大科技攻关项目(2005C11001-02)
摘 要:针对智能视觉监控系统中的运动目标轨迹分类问题,提出了一种基于多维Hausdorff距离的轨迹聚类算法。该算法使用流矢量序列描述目标运动轨迹,由多维Hausdorff距离进行轨迹相似性测量,通过谱聚类实现轨迹分类。该算法在轨迹描述中同时包含位置和方向信息,解决了Hausdorff距离不能区分轨迹运动方向的问题。为降低计算复杂度,本文还提出一种保距变换对轨迹相似性测量进行优化。与相关算法的对比实验表明,提出的轨迹分类算法可达到更高的聚类准确率;提出的保距变换可以显著降低算法的计算复杂度。A trajectory clustering algorithm based on multi-dimensional Hausdorff distance is proposed for classification of trajectories of moving objects in intelligent visual surveillance system.First,the trajectory of a moving object is described using a sequence of flow vectors.Then the similarity between trajectories is measured by their respective multi-dimensional Hausdorff distances.Finally,the trajectories are clustered by the spectral clustering algorithm.The proposed algorithm is different from other schemes using Hausdorff distance that it includes both the position and direction information in the flow vectors;hence it can distinguish the trajectories in different directions.A distance preserving transformation is also proposed to reduce the computational complexity of the similarity measure.Experimental results show that,comparing with other algorithm,the clustering accuracy of the proposed algorithm is better,and the proposed distance preserving transformation can greatly reduce the computational cost.
关 键 词:人工智能 轨迹分类 HAUSDORFF距离 谱聚类 保距变换
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222