Self-Organizing Map With Time-Varying Structure to Plan and Control Artificial Locomotion

Detecting and Tracking of Multiple Mice Using Part Proposal Networks

The study of mouse social behaviors has been increasingly undertaken in neuroscience research. However, automated quantification of mouse behaviors from the videos of interacting mice is still a challenging problem, where object tracking plays a key role in locating mice in their living spaces. Artificial markers are often applied for multiple mice tracking, which are intrusive and consequently interfere with the movements of mice in a dynamic environment. In this article, we propose a novel method to continuously track several mice and individual parts without requiring any specific tagging. First, we propose an efficient and robust deep-learning-based mouse part detection scheme to generate part candidates. Subsequently, we propose a novel Bayesian-inference integer linear programming (BILP) model that jointly assigns the part candidates to individual targets with necessary geometric constraints while establishing pair-wise association between the detected parts. There is no publicly available dataset in the research community that provides a quantitative test bed for part detection and tracking of multiple mice, and we here introduce a new challenging Multi-Mice PartsTrack dataset that is made of complex behaviors. Finally, we evaluate our proposed approach against several baselines on our new datasets, where the results show that our method outperforms the other state-of-the-art approaches in terms of accuracy. We also demonstrate the generalization ability of the proposed approach on tracking zebra and locust.

A full-parallel implementation of Self-Organizing Maps on hardware

Self-Organizing Maps (SOMs) are extensively used for data clustering and dimensionality reduction. However, if applications are to fully benefit from SOM based techniques, high-speed processing is demanding, given that data tends to be both highly dimensional and yet "big". Hence, a fully parallel architecture for the SOM is introduced to optimize the system's data processing time. Unlike most literature approaches, the architecture proposed here does not contain sequential steps - a common limiting factor for processing speed. The architecture was validated on FPGA and evaluated concerning hardware throughput and the use of resources. Comparisons to the state of the art show a speedup of 8.91× over a partially serial implementation, using less than 15% of hardware resources available. Thus, the method proposed here points to a hardware architecture that will not be obsolete quickly.

Self-Organizing Neuroevolution for Solving Carpool Service Problem With Dynamic Capacity to Alternate Matches

Traffic congestion often incurs environmental problems. One of the most effective ways to mitigate this is carpooling transportation, which substantially reduces automobile demands. Due to the popularization of smartphones and mobile applications, a carpool service can be conveniently accessed via the intelligent carpool system. In this system, the service optimization required to intelligently and adaptively distribute the carpool participant resources is called the carpool service problem (CSP). Several previous studies have examined viable and preliminary solutions to the CSP by using exact and metaheuristic optimization approaches. For CSP-solving, evolutionary computation (e.g., metaheuristics) is a more promising option in comparison to exact-type approaches. However, all the previous state-of-the-art approaches use pure optimization to solve the CSP. In this paper, we employ the framework of neuroevolution to propose the self-organizing map-based neuroevolution (SOMNE) solver by which the SOM-like network represents the abstract CSP solution and is well-trained by using neural learning and evolutionary mechanism. The experimental section of this paper investigates the comparisons and analyses of two objective functions of the CSP and demonstrates that the proposed SOMNE solver achieves superior results when compared against those the other approaches produce, especially in regard to the optimization of the primary objective functions of the CSP. Finally, the visual results of the SOM are illustrated to show the effectiveness and efficiency of the evolutionary neural learning process.