OpenRaiser/Intern-Atlas huggingface dataset:
Image Super-Resolution Based on Sparsity Prior via Smoothed $l_0$ Norm
Venue: arXiv cs.CV 2016
Year: 2016

In this paper we aim to tackle the problem of reconstructing a high-resolution image from a single low-resolution input image, known as single image super-resolution. In the literature, sparse representation has been used to address this problem, where it is assumed that both low-resolution and high-resolution images share the same sparse representation over a pair of coupled jointly trained dictionaries. This assumption enables us to use the compressed sensing theory to find the jointly sparse representation via the low-resolution image and then use it to recover the high-resolution image. However, sparse representation of a signal over a known dictionary is an ill-posed, combinatorial optimization problem. Here we propose an algorithm that adopts the smoothed $l_0$-norm (SL0) approach to find the jointly sparse representation. Improved quality of the reconstructed image is obtained for most images in terms of both peak signal-to-noise-ratio (PSNR) and structural similarity (SSIM) measures.
Selective AP-sequence Based Indoor Localization without Site Survey
Venue: arXiv cs.NI 2016
Year: 2016

In this paper, we propose an indoor localization system employing ordered sequence of access points (APs) based on received signal strength (RSS). Unlike existing indoor localization systems, our approach does not require any time-consuming and laborious site survey phase to characterize the radio signals in the environment. To be precise, we construct the fingerprint map by cutting the layouts of the interested area into regions with only the knowledge of positions of APs. This can be done offline within a second and has a potential for practical use. The localization is then achieved by matching the ordered AP-sequence to the ones in the fingerprint map. Different from traditional fingerprinting that employing all APs information, we use only selected APs to perform localization, due to the fact that, without site survey, the possibility in obtaining the correct AP sequence is lower if it involves more APs. Experimental results show that, the proposed system achieves localization accuracy < 5m with an accumulative density function (CDF) of 50% to 60% depending on the density of APs. Furthermore, we observe that, using all APs for localization might not achieve the best localization accuracy, e.g. in our case, 4 APs out of total 7 APs achieves the best performance. In practice, the number of APs used to perform localization should be a design parameter based on the placement of APs.
An Original Correction Method for Indoor Ultra Wide Band Ranging-based Localisation System
Venue: arXiv cs.NI 2016
Year: 2016

During this decade, Wireless Sensor Networks (WSNs) brought an increasing interest in the industrial and research world. One of their applications is the indoor localization. The ranging, i.e. the distance evaluation mechanism between nodes, is required to determine the position of the nodes. The research work presented in this article aims to use Ultra Wide Band (UWB) radio links to achieve an efficient ranging, based on Time of Flight (ToF) measurement. A good solution consists in integrating ranging traffic into the usual network mes-sages. However, the ToF ranging process is based on information exchanges which are temporally constrained. Once this information is encapsulated into the usual messages, the temporal constraint cannot be honoured, resulting in important ranging errors due to clock drifts. To mitigate these errors, we have introduced an original dynamic correction technique which enables a precision of twenty centimetres allowing the inclusion of ranging traffic in usual traffic
Pilot Power Allocation Through User Grouping in Multi-Cell Massive MIMO Systems
Venue: arXiv cs.IT 2016
Year: 2016

In this paper, we propose a relative channel estimation error (RCEE) metric, and derive closed-form expressions for its expectation $\rm {Exp}_{rcee}$ and the achievable uplink rate holding for any number of base station antennas $M$, with the least squares (LS) and minimum mean squared error (MMSE) estimation methods. It is found that RCEE and $\rm {Exp}_{rcee}$ converge to the same constant value when $M\rightarrow\infty$, resulting in the pilot power allocation (PPA) is substantially simplified and a PPA algorithm is proposed to minimize the average $\rm {Exp}_{rcee}$ per user with a total pilot power budget $P$ in multi-cell massive multiple-input multiple-output systems. Numerical results show that the PPA algorithm brings considerable gains for the LS estimation compared with equal PPA (EPPA), while the gains are only significant with large frequency reuse factor (FRF) for the MMSE estimation. Moreover, for large FRF and large $P$, the performance of the LS approaches to the performance of the MMSE, which means that simple LS estimation method is a very viable when co-channel interference is small. For the achievable uplink rate, the PPA scheme delivers almost the same average achievable uplink rate and improves the minimum achievable uplink rate compared with the EPPA scheme.
Energy-Efficient ConvNets Through Approximate Computing
Venue: arXiv cs.CV 2016
Year: 2016

Recently ConvNets or convolutional neural networks (CNN) have come up as state-of-the-art classification and detection algorithms, achieving near-human performance in visual detection. However, ConvNet algorithms are typically very computation and memory intensive. In order to be able to embed ConvNet-based classification into wearable platforms and embedded systems such as smartphones or ubiquitous electronics for the internet-of-things, their energy consumption should be reduced drastically. This paper proposes methods based on approximate computing to reduce energy consumption in state-of-the-art ConvNet accelerators. By combining techniques both at the system- and circuit level, we can gain energy in the systems arithmetic: up to 30x without losing classification accuracy and more than 100x at 99% classification accuracy, compared to the commonly used 16-bit fixed point number format.
Enhanced perceptrons using contrastive biclusters
Venue: arXiv cs.NE 2016
Year: 2016

Perceptrons are neuronal devices capable of fully discriminating linearly separable classes. Although straightforward to implement and train, their applicability is usually hindered by non-trivial requirements imposed by real-world classification problems. Therefore, several approaches, such as kernel perceptrons, have been conceived to counteract such difficulties. In this paper, we investigate an enhanced perceptron model based on the notion of contrastive biclusters. From this perspective, a good discriminative bicluster comprises a subset of data instances belonging to one class that show high coherence across a subset of features and high differentiation from nearest instances of the other class under the same features (referred to as its contrastive bicluster). Upon each local subspace associated with a pair of contrastive biclusters a perceptron is trained and the model with highest area under the receiver operating characteristic curve (AUC) value is selected as the final classifier. Experiments conducted on a range of data sets, including those related to a difficult biosignal classification problem, show that the proposed variant can be indeed very useful, prevailing in most of the cases upon standard and kernel perceptrons in terms of accuracy and AUC measures.
Building Model Identification during Regular Operation - Empirical Results and Challenges
Venue: arXiv cs.SY 2016
Year: 2016

The inter-temporal consumption flexibility of commercial buildings can be harnessed to improve the energy efficiency of buildings, or to provide ancillary service to the power grid. To do so, a predictive model of the building's thermal dynamics is required. In this paper, we identify a physics-based model of a multi-purpose commercial building including its heating, ventilation and air conditioning system during regular operation. We present our empirical results and show that large uncertainties in internal heat gains, due to occupancy and equipment, present several challenges in utilizing the building model for long-term prediction. In addition, we show that by learning these uncertain loads online and dynamically updating the building model, prediction accuracy is improved significantly.
Secure State Estimation for Nonlinear Power Systems under Cyber Attacks
Venue: arXiv cs.SY 2016
Year: 2016

This paper focuses on securely estimating the state of a nonlinear dynamical system from a set of corrupted measurements. In particular, we consider two broad classes of nonlinear systems, and propose a technique which enables us to perform secure state estimation for such nonlinear systems. We then provide guarantees on the achievable state estimation error against arbitrary corruptions, and analytically characterize the number of errors that can be perfectly corrected by a decoder. To illustrate how the proposed nonlinear estimation approach can be applied to practical systems, we focus on secure estimation for the wide area control of an interconnected power system under cyber-physical attacks and communication failures, and propose a secure estimator for the power system. Finally, we numerically show that the proposed secure estimation algorithm enables us to reconstruct the attack signals accurately.
Continuous-Flow Graph Transportation Distances
Venue: arXiv cs.OH 2016
Year: 2016

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized approximations. Motivated by fluid flow-based transportation on $\mathbb{R}^n$, however, this paper introduces an alternative definition of optimal transportation between distributions over graph vertices. This new distance still satisfies the triangle inequality but has better scaling and a connection to continuous theories of transportation. It is constructed by adapting a Riemannian structure over probability distributions to the graph case, providing transportation distances as shortest-paths in probability space. After defining and analyzing theoretical properties of our new distance, we provide a time discretization as well as experiments verifying its effectiveness.
On the necessity of symmetric positional coupling for string stability
Venue: arXiv cs.SY 2016
Year: 2016

We consider a distributed system with identical agents, constant-spacing policy and asymmetric bidirectional control, where the asymmetry is due to different controllers, which we describe by transfer functions. By applying the wave transfer function approach, it is shown that, if there are two integrators in the dynamics of agents, then the positional coupling must be symmetric, otherwise the system is locally string unstable. This finding holds also for a distributed system with a generalized path-graph interaction topology due to the local nature of the wave transfer function. The main advantage of the transfer function approach is that it allows us to analyse the bidirectional control with an arbitrary complex asymmetry in the controllers, for instance, the control with symmetric positional but asymmetric velocity couplings.
Multi-Scale Convolutional Neural Networks for Time Series Classification
Venue: arXiv cs.CV 2016
Year: 2016

Time series classification (TSC), the problem of predicting class labels of time series, has been around for decades within the community of data mining and machine learning, and found many important applications such as biomedical engineering and clinical prediction. However, it still remains challenging and falls short of classification accuracy and efficiency. Traditional approaches typically involve extracting discriminative features from the original time series using dynamic time warping (DTW) or shapelet transformation, based on which an off-the-shelf classifier can be applied. These methods are ad-hoc and separate the feature extraction part with the classification part, which limits their accuracy performance. Plus, most existing methods fail to take into account the fact that time series often have features at different time scales. To address these problems, we propose a novel end-to-end neural network model, Multi-Scale Convolutional Neural Networks (MCNN), which incorporates feature extraction and classification in a single framework. Leveraging a novel multi-branch layer and learnable convolutional layers, MCNN automatically extracts features at different scales and frequencies, leading to superior feature representation. MCNN is also computationally efficient, as it naturally leverages GPU computing. We conduct comprehensive empirical evaluation with various existing methods on a large number of benchmark datasets, and show that MCNN advances the state-of-the-art by achieving superior accuracy performance than other leading methods.
Mean-Field Games for Distributed Caching in Ultra-Dense Small Cell Networks
Venue: arXiv cs.IT 2016
Year: 2016

In this paper, the problem of distributed caching in dense wireless small cell networks (SCNs) is studied using mean field games (MFGs). In the considered SCN, small base stations (SBSs) are equipped with data storage units and cooperate to serve users' requests either from files cached in the storage or directly from the capacity-limited backhaul. The aim of the SBSs is to define a caching policy that reduces the load on the capacity-limited backhaul links. This cache control problem is formulated as a stochastic differential game (SDG). In this game, each SBS takes into consideration the storage state of the other SBSs to decide on the fraction of content it should cache. To solve this problem, the formulated SDG is reduced to an MFG by considering an ultra-dense network of SBSs in which the existence and uniqueness of the mean-field equilibrium is shown to be guaranteed. Simulation results show that this framework allows an efficient use of the available storage space at the SBSs while properly tracking the files' popularity. The results also show that, compared to a baseline model in which SBSs are not aware of the instantaneous system state, the proposed framework increases the number of served files from the SBSs by more than 69%.
Recurrent Neural Network Encoder with Attention for Community Question Answering
Venue: arXiv cs.CL 2016
Year: 2016

We apply a general recurrent neural network (RNN) encoder framework to community question answering (cQA) tasks. Our approach does not rely on any linguistic processing, and can be applied to different languages or domains. Further improvements are observed when we extend the RNN encoders with a neural attention mechanism that encourages reasoning over entire sequences. To deal with practical issues such as data sparsity and imbalanced labels, we apply various techniques such as transfer learning and multitask learning. Our experiments on the SemEval-2016 cQA task show 10% improvement on a MAP score compared to an information retrieval-based approach, and achieve comparable performance to a strong handcrafted feature-based method.
Cluster Content Caching: An Energy-Efficient Approach to Improve Quality of Service in Cloud Radio Access Networks
Venue: arXiv cs.IT 2016
Year: 2016

In cloud radio access networks (C-RANs), a substantial amount of data must be exchanged in both backhaul and fronthaul links, which causes high power consumption and poor quality of service (QoS) experience for real-time services. To solve this problem, a cluster content caching structure is proposed in this paper, which takes full advantage of distributed caching and centralized signal processing. In particular, redundant traffic on the backhaul can be reduced because the cluster content cache provides a part of required content objects for remote radio heads (RRHs) connected to a common edge cloud. Tractable expressions for both effective capacity and energy efficiency performance are derived, which show that the proposed structure can improve QoS guarantees with a lower power cost of local storage. Furthermore, to fully explore the potential of the proposed cluster content caching structure, the joint design of resource allocation and RRH association is optimized, and two distributed algorithms are accordingly proposed. Simulation results verify the accuracy of the analytical results and show the performance gains achieved by cluster content caching in C-RANs.
CSI-based Fingerprinting for Indoor Localization: A Deep Learning Approach
Venue: arXiv cs.NI 2016
Year: 2016

With the fast growing demand of location-based services in indoor environments, indoor positioning based on fingerprinting has attracted a lot of interest due to its high accuracy. In this paper, we present a novel deep learning based indoor fingerprinting system using Channel State Information (CSI), which is termed DeepFi. Based on three hypotheses on CSI, the DeepFi system architecture includes an off-line training phase and an on-line localization phase. In the off-line training phase, deep learning is utilized to train all the weights of a deep network as fingerprints. Moreover, a greedy learning algorithm is used to train the weights layer-by-layer to reduce complexity. In the on-line localization phase, we use a probabilistic method based on the radial basis function to obtain the estimated location. Experimental results are presented to confirm that DeepFi can effectively reduce location error compared with three existing methods in two representative indoor environments.
Deep Multimodal Feature Analysis for Action Recognition in RGB+D Videos
Venue: arXiv cs.CV 2016
Year: 2016

Single modality action recognition on RGB or depth sequences has been extensively explored recently. It is generally accepted that each of these two modalities has different strengths and limitations for the task of action recognition. Therefore, analysis of the RGB+D videos can help us to better study the complementary properties of these two types of modalities and achieve higher levels of performance. In this paper, we propose a new deep autoencoder based shared-specific feature factorization network to separate input multimodal signals into a hierarchy of components. Further, based on the structure of the features, a structured sparsity learning machine is proposed which utilizes mixed norms to apply regularization within components and group selection between them for better classification performance. Our experimental results show the effectiveness of our cross-modality feature analysis framework by achieving state-of-the-art accuracy for action classification on five challenging benchmark datasets.
Popular matchings with two-sided preferences and one-sided ties
Venue: arXiv cs.DM 2016
Year: 2016

We are given a bipartite graph $G = (A \cup B, E)$ where each vertex has a preference list ranking its neighbors: in particular, every $a \in A$ ranks its neighbors in a strict order of preference, whereas the preference lists of $b \in B$ may contain ties. A matching $M$ is popular if there is no matching $M'$ such that the number of vertices that prefer $M'$ to $M$ exceeds the number of vertices that prefer $M$ to~$M'$. We show that the problem of deciding whether $G$ admits a popular matching or not is NP-hard. This is the case even when every $b \in B$ either has a strict preference list or puts all its neighbors into a single tie. In contrast, we show that the problem becomes polynomially solvable in the case when each $b \in B$ puts all its neighbors into a single tie. That is, all neighbors of $b$ are tied in $b$'s list and $b$ desires to be matched to any of them. Our main result is an $O(n^2)$ algorithm (where $n = |A \cup B|$) for the popular matching problem in this model. Note that this model is quite different from the model where vertices in $B$ have no preferences and do not care whether they are matched or not.
Deductive Refinement of Species Labelling in Weakly Labelled Birdsong Recordings
Venue: arXiv cs.SD 2016
Year: 2016

Many approaches have been used in bird species classification from their sound in order to provide labels for the whole of a recording. However, a more precise classification of each bird vocalization would be of great importance to the use and management of sound archives and bird monitoring. In this work, we introduce a technique that using a two step process can first automatically detect all bird vocalizations and then, with the use of 'weakly' labelled recordings, classify them. Evaluations of our proposed method show that it achieves a correct classification of 61% when used in a synthetic dataset, and up to 89% when the synthetic dataset only consists of vocalizations larger than 1000 pixels.
Gaussian Process Morphable Models
Venue: arXiv cs.CV 2016
Year: 2016

Statistical shape models (SSMs) represent a class of shapes as a normal distribution of point variations, whose parameters are estimated from example shapes. Principal component analysis (PCA) is applied to obtain a low-dimensional representation of the shape variation in terms of the leading principal components. In this paper, we propose a generalization of SSMs, called Gaussian Process Morphable Models (GPMMs). We model the shape variations with a Gaussian process, which we represent using the leading components of its Karhunen-Loeve expansion. To compute the expansion, we make use of an approximation scheme based on the Nystrom method. The resulting model can be seen as a continuous analogon of an SSM. However, while for SSMs the shape variation is restricted to the span of the example data, with GPMMs we can define the shape variation using any Gaussian process. For example, we can build shape models that correspond to classical spline models, and thus do not require any example data. Furthermore, Gaussian processes make it possible to combine different models. For example, an SSM can be extended with a spline model, to obtain a model that incorporates learned shape characteristics, but is flexible enough to explain shapes that cannot be represented by the SSM. We introduce a simple algorithm for fitting a GPMM to a surface or image. This results in a non-rigid registration approach, whose regularization properties are defined by a GPMM. We show how we can obtain different registration schemes,including methods for multi-scale, spatially-varying or hybrid registration, by constructing an appropriate GPMM. As our approach strictly separates modelling from the fitting process, this is all achieved without changes to the fitting algorithm. We show the applicability and versatility of GPMMs on a clinical use case, where the goal is the model-based segmentation of 3D forearm images.
Summaries for Context-Free Games
Venue: arXiv cs.LO 2016
Year: 2016

We study two-player games played on the infinite graph of sentential forms induced by a context-free grammar (that comes with an ownership partitioning of the non-terminals). The winning condition is inclusion of the derived terminal word in the language of a finite automaton. Our contribution is a new algorithm to decide the winning player and to compute her strategy. It is based on a novel representation of all plays starting in a non-terminal. The representation uses the domain of Boolean formulas over the transition monoid of the target automaton. The elements of the monoid are essentially procedure summaries, and our approach can be seen as the first summary-based algorithm for the synthesis of recursive programs. We show that our algorithm has optimal (doubly exponential) time complexity, that it is compatible with recent antichain optimizations, and that it admits a lazy evaluation strategy. Our preliminary experiments indeed show encouraging results, indicating a speed up of three orders of magnitude over a competitor.