{"title":"FHDR: HDR Image Reconstruction from a Single LDR Image using Feedback Network","authors":"Zeeshan Khan, Mukul Khanna, S. Raman","doi":"10.1109/GlobalSIP45357.2019.8969167","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969167","url":null,"abstract":"High dynamic range (HDR) image generation from a single exposure low dynamic range (LDR) image has been made possible due to the recent advances in Deep Learning. Various feed-forward Convolutional Neural Networks (CNNs) have been proposed for learning LDR to HDR representations. To better utilize the power of CNNs, we exploit the idea of feedback, where the initial low level features are guided by the high level features using a hidden state of a Recurrent Neural Network. Unlike a single forward pass in a conventional feed-forward network, the reconstruction from LDR to HDR in a feedback network is learned over multiple iterations. This enables us to create a coarse-to-fine representation, leading to an improved reconstruction at every iteration. Various advantages over standard feed-forward networks include early reconstruction ability and better reconstruction quality with fewer network parameters. We design a dense feedback block and propose an end-to-end feedback network-FHDR for HDR image generation from a single exposure LDR image. Qualitative and quantitative evaluations show the superiority of our approach over the state-of-the-art methods.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133492633","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 BP Neural Network Based Punctured Scheduling Scheme Within Mini-slots for Joint URLLC and eMBB Traffic","authors":"Qingqing Shang, Fangfang Liu, Chunyan Feng, Ruiyi Zhang, Shulun Zhao","doi":"10.1109/GlobalSIP45357.2019.8969539","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969539","url":null,"abstract":"To satisfy the strict latency requirement of Ultra Reliable Low Latency Communications (URLLC) traffic, it is usually scheduled on resources occupied by enhanced Mobile Broadband (eMBB) transmissions at the expense of a highly degraded eMBB spectral efficiency (SE). In this paper, we propose a back propagation neural network (BPNN) based punctured scheduling scheme to address the URLLC placement problem on eMBB traffic within mini-slots. In the proposed scheme, we first design a three-layer BPNN to predict decoding probability of eMBB users with different puncturing situation, then scheduler will select the eMBB user with the least potential throughput loss to puncture. Simulation results demonstrate that the proposed scheme can efficiently reduce the loss of throughput and improve the reliability of eMBB users.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133688479","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}
Samuel Todd Flanagan, Drupad K. Khublani, J. Chamberland, Siddharth Agarwal, Ankit Vora
{"title":"Localization in Autonomous Vehicles Using a Generalized Inner Product","authors":"Samuel Todd Flanagan, Drupad K. Khublani, J. Chamberland, Siddharth Agarwal, Ankit Vora","doi":"10.1109/GlobalSIP45357.2019.8969453","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969453","url":null,"abstract":"Fine localization in autonomous driving platforms is a task of broad interest, receiving much attention in recent years. Some localization algorithms use the Euclidean distance as a similarity measure between the local image acquired by a camera and a global map, which acts as side information. The global map is typically expressed in terms of the coordinate system of the road plane. Yet, a road image captured by a camera is subject to distortion in that nearby features on the road have much larger footprints on the focal plane of the camera compared with those of equally-sized features that lie farther ahead of the vehicle. Using commodity computational tools, it is straightforward to execute a transformation and, thereby, bring the distorted image into the frame of reference of the global map. However, this nonlinear transformation results in unequal noise amplification. The noise profile induced by this transformation should be accounted for when trying to match an acquired image to a global map, with more reliable regions being given more weight in the process. This physical reality presents an algorithmic opportunity to improve existing localization algorithms, especially in harsh conditions. This article reviews the physics of road feature acquisition through a camera, and it proposes an improved matching method rooted in statistical analysis. Findings are supported by numerical simulations.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130322395","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":"On Convex Stochastic Variance Reduced Gradient for Adversarial Machine Learning","authors":"Saikiran Bulusu, Qunwei Li, P. Varshney","doi":"10.1109/GlobalSIP45357.2019.8969103","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969103","url":null,"abstract":"We study the finite-sum problem in an adversarial setting using stochastic variance reduced gradient (SVRG) optimization in a distributed setting. Here, a fraction of the workers are assumed to be Byzantine that exhibit adversarial behavior by providing arbitrary data. We propose a robust scheme to combat the actions of Byzantine adversaries in this setting, and provide rates of convergence for the convex case. This is the first study of SVRG in an adversarial setting.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114767578","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":"Dynamic Network Slicing for Fog Radio Access Networks","authors":"A. Nassar, Yasin Yılmaz","doi":"10.1109/GlobalSIP45357.2019.8969455","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969455","url":null,"abstract":"Fog radio access network (F-RAN) has been recently proposed to satisfy the quality-of-service (QoS) requirements of the ultra-reliable-low-latency-communication (URLLC) IoT applications, hence fog nodes are empowered with computing and storage resources to independently deliver network functionalities at the edge of network without referring the users to the cloud. However, due to their limited resources, fog nodes should utilize their resources intelligently for low latency IoT applications to leverage the complementarity with cloud computing. We consider the problem of sequentially allocating fog node’s limited resources to various IoT applications with heterogeneous latency needs. We formulate the problem as a finite-horizon Markov Decision Process (MDP), and present the optimal solution, known as the optimal policy, through dynamic programming. The fog node learns the optimal policy through interaction with the IoT environment, which enables adaptive resource allocation in different IoT environments. Comprehensive simulation results for various IoT environments corroborate the theoretical basis of the proposed MDP method.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114067932","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":"Sampling Signals On Meet/Join Lattices","authors":"Chris Wendler, Markus Püschel","doi":"10.1109/GlobalSIP45357.2019.8969566","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969566","url":null,"abstract":"We present a novel sampling theorem, and prototypical applications, for Fourier-sparse lattice signals, i.e., data indexed by a finite semilattice. A semilattice is a partially ordered set endowed with a meet (or join) operation that returns the greatest lower bound (smallest upper bound) of two elements. Semilattices can be viewed as a special class of directed graphs with a strictly triangular adjacency matrix, which thus cannot be diagonalized. Our work does not build on prior graph signal processing (GSP) frameworks but on the recently introduced discrete-lattice signal processing (DLSP), which uses the meet as shift operator to derive convolution and Fourier transform. DLSP is fundamentally different from GSP in that it requires several generating shifts that capture the partial-order- rather than the adjacency-structure, and a diagonalizing Fourier transform is always guaranteed by algebraic lattice theory. We apply and demonstrate the utility of our novel sampling scheme in three real-world settings from computational biology, document representation, and auction design.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711739","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":"Double-Selection based High-Dimensional Factor Model with Application in Asset Pricing","authors":"Qingliang Fan, Fannu Hu, Xiao-Ping Zhang","doi":"10.1109/GlobalSIP45357.2019.8969175","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969175","url":null,"abstract":"This paper proposes a principal component analysis (PCA) approach after a double-selection Lasso and applies it to both Chinese and US stock market data. Similar to the idea of Post-Lasso, we perform least squares regression on the principal component factors. To accommodate the nonlinear nature of the data, this paper compares the support vector regression (SVR) model with least squares regression model. Empirical results show that the SVR method can improve the prediction ability, as evidenced by the superior accumulated rate of return using the test set sample of both markets.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"410 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122863450","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":"Anomalous Sensor Detection Based on Nonlinear Graph Filter","authors":"Zhuo Li, Zhenlong Xiao, C. Lan","doi":"10.1109/GlobalSIP45357.2019.8969109","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969109","url":null,"abstract":"Detecting anomalous data on IoT sensor network is an essential yet challenging task, especially if anomalies have small deviations from normal data, which would be more difficult in the coming 5G and beyond era due to the explosive growth of data. In this paper, the sensor data, as well as the network structural information, are studied to develop a robust and effective anomaly detection algorithm. The sensor data reconstruction model is built based on the recently developed nonlinear polynomial graph filter (NPGF), which involves the adjacency matrix of the sensor network and hence would learn from the network structural information. It first estimates the NPGF based reconstruction model from normal sensor data, and then detects anomalous sensors as those attaining high reconstruction error from the model. The proposed algorithm is shown to achieve 0.1 higher detection rate on anomalies with small deviations, compared with another recent graph-based detector based on linear graph frequency.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130005521","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":"Super-Resolution for Imagery Enhancement Using Variational Quantum Eigensolver","authors":"Ystallonne Alves","doi":"10.1109/GlobalSIP45357.2019.8969496","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969496","url":null,"abstract":"Super-Resolution (SR) is a technique that has been exhaustively exploited and incorporates strategic aspects to image processing. As quantum computers gradually evolve and provide unconditional proof of computational advantage at solving intractable problems over their classical counterparts, quantum computing emerges with the compelling prospect to offer exponential speedup to process computationally expensive operations, such as the ones verified in SR imaging. Envisioning the design of a quantum-ready method for near-term noisy devices and igniting Rapid and Accurate Image Super Resolution (RAISR), an implementation using Variational Quantum Eigensolver (VQE) is demonstrated. This study proposes an approach that combines the benefits of RAISR, a non hallucinating and computationally efficient method, and VQE, a hybrid classical-quantum algorithm, to conduct SR with the support of quantum computation, preserving quantitative performance in terms of Image Quality Assessment (IQA).","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324502","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":"Cramér-Rao Bound for Wideband DOA Estimation with Uncorrelated Sources","authors":"Yibao Liang, Qing Shen, W. Cui, Wei Liu","doi":"10.1109/GlobalSIP45357.2019.8969279","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969279","url":null,"abstract":"In this paper, the closed-form Cramér-Rao bound (CRB) is derived for direction-of-arrival (DOA) estimation under the unconditional model assumption (UMA) for uncorrelated wideband sources. The existence of the CRB is proved based on the rank condition of the introduced augmented co-array manifold (ACM) matrix. The resolution capacity is then investigated and it is found that the number of resolvable sources for the wideband model can exceed the limitation in the narrowband case without requirement of any special array structure.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125003889","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}