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

筛选
英文 中文
Hardware-Efficient Seizure Detection 硬件高效的癫痫检测
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049047
Bingzhao Zhu, Mahsa Shoaran
{"title":"Hardware-Efficient Seizure Detection","authors":"Bingzhao Zhu, Mahsa Shoaran","doi":"10.1109/IEEECONF44664.2019.9049047","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049047","url":null,"abstract":"Hardware-efficient classification is essential for applications such as medical implants, wearables, and IoT devices, with severe energy and resources constraints. Here, we propose a hardware-efficient machine learning algorithm based on gradient boosted decision trees. Specifically, we train our model to minimize the energy cost associated with feature extraction, and reduce the model size by employing a fixed point quantization method. Hardware parameters such as filter order and coefficient resolution are further optimized for seizure detection task to achieve a reasonable trade-off between performance and hardware cost. Testing this model on the intracranial EEG (iEEG) recordings from 10 patients with epilepsy, we are able to reduce the energy cost by 68.4% compared to the base model, and quantize the tree parameters with 3b (for leaf weights) and 10b (for thresholds), while maintaining the classification performance.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"3 1","pages":"2040-2043"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89222202","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
Optimal deception attack on networked vehicular cyber physical systems 网络化车辆网络物理系统的最优欺骗攻击
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048730
Moulik Choraria, Arpan Chattopadhyay, U. Mitra, E. Ström
{"title":"Optimal deception attack on networked vehicular cyber physical systems","authors":"Moulik Choraria, Arpan Chattopadhyay, U. Mitra, E. Ström","doi":"10.1109/IEEECONF44664.2019.9048730","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048730","url":null,"abstract":"Herein, design of false data injection attack on a distributed cyber-physical system is considered. A stochastic process with linear dynamics and Gaussian noise is measured by multiple agent nodes, each equipped with multiple sensors. The agent nodes form a multi-hop network among themselves. Each agent node computes an estimate of the process by using its sensor observations and messages obtained from neighbouring nodes, via Kalman-consensus filtering. An external attacker, capable of arbitrarily manipulating the sensor observations of some or all agent nodes, injects errors into those sensor observations. The goal of the attacker is to steer the estimates at the agent nodes as close as possible to a pre-specified value, while respecting a constraint on the attack detection probability. To this end, a constrained optimization problem is formulated to find the optimal parameter values of a certain class of linear attacks. The parameters of linear attack are learnt on-line via a combination of stochastic approximation and online stochastic gradient descent. Numerical results demonstrate the efficacy of the attack.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"1131-1135"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90155503","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
Secure Regularized Zero Forcing for Multiuser MIMOME Channels 多用户MIMOME信道的安全正则化零强制
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048726
S. Asaad, Ali Bereyhi, R. Müller, R. Schaefer
{"title":"Secure Regularized Zero Forcing for Multiuser MIMOME Channels","authors":"S. Asaad, Ali Bereyhi, R. Müller, R. Schaefer","doi":"10.1109/IEEECONF44664.2019.9048726","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048726","url":null,"abstract":"This paper proposes a new linear precoding scheme for downlink transmission in MIMOME channels, referred to as secure regularized zero forcing. The scheme modifies regularized zero forcing precoding, such that the beamformers further suppress the information leakage towards the eavesdroppers. The proposed scheme is characterized in the large-system limit, and a closed-form expression for the achievable ergodic secrecy rate per user is derived. Numerical investigations demonstrate high robustness against the quality of eavesdroppers’ channel.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"9 1","pages":"1108-1113"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90344539","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}
引用次数: 6
Smooth Fictitious Play in N × 2 Potential Games N × 2潜在游戏中的平滑虚拟玩法
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048995
Brian Swenson, H. Poor
{"title":"Smooth Fictitious Play in N × 2 Potential Games","authors":"Brian Swenson, H. Poor","doi":"10.1109/IEEECONF44664.2019.9048995","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048995","url":null,"abstract":"The paper shows that smooth fictitious play converges to a neighborhood of a pure-strategy Nash equilibrium with probability 1 in almost all N × 2 (N-player, two-action) potential games. The neighborhood of convergence may be made arbitrarily small by taking the smoothing parameter to zero. Simple proof techniques are furnished by considering regular potential games.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"124 3","pages":"1739-1743"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91408489","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
Convergence of Iterative Hard Thresholding Variants with Application to Asynchronous Parallel Methods for Sparse Recovery 迭代硬阈值变量的收敛性及其在异步并行稀疏恢复方法中的应用
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048787
Jamie Haddock, D. Needell, Alireza Zaeemzadeh, N. Rahnavard
{"title":"Convergence of Iterative Hard Thresholding Variants with Application to Asynchronous Parallel Methods for Sparse Recovery","authors":"Jamie Haddock, D. Needell, Alireza Zaeemzadeh, N. Rahnavard","doi":"10.1109/IEEECONF44664.2019.9048787","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048787","url":null,"abstract":"Recently several asynchronous parallel algorithms for sparse recovery have been proposed. These methods share an estimation of the support of the signal between nodes, which then use this information in addition to their local estimation of the support to update via an iterative hard thresholding (IHT) method. We analyze a generalized version of the IHT method run on each of the nodes and show that this method performs at least as well as the standard IHT method. We perform numerical simulations that illustrate the potential advantage these methods enjoy over the standard IHT.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"80 1","pages":"276-279"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83139866","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
IEEECONF 2019 Author Index ieee econf 2019作者索引
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/ieeeconf44664.2019.9048725
{"title":"IEEECONF 2019 Author Index","authors":"","doi":"10.1109/ieeeconf44664.2019.9048725","DOIUrl":"https://doi.org/10.1109/ieeeconf44664.2019.9048725","url":null,"abstract":"","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79641515","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
Unsupervised Learning of Nonlinear Mixtures: Identifiability and Algorithm 非线性混合的无监督学习:可辨识性与算法
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048661
Bo Yang, Xiao Fu, N. Sidiropoulos, Kejun Huang
{"title":"Unsupervised Learning of Nonlinear Mixtures: Identifiability and Algorithm","authors":"Bo Yang, Xiao Fu, N. Sidiropoulos, Kejun Huang","doi":"10.1109/IEEECONF44664.2019.9048661","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048661","url":null,"abstract":"Linear mixture models (LMMs) have proven very useful in a plethora of applications, e.g., topic modeling, clustering, and speech / audio separation. As a critical aspect of the LMM, identifiability of the model parameters is well-studied, under frameworks such as independent component analysis and constrained matrix factorization. Nevertheless, when the linear mixtures are distorted by unknown nonlinear functions – which is well-motivated and more realistic in many cases – the associated identifiability issues are far less studied. This work focuses on parameter identification of a nonlinear mixture model that is motivated by a number of real-world applications, e.g., hyperspectral imaging and magnetic resonance imaging. A novel identification criterion is proposed and the associated identifiability issues are studied. A practical implementation based on a judiciously designed neural network is proposed to realize the criterion, and an effective learning algorithm is proposed. Numerical results on synthetic and real application data corroborate the effectiveness of the proposed method.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"23 1","pages":"1040-1044"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79650393","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
Reinforcement Learning for Cognitive Radar Task Scheduling 认知雷达任务调度的强化学习
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048892
M. Gaafar, M. Shaghaghi, R. Adve, Z. Ding
{"title":"Reinforcement Learning for Cognitive Radar Task Scheduling","authors":"M. Gaafar, M. Shaghaghi, R. Adve, Z. Ding","doi":"10.1109/IEEECONF44664.2019.9048892","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048892","url":null,"abstract":"Cognitive Radars (CRs) have the capability to adapt to their environment and accumulate knowledge from their interactions with the environment. This paper deals with the Radar Resource Management (RRM) problem where the radar assigns limited time resources to a set of tasks. The problem is modeled as an optimization problem where the aim is to minimize the number of delayed and dropped tasks which is an NP-hard problem. We propose a modified Monte Carlo Tree Search (MCTS) approach to find an effective solution. We further develop a Reinforcement Learning (RL) solution that uses a Neural Network (NN) to guide the modified MCTS. This produces a stable RL algorithm that learns on its own, requires no external training data, and can adapt to a varying environment. The results show the proposed RL algorithm outperforms other techniques including commonly used heuristics and produces close to optimal results.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"48 1","pages":"1653-1657"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89275215","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}
引用次数: 6
Fast Color-guided Depth Denoising for RGB-D Images by Graph Filtering 基于图形滤波的RGB-D图像快速颜色引导深度去噪
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048703
Qiwei Huang, Ruikang Li, Zidong Jiang, Wei Feng, Sijie Lin, Hui Feng, Bo Hu
{"title":"Fast Color-guided Depth Denoising for RGB-D Images by Graph Filtering","authors":"Qiwei Huang, Ruikang Li, Zidong Jiang, Wei Feng, Sijie Lin, Hui Feng, Bo Hu","doi":"10.1109/IEEECONF44664.2019.9048703","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048703","url":null,"abstract":"Depth images captured by off-the-shelf RGB-D cameras suffer from much stronger noise than color images. In this paper, we propose a method to denoise the depth images in RGB-D images by color-guided graph filtering. Our iterative method contains two components: color-guided similarity graph construction, and graph filtering on the depth signal. Implemented in graph vertex domain, filtering is accelerated as computation only occurs among neighboring vertices. Experimental results show that our method outperforms state-of-art depth image denoising methods significantly both on quality and efficiency.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"5 1","pages":"1811-1815"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89336908","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
Synthetic Power Analyses: Empirical Evaluation and Application to Cognitive Neuroimaging 综合功率分析:经验评价及在认知神经影像学中的应用
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048971
Peiye Zhuang, Bliss Chapman, Ran Li, Oluwasanmi Koyejo
{"title":"Synthetic Power Analyses: Empirical Evaluation and Application to Cognitive Neuroimaging","authors":"Peiye Zhuang, Bliss Chapman, Ran Li, Oluwasanmi Koyejo","doi":"10.1109/IEEECONF44664.2019.9048971","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048971","url":null,"abstract":"In the experimental sciences, statistical power analyses are often used before data collection to determine the required sample size. However, traditional power analyses can be costly when data are difficult or expensive to collect. We propose synthetic power analyses; a framework for estimating statistical power at various sample sizes, and empirically explore the performance of synthetic power analysis for sample size selection in cognitive neuroscience experiments. To this end, brain imaging data is synthesized using an implicit generative model conditioned on observed cognitive processes. Further, we propose a simple procedure to modify the statistical tests which result in conservative statistics. Our empirical results suggest that synthetic power analysis could be a low-cost alternative to pilot data collection when the proposed experiments share cognitive processes with previously conducted experiments.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"102 1","pages":"1192-1196"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80595298","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学术官方微信