| 21 | | <h3 align="center">1 </h3><dl class="version" compact><dt><b>Version:</b></dt><dd>0.1</dd></dl> |
| 22 | | <dl class="author" compact><dt><b>Author:</b></dt><dd>Vaclav Smidl</dd></dl> |
| 23 | | BDM is a collection of methods for selected tasks of Bayesian decision-making, such as estimation, filtering and control.<h2><a class="anchor" name="Approach"> |
| 24 | | Approach</a></h2> |
| 25 | | The toolbox is designed using two design criteria: <ul> |
| 26 | | <li>relation to mathematics, </li> |
| 27 | | <li>efficient evaluation, while the first one is more important than the latter.</li> |
| 28 | | </ul> |
| 29 | | Hence, each mathematical object such as probability density is represented by one software object. The resulting algorithms are then implemented as operations on these objects. In cases when more efficient solution can be achived when this structure is not respected, a parallel implementation is created and clearly marked as specific.<h2><a class="anchor" name="Methods"> |
| 30 | | Methods</a></h2> |
| 31 | | At present we support the following methods: <ul> |
| 32 | | <li>Estimation: <a class="el" href="classARX.html" title="Linear Autoregressive model with Gaussian noise.">ARX</a> models </li> |
| 33 | | <li>Filtering: <a class="el" href="classKalman.html" title="Kalman filter with covariance matrices in square root form.">Kalman</a> filtering, Extended Kalman filters (<a class="el" href="classEKF.html" title="Extended Kalman Filter.">EKF</a>), Particle filters (<a class="el" href="classPF.html" title="Trivial particle filter with proposal density equal to parameter evolution model...">PF</a>), Marginalized Particle filters (<a class="el" href="classMPF.html" title="Marginalized Particle filter.">MPF</a>). </li> |
| 34 | | <li>Desing: None.</li> |
| 35 | | </ul> |
| 36 | | <h2><a class="anchor" name="Implementation"> |
| 37 | | Implementation</a></h2> |
| 38 | | BDM is build on top of <code>IT++</code> which wraps numerically efficient operations of linear algebra into easy to use C++ classes. Thanks to this excellent library, writing of numerical algorithms is as easy as in Matlab but we gain significant advantages:<p> |
| 39 | | <ul> |
| 40 | | <li>computational speed comparable to built-in Matlab function, and surpassing interpreted Matlab in order of magnitudes, </li> |
| 41 | | <li>native support for object-oriented programming, </li> |
| 42 | | <li>support for templates which is often more appropriate than object-oriented programming, </li> |
| 43 | | <li>cross-platform compatibility. </li> |
| 44 | | </ul> |
| 45 | | </div> |
| 46 | | <hr size="1"><address style="text-align: right;"><small>Generated on Sat Aug 16 11:58:41 2008 for mixpp by |
| | 21 | <h3 align="center">1 </h3></div> |
| | 22 | <hr size="1"><address style="text-align: right;"><small>Generated on Sat Aug 16 17:22:02 2008 for mixpp by |
