2019 53rd Asilomar Conference on Signals, Systems, and Computers最新文献

筛选
英文 中文
A Modified Logistic Regression for Positive and Unlabeled Learning 一种改进的逻辑回归方法用于正学习和无标签学习
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048765
Kristen Jaskie, C. Elkan, A. Spanias
{"title":"A Modified Logistic Regression for Positive and Unlabeled Learning","authors":"Kristen Jaskie, C. Elkan, A. Spanias","doi":"10.1109/IEEECONF44664.2019.9048765","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048765","url":null,"abstract":"The positive and unlabeled learning problem is a semi-supervised binary classification problem. In PU learning, only an unknown percentage of positive samples are known, while the remaining samples, both positive and negative, are unknown. We wish to learn a decision boundary that separates the positive and negative data distributions. In this paper, we build on an existing popular probabilistic positive unlabeled learning algorithm and introduce a new modified logistic regression learner with a variable upper bound that we argue provides a better theoretical solution for this problem. We then apply this solution to both simulated data and to a simple image classification problem using the MNIST dataset with significantly improved results.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"99 1","pages":"2007-2011"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78366431","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}
引用次数: 12
Scan-Specific Residual Convolutional Neural Networks for Fast MRI Using Residual RAKI 基于残差RAKI的快速MRI扫描特异性残差卷积神经网络
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048706
Chi Zhang, S. A. Hosseini, S. Moeller, Sebastian Weingärtner, K. Uğurbil, M. Akçakaya
{"title":"Scan-Specific Residual Convolutional Neural Networks for Fast MRI Using Residual RAKI","authors":"Chi Zhang, S. A. Hosseini, S. Moeller, Sebastian Weingärtner, K. Uğurbil, M. Akçakaya","doi":"10.1109/IEEECONF44664.2019.9048706","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048706","url":null,"abstract":"Parallel imaging is a widely-used acceleration technique for magnetic resonance imaging (MRI). Conventional linear reconstruction approaches in parallel imaging suffer from noise amplification. Recently, a non-linear method that utilizes subject- specific convolutional neural networks for k-space reconstruction, Robust Artificial-neural-networks for k-space Interpolation (RAKI) was proposed and shown to improve noise resilience over linear methods. However, the linear convolutions still provide a sufficient baseline image quality and interpretability. In this paper, we sought to utilize a residual network architecture to combine the benefits of both the linear and non-linear RAKI reconstructions. This hybrid method, called residual RAKI (rRAKI) offers significant improvement in image quality compared to linear method, and improves upon RAKI in highly- accelerated simultaneous multi-slice imaging. Furthermore, it establishes an interpretable view for the use of CNNs in parallel imaging, as the CNN component in the residual network removes the noise amplification arising from the linear part.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"9 1","pages":"1476-1480"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78509011","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
Super-Directive Antenna Arrays: Fundamentals and New Perspectives 超级指令天线阵列:基本原理和新观点
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048753
T. Marzetta
{"title":"Super-Directive Antenna Arrays: Fundamentals and New Perspectives","authors":"T. Marzetta","doi":"10.1109/IEEECONF44664.2019.9048753","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048753","url":null,"abstract":"Wireless power transfer between an array of antennas and a single-antenna terminal is governed by matrix circuit theory. A complex-valued, non-conjugate symmetric impedance matrix constitutes a complete quantitative description of the system. The real-part of the impedance matrix is non-negative definite. The efficiency with which power can be transferred-either down-link (from the antenna array to the single-antenna terminal) or up-link (from the terminal to the array) is equal to the ratio of received power to transmitted power. The maximization of power transfer efficiency with respect to the joint transmit/receive activities yields the fact that the optimized up-link efficiency is equal to the optimized down-link efficiency. The typical operation of antenna arrays seeks to minimize mutual coupling among the constituent antennas by spacing the antennas at least half of a wave-length apart, which yields an array gain proportional to the number of antennas. By utilizing closer spacing, and deliberately creating strong mutual coupling, in principle it is possible to realize considerably higher array gains for the same number of antennas, a phenomenon called super-directivity. Practical super-directivity would benefit not only wireless communications, but also wireless power transfer.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"56 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79826464","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}
引用次数: 24
Short-Packet Transmission over a Bidirectional Massive MIMO link 双向大规模MIMO链路上的短包传输
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048838
Johan Östman, A. Lancho, G. Durisi
{"title":"Short-Packet Transmission over a Bidirectional Massive MIMO link","authors":"Johan Östman, A. Lancho, G. Durisi","doi":"10.1109/IEEECONF44664.2019.9048838","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048838","url":null,"abstract":"We consider the transmission of short packets over a bidirectional communication link where multiple devices, e.g., sensors and actuators, exchange small-data payloads with a base station equipped with a large antenna array. Using results from finite-blocklength information theory, we characterize the minimum SNR required to achieve a target error probability for a fixed packet length and a fixed payload size. Our non-asymptotic analysis, which applies to the scenario in which the bidirectional communication is device-initiated, and also to the more challenging case when it is base-station initiated, provides guidelines on the design of massive multiple-input multiple-output links that need to support sporadic ultra-reliable low-latency transmissions. Specifically, it allows us to determine the optimal amount of resources that need to be dedicated to the acquisition of channel state information.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"195 1","pages":"1399-1403"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79831767","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
Entropy-Based Non-Data-Aided SNR Estimation 基于熵的非数据辅助信噪比估计
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048732
Ferran de Cabrera, J. Riba
{"title":"Entropy-Based Non-Data-Aided SNR Estimation","authors":"Ferran de Cabrera, J. Riba","doi":"10.1109/IEEECONF44664.2019.9048732","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048732","url":null,"abstract":"A non-data-aided SNR estimation of a communication channel is addressed in this paper. The main contribution relies on the relationship between an entropy measure of a given constellation and the link quality. The main advantage is that the second order Rényi entropy is invariant to the rotation of the constellation and it is not envelope-based as the moment-based methods, enabling to asymptotically approximate the CRLB of coherent estimators at high SNR for an increasing data size. Comparative results are shown with other non-data-aided SNR estimation techniques.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"16 1","pages":"731-735"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80363536","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
Joint User Clustering and Content Caching with Heterogeneous User Content Preferences 基于异构用户内容偏好的联合用户聚类和内容缓存
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048847
Feng Chiu, Ting-Yu Kuo, Feng-Tsun Chien, Wan-Jen Huang, Min-Kuan Chang
{"title":"Joint User Clustering and Content Caching with Heterogeneous User Content Preferences","authors":"Feng Chiu, Ting-Yu Kuo, Feng-Tsun Chien, Wan-Jen Huang, Min-Kuan Chang","doi":"10.1109/IEEECONF44664.2019.9048847","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048847","url":null,"abstract":"In this paper, we consider a joint design of the user clustering and content caching in the cache-enabled heterogenous network (HetNet) in which users in the network have distinct content preferences. The joint clustering and caching in the HetNet relies on multitude of factors, such as channel gains in all links, which may not be fully known in practice. Besides, clustering and caching may exhibit a fundamental tradeoff between the content hit probability and the spectral efficiency. We are therefore motivated to tackle this challenging problem by the deep reinforcement learning (DRL). In particular, the deep deterministic policy gradient (DDPG) algorithm is employed to manage the dynamics of clustering and caching in the HetNet with a sizable action space. Simulation results are presented to demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"37 1","pages":"1314-1317"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81292476","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
Sparse Code-Domain Non-Orthogonal Random Access with Peeling Decoder 带剥离解码器的稀疏码域非正交随机存取
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049075
Johannes Dommel, Z. Utkovski, L. Thiele, S. Stańczak
{"title":"Sparse Code-Domain Non-Orthogonal Random Access with Peeling Decoder","authors":"Johannes Dommel, Z. Utkovski, L. Thiele, S. Stańczak","doi":"10.1109/IEEECONF44664.2019.9049075","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049075","url":null,"abstract":"In this paper, we propose a modification of (general) sparse-coded non-orthogonal multiple access (NOMA) designs, amenable to receiver-side processing based on peeling decoding. We numerically evaluate the joint effects of sparse signature design and forward-error correction, and characterize the interplay between the system parameters such as signature sparsity, system load, and channel coding rate. The receiver processing is performed in a (turbo-like) fashion where extrinsic information is exchanged between a multi-user-detection module employing peeling decoding, and a forward error correction (FEC) module operating on the level of individual users. As the complexity of the peeling decoding procedure is lower than the general message passing algorithm (MPA) implementation based on belief propagation, it can be particularly attractive for grant-free, nonorthogonal transmissions targeting massive connectivity in the context of the Internet-of-Things.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"6 1","pages":"984-988"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76248827","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
Bipartite Structured Gaussian Graphical Modeling via Adjacency Spectral Priors 基于邻接谱先验的二部结构高斯图形建模
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048752
Sandeep Kumar, Jiaxi Ying, José Vinícius de Miranda Cardoso, D. Palomar
{"title":"Bipartite Structured Gaussian Graphical Modeling via Adjacency Spectral Priors","authors":"Sandeep Kumar, Jiaxi Ying, José Vinícius de Miranda Cardoso, D. Palomar","doi":"10.1109/IEEECONF44664.2019.9048752","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048752","url":null,"abstract":"Learning a graph with a bipartite structure IS essential for interpretability and identification of the relationships among data in numerous applications including document clustering, network medicine, etc. To learn a bipartite structure is equivalent to a max-cut problem, which is an NP-hard problem. Existing methods employ a two-stage procedure and are computationally demanding as they require solving semi-definite programming. In this paper, we introduce a bipartite graph learning framework lying at the integration of Gaussian graphical models (GGM) and spectral graph theory. The proposed algorithms are provably convergent and practically amenable for large-scale unsupervised graph learning tasks. Numerical experiments demonstrate the effectiveness of the proposed algorithm over existing state-of-the-art methods. An R package containing code for all the experimental results is available at https://cran.r-project.org/package=spectralGraphTopology.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"2 1","pages":"322-326"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87567890","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
A Design Framework for Invertible Logic 可逆逻辑的设计框架
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048700
N. Onizawa, Kaito Nishino, S. C. Smithson, B. Meyer, W. Gross, Hitoshi Yamagata, Hiroyuki Fujita, T. Hanyu
{"title":"A Design Framework for Invertible Logic","authors":"N. Onizawa, Kaito Nishino, S. C. Smithson, B. Meyer, W. Gross, Hitoshi Yamagata, Hiroyuki Fujita, T. Hanyu","doi":"10.1109/IEEECONF44664.2019.9048700","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048700","url":null,"abstract":"Invertible logic using a probabilistic magnetoresistive device model has been recently presented that can operate in bidirectional ways and solve several problems quickly, such as factorization and combinational optimization. In this paper, we present a design framework for large- scale invertible logic circuits. Our approach makes use of linear programming to create a Hamiltonian library with the minimum number of nodes. In addition, as the device model is approximated based on stochastic computing in SystemVerilog, a faster simulation using the compiled SystemC binary is realized than a conventional SPICE-level simulation. We have evaluated our framework on designing invertible multipliers, which realizes almost 5 order-of-magnitude faster simulation than a conventional method.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"20 1","pages":"312-316"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88098451","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
Coupled Block-term Tensor Decomposition Based Blind Spectrum Cartography 基于块项张量分解的盲光谱制图
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048667
Guoyong Zhang, Xiao Fu, Jun Wang, Mingyi Hong
{"title":"Coupled Block-term Tensor Decomposition Based Blind Spectrum Cartography","authors":"Guoyong Zhang, Xiao Fu, Jun Wang, Mingyi Hong","doi":"10.1109/IEEECONF44664.2019.9048667","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048667","url":null,"abstract":"Spectrum cartography aims at estimating the pattern of wideband signal power propagation over a region of interest (i.e. the radio map)—from limited samples taken sparsely over the region. Classical cartography methods are mostly concerned with recovering the aggregate radio frequency (RF) information while ignoring the constituents of the radio map— but fine-grained emitter-level RF information is of great interest. In addition, most existing cartography methods are based on random geographical sampling that is considered difficult to implement in some cases, due to legal/privacy/security issues. The theoretical aspects (e.g., identifiability of the radio map) of many existing methods are also unclear. In this work, we propose a radio map disaggregation method that is based on coupled block-term tensor decomposition. Our method guarantees identifiability of the individual wideband radio map of each emitter in the geographical region of interest (thereby that of the aggregate radio map as well), under some realistic conditions. The identifiability result holds under a large variety of geographical sampling patterns, including many pragmatic systematic sampling strategies. We also propose an effective optimization algorithm to carry out the formulated coupled tensor decomposition problem.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"14 1","pages":"1644-1648"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86115653","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
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学术官方微信