{"title":"On the PDF of the square of constrained minimal singular value for robust signal recovery analysis","authors":"O. James","doi":"10.1109/ECS.2015.7124876","DOIUrl":null,"url":null,"abstract":"In compressed sensing, the l1-constrained minimal singular value (l1-CMSV) of an encoder is used for analyzing (theoretically) the robustness of decoders against noise. In this paper, we show that for random encoders, the square of the l1-CMSV (S-CMSV) is a random variable. And, for the Gaussian encoders, the S-CMSV admits a simple, closed-form probability and a cumulative distribution functions. We illustrate the benefits of these distributions for analyzing the robustness of various decoders. In particular, we interpret the existing theoretical robustness results of the decoders such as the basis pursuit in terms of the maximum possible undersampling.","PeriodicalId":202856,"journal":{"name":"2015 2nd International Conference on Electronics and Communication Systems (ICECS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 2nd International Conference on Electronics and Communication Systems (ICECS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECS.2015.7124876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In compressed sensing, the l1-constrained minimal singular value (l1-CMSV) of an encoder is used for analyzing (theoretically) the robustness of decoders against noise. In this paper, we show that for random encoders, the square of the l1-CMSV (S-CMSV) is a random variable. And, for the Gaussian encoders, the S-CMSV admits a simple, closed-form probability and a cumulative distribution functions. We illustrate the benefits of these distributions for analyzing the robustness of various decoders. In particular, we interpret the existing theoretical robustness results of the decoders such as the basis pursuit in terms of the maximum possible undersampling.