How Can Subsampling Reduce Complexity in Sequential MCMC Methods and Deal with Big Data in Target Tracking?

De Freitas, A., Septier, F., Mihaylova, L. orcid.org/0000-0001-5856-2223 et al. (1 more author) (2015) How Can Subsampling Reduce Complexity in Sequential MCMC Methods and Deal with Big Data in Target Tracking? In: Proceedings of the 18th International Conference on Information Fusion. 18th International Conference on Information Fusion, 06-09 Jul 2015, Washington DC, USA. IEEE , pp. 134-141.

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Reproduced in accordance with the publisher's self-archiving policy.

Keywords: Sequential Markov Chain Monte Carlo; Tracking; Sunsampling; Big Data
Dates:
  • Published: 17 September 2015
  • Accepted: 1 May 2015
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield)
Funding Information:
Funder
Grant number
EUROPEAN COMMISSION - FP6/FP7
TRAX - 607400
ENGINEERING AND PHYSICAL SCIENCE RESEARCH COUNCIL (EPSRC)
EP/K021516/1
Depositing User: Symplectic Sheffield
Date Deposited: 27 Feb 2018 09:26
Last Modified: 27 Feb 2018 09:28
Published Version: http://ieeexplore.ieee.org/abstract/document/72665...
Status: Published
Publisher: IEEE
Refereed: Yes
Open Archives Initiative ID (OAI ID):

Export

Statistics