2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第9页

Robust linear dimensionality reduction for hypothesis testing with application to sensor selection 假设检验的鲁棒线性降维及其在传感器选择中的应用

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394788

D. Bajović, B. Sinopoli, Joao Xavier

{"title":"Robust linear dimensionality reduction for hypothesis testing with application to sensor selection","authors":"D. Bajović, B. Sinopoli, Joao Xavier","doi":"10.1109/ALLERTON.2009.5394788","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394788","url":null,"abstract":"This paper addresses robust linear dimensionality reduction (RLDR) for binary Gaussian hypothesis testing. The goal is to find a linear map from the high dimensional space where the data vector lives to a low dimensional space where the hypothesis test is carried out. The linear map is designed to maximize the detector performance. This translates into maximizing the Kullback-Leibler (KL) distance between the two projected distributions. In practice, the distribution parameters are estimated from training data, thus subject to uncertainty. This is modeled by allowing the distribution parameters to drift within some confidence regions. We address the case where only the mean values of the Gaussian distributions, m0 and m1, are uncertain with confidence ellipsoids defined by the corresponding covariance matrices, S0 and S1. Under this setup, we find the linear map that maximizes the KL distance for the worst case drift of the mean values. We solve the problem globally for the case of linear mapping to one dimension, reducing it to a grid search over a finite interval. Our solution shows superior performance compared to robust linear discriminant analysis techniques recently proposed in the literature. In addition, we use our RLDR solution as a building block to derive a sensor selection algorithm for robust event detection, in the context of sensor networks. Our sensor selection algorithm shows quasi-optimal performance: worst-case KL distance for suboptimal sensor selection is at most 15% smaller than worst-case KL distance for the optimal sensor selection obtained by exhaustive search.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121473288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Secure relaying: Can publicly transferred keys increase degrees of freedom? 安全中继:公开传输的密钥能增加自由度吗?

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394873

T.T. Kim, H. Poor

{"title":"Secure relaying: Can publicly transferred keys increase degrees of freedom?","authors":"T.T. Kim, H. Poor","doi":"10.1109/ALLERTON.2009.5394873","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394873","url":null,"abstract":"Secure communication over a half-duplex relay system in the presence of an external wiretapper is investigated. In such a scenario, conventional relaying protocols generally provide secrecy rates that converge to a finite constant in the high signal-to-noise ratio (SNR) regime. It is shown in this work that strictly superior performance can be achieved by allowing the destination to transfer random keys in the form of known interference to the relay insecurely over the wireless medium. When there is no direct link between the source and the destination, an amplify-and-forward (AF) protocol is shown to achieve a secrecy rate that scales as 1/2 log SNR, if each of the legitimate nodes has a single antenna only. However, in the presence of a direct link between source and destination, this scaling rule no longer applies. The bottleneck of the AF scheme in the presence of a direct source-destination link is identified, motivating the use of multiple antennas at the destination to almost surely guarantee a secure degree of freedom of one half over the channel. The results hold even if the eavesdropper has more antennas than the source and the relay combined.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"85 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122603533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Enhanced CDMA communications using compressed-sensing reconstruction methods 利用压缩感知重构方法增强CDMA通信

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394537

V. Aggarwal, L. Applebaum, A. Bennatan, A. Calderbank, S. Howard, S. Searle

引用次数: 10

Distributed universally optimal strategies for interference channels with partial message passing 部分消息传递干扰信道的分布式全局最优策略

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394910

V. Aggarwal, A. Avestimehr, A. Sabharwal

引用次数: 8

Loss of continuity in cellular networks under stabilizing transmit power control 稳定发射功率控制下蜂窝网络的连续性损失

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394894

V. Kulkarni, V. Fromion, T. Alpcan, M. Safonov

引用次数: 1

FPGA-based low-complexity high-throughput tri-mode decoder for quasi-cyclic LDPC codes 基于fpga的准循环LDPC码低复杂度高吞吐量三模解码器

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394917

Xiaoheng Chen, Qin Huang, Shu Lin, V. Akella

{"title":"FPGA-based low-complexity high-throughput tri-mode decoder for quasi-cyclic LDPC codes","authors":"Xiaoheng Chen, Qin Huang, Shu Lin, V. Akella","doi":"10.1109/ALLERTON.2009.5394917","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394917","url":null,"abstract":"This paper presents an FPGA-based implementation of a tri-mode decoder for decoding the cyclic (4095,3367) Euclidean geometry LDPC code which has minimum distance 65 and no trapping set of size less than 65. The implementation integrates three compatible decoding algorithms in a single decoder. The three decoding algorithms are the one-step majority-logic decoding (OS-MLGD) algorithm and two iterative binary message passing algorithms (IBMP) derived from the OS-MLGD algorithm, one based on soft reliability information and the other on hard reliability information. All three algorithms requires only binary logical operations, integer additions, and single-bit messages, which makes them significantly less complex in terms of hardware requirements than sum-product algorithm, with a very modest loss in performance. The implementation is based on the partially parallel architecture and is optimized to take advantage of the high-speed dual-ported block RAMs in a Xilinx Virtex-4 FPGA. An optimization called memory sharing is introduced to take advantage of the configurable data width (word size) of the block RAMs to accommodate the 262080 edges in the Tanner graph of the (4095,3367) code. A technique is introduced to decode two codewords simultaneously to take advantage of the depth of the block RAMs. As a result, the proposed implementation achieves a throughput of 1.9 Gbps on a Virtex-4 LX160 FPGA and supports bit-error rate simulation down to 10−11 in a day or so.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124176557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 13

Information complexity of black-box convex optimization: A new look via feedback information theory 黑盒凸优化的信息复杂性:基于反馈信息理论的新视角

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394945

M. Raginsky, A. Rakhlin

{"title":"Information complexity of black-box convex optimization: A new look via feedback information theory","authors":"M. Raginsky, A. Rakhlin","doi":"10.1109/ALLERTON.2009.5394945","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394945","url":null,"abstract":"This paper revisits information complexity of black-box convex optimization, first studied in the seminal work of Nemirovski and Yudin, from the perspective of feedback information theory. These days, large-scale convex programming arises in a variety of applications, and it is important to refine our understanding of its fundamental limitations. The goal of black-box convex optimization is to minimize an unknown convex objective function from a given class over a compact, convex domain using an iterative scheme that generates approximate solutions by querying an oracle for local information about the function being optimized. The information complexity of a given problem class is defined as the smallest number of queries needed to minimize every function in the class to some desired accuracy. We present a simple information-theoretic approach that not only recovers many of the results of Nemirovski and Yudin, but also gives some new bounds pertaining to optimal rates at which iterative convex optimization schemes approach the solution. As a bonus, we give a particularly simple derivation of the minimax lower bound for a certain active learning problem on the unit interval.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122644924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Beyond network equivalence 超越网络等价

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394886

R. Koetter, M. Effros, M. Meadard

引用次数: 5

Expander codes over reals, Euclidean sections, and compressed sensing 在实数、欧几里得节和压缩感知上扩展代码

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394536

V. Guruswami, James R. Lee, A. Wigderson

引用次数: 1

Outlier detection via localized p-value estimation 通过局部p值估计进行离群值检测

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394501

Manqi Zhao, Venkatesh Saligrama

{"title":"Outlier detection via localized p-value estimation","authors":"Manqi Zhao, Venkatesh Saligrama","doi":"10.1109/ALLERTON.2009.5394501","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394501","url":null,"abstract":"We propose a novel non-parametric adaptive outlier detection algorithm, called LPE, for high dimensional data based on score functions derived from nearest neighbor graphs on n-point nominal data. Outliers are predicted whenever the score of a test sample falls below α, which is supposed to be the desired false alarm level. The resulting outlier detector is shown to be asymptotically optimal in that it is uniformly most powerful for the specified false alarm level, α, for the case when the density associated with the outliers is a mixture of the nominal and a known density. Our algorithm is computationally efficient, being linear in dimension and quadratic in data size. The whole empirical Receiving Operating Characteristics (ROC) curve can be derived with almost no additional cost based on the estimated score function. It does not require choosing complicated tuning parameters or function approximation classes and it can adapt to local structure such as local change in dimensionality by incorporating the technique of manifold learning. We demonstrate the algorithm on both artificial and real data sets in high dimensional feature spaces.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125499334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4