Performance of the familiarity algorithm.
收藏NIAID Data Ecosystem2026-03-09 收录
下载链接:
https://figshare.com/articles/dataset/_Performance_of_the_familiarity_algorithm_/1644814
下载链接
链接失效反馈官方服务:
资源简介:
A-C: Perfect memory (A), the mushroom body (B) and infomax (C) are evaluated for a segment of the route (triangles are grass blades) after training with ~80 images along this route. For test locations in 5cm displacements up to 25cm away from the trained image locations (on red line), all three familiarity algorithms are robust, recovering directions (arrows) that enable route following, but even ‘perfect’ memory can produce errors when not tested at an identical location to where the image was stored. D: Comparison of number of errors made by each algorithm when retracing a route (see Fig 1), compared to random choice of direction. Boxplots show the median, interquartile range and maximum and minimum results for 15 different routes, each ~8m long, with images stored every 10cm.
创建时间:
2016-03-16



