54,381 research outputs found

    Spike Clustering and Neuron Tracking over Successive Time Windows

    Get PDF
    This paper introduces a new methodology for tracking signals from individual neurons over time in multiunit extracellular recordings. The core of our strategy relies upon an extension of a traditional mixture model approach, with parameter optimization via expectation-maximimization (EM), to incorporate clustering results from the preceding time period in a Bayesian manner. EM initialization is also achieved by utilizing these prior clustering results. After clustering, we match the current and prior clusters to track persisting neurons. Applications of this spike sorting method to recordings from macaque parietal cortex show that it provides significantly more consistent clustering and tracking results

    Nearness to Local Subspace Algorithm for Subspace and Motion Segmentation

    Get PDF
    There is a growing interest in computer science, engineering, and mathematics for modeling signals in terms of union of subspaces and manifolds. Subspace segmentation and clustering of high dimensional data drawn from a union of subspaces are especially important with many practical applications in computer vision, image and signal processing, communications, and information theory. This paper presents a clustering algorithm for high dimensional data that comes from a union of lower dimensional subspaces of equal and known dimensions. Such cases occur in many data clustering problems, such as motion segmentation and face recognition. The algorithm is reliable in the presence of noise, and applied to the Hopkins 155 Dataset, it generates the best results to date for motion segmentation. The two motion, three motion, and overall segmentation rates for the video sequences are 99.43%, 98.69%, and 99.24%, respectively

    Fast, scalable, Bayesian spike identification for multi-electrode arrays

    Get PDF
    We present an algorithm to identify individual neural spikes observed on high-density multi-electrode arrays (MEAs). Our method can distinguish large numbers of distinct neural units, even when spikes overlap, and accounts for intrinsic variability of spikes from each unit. As MEAs grow larger, it is important to find spike-identification methods that are scalable, that is, the computational cost of spike fitting should scale well with the number of units observed. Our algorithm accomplishes this goal, and is fast, because it exploits the spatial locality of each unit and the basic biophysics of extracellular signal propagation. Human intervention is minimized and streamlined via a graphical interface. We illustrate our method on data from a mammalian retina preparation and document its performance on simulated data consisting of spikes added to experimentally measured background noise. The algorithm is highly accurate

    A Miniature Robot for Isolating and Tracking Neurons in Extracellular Cortical Recordings

    Get PDF
    This paper presents a miniature robot device and control algorithm that can autonomously position electrodes in cortical tissue for isolation and tracking of extracellular signals of individual neurons. Autonomous electrode positioning can significantly enhance the efficiency and quality of acute electrophysiolgical experiments aimed at basic understanding of the nervous system. Future miniaturized systems of this sort could also overcome some of the inherent difficulties in estabilishing long-lasting neural interfaces that are needed for practical realization of neural prostheses. The paper describes the robot's design and summarizes the overall structure of the control system that governs the electrode positioning process. We present a new sequential clustering algorithm that is key to improving our system's performance, and which may have other applications in robotics. Experimental results in macaque cortex demonstrate the validity of our approach
    corecore