整数的数据压缩算法 [英] Data compression algorithm for integers

问题描述

我正在尝试学习插值压缩，但我找不到插值压缩的任何示例或算法。任何人都可以帮助我了解插值压缩。谢谢。



我尝试了什么：



我读了几个研究出版物可以在谷歌上找到。

解决方案

也许卡尔曼过滤可能是您感兴趣的：卡尔曼过滤演示 [ ^ ]

发现于：如何减少一系列数据点的数量？ - 交叉验证 [ ^ ]

Quote：

calculate两个点之间的距离，其公式如

d = sqrt（（time1-time2）^ 2 +（bpm1-bpm2））。

您在程序中设置最小距离。然后你遍历你的数据并在每一点之后你删除所有后续点，其中d小于你的最小距离。

由于时间单位和bpm不一样你可能想要思考关于如何找到一种有意义地扩展单位的方法。

这看起来也很有趣： Ramer-Douglas-Peucker算法 - 维基百科 [ ^ ]

I am trying to learn about Interpolation compression but I couldn't find any example or algorithm for interpolation compression. Can any one help me to get an idea about interpolation compression. Thanks.

What I have tried:

I have read couple research publications which are available on google.

解决方案

Maybe Kalman filtering might be of interest to you: Kalman filtering demo[^]

Found this at: How do I reduce the number of data points in a series? - Cross Validated[^]

Quote:

calculate the distance between two points with a formula like
d=sqrt((time1-time2)^2 + (bpm1-bpm2)).
You set a minimum distance in your program. Then you iterate through your data and after every point you delete all following points for which d is smaller than your minimum distance.
As the unit of time and bpm isn't the same you might want to think about how you can find a way to scale the units meaningfully.

This looks interesting too: Ramer–Douglas–Peucker algorithm - Wikipedia[^]

这篇关于整数的数据压缩算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！