Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/12450
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorKirubarajan, T.en_US
dc.contributor.authorKRISHNAN, KRISHANTHen_US
dc.date.accessioned2014-06-18T16:59:42Z-
dc.date.available2014-06-18T16:59:42Z-
dc.date.created2012-08-30en_US
dc.date.issued2012-10en_US
dc.identifier.otheropendissertations/7336en_US
dc.identifier.other8353en_US
dc.identifier.other3277489en_US
dc.identifier.urihttp://hdl.handle.net/11375/12450-
dc.description.abstract<p>Prediction, tracking, and retrodiction for targets whose motion is constrained by external conditions (e.g., shipping lanes, roads) present many challenges to tracking systems. The targets are moving along a path, defined by way-points and segments. Measurements are obtained by sensors at low revisit rates (e.g., spaceborne). Existing tracking algorithms assume that the targets follow the same motion model between successive measurements, but in a low revisit rate scenario targets may change the motion model between successive measurements. A prediction algorithm is proposed here, which addresses this issue by considering possible motion model whenever targets move to a different segment. Further, when a target approaches a junction, it has the possibility to travel into one of the multiple segments connected to that junction. To predict the probable locations, multiple hypotheses for segments are introduced and a probability is calculated for each segment hypothesis. When measurements become available, segment hypothesis probability is updated based on a combined mode likelihood and a sequential probability ratio test is carried out to reject the hypotheses with low probability. Retrodiction for path constrained targets is also considered, because in some scenarios it is desirable to find out the target's exact location at some previous time (e.g., at the time of an oil leakage). A retrodiction algorithm is developed for path constrained targets so as to facilitate motion forensic analysis. Simulation results are presented to validate the proposed algorithms.</p>en_US
dc.subjectpredictionen_US
dc.subjecttarget trackingen_US
dc.subjectretrodictionen_US
dc.subjectpath-constrained targetsen_US
dc.subjectsegment hypothesisen_US
dc.subjectElectrical and Computer Engineeringen_US
dc.subjectSignal Processingen_US
dc.subjectElectrical and Computer Engineeringen_US
dc.titlePrediction, Tracking and Retrodiction for Path-Constrained Targetsen_US
dc.typethesisen_US
dc.contributor.departmentElectrical and Computer Engineeringen_US
dc.description.degreeMaster of Applied Science (MASc)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
609.05 kBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue