{"title":"基于马尔可夫链蒙特卡罗的相关信号分布式检测(海报)","authors":"Xingjian Sun, Lei Cao, R. Viswanathan","doi":"10.1109/COGSIMA.2018.8423984","DOIUrl":null,"url":null,"abstract":"The distributed detection problem with consideration of correlated sensor observations is an NP-hard problem. In this paper, a heuristic Markov Chain Monte Carlo algorithm, which consists of methods of slice sampling and simulated annealing, is investigated to solve this problem. Based on the criterion of minimizing the probability of error, sub-optimal solutions including fusion rules and sensor decisions are acquired. The performance of this algorithm is studied with analysis of experimental results.","PeriodicalId":231353,"journal":{"name":"2018 IEEE Conference on Cognitive and Computational Aspects of Situation Management (CogSIMA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Detection of Correlated Signal Using Markov Chain Monte Carlo (Poster)\",\"authors\":\"Xingjian Sun, Lei Cao, R. Viswanathan\",\"doi\":\"10.1109/COGSIMA.2018.8423984\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The distributed detection problem with consideration of correlated sensor observations is an NP-hard problem. In this paper, a heuristic Markov Chain Monte Carlo algorithm, which consists of methods of slice sampling and simulated annealing, is investigated to solve this problem. Based on the criterion of minimizing the probability of error, sub-optimal solutions including fusion rules and sensor decisions are acquired. The performance of this algorithm is studied with analysis of experimental results.\",\"PeriodicalId\":231353,\"journal\":{\"name\":\"2018 IEEE Conference on Cognitive and Computational Aspects of Situation Management (CogSIMA)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Conference on Cognitive and Computational Aspects of Situation Management (CogSIMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COGSIMA.2018.8423984\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Conference on Cognitive and Computational Aspects of Situation Management (CogSIMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COGSIMA.2018.8423984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Detection of Correlated Signal Using Markov Chain Monte Carlo (Poster)
The distributed detection problem with consideration of correlated sensor observations is an NP-hard problem. In this paper, a heuristic Markov Chain Monte Carlo algorithm, which consists of methods of slice sampling and simulated annealing, is investigated to solve this problem. Based on the criterion of minimizing the probability of error, sub-optimal solutions including fusion rules and sensor decisions are acquired. The performance of this algorithm is studied with analysis of experimental results.