2006
DOI: 10.1007/s00422-006-0055-y
|View full text |Cite
|
Sign up to set email alerts
|

Avoiding Spurious Submovement Decompositions II: A Scattershot 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. 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, 200… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
57
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 67 publications
(57 citation statements)
references
References 19 publications
0
57
0
Order By: Relevance
“…The second method uses a stochastic "scattershot" global nonlinear minimization algorithm. It is probabilistic in nature; i.e., the results are globally optimal with probability close but not equal to unity, but it requires approximately four orders of magnitude less time to compute [53][54].…”
Section: Extracting Submovementsmentioning
confidence: 99%
“…The second method uses a stochastic "scattershot" global nonlinear minimization algorithm. It is probabilistic in nature; i.e., the results are globally optimal with probability close but not equal to unity, but it requires approximately four orders of magnitude less time to compute [53][54].…”
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%
“…The types of bell-shaped functions include the Gaussian curve, support-bounded log-normal curve, and the minimum jerk curve. In this paper, the planar velocity of the monkey's hand is decomposed into minimum jerk curves, similar methods to the ones applied by [21]. In the subsequent RPCA analysis, submovements with small amplitude and/or long duration are ignored to avoid artifacts of overfitting.…”
Section: A Submovement Decompositionmentioning
confidence: 99%
“…Since every linguist agrees that 'peripheral', difficult cases must be learned inductively on the basis of the input, constructionists point out that there is no reason to assume that the more general, regular, frequent cases cannot possibly be. "On the same wavelength, Tomasello (2003,(104)(105) remarks that "not only must there be a mechanism for learning the idiosyncratic, but this mechanism produces an output that has all of the properties of core grammar, except for maximal generality." In short, advocates of the usagebased approach take the position that core properties are ones with 'maximal generality' and, hence, properties whose effects appear with greater regularity in a language, as compared to peripheral phenomena.…”
mentioning
confidence: 99%
“…The velocity profile of the reconstruction F(t) is then given by the superposition of N submovements ẋ i (t) ( 1) where T 0i and T 0i +D are the start and finish times of the ith submovement, ẋ i (t). In contrast to Rohrer and Hogan (2006), where they compared F(t) to the tangential velocity, …”
mentioning
confidence: 99%