Basic HTML version of Foils prepared 15 March 1996

Foil 71 Track Finding in Intermediate Cases

From Physical Optimization and Physical Computation CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox


1 Case III: Intermediate Number of Tracks or
2 Few Tracks with Dirty Data
  • Now we want to view total tour (track) as a single entity and use either annealing or elastic net methods?
  • Kalman filter fails as it uses information incrementally - adds one time slice to previous local track
  • c2 gets stuck in a local minimum - need concept of temperature to avoid false minima
  • Neural networks inefficient as too much redundancy
  • Deterministic Annealing (elastic net) is a good possibility
  • Rose has tested this
  • Note in tracking, tracks are attracted to measurements;
  • in navigation, vehicles are repelled from obstacles, otherwise identical

in Table To:


Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Feb 22 1998