{"title":"通过l-1/l-∞范数最小化来平衡多个时间实例的传感器管理","authors":"Cristian Rusu, J. Thompson, N. Robertson","doi":"10.1109/ICASSP.2017.7952769","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a solution to the sensor management problem over multiple time instances that balances the accuracy of the sensor network estimation with its utilization. We show how this problem reduces to a binary optimization problem for which we give a convex relaxation based solution that involves the minimization of a regularized ℓ∞ reweighted ℓ1 norm. We show experimentally the behavior of the proposed algorithm and compare it with previous methods from the literature.","PeriodicalId":118243,"journal":{"name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Balanced sensor management across multiple time instances via l-1/l-infinity norm minimization\",\"authors\":\"Cristian Rusu, J. Thompson, N. Robertson\",\"doi\":\"10.1109/ICASSP.2017.7952769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a solution to the sensor management problem over multiple time instances that balances the accuracy of the sensor network estimation with its utilization. We show how this problem reduces to a binary optimization problem for which we give a convex relaxation based solution that involves the minimization of a regularized ℓ∞ reweighted ℓ1 norm. We show experimentally the behavior of the proposed algorithm and compare it with previous methods from the literature.\",\"PeriodicalId\":118243,\"journal\":{\"name\":\"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.2017.7952769\",\"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 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2017.7952769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Balanced sensor management across multiple time instances via l-1/l-infinity norm minimization
In this paper, we propose a solution to the sensor management problem over multiple time instances that balances the accuracy of the sensor network estimation with its utilization. We show how this problem reduces to a binary optimization problem for which we give a convex relaxation based solution that involves the minimization of a regularized ℓ∞ reweighted ℓ1 norm. We show experimentally the behavior of the proposed algorithm and compare it with previous methods from the literature.