Hello all,
There is a computer algorithm to determine the positive and negative of the stride width of turning gait.
key to symbols:
dotted line 6 – ground projection of the trajectory of the left heel marker
dotted line 5 - ground projection of the trajectory of the right heel marker
solid line 3 – left stride length
solid line 1 – right stride length
dashed line 4 – left stride width
dashed line 2 – right stride width
In the left gait cycle, dotted line 6 and dashed line 3 enclose a polygon. If the ground projection of the right heel marker at right heel strike is located outside the polygon, then the corresponding left stride width 4 is positive (left and central panels of the figure). If the ground projection of the right heel marker at right heel strike is located inside the polygon, then the corresponding left stride width 4 is negative (right panel of the figure).
In the right gait cycle, dotted line 5 and dashed line 2 enclose a polygon. If the ground projection of the left heel marker at left heel strike is located outside the polygon, then the corresponding right stride width 2 is positive (central and right panels of the figure). If the ground projection of the left heel marker at left heel strike is located inside the polygon, then the corresponding right stride width 2 is negative (left panel of the figure).
This algorithm can be easily achieved by using Matlab's inpolygon function.
Is this algorithm correct? If it is correct, then do you think it is innovative?
Thank you.
Reference:
[1] HUXHAM F, GONG J, BAKER R, et al. Defining spatial parameters for non-linear walking [J]. Gait & Posture, 2006, 23(2): 159-63.
I have also come up with a better way to determine the positive and negative of the stride width of natural gait.
If the left and right stride lengths have 0 intersection, then the corresponding stride width is positive.
If the left and right stride lengths have 1 intersection, then the corresponding stride width is negative.
If the left and right stride lengths have an infinite number of intersection points, then the corresponding stride width is zero.
Such algorithm can be easily achieved by using Matlab's polyxpoly function.
- Badges
- Science topic