2003
DOI: 10.1007/s00422-003-0428-4
|View full text |Cite
|
Sign up to set email alerts
|

Avoiding spurious submovement decompositions: a globally optimal algorithm

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
53
0

Year Published

2005
2005
2017
2017

Publication Types

Select...
5
2
2

Relationship

2
7

Authors

Journals

citations
Cited by 56 publications
(55 citation statements)
references
References 21 publications
2
53
0
Order By: Relevance
“…Second, and much more vexing, even if the submovement shape was known, the sequence of submovements obtained is exquisitely sensitive to the method used to identify them. We found that all of the prior methods that have been used were vulnerable to substantial misidentification [52]. By recasting submovement extraction as a global nonlinear optimization problem, we developed two reliable approaches.…”
Section: Extracting Submovementsmentioning
confidence: 99%
See 1 more Smart Citation
“…Second, and much more vexing, even if the submovement shape was known, the sequence of submovements obtained is exquisitely sensitive to the method used to identify them. We found that all of the prior methods that have been used were vulnerable to substantial misidentification [52]. By recasting submovement extraction as a global nonlinear optimization problem, we developed two reliable approaches.…”
Section: Extracting Submovementsmentioning
confidence: 99%
“…The first is based on a "branch-andbound" algorithm. It is powerful, with proven convergence properties, and can correctly identify submovements even in the presence of noise [52]. Unfortunately, it is computationally burdensome.…”
Section: Extracting Submovementsmentioning
confidence: 99%
“…Rohrer and Hogan outline various types of roughly bell shaped functions representing submovements and present algorithms for fitting sums of bell-shaped functions to kine matic data [20] [21]. The types of bell-shaped functions include the Gaussian curve, support-bounded log-normal curve, and the minimum jerk curve.…”
Section: A Submovement Decompositionmentioning
confidence: 99%
“…In general, global nonlinear optimization problems are difficult to solve. Although several submovement extraction algorithms have been proposed previously (Morasso and Mussa-Ivaldi 1982;Flash and Henis 1991;Milner 1992;Berthier 1996;Lee et al 1997;Burdet and Milner 1998), all of them are subject to finding local, rather than global, minima and to producing spurious decomposition results (Rohrer and Hogan 2003). Principal components analysis was evaluated for use in submovement extraction, as well, but was found to be inappropriate in that it extracted continuous time components that spanned the entire movement and that contained parts of several submovements.…”
mentioning
confidence: 99%