Avoiding spurious submovement decompositions: a globally optimal algorithm

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Biological cybernetics Ročník 89; číslo 3; s. 190 - 199
Hlavní autoři: Rohrer, Brandon, Hogan, Neville
Médium: Journal Article
Jazyk:angličtina
Vydáno: Germany Springer Nature B.V 01.09.2003
Témata:
ALGORITHMS
Auditory Perception
BIOLOGY
Biomechanical Phenomena
Computer Simulation
CYBERNETICS
Feedback - physiology
Humans
MANAGEMENT OF RADIOACTIVE WASTES, AND NON-RADIOACTIVE WASTES FROM NUCLEAR FACILITIES
MINIMIZATION
Models, Biological
Motion
Movement - physiology
Nonlinear Dynamics
Psychomotor Performance - physiology
Reaction Time
ISSN:0340-1200, 1432-0770
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
USDOE
SAND2003-2791J
AC04-94AL85000
ISSN:0340-1200
1432-0770
DOI:10.1007/s00422-003-0428-4