期刊文献+

用双切比雪夫方法近似含噪音移动对象轨迹

Approximating Inaccurate Moving Object Trajectories with Bi-chebyshev Method
下载PDF
导出
摘要 在移动对象数据库中需要存储大量移动对象的历史轨迹。为了降低存储开销,同时提高轨迹查询的效率,研究者们提出了很多基于时间序列的方法对轨迹序列进行压缩近似及索引。但是这些方法不能用于不精确的轨迹数据。本文针对含噪音的轨迹数据提出了一种新的近似算法。该方法充分利用了轨迹位置数据和速度数据的导数关系,在不增加计算复杂度的情况下,能够更好地处理不精确的轨迹。在相同的压缩比下,用双切比雪夫方法重建的轨迹比现有方法更加接近移动对象的真实轨迹。 Approximating and compressing inaccurate moving object trajectories is a key topic in moving object database research. This paper proposes a new method, called Bi-Chebyshev, to solve the problem. Different from existing methods, the Bi-Chebyshev method makes use of velocity data as subsidiary information to improve the accuracy of trajectory approximation. The method is based on a quadratic optimization model, to which a numerical solution is provided. In experimental comparison, the Bi-Chebyshev method demonstrates its superiority in both reconstruction accuracy and robustness against noise. The feature coefficients generated by Bi-Chebyshev transformation can be used for indexing purpose in the same way as in other methods. The complexity of computing Bi-Chebyshev coefficients is quadratic on the number of coefficients and linear on the length trajectory data, comparable to other global methods.
出处 《计算机科学》 CSCD 北大核心 2008年第9期248-251,288,共5页 Computer Science
基金 国家自然科学基金项目资助(项目编号:60573164)
关键词 移动对象轨迹 近似 噪音 切比雪夫多项式 Moving object trajectory, Approximation, Noise, Chebyshev polynomials
  • 相关文献

参考文献11

  • 1Ding Zhiming, Guting R H. Managing Moving Objects on Dynamic Transportation NetworksffProe. the 16th Int. Cord. Science and Statistical Database Management. Santorini, Greece, 2004 : 287-296
  • 2Faloutsos C, Ranganathan M, Manolopoulos Y. Fast subsequence matching in time-Series databases//Proc the Int. Conf. Management of Data. Minneapolis,Minnesota,USA,1994:412-429
  • 3Rafiei D, Mendelzon A. Similarity-based queries for time series data//Proc, the Int. Conf. Management of Data. Tucson, Arizona,USA, 1997: 13-25
  • 4Chan K P, Fu A W C. Efficient time series matching by wavelets //Proc. the 15th Int. Conf. Data Engineering. Sydney,Australia, 1999:126-133
  • 5Chakrabarti K, Garofalakis M, Rastogi R, et al. Approximate query processing using wavelets//Proc, the 26th Int. Conf. Very Large Data Bases Conference. Cairo, Egypt, 2000:111-122
  • 6Guha S, Harb B. Approximation algorithms for wavelet transform coding of data strearns//Proc, the 17th Annual ACM-SIAM Symposium on Discrete Algorithm. Miami, Florida, USA, 2003:698-707
  • 7Cai Y H, Ng R. Indexing spatio-temporal trajectories with Chebyshev polynomials//Proc. Int. Conf. Management of Data. Paris, France, 2004 : 599-610
  • 8Keogh E, Chakrabarti K, Pazzani M, et al. Dimensionality reduction technique for fast similarity search in large time series databases. Journal of Knowledge and Information Systems, 2001,3 (3) :263-286
  • 9Keogh E, Chakrabarti K, Pazzani M, et al. Locally adaptive dimensionality reduction for indexing large time series databases //Proc. Int. Conf. Management of Data. Santa Barbara, California, USA, 2001 : 151-162
  • 10Press W H, Flannery B P, Teukolsky S A, et al. Numerical Recipes: The Art of Scientific Computing. 2nd Edition. Cambridge University Press, 1994

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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