You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
21 May 2015Proof that particle flow corresponds to Bayes’ rule: necessary and sufficient conditions
We prove a theorem that guarantees the existence of a particle flow corresponding to Bayes’ rule, assuming certain regularity conditions (smooth and nowhere vanishing probability densities). This theory applies to particle flows to compute Bayes’ rule for nonlinear filters, Bayesian decisions and learning as well as transport. The particle flow algorithms reduce computational complexity by orders of magnitude compared with standard Markov chain Monte Carlo (MCMC) algorithms that achieve the same accuracy for high dimensional problems.
Fred Daum andJim Huang
"Proof that particle flow corresponds to Bayes’ rule: necessary and sufficient conditions", Proc. SPIE 9474, Signal Processing, Sensor/Information Fusion, and Target Recognition XXIV, 94740I (21 May 2015); https://doi.org/10.1117/12.2076167
The alert did not successfully save. Please try again later.
Fred Daum, Jim Huang, "Proof that particle flow corresponds to Bayes’ rule: necessary and sufficient conditions," Proc. SPIE 9474, Signal Processing, Sensor/Information Fusion, and Target Recognition XXIV, 94740I (21 May 2015); https://doi.org/10.1117/12.2076167