warack@dip.eecs.umich.edu (Christopher Warack) (12/06/90)
I'm looking into tracking algorithms for parallel architectures. I'm interested in the major issues of sensor data input, track initiation, track extension, termination, and perhaps piece correlation (several tracks associated because they are actually from the same object). I'd appreciate any publication references or insights you have. Also, any comparisons with the performance of serial algorithms is of interest. Finally, I'm interested in both the theoretical and applied aspects. Please e-mail. I'll post a summary. Thanks, Chris -- Christopher A. Warack warack@eecs.umich.edu Graduate Dept, EECS (313) 665-4789 University of Michigan
fier@decwrl.dec.com (Jeff Fier) (12/14/90)
Chris:
I received a copy of the request you posted to the net about parallel tracking
algorithms. I recently implemented a PDA algorithm due to S.B. Colegrove, et
al. [1] on the MasPar MP-1 (SIMD, 1K--16K processors). This work was carried
out with Heiko Schroeder, Rob Evans, and Bryan Beresford-Smith of Newcastle
University in Newcastle, NSW, Australia. We have not yet written a paper
describing the work, but intend to do so shortly.
I would be happy to send a preliminary copy of the paper once I get something
coherent written. If you'd like to know some details about the implementation
right away, please feel free to call me @ (408) 736-3300 and I'll fill you in
on what we did; it's kind of difficult to describe things in an e-mail
message. I'd also like to hear what sort of things you have been looking at
since this is an interesting problem area.
--Jeff Fier
fier@maspar.com
[1] S.B. Colegrove and J.K. Ayliffe, "Track Initiation and Nearest Neighbours
Incorporated into Probabilistic Data Association," IEEE Australia, Vol. 6,
No. 3, September 1986, pp. 191--198.