检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机科学》2008年第9期248-251,288,共5页Computer Science
基 金:国家自然科学基金项目资助(项目编号:60573164)
摘 要:在移动对象数据库中需要存储大量移动对象的历史轨迹。为了降低存储开销,同时提高轨迹查询的效率,研究者们提出了很多基于时间序列的方法对轨迹序列进行压缩近似及索引。但是这些方法不能用于不精确的轨迹数据。本文针对含噪音的轨迹数据提出了一种新的近似算法。该方法充分利用了轨迹位置数据和速度数据的导数关系,在不增加计算复杂度的情况下,能够更好地处理不精确的轨迹。在相同的压缩比下,用双切比雪夫方法重建的轨迹比现有方法更加接近移动对象的真实轨迹。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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222