OpenRaiser/Intern-Atlas huggingface dataset:
Explanatory Graphs for CNNs
Venue: arXiv cs.CV 2018
Year: 2018

This paper introduces a graphical model, namely an explanatory graph, which reveals the knowledge hierarchy hidden inside conv-layers of a pre-trained CNN. Each filter in a conv-layer of a CNN for object classification usually represents a mixture of object parts. We develop a simple yet effective method to disentangle object-part pattern components from each filter. We construct an explanatory graph to organize the mined part patterns, where a node represents a part pattern, and each edge encodes co-activation relationships and spatial relationships between patterns. More crucially, given a pre-trained CNN, the explanatory graph is learned without a need of annotating object parts. Experiments show that each graph node consistently represented the same object part through different images, which boosted the transferability of CNN features. We transferred part patterns in the explanatory graph to the task of part localization, and our method significantly outperformed other approaches.
FrameNet automatic analysis : a study on a French corpus of encyclopedic texts
Venue: arXiv cs.CL 2018
Year: 2018

This article presents an automatic frame analysis system evaluated on a corpus of French encyclopedic history texts annotated according to the FrameNet formalism. The chosen approach relies on an integrated sequence labeling model which jointly optimizes frame identification and semantic role segmentation and identification. The purpose of this study is to analyze the task complexity from several dimensions. Hence we provide detailed evaluations from a feature selection point of view and from the data point of view.
Very Power Efficient Neural Time-of-Flight
Venue: arXiv cs.CV 2018
Year: 2018

Time-of-Flight (ToF) cameras require active illumination to obtain depth information thus the power of illumination directly affects the performance of ToF cameras. Traditional ToF imaging algorithms is very sensitive to illumination and the depth accuracy degenerates rapidly with the power of it. Therefore, the design of a power efficient ToF camera always creates a painful dilemma for the illumination and the performance trade-off. In this paper, we show that despite the weak signals in many areas under extreme short exposure setting, these signals as a whole can be well utilized through a learning process which directly translates the weak and noisy ToF camera raw to depth map. This creates an opportunity to tackle the aforementioned dilemma and make a very power efficient ToF camera possible. To enable the learning, we collect a comprehensive dataset under a variety of scenes and photographic conditions by a specialized ToF camera. Experiments show that our method is able to robustly process ToF camera raw with the exposure time of one order of magnitude shorter than that used in conventional ToF cameras. In addition to evaluating our approach both quantitatively and qualitatively, we also discuss its implication to designing the next generation power efficient ToF cameras. We will make our dataset and code publicly available.
Derandomizing compressed sensing with combinatorial design
Venue: arXiv cs.IT 2018
Year: 2018

Compressed sensing is the art of reconstructing structured $n$-dimensional vectors from substantially fewer measurements than naively anticipated. A plethora of analytic reconstruction guarantees support this credo. The strongest among them are based on deep results from large-dimensional probability theory that require a considerable amount of randomness in the measurement design. Here, we demonstrate that derandomization techniques allow for considerably reducing the amount of randomness that is required for such proof strategies. More, precisely we establish uniform s-sparse reconstruction guarantees for $C s \log (n)$ measurements that are chosen independently from strength-four orthogonal arrays and maximal sets of mutually unbiased bases, respectively. These are highly structured families of $\tilde{C} n^2$ vectors that imitate signed Bernoulli and standard Gaussian vectors in a (partially) derandomized fashion.
Minimizing Age of Information with Soft Updates
Venue: arXiv cs.IT 2018
Year: 2018

We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but $instantaneously$ in both cases, here updates start taking effect right away but $gradually$ over time. We coin this setting $soft$ $updates$. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of age is proportional to the current age, and in the second model, the rate of decrease of age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and optimum durations of the updates, subject to the constraints on the number of update periods and the total update duration.
Extrinisic Calibration of a Camera-Arm System Through Rotation Identification
Venue: arXiv cs.RO 2018
Year: 2018

Determining extrinsic calibration parameters is a necessity in any robotic system composed of actuators and cameras. Once a system is outside the lab environment, parameters must be determined without relying on outside artifacts such as calibration targets. We propose a method that relies on structured motion of an observed arm to recover extrinsic calibration parameters. Our method combines known arm kinematics with observations of conics in the image plane to calculate maximum-likelihood estimates for calibration extrinsics. This method is validated in simulation and tested against a real-world model, yielding results consistent with ruler-based estimates. Our method shows promise for estimating the pose of a camera relative to an articulated arm's end effector without requiring tedious measurements or external artifacts. Index Terms: robotics, hand-eye problem, self-calibration, structure from motion
Dense Moving Fog for Intelligent IoT: Key Challenges and Opportunities
Venue: arXiv cs.NI 2018
Year: 2018

As the ratification of 5G New Radio technology is being completed, enabling network architectures are expected to undertake a matching effort. Conventional cloud and edge computing paradigms may thus become insufficient in supporting the increasingly stringent operating requirements of \emph{intelligent~Internet-of-Things (IoT) devices} that can move unpredictably and at high speeds. Complementing these, the concept of fog emerges to deploy cooperative cloud-like functions in the immediate vicinity of various moving devices, such as connected and autonomous vehicles, on the road and in the air. Envisioning gradual evolution of these infrastructures toward the increasingly denser geographical distribution of fog functionality, we in this work put forward the vision of dense moving fog for intelligent IoT applications. To this aim, we review the recent powerful enablers, outline the main challenges and opportunities, and corroborate the performance benefits of collaborative dense fog operation in a characteristic use case featuring a connected fleet of autonomous vehicles.
Soft Realization: a Bio-inspired Implementation Paradigm
Venue: arXiv cs.ET 2018
Year: 2018

Researchers traditionally solve the computational problems through rigorous and deterministic algorithms called as Hard Computing. These precise algorithms have widely been realized using digital technology as an inherently reliable and accurate implementation platform, either in hardware or software forms. This rigid form of implementation which we refer as Hard Realization relies on strict algorithmic accuracy constraints dictated to digital design engineers. Hard realization admits paying as much as necessary implementation costs to preserve computation precision and determinism throughout all the design and implementation steps. Despite its prior accomplishments, this conventional paradigm has encountered serious challenges with today's emerging applications and implementation technologies. Unlike traditional hard computing, the emerging soft and bio-inspired algorithms do not rely on fully precise and deterministic computation. Moreover, the incoming nanotechnologies face increasing reliability issues that prevent them from being efficiently exploited in hard realization of applications. This article examines Soft Realization, a novel bio-inspired approach to design and implementation of an important category of applications noticing the internal brain structure. The proposed paradigm mitigates major weaknesses of hard realization by (1) alleviating incompatibilities with today's soft and bio-inspired algorithms such as artificial neural networks, fuzzy systems, and human sense signal processing applications, and (2) resolving the destructive inconsistency with unreliable nanotechnologies. Our experimental results on a set of well-known soft applications implemented using the proposed soft realization paradigm in both reliable and unreliable technologies indicate that significant energy, delay, and area savings can be obtained compared to the conventional implementation.
Unsupervised Meta-learning of Figure-Ground Segmentation via Imitating Visual Effects
Venue: arXiv cs.CV 2018
Year: 2018

This paper presents a "learning to learn" approach to figure-ground image segmentation. By exploring webly-abundant images of specific visual effects, our method can effectively learn the visual-effect internal representations in an unsupervised manner and uses this knowledge to differentiate the figure from the ground in an image. Specifically, we formulate the meta-learning process as a compositional image editing task that learns to imitate a certain visual effect and derive the corresponding internal representation. Such a generative process can help instantiate the underlying figure-ground notion and enables the system to accomplish the intended image segmentation. Whereas existing generative methods are mostly tailored to image synthesis or style transfer, our approach offers a flexible learning mechanism to model a general concept of figure-ground segmentation from unorganized images that have no explicit pixel-level annotations. We validate our approach via extensive experiments on six datasets to demonstrate that the proposed model can be end-to-end trained without ground-truth pixel labeling yet outperforms the existing methods of unsupervised segmentation tasks.
User Authorization in a System with a Role-Based Access Control on the Basis of the Analytic Hierarchy Process
Venue: arXiv cs.CR 2018
Year: 2018

The problem of optimal authorization of a user in a system with a role-based access control policy is considered. The main criterion is to minimize the risks of permission leakage. The choice of the role for authorization is based on the analytic hierarchy process. The substantiation of a choice of criteria for formation of a hierarchy of the first level is given. An algorithm for calculating weight coefficients is presented, based on the quantitative characteristics of the role graph and not dependent on subjective expert evaluations. The complexity is estimated and the scalability of the proposed algorithm is discussed.
A Secure and Efficient Direct Power Load Control Framework Based on Blockchain
Venue: arXiv cs.CR 2018
Year: 2018

Security and privacy in Direct Load Control (DLC) is a fundamental challenge in smart grids. In this paper, we propose a blockchain-based framework to increase security and privacy of DLC. We propose a method whereby participating nodes share their data with the distribution company in an anonymous and secure manner. To reduce the associated overhead for data dissemination, we propose a hash-based transaction generation method. We also outline the DLC process for managing the load in consumer site. Qualitative analysis demonstrates the security and privacy of the proposed method.
A heuristic approach to author name disambiguation in bibliometrics databases for large-scale research assessments
Venue: arXiv cs.DL 2018
Year: 2018

National exercises for the evaluation of research activity by universities are becoming regular practice in ever more countries. These exercises have mainly been conducted through the application of peer-review methods. Bibliometrics has not been able to offer a valid large-scale alternative because of almost overwhelming difficulties in identifying the true author of each publication. We will address this problem by presenting a heuristic approach to author name disambiguation in bibliometric datasets for large-scale research assessments. The application proposed concerns the Italian university system, consisting of 80 universities and a research staff of over 60,000 scientists. The key advantage of the proposed approach is the ease of implementation. The algorithms are of practical application and have considerably better scalability and expandability properties than state-of-the-art unsupervised approaches. Moreover, the performance in terms of precision and recall, which can be further improved, seems thoroughly adequate for the typical needs of large-scale bibliometric research assessments.
Impact of LTE's Periodic Interference on Heterogeneous Wi-Fi Transmissions
Venue: arXiv cs.NI 2018
Year: 2018

The problem of Wi-Fi and LTE coexistence has been significantly debated in the last years, with the emergence of LTE extensions enabling the utilization of unlicensed spectrum for carrier aggregation. Rather than focusing on the problem of resource sharing between the two technologies, in this paper, we study the effects of LTE's structured transmissions on the Wi-Fi random access protocol. We show how the scheduling of periodic LTE transmissions modifies the behavior of 802.11's distributed coordination function (DCF), leading to a degradation of Wi-Fi performance, both in terms of channel utilization efficiency and in terms of channel access fairness. We also discuss the applicability and limitations of a persistent DCF model in analyzing Wi-Fi performance under periodic LTE interference.
FBG-Based Position Estimation of Highly Deformable Continuum Manipulators: Model-Dependent vs. Data-Driven Approaches
Venue: arXiv cs.RO 2018
Year: 2018

Conventional shape sensing techniques using Fiber Bragg Grating (FBG) involve finding the curvature at discrete FBG active areas and integrating curvature over the length of the continuum dexterous manipulator (CDM) for tip position estimation (TPE). However, due to limited number of sensing locations and many geometrical assumptions, these methods are prone to large error propagation especially when the CDM undergoes large deflections. In this paper, we study the complications of using the conventional TPE methods that are dependent on sensor model and propose a new data-driven method that overcomes these challenges. The proposed method consists of a regression model that takes FBG wavelength raw data as input and directly estimates the CDM's tip position. This model is pre-operatively (off-line) trained on position information from optical trackers/cameras (as the ground truth) and it intra-operatively (on-line) estimates CDM tip position using only the FBG wavelength data. The method's performance is evaluated on a CDM developed for orthopedic applications, and the results are compared to conventional model-dependent methods during large deflection bendings. Mean absolute TPE error (and standard deviation) of 1.52 (0.67) mm and 0.11 (0.1) mm with maximum absolute errors of 3.63 mm and 0.62 mm for the conventional and the proposed data-driven techniques were obtained, respectively. These results demonstrate a significant out-performance of the proposed data-driven approach versus the conventional estimation technique.
Iterative Relevance Feedback for Answer Passage Retrieval with Passage-level Semantic Match
Venue: arXiv cs.IR 2018
Year: 2018

Relevance feedback techniques assume that users provide relevance judgments for the top k (usually 10) documents and then re-rank using a new query model based on those judgments. Even though this is effective, there has been little research recently on this topic because requiring users to provide substantial feedback on a result list is impractical in a typical web search scenario. In new environments such as voice-based search with smart home devices, however, feedback about result quality can potentially be obtained during users' interactions with the system. Since there are severe limitations on the length and number of results that can be presented in a single interaction in this environment, the focus should move from browsing result lists to iterative retrieval and from retrieving documents to retrieving answers. In this paper, we study iterative relevance feedback techniques with a focus on retrieving answer passages. We first show that iterative feedback is more effective than the top-k approach for answer retrieval. Then we propose an iterative feedback model based on passage-level semantic match and show that it can produce significant improvements compared to both word-based iterative feedback models and those based on term-level semantic similarity.
Using First Hitting Times to Find Sets that Maximize the Convergence Rate to Consensus
Venue: arXiv cs.DM 2018
Year: 2018

In a model of communication in a social network described by a simple consensus model, we pose the problem of finding a subset of nodes with given cardinality and fixed consensus values that enable the fastest convergence rate to equilibrium of the values of the remaining nodes. Given a network topology and a subset, called the stubborn nodes, the equilibrium exists and is a convex sum of the initial values of the stubborn nodes. The value at a non-stubborn node converges to its consensus value exponentially with a rate constant determined by the expected first hitting time of a random walker starting at the node and ending at the first stubborn node it visits. In this paper, we will use the sum of the expected first hitting times to the stubborn nodes as an objective function for a minimization problem. Its solution is a set with the fastest convergence rate. We present a polynomial time method for obtaining approximate solutions of the optimization problem for fixed cardinality less than that of a reference vertex cover. Under the assumption that the transition matrix for the random walk is irreducible and reversible, we also obtain an upper bound for the expected first hitting time and therefore an upper bound on the rate of convergence to consensus, using results from the mixing theory of Markov chains
Pre-training with Non-expert Human Demonstration for Deep Reinforcement Learning
Venue: arXiv cs.LG 2018
Year: 2018

Deep reinforcement learning (deep RL) has achieved superior performance in complex sequential tasks by using deep neural networks as function approximators to learn directly from raw input images. However, learning directly from raw images is data inefficient. The agent must learn feature representation of complex states in addition to learning a policy. As a result, deep RL typically suffers from slow learning speeds and often requires a prohibitively large amount of training time and data to reach reasonable performance, making it inapplicable to real-world settings where data is expensive. In this work, we improve data efficiency in deep RL by addressing one of the two learning goals, feature learning. We leverage supervised learning to pre-train on a small set of non-expert human demonstrations and empirically evaluate our approach using the asynchronous advantage actor-critic algorithms (A3C) in the Atari domain. Our results show significant improvements in learning speed, even when the provided demonstration is noisy and of low quality.
Efficient Misalignment-Robust Multi-Focus Microscopical Images Fusion
Venue: arXiv cs.CV 2018
Year: 2018

In this paper we propose a very efficient method to fuse the unregistered multi-focus microscopical images based on the speed-up robust features (SURF). Our method follows the pipeline of first registration and then fusion. However, instead of treating the registration and fusion as two completely independent stage, we propose to reuse the determinant of the approximate Hessian generated in SURF detection stage as the corresponding salient response for the final image fusion, thus it enables nearly cost-free saliency map generation. In addition, due to the adoption of SURF scale space representation, our method can generate scale-invariant saliency map which is desired for scale-invariant image fusion. We present an extensive evaluation on the dataset consisting of several groups of unregistered multi-focus 4K ultra HD microscopic images with size of 4112 x 3008. Compared with the state-of-the-art multi-focus image fusion methods, our method is much faster and achieve better results in the visual performance. Our method provides a flexible and efficient way to integrate complementary and redundant information from multiple multi-focus ultra HD unregistered images into a fused image that contains better description than any of the individual input images. Code is available at https://github.com/yiqingmy/JointRF.
Computational RAM to Accelerate String Matching at Scale
Venue: arXiv cs.AR 2018
Year: 2018

Traditional Von Neumann computing is falling apart in the era of exploding data volumes as the overhead of data transfer becomes forbidding. Instead, it is more energy-efficient to fuse compute capability with memory where the data reside. This is particularly critical for pattern matching, a key computational step in large-scale data analytics, which involves repetitive search over very large databases residing in memory. Emerging spintronic technologies show remarkable versatility for the tight integration of logic and memory. In this paper, we introduce CRAM-PM, a novel high-density, reconfigurable spintronic in-memory compute substrate for pattern matching.
Offline timed pattern matching under uncertainty
Venue: arXiv cs.SY 2018
Year: 2018

Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example, "a given action is always followed by another action before a given deadline". This problem has strong connections with monitoring real-time systems. We address here timed pattern matching in presence of an uncertain specification, i.e., that may contain timing parameters (e.g., the deadline can be uncertain or unknown). That is, we want to know for which start and end dates, and for what values of the deadline, this property holds. Or what is the minimum or maximum deadline (together with the corresponding start and end dates) for which this property holds. We propose here a framework for timed pattern matching based on parametric timed model checking. In contrast to most parametric timed problems, the solution is effectively computable, and we perform experiments using IMITATOR to show the applicability of our approach.