Avoiding spurious submovement decompositions: a globally optimal algorithm.
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. Examples of potential failures are given. A branch-and-bound algorithm for submovement extraction, capable of global nonlinear minimization (and hence capable of avoiding spurious decompositions), is developed and demonstrated.
D000465:Algorithms; D001307:Auditory Perception; D001696:Biomechanical Phenomena; D003198:Computer Simulation; D005246:Feedback / Q000502:physiology; D006801:Humans; D008954:Models, Biological; D009038:Motion; D009068:Movement / Q000502:physiology*; D017711:Nonlinear Dynamics; D011597:Psychomotor Performance / Q000502:physiology*; D011930:Reaction Time