{"title":"VECTOR APPROXIMATE MESSAGE PASSING FOR QUANTIZED COMPRESSED SENSING","authors":"Daniel Franz, V. Kuehn","doi":"10.1109/GlobalSIP.2018.8646432","DOIUrl":null,"url":null,"abstract":"In recent years approximate message passing algorithms have gained a lot of attention and different versions have been proposed for coping with various system models. This paper focuses on vector approximate message passing (VAMP) for generalized linear models. While this algorithm is originally derived from a message passing point of view, we will review it from an estimation theory perspective and afterwards adapt it for a quantized compressed sensing application. Finally, numerical results are presented to evaluate the performance of the algorithm.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP.2018.8646432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In recent years approximate message passing algorithms have gained a lot of attention and different versions have been proposed for coping with various system models. This paper focuses on vector approximate message passing (VAMP) for generalized linear models. While this algorithm is originally derived from a message passing point of view, we will review it from an estimation theory perspective and afterwards adapt it for a quantized compressed sensing application. Finally, numerical results are presented to evaluate the performance of the algorithm.