2010
DOI: 10.3758/s13428-010-0025-0
|View full text |Cite
|
Sign up to set email alerts
|

A new method to evaluate order and accuracy of inaccurately and incompletely reproduced movement sequences

Abstract: Studying imitation learning of long sequences requires the evaluation of inaccurately and incompletely reproduced movement sequences. In order to evaluate the movement reproduction, it has to be assigned to the original stimulus. We developed an assignment algorithm that considers the Spatial Neighborhood and Order of reproduction (SNOA). To evaluate the features of this analysis it was applied to human performance during learning of long pointing sequences under two conditions: stimulus-guided reproduction wi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…In addition, omissions and erroneous pointing movements which do not correspond to any remembered target position may occur (explorations). Therefore, in this paradigm, the reproductions cannot simply be assigned to the targets with the smallest spatial distance, but were submitted to an algorithm which was developed to assign pointing positions to target locations under these specific conditions [19]. Basically, the algorithm performs a recursive ordered assignment [31,32] searching for the longest continuous target sub-sequence that can be assigned in order and under consideration of potential intermittent, explorative reproductions which were not assigned to any target.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…In addition, omissions and erroneous pointing movements which do not correspond to any remembered target position may occur (explorations). Therefore, in this paradigm, the reproductions cannot simply be assigned to the targets with the smallest spatial distance, but were submitted to an algorithm which was developed to assign pointing positions to target locations under these specific conditions [19]. Basically, the algorithm performs a recursive ordered assignment [31,32] searching for the longest continuous target sub-sequence that can be assigned in order and under consideration of potential intermittent, explorative reproductions which were not assigned to any target.…”
Section: Discussionmentioning
confidence: 99%
“…The DILSS-task [19][20][21] was performed in trials consisting of a presentation-phase during which the subject only observed the target on the screen, followed by a reproduction-phase during which the subject pointed with the graphic pen to the memorized target locations on the blank screen. A full training session consisted of 25 repetitions of these presentation-reproduction pairs.…”
Section: Dilss-taskmentioning
confidence: 99%
See 1 more Smart Citation