寻找分散的圈子 [英] Finding circles in scatter

问题描述

我正在使用传感器，并且已经收集了两个列表中表示的数据:

I am working with a sensor and I have collected data which represented in two lists:

filtered_x = [64, 90, 83, 78, 57, 58....]
filtered_y = [26, 17, 63, 21, 62, 86....]

其中给出了以下散点图:

Which gives the following scatter plot:

这是校准过程的一部分.为了完成此操作，我必须找到图中的圆圈，并提出圆圈中心的坐标，以便可以对传感器进行校准.我应该使用哪些库以及如何执行此操作?我遇到了最近的K个邻居，但找不到任何实际方法将其应用于两个列表以标识25个聚类的中心. LED板闪烁的结果是读数.

This is part of a calibration process. In order to complete this, I have to find the circles in the plot and come up with coordinates of the centers of the circles so the sensor can be calibrated. Which libraries should I use and how do I go about doing this? I have come across nearest K neighbor but I cannot find any practical approaches to applying this to both lists to identify the centers of the 25 clusters. The readings as a result of a flashing LED board.

推荐答案

使用内核密度估计(KDE)，并找到最大值.

Use kernel density estimation (KDE), and find maxima.

因为这是您要查找的最密集的位置.

Because that is what you want to find, the most dense locations.

这篇关于寻找分散的圈子的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！