基于鲁棒轨迹的密度估计几何结构恢复:理论与应用
Robust Trajectory-based Density Estimation for Geometric Structure Recovery: Theory and Applications
摘要:
随着物联网的兴起,有效处理大数据的策略对于发现有意义的见解至关重要。由互连设备组产生的时间序列数据集包含有价值的潜在模式。最近的工作已经从时空数据集中提取模式,以帮助道路网络生成,活动识别等。在这些应用中,底层几何重建的速度和精度是重要的。现有的方法,如核密度估计(KDE)已被使用,但往往是计算昂贵的。我们建议修改边四叉树,以利用其有效的层次结构。我们的修改使用新型轨迹计数函数来估计密度,该函数通过强制局部扰动的不变性来提供计数稳定性的数学保证。我们评估我们的方法的有效性,在提取底层几何和代表性的子样本点。为了验证,我们比较KDE的变种在提取的基础形状的嘈杂的合成轨迹沿形状。我们比较地图提取GPS跟踪对目前的方法。我们的方法显着提高了运行时间,同时更好地提取几何形状或至少是更好地提取几何形状。我们还比较了活动识别数据集上的最大最小子采样,并发现具有可比性能的显着运行时改进。
英文摘要:
With the rise of the Internet of Things, strategies for effectively processing big data are essential for discovering meaningul insights. The time series datasets produced by groups of interconnected devices contain valuable underlying patterns. Recent works have extracted patterns from spatio-temporal datasets to aid in road network generation, activity recognition, and others. The speed and accuracy of the underlying geometry reconstruction are important in these applications. Existing methods such as kernel density estimation (KDE) have been used but are often computationally expensive. We propose modifying edge quadtrees to utilize their effective heirarchical structure. Our modification estimates density using a novel trajectory count function which provides mathematical guarantees on the stability of the count by enforcing an invariance to local perturbations. We evaluate our method's effectiveness at extracting the underlying geometry and representative subsample points. For verification, we compare against a KDE variant at extracting the underlying shape of noisy synthetic trajectories travelling alonng the shape. We compare map extraction from GPS traces against current methods. Our method significantly improves runtime while extracting the geometry better or at least comparably. We also compare against maxmin subsampling on an activity recognition data set and find a significant runtime improvement with comparable performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。