期刊文献+

基于Min-Hash数据降维的伴随关系研究 被引量:1

Research of Accompany Relation Based on Min-Hash Data Dimensionality Reduction
下载PDF
导出
摘要 文中提出一种新的计算伴随关系(同行、同停留)的方法,该方法基于手机信号数据、人脸行踪和车辆记录等多源数据。首先,利用ID-MAPPING技术将多源数据统一关联到同一ID,实现数据融合;接着,采用min-Hash算法进行数据降维,降低运算量和存储空间;最后,利用分块Hash映射将具有相同轨迹特征片段的用户映射进同一个桶,计算时空相似度,得到具有相似时空序列的人员列表,从而生成伴随关系。实测数据表明:该方法在提高伴随关系准确度的同时,运行效率比传统方法提升了12倍。 We propose A new method,which combines cellphone signal tracks,human face-recognition,vehicle driving tracks and etc,to mine accompany relation(homogeneous movement and homogeneous stay).Firstly,the method employs ID-MAPPING technique to build connection among multiple data sources with a unique ID and thus bring data sources into integration.Secondly,the method performs data dimension reduction with the min-Hash algorithm and thus reduces the amount of computation and storage.Last,the method utilizes block Hash-Mapping strategy to map persons sharing identical track characteristic segment into a same bucket.Within the bucket,we generate pairwise relations and calculate space-time similarity of each relation.The method finally returns a list of persons sharing similar spacetime series and brings them into accompany relations,An empirical test shows that the method not only improves the accuracy of capturing the relations but also increases the computation efficiency 12 times more than that of traditional computation.
作者 黄晓雄 李博文 卢云亮 林璋 史超 陈伟 章武盛 HUANG Xiao-xiong;LI Bo-wen;LU Yun-liang;LIN Zhang;SHI Chao;CHEN Wei;ZHANG Wu-sheng(Guangzhou Itelligence Communieations Technology Co.,Ltd.,Guangzhou 510000,China)
出处 《中国电子科学研究院学报》 北大核心 2020年第10期984-988,共5页 Journal of China Academy of Electronics and Information Technology
基金 国家重点研发计划(2017YFC0820500)。
关键词 伴随关系 ID-MAPPING min-Hash 时空相似度 accompany relation ID-MAPPING min-Hash space-time similarity
  • 相关文献

参考文献6

二级参考文献54

  • 1张波,田蔚风,金志华.Joint tracking algorithm using particle filter and mean shift with target model updating[J].Chinese Optics Letters,2006,4(10):569-572. 被引量:12
  • 2Hiroaki Sakoe,Seibi Chiba.Dynamic Programming Algorithm Optimization for Spoken Word Recognition[J].IEEE Trans.On Acoustics,Speech,and Signal Processing,February 1978,26(1):43 -49.
  • 3Ran Yaniv and David Burshtein,Senior Member,IEEE.An Enhanced Dynamic Time Warping Model for Improved Estimation of DTW Programming[J].IEEE Trans.On Speech And Audio Processing,May 2003,11(3):216 -227.
  • 4Marco Dorigo and Luca Maria Gambardella,Ant colonies for the traveling salesman problem[J],Bio Systems,1997,43(2):73 -81.
  • 5M.Dorigo,G.Di Caro,The Ant Colony Optimization[A],New Meta-Heuristic,Proceedings of the Congress on Evolutionary Computation[C],London,UK,1999.11-32.
  • 6Yilmaz A, Javed O, and Shah M. Object tracking: a survey[J]. A CM Computing Surveys, 2006, 38(4): 13-58.
  • 7Vidal R and Ma Y. A unified algebraic approach to 2-d and 3-d motion segmentation[C]. European Conference on Computer Vision, Prague, Czech, 2004: 1-15.
  • 8Yilmaz A, Li X, and Shah M. Contour based object tracking with occlusion handling in video acquired using mobile cameras[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(11): 1531-1536.
  • 9Comaniciu D, Ramesh V, and Meer P. Kernel-based object tracking[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(5): 564-575.
  • 10Isard M and MacCormick J. BraMBLe: a Bayesian multiple- blob tracker[C]. IEEE International Conference on Computer Vision, Vancouver, Canada, 2001, 2: 34-41.

共引文献58

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部