IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i5p1550147717707418.html

Fall detection via human posture representation and support vector machine

Author

Listed:
  • Kaibo Fan
  • Ping Wang
  • Yan Hu
  • Bingjie Dou

Abstract

Accidental falls of elderly people are a major cause of fatal injuries, especially for those living alone. We present a novel vision–based fall detection approach that analyzes an extracted human body using described human postures. First, a human body extracted by a background subtraction technique is located by a minimum area-enclosing ellipse. Then, a normalized directional histogram is developed around the center of the ellipse to represent a human posture by multi-directional statistical analysis. After that, 12 static and 8 dynamic features are derived from the normalized directional histogram. These features are fed into a directed acyclic graph support vector machine to distinguish four closely related human postures (standing, crouching, lying, and sitting). A fall-like accident is detected by counting the occurrences of lying postures in a short temporal window. After conducting majority voting, a fall event is determined by immobility verification. From the experimental results, an overall accuracy of 97.1% is obtained for recognition of the four postures, and only 1.0% of postures are misclassified as lying postures. Our fall detection system achieves up to 95.2% fall detection accuracy on a public fall dataset.

Suggested Citation

  • Kaibo Fan & Ping Wang & Yan Hu & Bingjie Dou, 2017. "Fall detection via human posture representation and support vector machine," International Journal of Distributed Sensor Networks, , vol. 13(5), pages 15501477177, May.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:5:p:1550147717707418
    DOI: 10.1177/1550147717707418
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717707418
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717707418?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Ang Li & Zhenjiang Miao & Yigang Cen & Tian Wang & Viacheslav Voronin, 2015. "Histogram of Maximal Optical Flow Projection for Abnormal Events Detection in Crowded Scenes," International Journal of Distributed Sensor Networks, , vol. 11(11), pages 406941-4069, November.
    2. Jian He & Chen Hu & Xiaoyi Wang, 2016. "A Smart Device Enabled System for Autonomous Fall Detection and Alert," International Journal of Distributed Sensor Networks, , vol. 12(2), pages 2308183-230, February.
    3. P. Kumar & E. A. Yildirim, 2005. "Minimum-Volume Enclosing Ellipsoids and Core Sets," Journal of Optimization Theory and Applications, Springer, vol. 126(1), pages 1-21, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Karim Abou-Moustafa & Frank P. Ferrie, 2018. "Local generalized quadratic distance metrics: application to the k-nearest neighbors classifier," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(2), pages 341-363, June.
    2. Wei-jie Cong & Le Wang & Hui Sun, 2020. "Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem," Computational Optimization and Applications, Springer, vol. 75(1), pages 237-262, January.
    3. Farman Hassan, Muhammad Hamza Mehmood,Babar Younis, Nasir Mehmood, Talha Imran, Usama Zafar, 2022. "Comparative Analysis of Machine Learning Algorithms for Classification of Environmental Sounds and Fall Detection," International Journal of Innovations in Science & Technology, 50sea, vol. 4(1), pages 163-174, February.
    4. Selin Ahipaşaoğlu, 2015. "Fast algorithms for the minimum volume estimator," Journal of Global Optimization, Springer, vol. 62(2), pages 351-370, June.
    5. Pál Somogyi & Samuel Rosa & Radoslav Harman, 2025. "A randomized exchange algorithm for optimal design of multi-response experiments," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 88(6), pages 1161-1186, August.
    6. Jiajia Li & Jinfu Liu & Peigang Yan & Xingshuo Li & Guowen Zhou & Daren Yu, 2021. "Operation Optimization of Integrated Energy System under a Renewable Energy Dominated Future Scene Considering Both Independence and Benefit: A Review," Energies, MDPI, vol. 14(4), pages 1-36, February.
    7. Pál Somogyi & Samuel Rosa & Radoslav Harman, 2026. "A randomized exchange algorithm for optimal design of multi-response experiments," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 89(2), pages 217-242, February.
    8. Piyush Kumar & E. Alper Yıldırım, 2009. "An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 614-629, November.
    9. Rosa, Samuel & Harman, Radoslav, 2022. "Computing minimum-volume enclosing ellipsoids for large datasets," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    10. Cyril Bachelard & Apostolos Chalkis & Vissarion Fisikopoulos & Elias Tsigaridas, 2024. "Randomized Control in Performance Analysis and Empirical Asset Pricing," Papers 2403.00009, arXiv.org.
    11. Qing, Ke & Du, Yuefang & Huang, Qi & Duan, Chao & Hu, Weihao, 2024. "Energy scheduling for microgrids with renewable energy sources considering an adjustable convex hull based uncertainty set," Renewable Energy, Elsevier, vol. 220(C).
    12. Piyush Kumar & E. Alper Yıldırım, 2011. "A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 377-391, August.
    13. Wei-jie Cong & Hong-wei Liu & Feng Ye & Shui-sheng Zhou, 2012. "Rank-two update algorithms for the minimum volume enclosing ellipsoid problem," Computational Optimization and Applications, Springer, vol. 51(1), pages 241-257, January.
    14. P. Kumar & E. A. Yıldırım, 2008. "Computing Minimum-Volume Enclosing Axis-Aligned Ellipsoids," Journal of Optimization Theory and Applications, Springer, vol. 136(2), pages 211-228, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:13:y:2017:i:5:p:1550147717707418. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.