By Topic

Reduction of Sea Surveillance Data Using Binary Matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A new approach is described for assembling feasible ship trajectories from ship position sightings. The ship may or may not be identified on a particular sighting. The proposed algorithm does not attempt to resolve sighting-trajectory assignment ambiguities. No a priori ship motion model is used except for a bound on the maximum speed. The feasible relative ship motion and identity information are encoded into binary matrices. These binary matrices are computed recursively using logical AND and OR operations. The algorithm is analogous to the Kalman filter.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-6 ,  Issue: 8 )