Poster 33: Quantitative Measures of Seated Balance and Recovery of Postural Control in Acute Stroke

2008 ◽  
Vol 89 (10) ◽  
pp. e17
Author(s):  
Cynthia Danells ◽  
John Zettle ◽  
Avril Mansfield ◽  
Sandra Black ◽  
William McIlroy
2006 ◽  
Vol 174 (4) ◽  
pp. 694-700 ◽  
Author(s):  
N. Peter Reeves ◽  
Vanessa Q. Everding ◽  
Jacek Cholewicki ◽  
David C. Morrisette

2009 ◽  
Vol 42 (2) ◽  
pp. 164-170 ◽  
Author(s):  
N. Peter Reeves ◽  
Jacek Cholewicki ◽  
Kumpati S. Narendra

2009 ◽  
Vol 23 (11) ◽  
pp. 1051-1055 ◽  
Author(s):  
Sarah F Tyson ◽  
Louise Connell ◽  
Monica Busse ◽  
Sheila Lennon
Keyword(s):  

Author(s):  
M. Cody Priess ◽  
Jongeun Choi ◽  
Clark Radcliffe ◽  
John M. Popovich ◽  
Jacek Cholewicki ◽  
...  

We are developing a series of systems science-based clinical tools that will assist in modeling, diagnosing, and quantifying postural control deficits in human subjects. In line with this goal, we have designed and constructed a seated balance device and associated experimental task for identification of the human seated postural control system. In this work, we present a quadratic programming (QP) technique for optimizing a time-domain experimental input signal for this device. The goal of this optimization is to maximize the information present in the experiment, and therefore its ability to produce accurate estimates of several desired seated postural control parameters. To achieve this, we formulate the problem as a nonconvex QP and attempt to locally maximize a measure (T-optimality condition) of the experiment’s Fisher information matrix (FIM) under several constraints. These constraints include limits on the input amplitude, physiological output magnitude, subject control amplitude, and input signal autocorrelation. Because the autocorrelation constraint takes the form of a quadratic constraint (QC), we replace it with a conservative linear relaxation about a nominal point, which is iteratively updated during the course of optimization. We show that this iterative descent algorithm generates a convergent suboptimal solution that guarantees monotonic nonincreasing of the cost function value while satisfying all constraints during iterations. Finally, we present successful experimental results using an optimized input sequence.


Sign in / Sign up

Export Citation Format

Share Document