Skip to main content

A New MCMC Particle Filter Resampling Algorithm Based on Minimizing Sampling Variance

  • Conference paper
  • First Online:
Simulation Tools and Techniques (SIMUtools 2019)

Abstract

In order to solve the problem of particle divergence caused by deviation of sample distribution before and after resampling, a new Markov Chain Monte Carlo (MCMC) resampling algorithm based on minimizing sampling variance is proposed. First, MCMC transfer in which Particle Swarm Optimization (PSO) is possessed as the transfer kernel to construct Markov Chain is applied to the impoverished sample to combat sample degeneracy as well as sample impoverishment. Second, the algorithm takes the weighted variance as the cost function to measure the difference between the weighted particle discrete distribution before and after the resampling process, and optimizes the previous MCMC resampling by the minimum sampling variance criterion. Finally Experiment result shows that the algorithm can overcome particle impoverishment and realize the identical distribution of particles before and after resampling.

This work is partly supported by the Natural Science Foundation of Jiangsu Province of China (No. BK20161165), the applied fundamental research Foundation of Xuzhou of China (No. KC17072), Xuzhou Science and Technology Plan Project (No. KC18011), and Ministry of Housing and Urban-Rural Development Science and Technology Planning Project (NO.2016-R2-060).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Li, T., et al.: Fighting sample degeneracy and impoverishment in particle filters: a review of intelligent approaches. Expert Syst. Appl. 41(8), 3944–3954 (2014)

    Article  Google Scholar 

  2. Punithakumar, K., Mcdonald, M., Kirubarajan, T.: Spline filter for multidimensional nonlinear/non-Gaussian Bayesian tracking. In: Spie Defense and Security Symposium International Society for Optics and Photonics (2008). https://doi.org/10.1117/12.779223

  3. Duong, P.L.T., Raghavan, N.: Heuristic Kalman optimized particle filter for remaining useful life prediction of lithium-ion battery. Microelectron. Reliab. 81, 232–243 (2018)

    Article  Google Scholar 

  4. Arulampalam, M.S., Maskell, S., Gordon, N., et al.: A tutorial on particle filters for online Nonlinear/non-Gaussian Bayesian tracking. IEEE Trans. Signal Process. 50(2), 174–188 (2002)

    Article  Google Scholar 

  5. Septier, F., Peters, G.W.: Langevin and Hamiltonian based sequential MCMC for efficient Bayesian filtering in High-dimensional spaces. IEEE J. Sel. Top. Signal Process. 10(2), 312–327 (2016)

    Article  Google Scholar 

  6. Das, S.K., Mazumdar, C.: Priori-sensitive resampling particle filter for dynamic state estimation of UUVs. In: International Workshop on Systems, pp. 384–389. IEEE (2013)

    Google Scholar 

  7. Choe, G., Wang, T., Liu, F., et al.: Particle filter with spline resampling and global transition model. IET Comput. Vis. 9(2), 184–197 (2014)

    Article  Google Scholar 

  8. Lv, T.Z., Zhao, C.X., Zhang, H.F.: An improved FastSLAM algorithm based on revised genetic resampling and SR-UPF. Int. J. Autom. Comput. 5, 1–10 (2014)

    Google Scholar 

  9. Tian-Cheng, L.I., Villarrubia, G., Sun, S.D., et al.: Resampling methods for particle filtering: identical distribution, a new method, and comparable study. Front. Inf. Technol. Electron. Eng. 16(11), 969–984 (2015)

    Article  Google Scholar 

  10. Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79–86 (1951)

    Article  MathSciNet  Google Scholar 

  11. Cheng, S., Zhang, J.: Fission bootstrap particle filtering. Chin. J. Electron. 36, 500–504 (2008)

    Google Scholar 

  12. Li, T., Sattar, T.P., Sun, S.: Deterministic resampling: unbiased sampling to avoid sample impoverishment in particle filters. Sig. Process. 92(7), 1637–1645 (2012)

    Article  Google Scholar 

  13. Wang, W., Tan, Q.K., Chen, J., et al.: Particle filter based on improved genetic algorithm resampling. In: Guidance, Navigation and Control Conference, pp. 346–350. IEEE (2017)

    Google Scholar 

  14. Jiang, E., Wang, W., Shi, L., Song, H.: A compressive sensing-based approach to end-to-end network traffic reconstruction. IEEE Trans. Netw. Sci. Eng. (2018). https://doi.org/10.1109/TNSE.2018.2877597

  15. Jiang, D., Huo, L., Lv, Z., et al.: A joint multi-criteria utility-based network selection approach for vehicle-to-infrastructure networking. IEEE Trans. Intell. Transp. Syst. 1–15 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan Tian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tian, J., Li, D. (2019). A New MCMC Particle Filter Resampling Algorithm Based on Minimizing Sampling Variance. In: Song, H., Jiang, D. (eds) Simulation Tools and Techniques. SIMUtools 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 295. Springer, Cham. https://doi.org/10.1007/978-3-030-32216-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-32216-8_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-32215-1

  • Online ISBN: 978-3-030-32216-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics