计算机工程 ›› 2011, Vol. 37 ›› Issue (10): 255-256.doi: 10.3969/j.issn.1000-3428.2011.10.088

• 开发研究与设计技术 • 上一篇    下一篇

人体重心动摇轨迹包络面积的快速算法

安美君 a,b,邹任玲 b,胡秀坊 b,徐秀林 b   

  1. (上海理工大学 a. 光电信息与计算机工程学院;b. 医疗器械与食品学院,上海 200093)
  • 出版日期:2011-05-20 发布日期:2011-05-20
  • 作者简介:安美君(1966-),男,高级工程师、博士研究生,主研方向:光电信息处理,光学工程;邹任玲,讲师、硕士;胡秀坊,高级实验师;徐秀林,副教授
  • 基金项目:

    上海市科学技术委员会科研计划基金资助项目“针对肌肉/平衡功能障碍的智能化评定/训练治疗系统研究”(08440510300)

Fast Algorithm for Envelope Area of Body Barycenter Swaying Trajectory

AN Mei-jun a, b, ZOU Ren-ling b, HU Xiu-fang b, XU Xiu-lin b   

  1. (a. School of Optical-Electrical and Computer Engineering; b. School of Medical Instrument and Food, University of Shanghai for Science and Technology, Shanghai 200093, China)
  • Online:2011-05-20 Published:2011-05-20

摘要:

传统的人体重心动摇轨迹包络面积计算方法是先确定包络所有点的凸包形状,再计算凸包的面积,其最优时间复杂度接近O(nlbn)。针对上述问题给出一种近似凸包计算方法,通过计算点集在不同旋转角度下的坐标,查找X轴和Y轴的最大最小极值点,快速标定构成凸包点,确定凸包形状。算法的时间复杂度接近于O(n)。实际应用证明,该算法能满足精度要求,提高人体重心动摇轨迹包络面积计算速度。

关键词: 人体重心动摇轨迹, 凸包算法, 近似凸包, 包络面积, 平衡测试

Abstract:

The envelope area of the body barycenter swaying trajectory is one of sensitive indicators that discriminates the balanced capacity of dizziness patient. Traditional computing method firstly determines the shape of convex hull enveloping all points and then calculates the area of convex hull, it need sort all points, time complexity of algorithm close to O(nlbn) on the best cases. This paper introduces a kind of algorithm of approximate convex hull, calculates coordinates of different rotation angle, looks up the point set of maximum and minimum along X-axis and Y-axis, quickly marks the points and make sure the shape of convex hull. Time complexity of algorithm close to O(n). It is proved that the algorithm can meet accuracy requirement of balance test system, and increase calculation speed.

Key words: body barycenter swaying trajectory, algorithm of convex hull, approximate convex hull, envelope area, balance test

中图分类号: