Events in MathSys and Complexity Science
This is a calendar page detailing events within the MathSys CDT. It also acts as a booking diary for the Seminar Room D1.07. To book D1.07 please email Sheetal.Sharma@warwick.ac.uk
Please note that your event booking is for D1.07 only. The adjacent common room is a private area for the MathSys Centre that cannot used as part of your booking.
MathSys CDT events have priority for D1.07 room bookings.
Click here to see all seminars taking place in the Mathematics InstituteLink opens in a new window
Click here to see the calendar for SBIDERLink opens in a new window.
Friday, May 21, 2010
Export as iCalendar |
Imperial College
The next Complex System Dynamics (CoSyDy) meeting will be at Imperial College on Friday 21 May:If you'd like travel support, please let me know in advance and buy a cheap ticket (I have up to 100 pounds total from the LMS for 糖心TV people to attend, so no promises!). Prof R.S.MacKay FRS FInstP FIMA
|
-Export as iCalendar |
Complexity Forum - Misha ChertkovSpeaker: Misha Chertkov (LANL)
Title: Tracking particles by passing messages between images Abstract: We report construction of an efficient algorithm for learning parameters of dynamical statistical models, mapping many identical particles/markers from one image to another, given that positions of all the particles in both images are known. Our algorithm belongs to the class of the message-passing algorithms, also known in Computer Science, Information Theory and Statistical Physics under the name of Belief Propagation (BP). The algorithm is distributed thus allowing parallel implementation suitable for computations on multiple machines without significant inter-machine computational overhead. We test our algorithm on a model example of reconstructing diffusion coefficient and velocity gradient tensor from two consecutive images of many particles seed in two-dimensional and three-dimensional flows. Our numerical experiments show that this BP algorithm compares in quality of the parameter prediction with exact Markov Chain Monte-Carlo algorithm, while BP is far more superior in speed. We also suggest and analyze a random-distance model providing theoretical justification for BP accuracy in the diffusion and velocity gradient reconstruction. Our main conclusion is that the developed technique offers a very significant ``software" improvement in speed for Particle Image Velocimetry (PIV) technique, which currently constitutes the main working horse in experimental turbulent research. The talk is based on PNAS 10.1073/pnas.0910994107 published in Apr, 2010. |