{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/9176"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/9176","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Distributed Tracking with Probability Hypothesis Density Filters Using Efficient Measurement Encoding","abstract":"<p>Probability Hypothesis Density (PHD) filter is a unified framework for multitarget tracking that provides estimates for a number of targets as well as individual target states. Sequential Monte Carlo (SMC) implementation of a PHD filter can be used for nonlinear non-Gaussian problems. However, the application of PHD based state estimators for a distributed sensor network, where each tracking node runs its own PHD based state estimator, is more challenging compared with single sensor tracking due to communication limitations. A distributed state estimator should use the available communication resources efficiently in order to avoid the degradation of filter performance. In this thesis, a method that communicates encoded measurements between nodes efficiently while maintaining the filter accuracy is proposed. This coding is complicated in the presence of high clutter and instantaneous target births. This problem is mitigated using adaptive quantization and encoding techniques. The performance of the algorithm is quantified using a Posterior Cramér-Rao Lower Bound (PCRLB), which incorporates quantization errors. Simulation studies are performed to demonstrate the effectiveness of the proposed algorithm.</p>","abstract_html":"&lt;p&gt;Probability Hypothesis Density (PHD) filter is a unified framework for multitarget tracking that provides estimates for a number of targets as well as individual target states. Sequential Monte Carlo (SMC) implementation of a PHD filter can be used for nonlinear non-Gaussian problems. However, the application of PHD based state estimators for a distributed sensor network, where each tracking node runs its own PHD based state estimator, is more challenging compared with single sensor tracking due to communication limitations. A distributed state estimator should use the available communication resources efficiently in order to avoid the degradation of filter performance. In this thesis, a method that communicates encoded measurements between nodes efficiently while maintaining the filter accuracy is proposed. This coding is complicated in the presence of high clutter and instantaneous target births. This problem is mitigated using adaptive quantization and encoding techniques. The performance of the algorithm is quantified using a Posterior Cramér-Rao Lower Bound (PCRLB), which incorporates quantization errors. Simulation studies are performed to demonstrate the effectiveness of the proposed algorithm.&lt;/p&gt;","abstract_has_math":false,"creators":["Ampikathasan, Aravinthan"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Kirubarajan, T."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-08","date_published":"2009-08","updated_at":"2026-11-18T19:32:33Z","subjects":["Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/12205"],"render_values":[{"text":"https://doi.org/10.71548/12205","href":"https://doi.org/10.71548/12205","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/4322","5340","2039728"],"render_values":[{"text":"opendissertations/4322","href":null,"code":true},{"text":"5340","href":null,"code":true},{"text":"2039728","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/9176","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/9176","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F9176","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Kirubarajan, T."]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Ampikathasan, Aravinthan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:45:57Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:45:57Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-05-31"]},{"key":"dc:date.issued","label":"Date","values":["2009-08"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/4322","5340","2039728"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/9176","https://doi.org/10.71548/12205"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>Probability Hypothesis Density (PHD) filter is a unified framework for multitarget tracking that provides estimates for a number of targets as well as individual target states. Sequential Monte Carlo (SMC) implementation of a PHD filter can be used for nonlinear non-Gaussian problems. However, the application of PHD based state estimators for a distributed sensor network, where each tracking node runs its own PHD based state estimator, is more challenging compared with single sensor tracking due to communication limitations. A distributed state estimator should use the available communication resources efficiently in order to avoid the degradation of filter performance. In this thesis, a method that communicates encoded measurements between nodes efficiently while maintaining the filter accuracy is proposed. This coding is complicated in the presence of high clutter and instantaneous target births. This problem is mitigated using adaptive quantization and encoding techniques. The performance of the algorithm is quantified using a Posterior Cramér-Rao Lower Bound (PCRLB), which incorporates quantization errors. Simulation studies are performed to demonstrate the effectiveness of the proposed algorithm.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["Distributed Tracking with Probability Hypothesis Density Filters Using Efficient Measurement Encoding"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Kirubarajan, T."],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Ampikathasan, Aravinthan"],"dc:date.accessioned":["2014-06-18T16:45:57Z"],"dc:date.available":["2014-06-18T16:45:57Z"],"dc:date.created":["2011-05-31"],"dc:date.issued":["2009-08"],"dc:description.abstract":["<p>Probability Hypothesis Density (PHD) filter is a unified framework for multitarget tracking that provides estimates for a number of targets as well as individual target states. Sequential Monte Carlo (SMC) implementation of a PHD filter can be used for nonlinear non-Gaussian problems. However, the application of PHD based state estimators for a distributed sensor network, where each tracking node runs its own PHD based state estimator, is more challenging compared with single sensor tracking due to communication limitations. A distributed state estimator should use the available communication resources efficiently in order to avoid the degradation of filter performance. In this thesis, a method that communicates encoded measurements between nodes efficiently while maintaining the filter accuracy is proposed. This coding is complicated in the presence of high clutter and instantaneous target births. This problem is mitigated using adaptive quantization and encoding techniques. The performance of the algorithm is quantified using a Posterior Cramér-Rao Lower Bound (PCRLB), which incorporates quantization errors. Simulation studies are performed to demonstrate the effectiveness of the proposed algorithm.</p>"],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.other":["opendissertations/4322","5340","2039728"],"dc:identifier.uri":["http://hdl.handle.net/11375/9176","https://doi.org/10.71548/12205"],"dc:subject":["Electrical and Computer Engineering"],"dc:title":["Distributed Tracking with Probability Hypothesis Density Filters Using Efficient Measurement Encoding"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:32:33Z"}