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. 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Acknowledgments.
This work was supported by National Institutes of Health Grants R01-HD37397 and R01-HD36827 and by a National Science Foundation graduate fellowship (B.R.). Sandia is a multiprogram laboratory operated by Sandia Corp., a Lockheed Martin Company, for the United States Department of Energy under contract DE-AC04-94AL85000. The work performed complies with the current laws of the United States of America.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rohrer, B., Hogan, N. Avoiding spurious submovement decompositions: a globally optimal algorithm. Biol. Cybern. 89, 190–199 (2003). https://doi.org/10.1007/s00422-003-0428-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00422-003-0428-4