{"title":"基于似然面离散化的树搜索跟踪","authors":"Hossein Roufarshbaf, J. Nelson","doi":"10.1109/CISS.2013.6552306","DOIUrl":null,"url":null,"abstract":"A new discretization technique based on local maxima of the observation likelihood surface is proposed for tree-search based tracking of dim targets in heavy clutter. The joint likelihood of sensor observations over the target state space is evaluated in the vicinity of the previously estimated target state, and its local maxima are selected as new states for discretization. The discretized states are used to build a search tree, which is navigated using the stack algorithm to approximate the maximum a posteriori tracking solution. Simulation results on a benchmark active sonar data set reveal that the proposed algorithm is able to follow dim maneuvering targets without track fragmentation.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Likelihood-surface based discretization for tracking via tree search\",\"authors\":\"Hossein Roufarshbaf, J. Nelson\",\"doi\":\"10.1109/CISS.2013.6552306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new discretization technique based on local maxima of the observation likelihood surface is proposed for tree-search based tracking of dim targets in heavy clutter. The joint likelihood of sensor observations over the target state space is evaluated in the vicinity of the previously estimated target state, and its local maxima are selected as new states for discretization. The discretized states are used to build a search tree, which is navigated using the stack algorithm to approximate the maximum a posteriori tracking solution. Simulation results on a benchmark active sonar data set reveal that the proposed algorithm is able to follow dim maneuvering targets without track fragmentation.\",\"PeriodicalId\":268095,\"journal\":{\"name\":\"2013 47th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 47th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2013.6552306\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2013.6552306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Likelihood-surface based discretization for tracking via tree search
A new discretization technique based on local maxima of the observation likelihood surface is proposed for tree-search based tracking of dim targets in heavy clutter. The joint likelihood of sensor observations over the target state space is evaluated in the vicinity of the previously estimated target state, and its local maxima are selected as new states for discretization. The discretized states are used to build a search tree, which is navigated using the stack algorithm to approximate the maximum a posteriori tracking solution. Simulation results on a benchmark active sonar data set reveal that the proposed algorithm is able to follow dim maneuvering targets without track fragmentation.