Closed a1eko closed 7 years ago
@lidakanari @eleftherioszisis Any comments on this? I believe the possibility of implementing this has been discussed recently.
Yes, indeed. This have been discussed and it will be implemented in a future version of NeuroM. However, the code is a bit more complicated than the one described by Alexander. Here is the corresponding paper: http://www.sciencedirect.com/science/article/pii/S0165027014000272
First of all, I would propose that we concentrate on the extraction of the data in the Sholl analysis function and we leave the plotting to the user (that will indeed be trivial).
Second, since Sholl analysis require the parsing of the tree for each circle in order to define the number of intersections, I would proposed an optimized approach: first define all the circles and then parse the tree once, calculating all intersections for all circles.
"...an optimized approach: first define all the circles and then parse the tree once, calculating all intersections for all circles." Yes, it will be linear in the number of points, n. I suppose same algorithm is used for touch detection as well! If not, it could be as slow as n^2.
Hello @a1eko,
I have added this feature in #570, and would appreciate it if you gave it a shot, and see if it works for your use case.
Thanks.
For compatibility with experimental data, a Sholl diagram is needed. Something like this: