Home
Grupo de investigación BISITE
  • EN EN
  • ES ES
University of Salamanca
  • Who are we?
  • Group
    • Team
    • Laboratories
    • Blog
  • R&D+i
    • Research Lines
    • Projects
      • Internationals
      • Nationals
      • Companies
      • Regionals
      • Educational innovation
      • Thematic networks
    • Publications
      • Journals
      • Books
      • Book chapters
      • Conferences
    • Technology Transfer
      • Partners
      • Platforms
  • Training
    • Masters
      • Master in 3D Printing
      • Master in Blockchain and Smart Contracts
      • Master in Digital Animation
      • Master in Digital Transformation
      • Master in Internet Security
      • Master in Smart Cities & Intelligent Buildings
      • Máster in the Internet of Things
      • Recursos TIC en el proceso de Enseñanza-Aprendizaje
    • Experts
      • Expert in 3D Printing
      • Expert in Blockchain and Smart Contracts
      • Expert in Digital Animation
      • Expert in Digital Transformation
      • Expert in Internet Security
      • Expert in Smart Cities & Intelligent Buildings
      • Expert in the Internet of Things
      • Experto en Gestión Laboral
      • Experto en Pericia Documental
    • MOOCs e4YOU
    • Campus-BISITE
  • Conferences
  • BISITE
  • Research
  • Publications

Algorithm design for parallel implementation of the SMC-PHD filter

Back
  • Research lines
  • Projects
    • Internationals
    • Nationals
    • Regionals
    • Companies
    • Educational innovation
    • Thematic networks
  • Publications
    • Journals
    • Books
    • Book chapters
    • Conferences
  • Intelectual Property Rights
Title:
Algorithm design for parallel implementation of the SMC-PHD filter.
Authors: 
Li, Tiancheng; Sun, Shudong; Bolic, Miodrag; Corchado Rodríguez, Juan M.
Journal:
Signal Processing. Volume 119, pp. 115–127. Elsevier.

Publication date: 
February 2016
ISSN: 
0165-1684
DOI
 10.1016/j.sigpro.2015.07.013

BibTex

@article { article,
title = {Algorithm design for parallel implementation of the SMC-PHD filter},
author = {Li, Tiancheng; Sun, Shudong; Bolic, Miodrag; Corchado Rodríguez, Juan M.},
journal = {Signal Processing},
publisher = {Elsevier},
volume = {119},
year = {2016}
}

XML

<article key='journals/Signal/Li,/February 2016' mdate='February 2016'>
<author> Li</author>
<author> Tiancheng; Sun</author>
<author> Shudong; Bolic</author>
<author> Miodrag; Corchado Rodríguez</author>
<author> Juan M.</author>
<title> Algorithm design for parallel implementation of the SMC-PHD filter</title>
<pages> 115–127</pages>
<year> 2016</year>
<journal> Signal Processing</journal>
<ee> 10.1016/j.sigpro.2015.07.013</ee>
</article>
Evidences of quality:
JCR(2016): 3.110
ENGINEERING, ELECTRICAL & ELECTRONIC: 58/262 (Q1)

The sequential Monte Carlo (SMC) implementation of the probability hypothesis density (PHD) filter suffers from low computational efficiency since a large number of particles are often required, especially when there are a large number of targets and dense clutter. In order to speed up the computation, an algorithmic framework for parallel SMC-PHD filtering based on multiple processors is proposed. The algorithm makes full parallelization of all four steps of the SMC-PHD filter and the computational load is approximately equal among parallel processors, rendering a high parallelization benefit when there are multiple targets and dense clutter. The parallelization is theoretically unbiased as it provides the same result as the serial implementation, without introducing any approximation. Experiments on multi-core computers have demonstrated that our parallel implementation has gained considerable speedup compared to the serial implementation of the same algorithm.

Follow us


Links of interest

Contact

  • Edificio Multiusos I+D+i:
    Calle Espejo s/n, 37007, Salamanca, Spain

     

  • Phone: (+34) 923 294 400 ext. 1525
  • Fax: (+34) 923 294 514
  • Email: bisite@usal.es

Bisite Research Group

© Copyright 2022 | BISITE Research Group

  • Sitemap
  • Graphic Identity
If you continue browsing this website, you agree to our policies.
I agree to the site policies and terms of use
View policies