发布求助
文献互助 智能选刊 最新文献

2019 IEEE International Symposium on Information Theory (ISIT)最新文献

筛选
英文 中文
Towards theoretically-founded learning-based denoising 走向基于理论的基于学习的去噪
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849348
Wenda Zhou, S. Jalali
{"title":"Towards theoretically-founded learning-based denoising","authors":"Wenda Zhou, S. Jalali","doi":"10.1109/ISIT.2019.8849348","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849348","url":null,"abstract":"Denoising a stationary process (Xi)i∈ℤ corrupted by additive white Gaussian noise (Zi)i∈ℤ, i.e., recovering Xn from Yn = Xn + Zn, is a classic and fundamental problem in information theory and statistical signal processing. Theoretically-founded and computationally-efficient denoising algorithms which are applicable to general sources are yet to be found. In a Bayesian setup, given the distribution of Xn, a minimum mean square error (MMSE) denoiser computes E[Xn|Yn]. However, for general sources, computing E[Xn|Yn] is computationally very challenging, if not infeasible. In this paper, starting from a Bayesian setup, a novel denoiser, namely, quantized maximum a posteriori (Q-MAP) denoiser, is proposed and its asymptotic performance is analyzed. Both for memoryless sources, and for structured first-order Markov sources, it is shown that, asymptotically, as σ2 (noise variance) converges to zero, $frac{1}{{{sigma ^2}}}{text{E}}left[ {{{left( {{X_i} - hat X_i^{{text{Q - MAP}}}} right)}^2}} right]$ converges to the information dimension of the source. For the studied memoryless sources, this limit is known to be optimal. A key advantage of the Q-MAP denoiser is that, unlike a MMSE denoiser, it highlights the key properties of the source distribution that are to be used in its denoising. This naturally leads to a learning-based denoising algorithm. Using ImageNet database for training, initial simulation results exploring the performance of such a learning-based denoiser in image denoising are presented.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"43 1","pages":"2714-2718"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73737656","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}
引用次数: 2
A Proof of de Bruijn Identity based on Generalized Price’s Theorem 基于广义Price定理的de Bruijn恒等式的证明
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849368
J. Riba, Ferran de Cabrera
{"title":"A Proof of de Bruijn Identity based on Generalized Price’s Theorem","authors":"J. Riba, Ferran de Cabrera","doi":"10.1109/ISIT.2019.8849368","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849368","url":null,"abstract":"This paper shows that de Bruijn identity, which relates entropy with Fisher information, can be obtained as a particular case of an immediate generalization of Price’s theorem, which is a tool used in the analysis of nonlinear memoryless systems with Gaussian inputs. It is shown that, while the general Price’s theorem follows since the density of the perturbation satisfies the heat equation, the particular case of de Bruijn identity follows since the score function is zero-mean, which is the well-known condition that provides the insightful Cramér- Rao bound expression based on the negative second derivative of the log-likelihood function. The unified framework uses the characteristic function as a main tool and becomes a more intuitive alternative to the classical technical proof obtained by integrating by parts. Second-order Tsallis entropy is also briefly explored under this general framework.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"53 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74015306","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}
引用次数: 2
The Geometry of Community Detection via the MMSE Matrix 基于MMSE矩阵的社区检测几何
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849594
G. Reeves, Vaishakhi Mayya, A. Volfovsky
{"title":"The Geometry of Community Detection via the MMSE Matrix","authors":"G. Reeves, Vaishakhi Mayya, A. Volfovsky","doi":"10.1109/ISIT.2019.8849594","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849594","url":null,"abstract":"The information-theoretic limits of community detection have been studied extensively for network models with high levels of symmetry or homogeneity. The contribution of this paper is to study a broader class of network models that allow for variability in the sizes and behaviors of the different communities, and thus better reflect the behaviors observed in real-world networks. Our results show that the ability to detect communities can be described succinctly in terms of a matrix of effective signal-to-noise ratios that provides a geometrical representation of the relationships between the different communities. This characterization follows from a matrix version of the I-MMSE relationship and generalizes the concept of an effective scalar signal-to-noise ratio introduced in previous work. We provide explicit formulas for the asymptotic per-node mutual information and upper bounds on the minimum mean-squared error. The theoretical results are supported by numerical simulations.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"8 1","pages":"400-404"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75177231","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
Decoding of Generalized Three-Layer Integrated Interleaved Codes 广义三层集成交错码的译码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849285
Xinmiao Zhang
{"title":"Decoding of Generalized Three-Layer Integrated Interleaved Codes","authors":"Xinmiao Zhang","doi":"10.1109/ISIT.2019.8849285","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849285","url":null,"abstract":"Generalized integrated interleaved (GII) codes nest sub-codewords, also called interleaves, to generate parities shared by the interleaves. They achieve better tradeoffs compared to other locally recoverable erasure codes and are good candidates for hyper-speed data storage and communications. By nesting the interleaves in a hierarchical manner, the recent three-layer GII codes further improve the decoding locality. However, due to the fundamentally different structure and larger size of the nesting matrix, three-layer GII decoding faces many issues that do not exist previously. In this paper, constraints on the relative correction capabilities of the nested codes are defined to achieve the target correction goal. The bottleneck on syndrome conversion matrix inversion is eliminated by transforming the conversion matrices and syndrome vectors. The overall decoding process is optimized to increase correction capability and reduce complexity.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"14 1","pages":"2424-2428"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75212598","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}
引用次数: 3
Capacity of dynamical storage systems 动态存储系统的容量
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849745
Ohad Elishco, A. Barg
{"title":"Capacity of dynamical storage systems","authors":"Ohad Elishco, A. Barg","doi":"10.1109/ISIT.2019.8849745","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849745","url":null,"abstract":"We define a time-dependent model of erasure coding for distributed storage and estimate the average capacity of the network in the simple case of fixed link bandwidth that takes one of two given values. We show that if k data blocks are encoded into n blocks placed on n nodes of which n1 have links with bandwidth greater than the remaining n − n1 nodes by γ symbols, then the average capacity increases by Ω(γ(k – n1)2) symbols compared to the static model.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"1562-1566"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75666821","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}
引用次数: 2
Phase Transition in Mixed ℓ2/ℓ1-norm Minimization for Block-Sparse Compressed Sensing 块稀疏压缩感知中混合l2 / l1范数最小化的相变
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849798
Toshiyuki Tanaka
{"title":"Phase Transition in Mixed ℓ2/ℓ1-norm Minimization for Block-Sparse Compressed Sensing","authors":"Toshiyuki Tanaka","doi":"10.1109/ISIT.2019.8849798","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849798","url":null,"abstract":"We have evaluated, via the replica method, phase transition thresholds for the mixed ℓ2/ℓ1-norm minimization applied to block-sparse compressed sensing with randomly generated measurement matrices. Our analysis takes into account that the matrix elements may be of non-zero mean, and shows that the phase transition threshold for the mixed ℓ2/ℓ1-norm minimization improves when the matrix elements have non-zero mean and the distribution of non-zero blocks of the target vector to be estimated has a certain imbalance.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"124 1","pages":"2848-2852"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75813283","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}
引用次数: 0
Bounded Single Insertion/Deletion Correcting Codes 有界单插入/删除纠错码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849583
Takayuki Nozaki
{"title":"Bounded Single Insertion/Deletion Correcting Codes","authors":"Takayuki Nozaki","doi":"10.1109/ISIT.2019.8849583","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849583","url":null,"abstract":"A code is bounded single insertion/deletion correcting if a decoder corrects a single insertion or single deletion with side information about a range of positions occurring an inserted symbol or deleted symbol. This paper constructs two bounded single insertion/deletion correcting codes and gives decoding algorithms for these. Moreover, we evaluate the number of codewords of these codes. As a result, the constructed codes have larger cardinalities than the existing ones.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"102 1","pages":"2379-2383"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75697490","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}
引用次数: 8
New Sum-Rate Capacity Results for Multi-User Interference Channels 多用户干扰信道的新和速率容量结果
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849858
Reza Khosravi-Farsani
{"title":"New Sum-Rate Capacity Results for Multi-User Interference Channels","authors":"Reza Khosravi-Farsani","doi":"10.1109/ISIT.2019.8849858","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849858","url":null,"abstract":"The Interference Channels (ICs) represent fundamental building blocks of many wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two users, are still very limited. One of the main difficulties in the analysis of these networks is how to establish useful capacity outer bounds for them. In this paper, novel techniques requiring subtle sequential applications of the Csiszar-Korner identity are developed to establish efficient single-letter outer bounds on the sum-rate capacity of interference networks. Then, by using the derived outer bounds, a full characterization of the sum-rate capacity is obtained for various multi-user ICs under specific conditions. Our capacity results hold for both discrete and Gaussian networks.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"41 1","pages":"1277-1281"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74227670","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}
引用次数: 0
Community Detection with Side Information via Semidefinite Programming 基于半定规划的边信息社区检测
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849686
Mohammadjafar Esmaeili, H. Saad, Aria Nosratinia
{"title":"Community Detection with Side Information via Semidefinite Programming","authors":"Mohammadjafar Esmaeili, H. Saad, Aria Nosratinia","doi":"10.1109/ISIT.2019.8849686","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849686","url":null,"abstract":"Semidefinite programming is known to be both efficient and asymptotically optimal in solving community detection problems, but it has been studied in this context only when observations are purely graphical in nature. In this paper, we extend the use of semidefinite programming in community detection to observations that have both a graphical and a nongraphical component. We consider the binary censored block model with n nodes and study the effect of partially revealed labels on the performance of semidefinite programming. We address the question: do partially revealed labels help the semidefinite programming solution as much as they help the maximum likelihood solutionƒ Our results are twofold. First, we show that partially revealed labels change the phase transition of exact recovery if and only if the information they provide grows no slower than Ω(log(n)). Second, we show that the semidefinite programming relaxation of maximum likelihood can achieve exact recovery down to the optimal threshold under partially revealed labels.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"09 1","pages":"420-424"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80119712","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}
引用次数: 7
On Deletion/Insertion of Zeros and Asymmetric Error Control Codes* 零的删除/插入与非对称错误控制码*
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849470
L. Tallini, Nawaf Alqwaifly, B. Bose
{"title":"On Deletion/Insertion of Zeros and Asymmetric Error Control Codes*","authors":"L. Tallini, Nawaf Alqwaifly, B. Bose","doi":"10.1109/ISIT.2019.8849470","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849470","url":null,"abstract":"This paper gives some theory and efficient design of binary block codes capable of correcting the deletions of the symbol \"0\" (referred to as 0-deletions) and/or the insertions of the symbol \"0\" (referred to as 0-insertions). This problem of correcting 0-deletions and/or 0-insertions (referred to as 0-errors) is shown to be equivalent to the efficient design of some L1 metric asymmetric error control codes over the natural alphabet, ℕ. In particular, it is shown that t 0-insertion correcting codes are actually capable of correcting t 0-errors, detecting (t+1) 0-errors and, simultaneously, detecting all occurrences of only 0-deletions or only 0-insertions in every received word (briefly, they are t-Sy0EC/(t + 1)-Sy0ED/AU0ED codes). From the relations with the L1 distance error control codes, new improved bounds are given for the optimal t 0-error correcting codes. In addition, some optimal non-systematic code designs are also given. Decoding can be efficiently performed by algebraic means with the Extended Euclidean Algorithm.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"578 1","pages":"2384-2388"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85737778","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信