I have been trying to implement BSA in Python and looks like the algorithm is pretty confusing. Has anyone implemented this algorithm? Any language.
The paper can be found here -> http://users.elis.ugent.be/~bschrauw/publicaties/ijcnn.pdf
Thanks.
Regards,
Akshay.
Update:
I have implemented the BSA algorithm here -> https://github.com/akshaybabloo/Spikes. If anyone needs it, please feel free to fork it.
https://github.com/akshaybabloo/Spikes
Akshay,
I've only skimmed the article linked to. Writing the algorithm appearing in Fig 7 in python is simple enough provided one has the input and filter arrays filled. Would such a code be useful to you?
.
i have not implemented it myself but it should not be too hard to find help in your close environment !
see this fine thesis done under the direction of Prof. Nikola Kasabov ... from AUT isn't it ?
http://aut.researchgateway.ac.nz/bitstream/handle/10292/5398/NuntalidN2.pdf?sequence=4
(nice explanation of the algorithm p124+)
good luck
.
@Fabrice Ya Nuttapod did not implement it. He just explained it. Prof. Kasabov is my supervisor as well. But I just wanted to know if anyone implemented personally. I'll go through the thesis, though. Thanks.
@Paul Ya in a way, but it's only a pseudo code, but an actual implementation would be better.
Where did you guys get the filter array for BSA from? This data is not given in the original paper, it is only plotted in a figure.
okay, I've already extracted it out of the figure manually. Not recommended. Does anyone have more exact values?
@Dorian this is how I implemented the filter -> https://github.com/akshaybabloo/Spikes/blob/master/spikes/encoder.py#L122-L152
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Algorithms