糖心TV

Skip to main content Skip to navigation

糖心TV Complexity Science Events

Complexity Centre and MathSys CDT events carry priority over room D1.07.

To book D1.07 please email Sheetal dot Sharma at warwick dot ac dot 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.

Friday, May 21, 2010

Select tags to filter on
Thu, May 20 Today Sat, May 22 Jump to any date

How do I use this calendar?

You can click on an event to display further information about it.

The toolbar above the calendar has buttons to view different events. Use the left and right arrow icons to view events in the past and future. The button inbetween returns you to today's view. The button to the right of this shows a mini-calendar to let you quickly jump to any date.

The dropdown box on the right allows you to see a different view of the calendar, such as an agenda or a termly view.

If this calendar has tags, you can use the labelled checkboxes at the top of the page to select just the tags you wish to view, and then click "Show selected". The calendar will be redisplayed with just the events related to these tags, making it easier to find what you're looking for.

 
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 Chertkov
Speaker: 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.

Placeholder

Let us know you agree to cookies