OpenRaiser/Intern-Atlas huggingface dataset:
What Goes Where: Predicting Object Distributions from Above
Venue: arXiv cs.CV 2018
Year: 2018

In this work, we propose a cross-view learning approach, in which images captured from a ground-level view are used as weakly supervised annotations for interpreting overhead imagery. The outcome is a convolutional neural network for overhead imagery that is capable of predicting the type and count of objects that are likely to be seen from a ground-level perspective. We demonstrate our approach on a large dataset of geotagged ground-level and overhead imagery and find that our network captures semantically meaningful features, despite being trained without manual annotations.
Two-Stage Analog Combining in Hybrid Beamforming Systems with Low-Resolution ADCs
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we investigate hybrid analog/digital beamforming for multiple-input multiple-output (MIMO) systems with low-resolution analog-to-digital converters (ADCs) for millimeter wave (mmWave) communications. In the receiver, we propose to split the analog combining subsystem into a channel gain aggregation stage followed by a spreading stage. Both stages use phase shifters. Our goal is to design the two-stage analog combiner to optimize mutual information (MI) between the transmitted and quantized signals by effectively managing quantization error. To this end, we formulate an unconstrained MI maximization problem without a constant modulus constraint on analog combiners, and derive a two-stage analog combining solution. The solution achieves the optimal scaling law with respect to the number of radio frequency chains and maximizes the MI for homogeneous singular values of a MIMO channel. We further develop a two-stage analog combining algorithm to implement the derived solution for mmWave channels. By decoupling channel gain aggregation and spreading functions from the derived solution, the proposed algorithm implements the two functions by using array response vectors and a discrete Fourier transform matrix under the constant modulus constraint on each matrix element. Therefore, the proposed algorithm provides a near optimal solution for the unconstrained problem, whereas conventional hybrid approaches offer a near optimal solution only for a constrained problem. The closed-form approximation of the ergodic rate is derived for the algorithm, showing that a practical digital combiner with two-stage analog combining also achieves the optimal scaling law. Simulation results validate the algorithm performance and the derived ergodic rate.
Are You in the Line? RSSI-based Queue Detection in Crowds
Venue: arXiv cs.NI 2018
Year: 2018

Crowd behaviour analytics focuses on behavioural characteristics of groups of people instead of individuals' activities. This work considers human queuing behaviour which is a specific crowd behavior of groups. We design a plug-and-play system solution to the queue detection problem based on Wi-Fi/Bluetooth Low Energy (BLE) received signal strength indicators (RSSIs) captured by multiple signal sniffers. The goal of this work is to determine if a device is in the queue based on only RSSIs. The key idea is to extract features not only from individual device's data but also mobility similarity between data from multiple devices and mobility correlation observed by multiple sniffers. Thus, we propose single-device feature extraction, cross-device feature extraction, and cross-sniffer feature extraction for model training and classification. We systematically conduct experiments with simulated queue movements to study the detection accuracy. Finally, we compare our signal-based approach against camera-based face detection approach in a real-world social event with a real human queue. The experimental results indicate that our approach can reach minimum accuracy of 77% and it significantly outperforms the camera-based face detection because people block each other's visibility whereas wireless signals can be detected without blocking.
Analysis of Content-Oriented Heterogeneous Networks with D2D and Cognitive Communications
Venue: arXiv cs.NI 2018
Year: 2018

Content-oriented operation with D2D communications and spectrum sharing in the form of cognitive communications are expected to be enablers for cost-efficient nextgeneration wireless systems with bandwidth-hungry services. To this end, caching is an important building block of these systems. In this work, we model such a heterogeneous network and model a popularity-aware caching algorithm where we try to keep more popular contents in caches of system units with a higher probability compared to less popular contents. Moreover, for improving the usage of the channel capacity, overlaying for device-to-device (D2D) transmissions (unless these transmission interfere with each other) is enabled. We model our system with an analytical continuous time Markov chain (CTMC). We have a heterogeneous network architecture consisting of a LEO satellite, base station (BS) and a set of devices within the boundary of BS coverage that can get service from the satellite, from the BS or in D2D mode. Our devices operate in primary mode when they get service from the satellite but in secondary mode when they get service from the BS or some device in D2D mode over the terrestrial link. We evaluate our system for energy efficiency (EE) and goodput metrics. We looked how popularity-aware caching, integration of universal source concept and overlaying in D2D mode affect the network performance. Besides, we investigate how resource allocation (RA) and performance metrics are tangled.
Optimizing Space-Air-Ground Integrated Networks by Artificial Intelligence
Venue: arXiv cs.NI 2018
Year: 2018

It is widely acknowledged that the development of traditional terrestrial communication technologies cannot provide all users with fair and high quality services due to the scarce network resource and limited coverage areas. To complement the terrestrial connection, especially for users in rural, disaster-stricken, or other difficult-to-serve areas, satellites, unmanned aerial vehicles (UAVs), and balloons have been utilized to relay the communication signals. On the basis, Space-Air-Ground Integrated Networks (SAGINs) have been proposed to improve the users' Quality of Experience (QoE). However, compared with existing networks such as ad hoc networks and cellular networks, the SAGINs are much more complex due to the various characteristics of three network segments. To improve the performance of SAGINs, researchers are facing many unprecedented challenges. In this paper, we propose the Artificial Intelligence (AI) technique to optimize the SAGINs, as the AI technique has shown its predominant advantages in many applications. We first analyze several main challenges of SAGINs and explain how these problems can be solved by AI. Then, we consider the satellite traffic balance as an example and propose a deep learning based method to improve the traffic control performance. Simulation results evaluate that the deep learning technique can be an efficient tool to improve the performance of SAGINs.
Online Illumination Invariant Moving Object Detection by Generative Neural Network
Venue: arXiv cs.CV 2018
Year: 2018

Moving object detection (MOD) is a significant problem in computer vision that has many real world applications. Different categories of methods have been proposed to solve MOD. One of the challenges is to separate moving objects from illumination changes and shadows that are present in most real world videos. State-of-the-art methods that can handle illumination changes and shadows work in a batch mode; thus, these methods are not suitable for long video sequences or real-time applications. In this paper, we propose an extension of a state-of-the-art batch MOD method (ILISD) to an online/incremental MOD using unsupervised and generative neural networks, which use illumination invariant image representations. For each image in a sequence, we use a low-dimensional representation of a background image by a neural network and then based on the illumination invariant representation, decompose the foreground image into: illumination change and moving objects. Optimization is performed by stochastic gradient descent in an end-to-end and unsupervised fashion. Our algorithm can work in both batch and online modes. In the batch mode, like other batch methods, optimizer uses all the images. In online mode, images can be incrementally fed into the optimizer. Based on our experimental evaluation on benchmark image sequences, both the online and the batch modes of our algorithm achieve state-of-the-art accuracy on most data sets.
iSPA-Net: Iterative Semantic Pose Alignment Network
Venue: arXiv cs.CV 2018
Year: 2018

Understanding and extracting 3D information of objects from monocular 2D images is a fundamental problem in computer vision. In the task of 3D object pose estimation, recent data driven deep neural network based approaches suffer from scarcity of real images with 3D keypoint and pose annotations. Drawing inspiration from human cognition, where the annotators use a 3D CAD model as structural reference to acquire ground-truth viewpoints for real images; we propose an iterative Semantic Pose Alignment Network, called iSPA-Net. Our approach focuses on exploiting semantic 3D structural regularity to solve the task of fine-grained pose estimation by predicting viewpoint difference between a given pair of images. Such image comparison based approach also alleviates the problem of data scarcity and hence enhances scalability of the proposed approach for novel object categories with minimal annotation. The fine-grained object pose estimator is also aided by correspondence of learned spatial descriptor of the input image pair. The proposed pose alignment framework enjoys the faculty to refine its initial pose estimation in consecutive iterations by utilizing an online rendering setup along with effectiveness of a non-uniform bin classification of pose-difference. This enables iSPA-Net to achieve state-of-the-art performance on various real image viewpoint estimation datasets. Further, we demonstrate effectiveness of the approach for multiple applications. First, we show results for active object viewpoint localization to capture images from similar pose considering only a single image as pose reference. Second, we demonstrate the ability of the learned semantic correspondence to perform unsupervised part-segmentation transfer using only a single part-annotated 3D template model per object class. To encourage reproducible research, we have released the codes for our proposed algorithm.
Structured Neural Network Dynamics for Model-based Control
Venue: arXiv cs.RO 2018
Year: 2018

We present a structured neural network architecture that is inspired by linear time-varying dynamical systems. The network is designed to mimic the properties of linear dynamical systems which makes analysis and control simple. The architecture facilitates the integration of learned system models with gradient-based model predictive control algorithms, and removes the requirement of computing potentially costly derivatives online. We demonstrate the efficacy of this modeling technique in computing autonomous control policies through evaluation in a variety of standard continuous control domains.
Lightweight Multilingual Software Analysis
Venue: arXiv cs.SE 2018
Year: 2018

Developer preferences, language capabilities and the persistence of older languages contribute to the trend that large software codebases are often multilingual, that is, written in more than one computer language. While developers can leverage monolingual software development tools to build software components, companies are faced with the problem of managing the resultant large, multilingual codebases to address issues with security, efficiency, and quality metrics. The key challenge is to address the opaque nature of the language interoperability interface: one language calling procedures in a second (which may call a third, or even back to the first), resulting in a potentially tangled, inefficient and insecure codebase. An architecture is proposed for lightweight static analysis of large multilingual codebases: the MLSA architecture. Its modular and table-oriented structure addresses the open-ended nature of multiple languages and language interoperability APIs. We focus here as an application on the construction of call-graphs that capture both inter-language and intra-language calls. The algorithms for extracting multilingual call-graphs from codebases are presented, and several examples of multilingual software engineering analysis are discussed. The state of the implementation and testing of MLSA is presented, and the implications for future work are discussed.
Ultra-Dense 5G Small Cell Deployment for Fiber and Wireless Backhaul-Aware Infrastructures
Venue: arXiv cs.NI 2018
Year: 2018

In this paper, we study the cell planning problem for a two-tier cellular network containing two types of base stations (BSs)-- i.e. with fiber backhaul, referred to as wired BSs (W-BSs), and BSs with wireless backhaul, referred to as unwired-BSs (U-BSs). In-band full-duplex wireless communications is used to connect U-BSs and W-BSs. We propose an algorithm to determine the minimum number of W-BSs and U-BSs to satisfy given cell and capacity coverage constraints. Furthermore, we apply our proposed non-dominated sorting genetic algorithm II (NSGA-II) to solve both cell planning and joint cell and backhaul planning problem to minimize the cost of planning, while maximizing the coverage simultaneously. Additionally, the considered cell planning program is developed into an optimization by including the problem of minimizing the cost of fiber backhaul deployment. In order to analyze the performance of the proposed algorithm, we study three different deployment scenarios based on different spatial distributions of users and coverage areas. The results show the superiority of our proposed NSGA-II algorithm for both cell planning and joint cell and backhaul planning to other well-known optimization algorithms. The results also reveal that there is a trade-off between cell deployment costs and SINR/rate coverage, and W-BSs are placed in congested areas to consume less resources for wireless backhauls. Similarly, a trade-off between cell and fiber deployment costs and SINR/rate coverage is observed in planning. We show that for realistic scenarios desirable solutions can be selected from the Pareto front of the introduced multi-objective problem based on given cellular operator policies.
Fundamentals of Simultaneous Wireless Information and Power Transmission in Heterogeneous Networks: A Cell Load Perspective
Venue: arXiv cs.IT 2018
Year: 2018

In a heterogeneous cellular network (HetNet) consisting of multiple different types (tiers) of base stations (BSs), the void cell event in which a BS does not have any users has been shown to exist due to user-centric BS association and its probability is dominated by the cell load of each tier. Such a void cell phenomenon has not been well characterized in the modeling and analytical framework of simultaneous wireless information and power transmission (SWIPT) in a HetNet. This paper aims to accurately exploit the fundamental performance limits of the SWIPT between a BS and its user by modeling the cell-load impact on the downlink and uplink transmissions of each BS. We first characterize the power-splitting receiver architecture at a user and analyze the statistical properties and limits of its harvested power and energy, which reveals how much of the average energy can be harvested by users and how likely the self-powered sustainability of users can be achieved. We then derive the downlink and uplink rates that characterize the cell-load and user association effects and use them to define the energy efficiency of a user. The optimality of the energy efficiency is investigated, which maximizes the SWIPT performance of the receiver architecture for different user association and network deployment scenarios.
A Compiler-Compiler for DSL Embedding
Venue: arXiv cs.PL 2018
Year: 2018

In this paper, we present a framework to generate compilers for embedded domain-specific languages (EDSLs). This framework provides facilities to automatically generate the boilerplate code required for building DSL compilers on top of extensible optimizing compilers. We evaluate the practicality of our framework by demonstrating several use-cases successfully built with it.
A recurrent multi-scale approach to RBG-D Object Recognition
Venue: arXiv cs.CV 2018
Year: 2018

Technological development aims to produce generations of increasingly efficient robots able to perform complex tasks. This requires considerable efforts, from the scientific community, to find new algorithms that solve computer vision problems, such as object recognition. The diffusion of RGB-D cameras directed the study towards the research of new architectures able to exploit the RGB and Depth information. The project that is developed in this thesis concerns the realization of a new end-to-end architecture for the recognition of RGB-D objects called RCFusion. Our method generates compact and highly discriminative multi-modal features by combining complementary RGB and depth information representing different levels of abstraction. We evaluate our method on standard object recognition datasets, RGB-D Object Dataset and JHUIT-50. The experiments performed show that our method outperforms the existing approaches and establishes new state-of-the-art results for both datasets.
CredSaT: Credibility Ranking of Users in Big Social Data incorporating Semantic Analysis and Temporal Factor
Venue: arXiv cs.SI 2018
Year: 2018

The widespread use of big social data has pointed the research community in several significant directions. In particular, the notion of social trust has attracted a great deal of attention from information processors | computer scientists and information consumers | formal organizations. This is evident in various applications such as recommendation systems, viral marketing and expertise retrieval. Hence, it is essential to have frameworks that can temporally measure users credibility in all domains categorised under big social data. This paper presents CredSaT (Credibility incorporating Semantic analysis and Temporal factor): a fine-grained users credibility analysis framework for big social data. A novel metric that includes both new and current features, as well as the temporal factor, is harnessed to establish the credibility ranking of users. Experiments on real-world dataset demonstrate the effectiveness and applicability of our model to indicate highly domain-based trustworthy users. Further, CredSaT shows the capacity in capturing spammers and other anomalous users.
DELIMIT PyTorch - An extension for Deep Learning in Diffusion Imaging
Venue: arXiv cs.LG 2018
Year: 2018

DELIMIT is a framework extension for deep learning in diffusion imaging, which extends the basic framework PyTorch towards spherical signals. Based on several novel layers, deep learning can be applied to spherical diffusion imaging data in a very convenient way. First, two spherical harmonic interpolation layers are added to the extension, which allow to transform the signal from spherical surface space into the spherical harmonic space, and vice versa. In addition, a local spherical convolution layer is introduced that adds the possibility to include gradient neighborhood information within the network. Furthermore, these extensions can also be utilized for the preprocessing of diffusion signals.
Smart City Development with Urban Transfer Learning
Venue: arXiv cs.AI 2018
Year: 2018

Nowadays, the smart city development levels of different cities are still unbalanced. For a large number of cities which just started development, the governments will face a critical cold-start problem: 'how to develop a new smart city service with limited data?'. To address this problem, transfer learning can be leveraged to accelerate the smart city development, which we term the urban transfer learning paradigm. This article investigates the common process of urban transfer learning, aiming to provide city planners and relevant practitioners with guidelines on how to apply this novel learning paradigm. Our guidelines include common transfer strategies to take, general steps to follow, and case studies in public safety, transportation management, etc. We also summarize a few research opportunities and expect this article can attract more researchers to study urban transfer learning.
LISA: Explaining Recurrent Neural Network Judgments via Layer-wIse Semantic Accumulation and Example to Pattern Transformation
Venue: arXiv cs.CL 2018
Year: 2018

Recurrent neural networks (RNNs) are temporal networks and cumulative in nature that have shown promising results in various natural language processing tasks. Despite their success, it still remains a challenge to understand their hidden behavior. In this work, we analyze and interpret the cumulative nature of RNN via a proposed technique named as Layer-wIse-Semantic-Accumulation (LISA) for explaining decisions and detecting the most likely (i.e., saliency) patterns that the network relies on while decision making. We demonstrate (1) LISA: "How an RNN accumulates or builds semantics during its sequential processing for a given text example and expected response" (2) Example2pattern: "How the saliency patterns look like for each category in the data according to the network in decision making". We analyse the sensitiveness of RNNs about different inputs to check the increase or decrease in prediction scores and further extract the saliency patterns learned by the network. We employ two relation classification datasets: SemEval 10 Task 8 and TAC KBP Slot Filling to explain RNN predictions via the LISA and example2pattern.
Spherical Harmonic Residual Network for Diffusion Signal Harmonization
Venue: arXiv cs.CV 2018
Year: 2018

Diffusion imaging is an important method in the field of neuroscience, as it is sensitive to changes within the tissue microstructure of the human brain. However, a major challenge when using MRI to derive quantitative measures is that the use of different scanners, as used in multi-site group studies, introduces measurement variability. This can lead to an increased variance in quantitative metrics, even if the same brain is scanned. Contrary to the assumption that these characteristics are comparable and similar, small changes in these values are observed in many clinical studies, hence harmonization of the signals is essential. In this paper, we present a method that does not require additional preprocessing, such as segmentation or registration, and harmonizes the signal based on a deep learning residual network. For this purpose, a training database is required, which consist of the same subjects, scanned on different scanners. The results show that harmonized signals are significantly more similar to the ground truth signal compared to no harmonization, but also improve in comparison to another deep learning method. The same effect is also demonstrated in commonly used metrics derived from the diffusion MRI signal.