{"title":"稠密杂波下无人机多目标跟踪的基于密度的递归RANSAC算法","authors":"Feng Yang, Weikang Tang, Hua Lan","doi":"10.1109/ICCA.2017.8003029","DOIUrl":null,"url":null,"abstract":"Target tracking is a hot topic for unmanned aerial vehicle surveillance. Recently, the novel random sample consensus (RANSAC) algorithm shows a good tracking performance in dense clutter environment. However, the heavy computational burden limits the usage for unmanned aerial vehicle (UAV). In this paper, a density-based recursive random sample consensus (DBR-RANSAC) algorithm is proposed, which utilizes the density property of measurements within several steps to direct sampling. In the DBR-RANSAC, the randomness of sampling can be avoided and the computation complexity can be reduced particularly in dense clutter. The simulation results show the validity of the proposed algorithm.","PeriodicalId":379025,"journal":{"name":"2017 13th IEEE International Conference on Control & Automation (ICCA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A density-based recursive RANSAC algorithm for unmanned aerial vehicle multi-target tracking in dense clutter\",\"authors\":\"Feng Yang, Weikang Tang, Hua Lan\",\"doi\":\"10.1109/ICCA.2017.8003029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Target tracking is a hot topic for unmanned aerial vehicle surveillance. Recently, the novel random sample consensus (RANSAC) algorithm shows a good tracking performance in dense clutter environment. However, the heavy computational burden limits the usage for unmanned aerial vehicle (UAV). In this paper, a density-based recursive random sample consensus (DBR-RANSAC) algorithm is proposed, which utilizes the density property of measurements within several steps to direct sampling. In the DBR-RANSAC, the randomness of sampling can be avoided and the computation complexity can be reduced particularly in dense clutter. The simulation results show the validity of the proposed algorithm.\",\"PeriodicalId\":379025,\"journal\":{\"name\":\"2017 13th IEEE International Conference on Control & Automation (ICCA)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th IEEE International Conference on Control & Automation (ICCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCA.2017.8003029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th IEEE International Conference on Control & Automation (ICCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCA.2017.8003029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A density-based recursive RANSAC algorithm for unmanned aerial vehicle multi-target tracking in dense clutter
Target tracking is a hot topic for unmanned aerial vehicle surveillance. Recently, the novel random sample consensus (RANSAC) algorithm shows a good tracking performance in dense clutter environment. However, the heavy computational burden limits the usage for unmanned aerial vehicle (UAV). In this paper, a density-based recursive random sample consensus (DBR-RANSAC) algorithm is proposed, which utilizes the density property of measurements within several steps to direct sampling. In the DBR-RANSAC, the randomness of sampling can be avoided and the computation complexity can be reduced particularly in dense clutter. The simulation results show the validity of the proposed algorithm.