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

筛选
英文 中文
Average Age of Information in Multi-Source Self-Preemptive Status Update Systems with Packet Delivery Errors 具有包传递错误的多源自抢占状态更新系统中信息的平均年龄
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048914
S. Farazi, A. G. Klein, D. Brown
{"title":"Average Age of Information in Multi-Source Self-Preemptive Status Update Systems with Packet Delivery Errors","authors":"S. Farazi, A. G. Klein, D. Brown","doi":"10.1109/IEEECONF44664.2019.9048914","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048914","url":null,"abstract":"This paper studies the \"age of information\" (AoI) in a multi-source status update system where multiple sources send updates of their process to a monitor through a last-come first-served server with preemption in service and packet delivery errors. Arrival times of the status updates from the sources are assumed to be random according to independent Poisson processes. Service times are also assumed to be exponentially distributed and independent of the status arrivals. If the server is idle, any arriving packet immediately enters service. When the server is busy, if the arriving packet and the packet in service are from the same source, the packet in service is preempted and the new packet immediately enters service. Otherwise, any arriving packet is discarded. A closed-form expression for the average AoI of each source as a function of the system parameters is derived and, for the case without packet delivery errors, is compared to the average AoI in the \"source agnostic\" preemption setting considered by Yates and Kaul where any source can preempt any other source. The results show that source agnostic preemption in service results in better average AoI than self preemption in service for all sources.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"8 1","pages":"396-400"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87098146","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}
引用次数: 20
Modeling Variability in Brain Architecture with Deep Feature Learning 基于深度特征学习的脑结构变异性建模
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048805
Aishwarya H. Balwani, Eva L. Dyer
{"title":"Modeling Variability in Brain Architecture with Deep Feature Learning","authors":"Aishwarya H. Balwani, Eva L. Dyer","doi":"10.1109/IEEECONF44664.2019.9048805","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048805","url":null,"abstract":"The brain has long been divided into distinct areas based upon its local microstructure, or patterned composition of cells, genes, and proteins. While this taxonomy is incredibly useful and provides an essential roadmap for comparing two brains, there is also immense anatomical variability within areas that must be incorporated into models of brain architecture. In this work we leverage the expressive power of deep neural networks to create a data-driven model of intra- and inter-brain area variability. To this end, we train a convolutional neural network that learns relevant microstructural features directly from brain imagery. We then extract features from the network and fit a simple classifier to them, thus creating a simple, robust, and interpretable model of brain architecture. We further propose and show preliminary results for the use of features from deep neural networks in conjunction with unsupervised learning techniques to find fine-grained structure within brain areas. We apply our methods to micron-scale X-ray microtomography images spanning multiple regions in the mouse brain and demonstrate that our deep feature-based model can reliably discriminate between brain areas, is robust to noise, and can be used to reveal anatomically relevant patterns in neural architecture that the network wasn’t trained to find.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"2 1","pages":"1186-1191"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87136699","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
Approximated Canonical Signed Digit for Error Resilient Intelligent Computation 误差弹性智能计算的近似正则有符号数
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049051
G. Cardarilli, L. Nunzio, R. Fazzolari, A. Nannarelli, M. Re
{"title":"Approximated Canonical Signed Digit for Error Resilient Intelligent Computation","authors":"G. Cardarilli, L. Nunzio, R. Fazzolari, A. Nannarelli, M. Re","doi":"10.1109/IEEECONF44664.2019.9049051","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049051","url":null,"abstract":"Lowering the energy consumption in applications operating on large datasets is one of the main challenges in modern computing. In this context, it is especially important to lower the energy required to transfer data from/to the memory. Usually, this is obtained by applying smart encoding techniques to the data. In this work, we show how to reduce the switching activity in buses and floating-point units by an approximated canonical signed-digit encoder. The precision of the encoding is programmable and can be chosen depending on the application’s required accuracy.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"17 1","pages":"1616-1620"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87191412","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
Low-Rank Modeling of Local Sinogram Neighborhoods with Tomographic Applications 层析成像应用于局部正弦图邻域的低秩建模
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048651
Rodrigo A. Lobos, R. Leahy, J. Haldar
{"title":"Low-Rank Modeling of Local Sinogram Neighborhoods with Tomographic Applications","authors":"Rodrigo A. Lobos, R. Leahy, J. Haldar","doi":"10.1109/IEEECONF44664.2019.9048651","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048651","url":null,"abstract":"Previous work has demonstrated that Fourier imaging data will often possess multifold linear shift-invariant autoregression relationships. This autoregressive structure is useful because it enables missing data samples to be imputed as a linear combination of neighboring samples, and also implies that certain structured matrices formed from the data will have low rank characteristics. The latter observation has enabled a range of powerful structured low-rank matrix recovery techniques for reconstructing sparsely-sampled and/or low-quality data in Fourier imaging modalities like magnetic resonance imaging. In this work, we demonstrate theoretically and empirically that similar modeling principles also apply to sinogram data, and demonstrate how this can be leveraged to restore missing information from real high-resolution X-ray imaging data from an integrated circuit.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"41 1","pages":"65-68"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85722264","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
Deep Learning for Musculoskeletal Image Analysis 肌肉骨骼图像分析的深度学习
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048671
I. Irmakci, S. Anwar, D. Torigian, Ulas Bagci
{"title":"Deep Learning for Musculoskeletal Image Analysis","authors":"I. Irmakci, S. Anwar, D. Torigian, Ulas Bagci","doi":"10.1109/IEEECONF44664.2019.9048671","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048671","url":null,"abstract":"The diagnosis, prognosis, and treatment of patients with musculoskeletal (MSK) disorders require radiology imaging (using computed tomography, magnetic resonance imaging (MRI), and ultrasound) and their precise analysis by expert radiologists. Radiology scans can also help assessment of metabolic health, aging, and diabetes. This study presents how machine learning, specifically deep learning methods, can be used for rapid and accurate image analysis of MRI scans, an unmet clinical need in MSK radiology. As a challenging example, we focus on automatic analysis of knee images from MRI scans and study machine learning classification of various abnormalities including meniscus and anterior cruciate ligament tears. Using widely used convolutional neural network (CNN) based architectures, we comparatively evaluated the knee abnormality classification performances of different neural network architectures under limited imaging data regime and compared single and multi-view imaging when classifying the abnormalities. Promising results indicated the potential use of multi-view deep learning based classification of MSK abnormalities in routine clinical assessment.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"43 1","pages":"1481-1485"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85747915","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
Optimal Adaptive Sampling for Boundary Estimation with Mobile Sensors 移动传感器边界估计的最优自适应采样
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048986
P. Kearns, J. Lipor, B. Jedynak
{"title":"Optimal Adaptive Sampling for Boundary Estimation with Mobile Sensors","authors":"P. Kearns, J. Lipor, B. Jedynak","doi":"10.1109/IEEECONF44664.2019.9048986","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048986","url":null,"abstract":"We consider the problem of active learning in the context of spatial sampling for boundary estimation, where the goal is to estimate an unknown boundary as accurately and quickly as possible. We present a finite-horizon search procedure to optimally minimize both the final estimation error and the distance traveled for a fixed number of samples, where a tuning parameter is used to trade off between the estimation accuracy and distance traveled. We show that the resulting optimization problem can be solved in closed form and that the resulting policy generalizes existing approaches to this problem.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"19 1","pages":"1621-1625"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90662580","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
Perceptually Driven Conditional GAN for Fourier Ptychography 用于傅立叶平面摄影的感知驱动条件GAN
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049029
Abhinau K. Venkataramanan, Shashank Gupta, Sumohana S. Channappayya
{"title":"Perceptually Driven Conditional GAN for Fourier Ptychography","authors":"Abhinau K. Venkataramanan, Shashank Gupta, Sumohana S. Channappayya","doi":"10.1109/IEEECONF44664.2019.9049029","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049029","url":null,"abstract":"Fourier Ptychography (FP) is a computational imaging technique which artificially increases the effective numerical aperture of an imaging system. In FP, the object is imaged using an array of Light Emitting Diodes (LEDs), each from a different illumination angle. A high resolution image is synthesized from this low resolution stack, typically using iterative phase retrieval algorithms. However, such algorithms are time consuming and fail when the overlap between the spectra of images is low, leading to high data requirements. At the crux of FP lies a phase retrieval problem. In this paper, we propose a Deep Learning (DL) algorithm to perform this synthesis under low spectral overlap between samples, and show a significant improvement in phase reconstruction over existing DL algorithms.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"33 1","pages":"1267-1271"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91217860","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
Distributed empirical risk minimization over directed graphs 有向图上的分布式经验风险最小化
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049065
Ran Xin, Anit Kumar Sahu, S. Kar, U. Khan
{"title":"Distributed empirical risk minimization over directed graphs","authors":"Ran Xin, Anit Kumar Sahu, S. Kar, U. Khan","doi":"10.1109/IEEECONF44664.2019.9049065","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049065","url":null,"abstract":"In this paper, we present stochastic optimization for empirical risk minimization over directed graphs. Using a novel information fusion approach that utilizes both row- and column-stochastic weights simultaneously, we propose $mathcal{S}mathcal{A}mathcal{B}$, a decentralized stochastic gradient method with gradient tracking, and show that the proposed algorithm converges linearly to an error ball around the optimal solution with a constant step-size. We provide a sketch of the convergence analysis as well as the generalization of the proposed algorithm. Finally, we illustrate the theoretical results with the help of experiments with real data.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"28 1","pages":"189-193"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72944312","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
Radar Beampattern Design for a Drone Swarm 无人机群雷达波束设计
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048820
M. Alaee-Kerahroodi, K. Mishra, B. Shankar
{"title":"Radar Beampattern Design for a Drone Swarm","authors":"M. Alaee-Kerahroodi, K. Mishra, B. Shankar","doi":"10.1109/IEEECONF44664.2019.9048820","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048820","url":null,"abstract":"The limited battery power of Unmanned Aerial Vehicles (UAVs) is a major challenge in equipping them with onboard radar. Low power results in short flight times, short ranges, and modest radar detection performance. These limitations are overcome by deploying an array of multiple drones. However, challenges due to interference from on-ground services, clutter echoes, and platform motion could distort the antenna radiation pattern. In this paper, we consider beampattern design for a two-dimensional array of multiple single-antenna drones operating in a multiple-input multiple-output (MIMO) radar configuration. The resulting optimization problem has a quartic objective function with constant modulus and discrete-phase constraints enforced to account for hardware limitations. We solve this non-convex problem using a variation of the coordinate-descent algorithm and obtain MIMO transmit waveforms that achieve the desired UAV-borne radar beampattern. Our extensive numerical experiments validate our methods.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"18 6","pages":"1416-1421"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72577362","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
Reducing the Complexity of Fingerprinting-Based Positioning using Locality-Sensitive Hashing 利用位置敏感哈希降低基于指纹定位的复杂性
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048657
Larry L Tang, Ramina Ghods, Christoph Studer
{"title":"Reducing the Complexity of Fingerprinting-Based Positioning using Locality-Sensitive Hashing","authors":"Larry L Tang, Ramina Ghods, Christoph Studer","doi":"10.1109/IEEECONF44664.2019.9048657","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048657","url":null,"abstract":"Localization of wireless transmitters based on channel state information (CSI) fingerprinting finds widespread use in indoor as well as outdoor scenarios. Fingerprinting localization first builds a database containing CSI with measured location information. One then searches for the most similar CSI in this database to approximate the position of wireless transmitters. In this paper, we investigate the efficacy of locality-sensitive hashing (LSH) to reduce the complexity of the nearest neighbor- search (NNS) required by conventional fingerprinting localization systems. More specifically, we propose a low-complexity and memory efficient LSH function based on the sum-to-one (STOne) transform and use approximate hash matches. We evaluate the accuracy and complexity (in terms of the number of searches and storage requirements) of our approach for line-of-sight (LoS) and non-LoS channels, and we show that LSH enables low-complexity fingerprinting localization with comparable accuracy to methods relying on exact NNS or deep neural networks.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"93 1","pages":"1086-1090"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72901729","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
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学术文献互助群
群 号:604180095
Book学术官方微信