{"title":"Semi-supervised Convolutional Triplet Neural Networks for Assessing Paper Texture Similarity","authors":"Leah Lackey, Arick Grootveld, A.G. Klein","doi":"10.1109/IEEECONF51394.2020.9443454","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443454","url":null,"abstract":"In the context of papers used in the graphic arts, including silver gelatin, inkjet, and wove papers, prior work has studied measures of texture similarity for purposes of classifying such papers. The majority of prior work has been based on classical image processing approaches such as Fourier, wavelet, and fractal analysis. In this work, recent advances in deep learning are used to develop a texture similarity approach for measuring paper texture similarity. Since the available datasets generally lack labels, the convolutional neural network is trained using triplet loss to minimize the feature distance of tiles from the same image while simultaneously maximizing the feature distance of tiles drawn from different images. The approach is tested on three paper texture image databases considered in prior works and the results suggest the proposed approach achieves state-of-the-art performance.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115244623","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}
Andrew Lazar, Mario Banuelos, Suzanne S. Sindi, Roummel F. Marcia
{"title":"Detecting novel genomic structural variants through negative binomial optimization","authors":"Andrew Lazar, Mario Banuelos, Suzanne S. Sindi, Roummel F. Marcia","doi":"10.1109/IEEECONF51394.2020.9443308","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443308","url":null,"abstract":"Structural variants (SVs) are short sequences of DNA, larger than one nucleotide, that can vary between members of the same species. Although SVs are relatively rare, compared to single nucleotide variants (SNVs) they are an important source of genetic variation and some SVs have been associated with diseases and susceptibility to certain types of cancer. SV detection is commonly performed by aligning sequenced fragments of an individual’s genome to a high-quality reference genome. Candidate SVs correspond to discordant mapped configurations of fragments; however, errors in the sequencing also lead to potential discordant mappings. Because of this error, many candidate SVs are in fact false positives. When sequencing coverage is high, SV detection is more accurate, but this comes at higher sequencing cost. Sequencing at low coverage does reduce cost, but increases error and complexity of SV detection. The goal of our work is to use mathematical optimization to improve SV detection in low-coverage DNA sequencing data. Previous studies of SV detection have modeled coverage with a Poisson distribution, but this assumes the mean and variance are the same. In an effort more closely model the experimental data we use the negative binomial distribution, which allows for the mean and variance to differ, and contains the Poisson distribution as a special case. Our approach also control false positive predictions by simultaneously considering simultaneous SV prediction in a parent and child. We assume that most SVs carried by a child are inherited from a parent but a small fraction may be novel to the child. We balance the rarity of novel versus inherited SVs by enforcing sparsity through an l1-penalty and compare this negative binomial reconstruction algorithm to the Poisson reconstruction algorithm by testing both on the same simulated data sets.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115374555","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}
Hyungseob Lim, Suhyeon Oh, Kyungguen Byun, Hong-Goo Kang
{"title":"A Study on Conditional Features for a Flow-based Neural Vocoder","authors":"Hyungseob Lim, Suhyeon Oh, Kyungguen Byun, Hong-Goo Kang","doi":"10.1109/IEEECONF51394.2020.9443273","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443273","url":null,"abstract":"In this paper, we propose an effective way of providing conditional features for a flow-based neural vocoder. Most conventional approaches utilize mel-spectrograms for conditioning neural vocoders, but this significantly increases the size of neural networks due to their high dimensional behavior. We show that the network size of a flow-based generative model can be reduced when we use acoustic parameters for a sinusoidal speech analysis-and-synthesis framework such as voiced/unvoiced flag, fundamental frequency, mel-cepstral coefficients, and energy of each analysis frame. We also conclude that training becomes much easier if we feed the fundamental frequency by an embedded vector representation after quantizing it with a small number of bits. Experimental results verify that the performance of the proposed algorithm is comparable to that of flow-based neural vocoders conditioned on mel-spectrograms while the required information for the feature representations and network complexity for generating speech become lower.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123744124","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}
Sudha Yellapantula, Colin Noe, S. Fischer-Baum, B. Aazhang
{"title":"Time-varying graph analysis comparing speech perception in healthy and aphasic brains","authors":"Sudha Yellapantula, Colin Noe, S. Fischer-Baum, B. Aazhang","doi":"10.1109/IEEECONF51394.2020.9443478","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443478","url":null,"abstract":"Aphasia affects millions of patients each year, causing communication difficulties and impeding their quality of life. While the nature of the language impairment after stroke is very patient specific, characterizing each person’s impairment is useful for treatment and research. Recently, language processing frameworks as a whole are moving towards whole-brain network based analyses. Reflecting this, network based approaches to normal and impaired EEG data are also needed. We measured some aspects of language processing impairments with electroencephalography (EEG). Using EEG recordings from subjects engaged in a speech perception task, we devised a framework based on graph signal processing and information theory, to reveal features of the brain dynamics that separate the 21 healthy subjects from an aphasic patient. This patient has focal difficulty in speech perception. We performed a robust principal component analysis to jointly infer a time-invariant low rank structure and time-varying sparse matrices to characterize brain dynamics in the healthy and the aphasic subjects. With this graph theoretic approach, we demonstrate the possibility to characterize impairment at a patient specific level, that sheds insight into cognitive processes that were disrupted at the network level. This allows for a complementary measure of patient impairment to traditional ERP metrics.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125428145","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}
{"title":"Autotuning Plug-and-Play Algorithms for MRI","authors":"S. Shastri, R. Ahmad, P. Schniter","doi":"10.1109/IEEECONF51394.2020.9443493","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443493","url":null,"abstract":"For magnetic resonance imaging (MRI), recently proposed \"plug-and-play\" (PnP) image recovery algorithms have shown remarkable performance. These PnP algorithms are similar to traditional iterative algorithms like FISTA, ADMM, or primal-dual splitting (PDS), but differ in that the proximal update is replaced by a call to an application-specific image denoiser, such as BM3D or DnCNN. The fixed-points of PnP algorithms depend upon an algorithmic stepsize parameter, however, which must be tuned for optimal performance. In this work, we propose a fast and robust auto-tuning PnP-PDS algorithm that exploits knowledge of the measurement-noise variance that is available from a pre-scan in MRI. Experimental results show that our algorithm converges very close to genie-tuned performance, and does so significantly faster than existing autotuning approaches.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125292330","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}
Sasank Garikapati, Aditya Gaonkar, A. Nagulu, Tingjun Chen, G. Zussman, H. Krishnaswamy
{"title":"Performance Comparison of Time-Domain and Frequency-Domain RF Self-Interference Cancellation in Full-Duplex Wireless Systems","authors":"Sasank Garikapati, Aditya Gaonkar, A. Nagulu, Tingjun Chen, G. Zussman, H. Krishnaswamy","doi":"10.1109/IEEECONF51394.2020.9457545","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9457545","url":null,"abstract":"Full-Duplex is a wireless communication paradigm which potentially provides a 2x improvement in the data-rate by a more efficient usage of available spectrum. A critical bottle neck in FD operation is the powerful Self-Interference (SI) on top of the desired received signal which lies in the same frequency range, potentially desensitizing the receive chain and thereby corrupting reception. To achieve FD operation, the SI has to be suppressed below the RX noise floor through different stages of cancellation as frequency selective filtering is not possible. Wide-band SI cancellation (SIC) requires a cancellation network which accurately emulates the frequency response of the SI channel over the desired bandwidth. This work examines two ways of achieving wide-band SIC, one from a frequency domain perspective by using a bank of RF filters and another from a time domain perspective by using finite impulse response (FIR) filters. Using data from measurements, we compare the two aforementioned approaches and discuss challenges involved in implementing these networks.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128237732","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}
{"title":"Probabilistic Optimization for Source Separation","authors":"G. Schuller, Oleg Golokolenko","doi":"10.1109/IEEECONF51394.2020.9443564","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443564","url":null,"abstract":"We present a novel probabilistic Zeroth-Order optimization method, which can handle higher dimensions, and can also be used for fast online optimization, for instance for multichannel source separation. We compared it to the Gradientless Descent (GLD) algorithm on a multichannel source separation task, and found that our method results in faster and better separation (for the 2-channels case). For the multichannel case, only our method resulted in useful separation. We also applied it to separating sources from 3-dimensional microphone arrays, with comparable results.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128263710","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}
Mel J White, V. Boominathan, A. Veeraraghavan, A. Molnar
{"title":"On-Chip Optical and Analog Processing in 180nm CMOS for Holography","authors":"Mel J White, V. Boominathan, A. Veeraraghavan, A. Molnar","doi":"10.1109/IEEECONF51394.2020.9443533","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443533","url":null,"abstract":"Digital holography generally requires multiple measurements or complex post-processing, precise optical setups, and can suffer from aliasing and high noise. In this work we present a theoretical approach for a novel sensor and a complementary off-axis optical setup, which can perform wide-field capture in a single shot with less aliasing than conventional off-axis methods. By exploiting on-chip optical and analog processing enabled by advances in chip fabrication we are able to reduce the number of measurements required, and boost the signal-to-noise ratio. Using upper metal layers of the integrated circuit, we create gratings that block or pass light at 0, π/2, π, and 3π/2 radians of phase interference, converting phase information in the light field to intensity. In the analog circuitry of the sensor, we incorporate differential readout and feedback techniques to improve SNR. We simulate reconstructions demonstrating x-y spatial reconstruction at the size of the pixel (15µm × 15µm), and compare this to two fundamental approaches – phase-stepped and off-axis holography.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404435","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}
{"title":"A Lightweight Model for Deep Frame Prediction in Video Coding","authors":"Hyomin Choi, I. Bajić","doi":"10.1109/IEEECONF51394.2020.9443427","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443427","url":null,"abstract":"Recent studies have demonstrated the efficacy of deep neural network (DNN)-based inter frame prediction for video coding. The network commonly used in these studies is built upon a U-Net-like architecture and produces content-adaptive 1-D separable filters with a large number of taps for frame prediction. This leads to a model with a large number of parameters. In this paper, we propose a lighter version of the network with significantly fewer parameters, by making use of dilated convolutional layers and making the U-Net shallower. In addition, we introduce a DCT-based ℓ1-loss term that encourages compression, and explore several ways of integrating our lightweight model into HEVC. Both frame prediction accuracy and coding efficiency are compared against previous works. The experiments show that the proposed model achieves up to 6.4% average bit reduction in terms of BD-Bitrate against HEVC, which is significantly better than existing methods in the literature.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128986006","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}
{"title":"Graph Laplacian-based Tumor Segmentation and Denoising in Brain Magnetic Resonance Imaging","authors":"A. Hanif, M. Doroslovački","doi":"10.1109/IEEECONF51394.2020.9443557","DOIUrl":"https://doi.org/10.1109/IEEECONF51394.2020.9443557","url":null,"abstract":"Brain tumor segmentation in Magnetic Resonance Imaging (MRI) scans provides vital information to radiologists in the diagnosis and staging of disease. However, these MRI scans are often corrupted with noise during its acquisition. Traditional approaches to this problem employ denoising which leads, in general, to edge smoothing and development of artifacts in MRI slices, thereby affecting tumor segmentation performance. In this paper, we employed graph signal processing (GSP) theory to first segment tumor core in each MRI slice using graph Laplacian followed by edge-aware denoising which is performed in synergy. The paper aims to present a novel technique to tackle the two problems of segmentation and denoising both under the GSP framework. The experimental results demonstrated on simulated and clinical brain MRI datasets, show highly competitive performance both in terms of tumor core segmentation under Dice and Sensitivity measures, and in terms of edge-aware denoising under PSNR and SSIM measures.","PeriodicalId":248190,"journal":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129242791","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}