Avoiding spurious submovement decompositions: a globally optimal algorithm |
| |
| Authors: | Brandon Rohrer Neville Hogan |
| |
| Institution: | (1) Sandia National Laboratories, Intelligent Systems and Robotics Center, 5800, Albuquerque, NM 87185, USA;(2) Department of Mechanical Engineering and Department of Brain and Cognitive Science, Massachusetts Institute of Technology, 77 Massachusetts Ave, Cambridge, MA 02139, USA |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 PubMed SpringerLink 等数据库收录！ |
|
