检索结果-内蒙古大学图书馆

Machine learning in the air

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Gundüz, Deniz De Kerret, Paul Sidiropoulos, Nicholas D. Gesbert, David Murthy, Chandra Van Der Schaar, Mihaela Information Processing and Communications Laboratory Department of Electrical and Electronics Engineering Imperial College London London United Kingdom Communication Systems Department EURECOM Sophia Antipolis France Department of Electrical and Computer Engineering University of Virginia Charlottesville VA United States Department of Electrical and Computer Engineering Indian Institute of Science Bangalore India

Thanks to the recent advances in processing speed and data acquisition and storage, machine learning (ML) is penetrating every facet of our lives, and transforming research in many areas in a fundamental manner. Wireless communications is another success story - ubiquitous in our lives, from handheld devices to wearables, smart homes, and automobiles. While recent years have seen a flurry of research activity in exploiting ML tools for various wireless communication problems, the impact of these techniques in practical communication systems and standards is yet to be seen. In this paper, we review some of the major promises and challenges of ML in wireless communication systems, focusing mainly on the physical layer. We present some of the most striking recent accomplishments that ML techniques have achieved with respect to classical approaches, and point to promising research directions where ML is likely to make the biggest impact in the near future. We also highlight the complementary problem of designing physical layer techniques to enable distributed ML at the wireless network edge, which further emphasizes the need to understand and connect ML with fundamental concepts in wireless communications. Copyright © 2019, The Authors. All rights reserved.

关键词： Intelligent buildings

Target localization with jammer removal using frequency diverse array

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liu, Qi Xu, Jingwei Ding, Zhi So, Hing Cheung Department of Electrical and Computer Engineering National University of Singapore Singapore National Laboratory of Radar Signal Processing Xidian University Xi'an Shaanxi710071 China Department of Electrical and Computer Engineering University of California at Davis DavisCA95616 United States Department of Electrical Engineering City University of Hong Kong Hong Kong

A foremost task in frequency diverse array multiple-input multiple-output (FDA-MIMO) radar is to efficiently obtain the target signal in the presence of interferences. In this paper, we employ a novel"low-rank + low-rank + sparse" decomposition model to extract the low-rank desired signal and suppress the jamming signals from both barrage and burst jammers. In the literature, the barrage jamming signals, which are intentionally interfered by enemy jammer radar, are usually assumed Gaussian distributed. However, such assumption is oversimplified to hold in practice as the interferences often exhibit non-Gaussian properties. Those non-Gaussian jamming signals, known as impulsive noise or burst jamming, are involuntarily deviated from friendly radar or other working radio equipment including amplifier saturation and sensor failures, thunderstorms and man-made noise. The estimation performance of the existing estimators, relied crucially on the Gaussian noise assumption, may degrade substantially since the probability density function (PDF) of burst jamming has heavier tails that exceed a few standard deviations than the Gaussian distribution. To capture a more general signal model with burst jamming in practice, both barrage jamming and burst jamming are included and a two-step"Go Decomposition" (GoDec) method via alternating minimization is devised for such mixed jamming signal model, where the a priori rank information is exploited to suppress two kinds of jammers and estimate the desired target. Simulation results verify the robust performance of the devised scheme. Copyright © 2019, The Authors. All rights reserved.

关键词： Jamming

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as ...

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

Time Series Forecasting of New Cases and New Deaths Rate for COVID-19 using Deep Learning Methods

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ayoobi, Nooshin Sharifrazi, Danial Alizadehsani, Roohallah Shoeibi, Afshin Gorriz, Juan M. Moosaei, Hossein Khosravi, Abbas Nahavandi, Saeid Chofreh, Abdoulmohammad Gholamzadeh Goni, Feybi Ariani Klemeš, Jiří Jaromír Mosavi, Amir Department of Mathematics Savitribai Phule Pune University Pune411007 India Department of Computer Engineering School of Technical and Engineering Shiraz Branch Islamic Azad University Shiraz Iran Institute for Intelligent Systems Research and Innovation Deakin University GeelongVIC3216 Australia Computer Engineering Department Ferdowsi University of Mashhad Mashhad Iran Faculty of Electrical and Computer Engineering Biomedical Data Acquisition Lab K. N. Toosi University of Technology Tehran Iran Department of Signal Theory Networking and Communications Universidad de Granada Spain Department of Mathematics Faculty of Science University of Bojnord Iran Sustainable Process Integration Laboratory - SPIL NETME Centre Faculty of Mechanical Engineering Brno University of Technology - VUT Brno Technická 2896/2 Brno616 69 Czech Republic Department of Management Faculty of Business and Management Brno University of Technology VUT Brno Kolejní 2906/4 Brno612 00 Czech Republic Faculty of Civil Engineering Technische Universität Dresden Dresden01069 Germany John von Neumann Faculty of Informatics Obuda University Budapest1034 Hungary School of Economics and Business Norwegian University of Life Sciences 1430 Norway

The first known case of Coronavirus disease 2019 (COVID-19) was identified in December 2019. It has spread worldwide, leading to an ongoing pandemic, imposed restrictions and costs to many countries. Predicting the number of new cases and deaths during this period can be a useful step in predicting the costs and facilities required in the future. The purpose of this study is to predict new cases and deaths rate one, three and seven-day ahead during the next 100 days. The motivation for predicting every n days (instead of just every day) is the investigation of the possibility of computational cost reduction and still achieving reasonable performance. Such a scenario may be encountered real-time forecasting of time series. Six different deep learning methods are examined on the data adopted from the WHO website. Three methods are LSTM, Convolutional LSTM, and GRU. The bidirectional extension is then considered for each method to forecast the rate of new cases and new deaths in Australia and Iran countries. This study is novel as it carries out a comprehensive evaluation of the aforementioned three deep learning methods and their bidirectional extensions to perform prediction on COVID-19 new cases and new death rate time series. To the best of our knowledge, this is the first time that Bi-GRU and Bi-Conv-LSTM models are used for prediction on COVID-19 new cases and new deaths time series. The evaluation of the methods is presented in the form of graphs and Friedman statistical test. The results show that the bidirectional models have lower errors than other models. Several error evaluation metrics are presented to compare all models, and finally, the superiority of bidirectional methods is determined. This research could be useful for organizations working against COVID-19 and determining their long-term plans. Copyright © 2021, The Authors. All rights reserved.

关键词： Coronavirus

AIM 2020 Challenge on Image Extreme Inpainting 16th

学校读者我要写书评

暂无评论

AIM 2020 Challenge on Image Extreme Inpainting

Workshops held at the 16th European Conference on computer Vision, ECCV 2020

作者： Ntavelis, Evangelos Romero, Andrés Bigdeli, Siavash Timofte, Radu Hui, Zheng Wang, Xiumei Gao, Xinbo Shin, Chajin Kim, Taeoh Son, Hanbin Lee, Sangyoun Li, Chao Li, Fu He, Dongliang Wen, Shilei Ding, Errui Bai, Mengmeng Li, Shuchen Zeng, Yu Lin, Zhe Yang, Jimei Zhang, Jianming Shechtman, Eli Lu, Huchuan Zeng, Weijian Ni, Haopeng Cai, Yiyang Li, Chenghua Xu, Dejia Wu, Haoning Han, Yu Nadim, Uddin S. M. Jang, Hae Woong Ahmed, Soikat Hasan Yoon, Jungmin Jung, Yong Ju Li, Chu-Tak Liu, Zhi-Song Wang, Li-Wen Siu, Wan-Chi Lun, Daniel P. K. Suin, Maitreya Purohit, Kuldeep Rajagopalan, A.N. Narang, Pratik Mandal, Murari Chauhan, Pranjal Singh Computer Vision Lab ETH Zürich Zürich Switzerland CSEM Neuchâtel Switzerland School of Electronic Engineering Xidian University Xi’an China Image and Video Pattern Recognition Laboratory School of Electrical and Electronic Engineering Yonsei University Seoul Korea Republic of Baidu Inc. Beijing China Beijing China Dalian University of Technology Dalian China Adobe San Jose United States Rensselaer Polytechnic Institute Troy United States Peking University Beijing China Lab Gachon University Seongnam Korea Republic of Centre for Multimedia Signal Processing Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong China Indian Institute of Technology Madras Chennai India BITS Pilani Pilani India MNIT Jaipur Jaipur India

ISBN: (纸本)9783030670696

This paper reviews the AIM 2020 challenge on extreme image inpainting. This report focuses on proposed solutions and results for two different tracks on extreme image inpainting: classical image inpainting and semantically guided image inpainting. The goal of track 1 is to inpaint large part of the image with no supervision. Similarly, the goal of track 2 is to inpaint the image by having access to the entire semantic segmentation map of the input. The challenge had 88 and 74 participants, respectively. 11 and 6 teams competed in the final phase of the challenge, respectively. This report gauges current solutions and set a benchmark for future extreme image inpainting methods. © 2020, Springer Nature Switzerland AG.

关键词： Semantic Segmentation

Block Sparse Bayesian Learning for Bursty Impulsive Noise Detection in Broadband PLC 2

学校读者我要写书评

暂无评论

Block Sparse Bayesian Learning for Bursty Impulsive Noise De...

2nd International Conference on Imaging, signal processing and Communication, ICISPC 2018

作者： Mariyam, Prita Dewi Liu, Jing Juwono, Filbert H. Gunawan, Dadang Universitas Indonesia Department of Electrical Engineering Depok West Java16424 Indonesia National Laboratory of Radar Signal Processing Xidian University Xi'an710071 China Curtin University Malaysia Department of Electrical and Computer Engineering Miri Sarawak98009 Malaysia

ISBN: (纸本)9781538669822

Broadband power-line communications (PLC) is considered as an enabling technology for the Internet-of-Things (IoT) systems. However, PLC faces some transmission issues as a power line was not designed to transmit communication data. Impulsive noise is one of the major issues in broadband PLC systems. In practice, impulsive noise may occur in bursts. The performance of the PLC systems degrades significantly under bursty impulsive noise environment. We propose to use a compressive sensing algorithm to detect and mitigate the bursty impulsive noise. In this paper, block sparse Bayesian learning (BSBL) algorithms are used to detect and estimate the bursty impulsive noise. The estimated impulsive noise is then subtracted from the contaminated signal. BSBL has relatively better performance than other block compressive sensing algorithms. We examine the performance of two types of BSBL algorithms, i.e. BSBL-bound optimization (BSBL-BO) and BSBL-expectation-maximization (BSBL-EM) under various bursty impulsive noise conditions. The results show that both algorithms have comparable performance in terms of bit error rate (BER). However, BSBL-EM gives better minimum square error (MSE) but much slower in the CPU processing time than BSBL-BO. © 2018 IEEE.

关键词： Impulse noise

Benchmarking quality-dependent and cost-sensitive score-level multimodal biometric fusion algorithms

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Poh, Norman Bourlai, Thirimachos Kittler, Josef Allano, Lorene Alonso-Fernandez, Fernando Ambekar, Onkar Baker, John Dorizzi, Bernadette Fatukasi, Omolara Fierrez, Julian Ganster, Harald Ortega-Garcia, Javier Maurer, Donald Salah, Albert Ali Scheidat, Tobias Vielhauer, Claus Centre for Vision Speech and Signal Processing School of Electronics and Physical Sciences University of Surrey Guildford SurreyGU2 7XH United Kingdom Biometrics Center Lane Department of Computer Science and Electrical Engineering College of Engineering and Mineral Resources West Virginia University MorgantownWV26506-6109 United States Institut Telecom Telecom and Management SudParis Evry91011 France Biometric Recognition Group – ATVS Escuela Politecnica Superior Universidad Autonoma de Madrid Madrid28049 Spain Amsterdam1098 XG Netherlands Applied Physics Laboratory Johns Hopkins University LaurelMD20723 United States Electronics and Physics Department Institut Telecom Telecom and Management SudParis Evry91011 France Institute of Digital Image Processing Joanneum Research Graz8010 Austria ISLA-ISIS University of Amsterdam Amsterdam1098 XG Netherlands Department of Informatics and Media Brandenburg University of Applied Sciences Brandenburg an der HavelD-14770 Germany Research Group Multimedia and Security Department of Technical and Business Information Systems Faculty of Computer Science Otto-von-Guericke-University of Magdeburg MagdeburgD-39106 Germany

Automatically verifying the identity of a person by means of biometrics (e.g., face and fingerprint) is an important application in our day-to-day activities such as accessing banking services and security control in airports. To increase the system reliability, several biometric devices are often used. Such a combined system is known as a multimodal biometric system. This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign organized by the University of Surrey, involving face, fingerprint, and iris biometrics for person authentication, targeting the application of physical access control in a medium-size establishment with some 500 persons. While multimodal biometrics is a well-investigated subject in the literature, there exists no benchmark for a fusion algorithm comparison. Working towards this goal, we designed two sets of experiments: quality-dependent and cost-sensitive evaluation. The quality-dependent evaluation aims at assessing how well fusion algorithms can perform under changing quality of raw biometric images principally due to change of devices. The cost-sensitive evaluation, on the other hand, investigates how well a fusion algorithm can perform given restricted computation and in the presence of software and hardware failures, resulting in errors such as failure-to-acquire and failure-to-match. Since multiple capturing devices are available, a fusion algorithm should be able to handle this nonideal but nevertheless realistic scenario. In both evaluations, each fusion algorithm is provided with scores from each biometric comparison subsystem as well as the quality measures of both the template and the query data. The response to the call of the evaluation campaign proved very encouraging, with the submission of 22 fusion systems. To the best of our knowledge, this campaign is the first attempt to benchmark quality-based multimodal fusion algorithms. In the presence of changing

关键词： Benchmarking

Analysis and experimental demonstration of orthant-symmetric four-dimensional 7 bit/4D-sym modulation for optical fiber communication

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chen, Bin Alvarado, Alex van der Heide, Sjoerd van den Hout, Menno Hafermann, Hartmut Okonkwo, Chigo The School of Computer Science and Information Engineering Hefei University of Technology Hefei China Eindhoven University of Technology Eindhoven5600 MB Netherlands The Information and Communication Theory Lab Signal Processing Systems Group Department of Electrical Engineering Eindhoven University of Technology Eindhoven5600 MB Netherlands The High Capacity Optical Transmission Laboratory Eindhoven University of Technology Eindhoven5600 MB Netherlands The Optical Communication Technology Lab Paris Research Center Huawei Technologies France SASU Boulogne-Billancourt92100 France

We propose a new four-dimensional orthant-symmetric 128-ary modulation format (4D-OS128) with a spectral efficiency of 7 bit/4D-sym. The proposed format fills the gap between polarization-multiplexed 8- and 16-ary quadrature-amplitude modulation (PM-8QAM and PM-16QAM). Numerical simulations show that 4D-OS128 outperforms two well-studied 4D geometrically-shaped modulation formats: 128SP-16QAM and 7b4D-2A8PSK by up to 0.65 dB for bit-interleaved coded modulation at the same spectral efficiency. These gains are experimentally demonstrated in a 11×233 Gbit/s wavelength division multiplexing (WDM) transmission system operating at 5.95 bit/4D-sym over 6000 km and 9000 km for both EDFA-only and hybrid amplification scenarios, respectively. A reach increase of 15% is achieved with respect to 128-ary set-partitioning 16QAM. Furthermore, the proposed 4D-OS128 is also compared to D4 lattice-based constellation, 16QAM and probabilistically-shaped 16QAM with finite blocklength via simulation. © 2020, CC BY.

关键词： Quadrature amplitude modulation

A mixture of experts model for predicting persistent weather patterns

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Pérez-Ortiz, M. Gutiérrez, P.A. Tino, P. Casanova-Mateo, C. Salcedo-Sanz, S. Computer Laboratory University of Cambridge United Kingdom Dpt. of Computer Science and Numerical Analysis University of Córdoba Spain School of Computer Science University of Birmingham United Kingdom Department of Civil Engineering: Construction Infrastructure and Transport Universidad Politécnica de Madrid Madrid Spain Department of Signal Processing and Communications University of Alcalá Spain

Weather and atmospheric patterns are often persistent. The simplest weather forecasting method is the so-called persistence model, which assumes that the future state of a system will be similar (or equal) to the present state. Machine learning (ML) models are widely used in different weather forecasting applications, but they need to be compared to the persistence model to analyse whether they provide a competitive solution to the problem at hand. In this paper, we devise a new model for predicting low-visibility in airports using the concepts of mixture of experts. Visibility level is coded as two different ordered categorical variables: cloud height and runway visual height. The underlying system in this application is stagnant approximately in 90% of the cases, and standard ML models fail to improve on the performance of the persistence model. Because of this, instead of trying to simply beat the persistence model using ML, we use this persistence as a baseline and learn an ordinal neural network model that refines its results by focusing on learning weather fluctuations. The results show that the proposal outperforms persistence and other ordinal autoregressive models, especially for longer time horizon predictions and for the runway visual height variable. Copyright © 2019, The Authors. All rights reserved.

关键词： Weather forecasting