CGL Meeting Agenda


Date: September 30, 2010
Location: DC 1331
Time: 10:30
Chair: Philippe Lamoureux
Philippe Lamoureux

1. Acceptance of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour last week:
Tiffany- thanks!
Coffee hour this week:
NOT Marshall
Coffee hour next week:
Volunteers?

3. Forthcoming

Date: October 7, 2010 October 14, 2010 October 21, 2010 October 28, 2010
Location: DC 1331 10:30 NOT DC 1331 10:30 DC 1331 1:30 DC 1331 10:30
Chair: Ben Lafreniere
Ben Lafreniere
Tiffany Inglis
Tiffany Inglis
Ed Lank
Ed Lank
Stephen Mann
Stephen Mann
Technical Presentation: Zainab AlMeraj
Zainab AlMeraj
Tiffany Inglis
Tiffany Inglis
Ben Lafreniere
Ben Lafreniere
Philippe Lamoureux
Philippe Lamoureux

4. Technical Presentation

Gabriel Esteves

Gabriel Esteves
Title : Run-time generation of QMC-Kalman filters for track fitting
Abstract:
One of the bottlenecks of the pattern recognition task in High Energy Physics is that of on-line track reconstruction. This has been traditionally divided into the sub-tasks of track finding and track fitting. The latter involves estimating the state of a particle inside a detector moving under the influence of a magnetic field. For the last twenty or so years, the most popular solution to the track fitting problem is the Kalman filter (KF). As powerful as it is, the assumptions under which the KF is guaranteed to compute the optimal estimator are not met in the track fitting problem. In particular, the dynamics are clearly non-linear and the process and measurement noise in the model are strongly non-Gaussian due to effects such as multiple Coulomb scattering and energy loss. A proposed solution is the "Gaussian sum" filter (GSF), which runs a bank of KFs to estimate each of the modes of the noise distribution, modeled here as a Gaussian mixture. In this paper, we take advantage of Intel's recent parallel frameworks dynamic code generation features to create a GSF that matches the given (observation) noise distribution. We further combat non-linearity by having the GSF drive, instead of KFs, the recently proposed quasi-Monte Carlo Kalman Filters, a generalization of the sigma-point KFs. The generated code is not only tailored to the data, but takes advantage of several levels of parallelism in multi-core processors.

5. Discussion Items

6. Action Items

7. Conferences and Special Journal Issues

Recent Additions

Upcoming Deadlines

8. Directors' Meeting

9. Seminars and Events

Also see other Math and CS postings.

10. Lab Cleanup

Valid HTML 4.01 Transitional