Related Experiment Video
Updated: Aug 9, 2026

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
Published on: February 10, 2017
Avoiding spurious submovement decompositions II: a scattershot algorithm
Brandon Rohrer1, Neville Hogan
1Cybernetic Systems Integration Department, Intelligent Systems and Robotics Center, Sandia National Laboratories, Albuquerque, NM, USA. brrohre@sandia.gov
Abstract:
Evidence for the existence of discrete submovements underlying continuous human movement has motivated many attempts to "extract" them. Although they produce visually convincing results, all of the methodologies that have been employed are prone to produce spurious decompositions. In previous work, a branch-and-bound algorithm for submovement extraction, capable of global nonlinear minimization, and hence, capable of avoiding spurious decompositions, was presented [Rohrer and Hogan (Biol Cybern 39:190-199, 2003)]. Here, we present a scattershot-type global nonlinear minimization algorithm that requires approximately four orders of magnitude less time to compute. A sensitivity analysis reveals that the scattershot algorithm can reliably detect changes in submovement parameters over time, e.g., over the course of neuromotor recovery.
Related Concept Videos
Statically Indeterminate Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Rationalizing Substitutions
Area Computation by the Alternative Coordinate Method
Synthetic Disvision of Polynomials
Machines: Problem Solving II