IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/704861.html
   My bibliography  Save this article

A Review on Particle Swarm Optimization Algorithm and Its Variants to Human Motion Tracking

Author

Listed:
  • Sanjay Saini
  • Dayang Rohaya Bt Awang Rambli
  • M. Nordin B. Zakaria
  • Suziah Bt Sulaiman

Abstract

Automatic human motion tracking in video sequences is one of the most frequently tackled tasks in computer vision community. The goal of human motion capture is to estimate the joints angles of human body at any time. However, this is one of the most challenging problem in computer vision and pattern recognition due to the high-dimensional search space, self-occlusion, and high variability in human appearance. Several approaches have been proposed in the literature using different techniques. However, conventional approaches such as stochastic particle filtering have shortcomings in computational cost, slowness of convergence, suffers from the curse of dimensionality and demand a high number of evaluations to achieve accurate results. Particle swarm optimization (PSO) is a population-based globalized search algorithm which has been successfully applied to address human motion tracking problem and produced better results in high-dimensional search space. This paper presents a systematic literature survey on the PSO algorithm and its variants to human motion tracking. An attempt is made to provide a guide for the researchers working in the field of PSO based human motion tracking from video sequences. Additionally, the paper also presents the performance of various model evaluation search strategies within PSO tracking framework for 3D pose tracking.

Suggested Citation

  • Sanjay Saini & Dayang Rohaya Bt Awang Rambli & M. Nordin B. Zakaria & Suziah Bt Sulaiman, 2014. "A Review on Particle Swarm Optimization Algorithm and Its Variants to Human Motion Tracking," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-16, November.
  • Handle: RePEc:hin:jnlmpe:704861
    DOI: 10.1155/2014/704861
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/704861.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2014/704861.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/704861?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
    ---><---

    More about this item

    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:hin:jnlmpe:704861. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.