寻找一维数组的连续数值波峰波谷

点云-激光雷达-Slam-三维牙齿

于 2023-04-11 14:56:11 发布

阅读量883

点赞数

分类专栏：其他文章标签： python numpy 算法

本文链接：https://blog.csdn.net/a394467238/article/details/130083932

版权

其他专栏收录该内容

66 篇文章 26 订阅 ¥29.90 ¥99.00

订阅专栏

本文探讨了一维数组中寻找连续数值构成的波峰和波谷问题。当波峰由多个相似值组成，而非单一值时，检测变得复杂。提供了一段示例代码来解决这个问题。

摘要由CSDN通过智能技术生成

如果一维数组中有波峰和波谷，但是波峰会持续好几个同样的数值或者差异很小而不是只有一个数值，波谷同理，要去寻找这种类型的波峰波谷就会有点难度，数据类似这种：

[0.         ,0.         ,0.         ,0.         ,0.         ,0.        ,
  0.         ,0.         ,0.         ,0.         ,0.         ,0.,
  0.         ,0.         ,0.         ,0.         ,0.         ,0.00167902,
  0.23939317 ,0.23939317 ,0.23939317 ,0.23939317 ,0.23939317 ,0.,
  0.         ,0.         ,0.         ,0.         ,0.         ,0.,
  0.2423835  ,0.2435938  ,0.24378107 ,0.24212517 ,0.04351635 ,0.,
  0.         ,0.         ,0.         ,0.00046742 ,0.2389589  ,0.24335814,
  0.24374051 ,0.2407499  ,0.04809693 ,0.         ,0.         ,0.,
  0.24143921 ,0.24343102 ,0.24376021 ,0.24200544 ,0.04404309 ,0.,
  0.         ,0.04849761 ,0.23886044 ,

了解本专栏