OpenRaiser/Intern-Atlas huggingface dataset:
Object Localization and Size Estimation from RGB-D Images
Venue: arXiv cs.CV 2018
Year: 2018

Depth sensing cameras (e.g., Kinect sensor, Tango phone) can acquire color and depth images that are registered to a common viewpoint. This opens the possibility of developing algorithms that exploit the advantages of both sensing modalities. Traditionally, cues from color images have been used for object localization (e.g., YOLO). However, the addition of a depth image can be further used to segment images that might otherwise have identical color information. Further, the depth image can be used for object size (height/width) estimation (in real-world measurements units, such as meters) as opposed to image based segmentation that would only support drawing bounding boxes around objects of interest. In this paper, we first collect color camera information along with depth information using a custom Android application on Tango Phab2 phone. Second, we perform timing and spatial alignment between the two data sources. Finally, we evaluate several ways of measuring the height of the object of interest within the captured images under a variety of settings.
RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertising
Venue: arXiv cs.IR 2018
Year: 2018

Recommender Systems are becoming ubiquitous in many settings and take many forms, from product recommendation in e-commerce stores, to query suggestions in search engines, to friend recommendation in social networks. Current research directions which are largely based upon supervised learning from historical data appear to be showing diminishing returns with a lot of practitioners report a discrepancy between improvements in offline metrics for supervised learning and the online performance of the newly proposed models. One possible reason is that we are using the wrong paradigm: when looking at the long-term cycle of collecting historical performance data, creating a new version of the recommendation model, A/B testing it and then rolling it out. We see that there a lot of commonalities with the reinforcement learning (RL) setup, where the agent observes the environment and acts upon it in order to change its state towards better states (states with higher rewards). To this end we introduce RecoGym, an RL environment for recommendation, which is defined by a model of user traffic patterns on e-commerce and the users response to recommendations on the publisher websites. We believe that this is an important step forward for the field of recommendation systems research, that could open up an avenue of collaboration between the recommender systems and reinforcement learning communities and lead to better alignment between offline and online performance metrics.
Approximate Probabilistic Neural Networks with Gated Threshold Logic
Venue: arXiv cs.ET 2018
Year: 2018

Probabilistic Neural Network (PNN) is a feed-forward artificial neural network developed for solving classification problems. This paper proposes a hardware implementation of an approximated PNN (APNN) algorithm in which the conventional exponential function of the PNN is replaced with gated threshold logic. The weights of the PNN are approximated using a memristive crossbar architecture. In particular, the proposed algorithm performs normalization of the training weights, and quantization into 16 levels which significantly reduces the complexity of the circuit.
Sparse and Dense Data with CNNs: Depth Completion and Semantic Segmentation
Venue: arXiv cs.CV 2018
Year: 2018

Convolutional neural networks are designed for dense data, but vision data is often sparse (stereo depth, point clouds, pen stroke, etc.). We present a method to handle sparse depth data with optional dense RGB, and accomplish depth completion and semantic segmentation changing only the last layer. Our proposal efficiently learns sparse features without the need of an additional validity mask. We show how to ensure network robustness to varying input sparsities. Our method even works with densities as low as 0.8% (8 layer lidar), and outperforms all published state-of-the-art on the Kitti depth completion benchmark.
Geometry-Based Multiple Camera Head Detection in Dense Crowds
Venue: arXiv cs.CV 2018
Year: 2018

This paper addresses the problem of head detection in crowded environments. Our detection is based entirely on the geometric consistency across cameras with overlapping fields of view, and no additional learning process is required. We propose a fully unsupervised method for inferring scene and camera geometry, in contrast to existing algorithms which require specific calibration procedures. Moreover, we avoid relying on the presence of body parts other than heads or on background subtraction, which have limited effectiveness under heavy clutter. We cast the head detection problem as a stereo MRF-based optimization of a dense pedestrian height map, and we introduce a constraint which aligns the height gradient according to the vertical vanishing point direction. We validate the method in an outdoor setting with varying pedestrian density levels. With only three views, our approach is able to detect simultaneously tens of heavily occluded pedestrians across a large, homogeneous area.
Evaluating search engines and defining a consensus implementation
Venue: arXiv cs.IR 2018
Year: 2018

Different search engines provide different outputs for the same keyword. This may be due to different definitions of relevance, and/or to different knowledge/anticipation of users' preferences, but rankings are also suspected to be biased towards own content, which may prejudicial to other content providers. In this paper, we make some initial steps toward a rigorous comparison and analysis of search engines, by proposing a definition for a consensual relevance of a page with respect to a keyword, from a set of search engines. More specifically, we look at the results of several search engines for a sample of keywords, and define for each keyword the visibility of a page based on its ranking over all search engines. This allows to define a score of the search engine for a keyword, and then its average score over all keywords. Based on the pages visibility, we can also define the consensus search engine as the one showing the most visible results for each keyword. We have implemented this model and present an analysis of the results.
Small World Model based on a Sphere Homeomorphic Geometry
Venue: arXiv cs.DS 2018
Year: 2018

We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving constant bounded distortions. The model builds networks with both number of vertices and size $Θ\left(n^2\right)$, where $n$ is the size parameter. It generates long-range edges with probability proportional to the inverse square of the distance between the vertices. We show a greedy routing algorithm that finds paths in the small world network with $\mathcal{O}\left(\log^2n\right)$ expected size. The probability of creating cycles of size three (C3) with long-range edges in a vertex is $\mathcal{O}\left(\log^{-1}n\right)$. Furthermore, there are $Θ\left(n^2\right)$ expected number of C3's in the entire network.
DataDeps.jl: Repeatable Data Setup for Replicable Data Science
Venue: arXiv cs.SE 2018
Year: 2018

We present DataDeps.jl: a julia package for the reproducible handling of static datasets to enhance the repeatability of scripts used in the data and computational sciences. It is used to automate the data setup part of running software which accompanies a paper to replicate a result. This step is commonly done manually, which expends time and allows for confusion. This functionality is also useful for other packages which require data to function (e.g. a trained machine learning based model). DataDeps.jl simplifies extending research software by automatically managing the dependencies and makes it easier to run another author's code, thus enhancing the reproducibility of data science research.
Code Shrew: Software platform for teaching programming through drawings and animations
Venue: arXiv cs.CY 2018
Year: 2018

In this paper, we present Code Shrew, a new software platform accompanied by an interactive programming course. Its aim is to teach the fundamentals of computer programming by enabling users to create their own drawings and animations. The programming language has a straightforward syntax based on Python, with additions that enable easy drawing and animating using object-oriented code. The editor reacts seamlessly and instantly, providing an engaging and interactive environment for experimenting and testing ideas. The programming course consists of lessons that cover essential programming principles, as well as challenges to test users' skills as they progress through the course. Both the lessons and challenges take advantage of the editor's instant feedback, allowing for a focus on learning-by-doing. We describe the software and the content, the motivation behind them, and their connection to constructionism.
Integrated System for Malicious Node Discovery and Self-destruction in Wireless Sensor Networks
Venue: arXiv cs.NI 2018
Year: 2018

With the tremendous advances of the wireless devices technology, securing wireless sensor networks became more and more a vital but also a challenging task. In this paper we propose an integrated strategy that is meant to discover malicious nodes within a sensor network and to expel them from the network using a node self-destruction procedure. Basically, we will compare every sensor reading with its estimated values provided by two predictors: an autoregressive predictor [1] that uses past values provided by the sensor under investigation and a neural predictor that uses past values provided by adjacent nodes. In case the absolute difference between the measured and the estimated values are greater then a chosen threshold, the sensor node becomes suspicious and a decision block is activated. If this block decides that the node is malicious, a self-destruction procedure will be started.
A Stochastic Model for File Lifetime and Security in Data Center Networks
Venue: arXiv cs.PF 2018
Year: 2018

Data center networks are an important infrastructure in various applications of modern information technologies. Note that each data center always has a finite lifetime, thus once a data center fails, then it will lose all its storage files and useful information. For this, it is necessary to replicate and copy each important file into other data centers such that this file can increase its lifetime of staying in a data center network. In this paper, we describe a large-scale data center network with a file d-threshold policy, which is to replicate each important file into at most d-1 other data centers such that this file can maintain in the data center network under a given level of data security in the long-term. To this end, we develop three relevant Markov processes to propose two effective methods for assessing the file lifetime and data security. By using the RG-factorizations, we show that the two methods are used to be able to more effectively evaluate the file lifetime of large-scale data center networks. We hope the methodology and results given in this paper are applicable in the file lifetime study of more general data center networks with replication mechanism.
Cyber Threat Intelligence : Challenges and Opportunities
Venue: arXiv cs.CR 2018
Year: 2018

The ever increasing number of cyber attacks requires the cyber security and forensic specialists to detect, analyze and defend against the cyber threats in almost realtime. In practice, timely dealing with such a large number of attacks is not possible without deeply perusing the attack features and taking corresponding intelligent defensive actions, this in essence defines cyber threat intelligence notion. However, such an intelligence would not be possible without the aid of artificial intelligence, machine learning and advanced data mining techniques to collect, analyse, and interpret cyber attack evidences. In this introductory chapter we first discuss the notion of cyber threat intelligence and its main challenges and opportunities, and then briefly introduce the chapters of the book which either address the identified challenges or present opportunistic solutions to provide threat intelligence.
Data-Flow Guided Slicing
Venue: arXiv cs.PL 2018
Year: 2018

We propose a flow-insensitive analysis that prunes out portions of code which are irrelevant to a specified set of data-flow paths. Our approach is fast and scalable, in addition to being able to generate a certificate as an audit for the computed result. We have implemented our technique in a tool called DSlicer and applied it to a set of 10600 real-world Android applications. Results are conclusive, we found out that the program code can be significantly reduced by 36% on average with respect to a specified set of data leak paths.
Detailed Human Avatars from Monocular Video
Venue: arXiv cs.CV 2018
Year: 2018

We present a novel method for high detail-preserving human avatar creation from monocular video. A parameterized body model is refined and optimized to maximally resemble subjects from a video showing them from all sides. Our avatars feature a natural face, hairstyle, clothes with garment wrinkles, and high-resolution texture. Our paper contributes facial landmark and shading-based human body shape refinement, a semantic texture prior, and a novel texture stitching strategy, resulting in the most sophisticated-looking human avatars obtained from a single video to date. Numerous results show the robustness and versatility of our method. A user study illustrates its superiority over the state-of-the-art in terms of identity preservation, level of detail, realism, and overall user preference.
Deep Learning-Based Multiple Object Visual Tracking on Embedded System for IoT and Mobile Edge Computing Applications
Venue: arXiv cs.CV 2018
Year: 2018

Compute and memory demands of state-of-the-art deep learning methods are still a shortcoming that must be addressed to make them useful at IoT end-nodes. In particular, recent results depict a hopeful prospect for image processing using Convolutional Neural Netwoks, CNNs, but the gap between software and hardware implementations is already considerable for IoT and mobile edge computing applications due to their high power consumption. This proposal performs low-power and real time deep learning-based multiple object visual tracking implemented on an NVIDIA Jetson TX2 development kit. It includes a camera and wireless connection capability and it is battery powered for mobile and outdoor applications. A collection of representative sequences captured with the on-board camera, dETRUSC video dataset, is used to exemplify the performance of the proposed algorithm and to facilitate benchmarking. The results in terms of power consumption and frame rate demonstrate the feasibility of deep learning algorithms on embedded platforms although more effort to joint algorithm and hardware design of CNNs is needed.
Predicting Expressive Speaking Style From Text In End-To-End Speech Synthesis
Venue: arXiv cs.CL 2018
Year: 2018

Global Style Tokens (GSTs) are a recently-proposed method to learn latent disentangled representations of high-dimensional data. GSTs can be used within Tacotron, a state-of-the-art end-to-end text-to-speech synthesis system, to uncover expressive factors of variation in speaking style. In this work, we introduce the Text-Predicted Global Style Token (TP-GST) architecture, which treats GST combination weights or style embeddings as "virtual" speaking style labels within Tacotron. TP-GST learns to predict stylistic renderings from text alone, requiring neither explicit labels during training nor auxiliary inputs for inference. We show that, when trained on a dataset of expressive speech, our system generates audio with more pitch and energy variation than two state-of-the-art baseline models. We further demonstrate that TP-GSTs can synthesize speech with background noise removed, and corroborate these analyses with positive results on human-rated listener preference audiobook tasks. Finally, we demonstrate that multi-speaker TP-GST models successfully factorize speaker identity and speaking style. We provide a website with audio samples for each of our findings.
Average Consensus by Graph Filtering: New Approach, Explicit Convergence Rate and Optimal Design
Venue: arXiv cs.SY 2018
Year: 2018

This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. Describing a consensus protocol as a graph spectrum filter, we present an effective new approach to the analysis and design of consensus protocols in the graph spectrum domain for the uncertain networks, which are difficult to handle by the existing time-domain methods. This novel approach has led to the following new results in this paper: 1) New necessary and sufficient conditions for both finite-time and asymptotic average consensus of multi-agent systems. 2) Direct link between the consensus convergence rate and the periodic consensus protocols. 3) Conversion of the fast consensus problem to the problem of polynomial design of graph spectrum filter. 4) A Lagrange polynomial interpolation method and a worst-case optimal interpolation method for the design of periodic consensus protocols for the MASs on uncertain graphs. 5) Explicit formulas for the convergence rate of the designed protocols. Several numerical examples are given to demonstrate the validity, effectiveness and advantages of these results.
Abstractive Summarization Improved by WordNet-based Extractive Sentences
Venue: arXiv cs.CL 2018
Year: 2018

Recently, the seq2seq abstractive summarization models have achieved good results on the CNN/Daily Mail dataset. Still, how to improve abstractive methods with extractive methods is a good research direction, since extractive methods have their potentials of exploiting various efficient features for extracting important sentences in one text. In this paper, in order to improve the semantic relevance of abstractive summaries, we adopt the WordNet based sentence ranking algorithm to extract the sentences which are most semantically to one text. Then, we design a dual attentional seq2seq framework to generate summaries with consideration of the extracted information. At the same time, we combine pointer-generator and coverage mechanisms to solve the problems of out-of-vocabulary (OOV) words and duplicate words which exist in the abstractive models. Experiments on the CNN/Daily Mail dataset show that our models achieve competitive performance with the state-of-the-art ROUGE scores. Human evaluations also show that the summaries generated by our models have high semantic relevance to the original text.
Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case
Venue: arXiv cs.GT 2018
Year: 2018

The search problem of computing a \textit{leader-follower equilibrium} has been widely investigated in the scientific literature in, almost exclusively, the single-follower setting. Although the \textit{optimistic} and \ textit{pessimistic} versions of the problem are solved with different methodologies, both cases allow for efficient, polynomial-time algorithms based on linear programming. The situation is different with multiple followers, where results are only sporadic and depend strictly on the nature of the followers' game. In this paper, we investigate the setting of a normal-form game with a single leader and multiple followers who, after observing the leader's commitment, play a Nash equilibrium. The corresponding search problem, both in the optimistic and pessimistic versions, is known to be not in Poly-$\textsf{APX}$ unless $\textsf{P}=\textsf{NP}$ and exact algorithms are known only for the optimistic case. We focus on the case where the followers play in pure strategies under the assumption of pessimism. After casting this search problem as a \italic{pessimistic bilevel programming problem}, we show that, with two followers, the problem is $\textsf{NP}$-hard and, with three or more followers, it is not in Poly-$\textsf{APX}$ unless $\textsf{P}=\textsf{NP}$. We propose a single-level mathematical programming reformulation which calls for the maximisation of a nonconcave quadratic function over an unbounded nonconvex feasible region defined by linear and quadratic constraints. Since, due to admitting a supremum but not a maximum, only a restricted version of this formulation can be solved to optimality with state-of-the-art methods, we propose an exact \textit{ad hoc} algorithm, which we also embed within a branch-and-bound scheme, capable of computing the supremum of the problem.
Traits & Transferability of Adversarial Examples against Instance Segmentation & Object Detection
Venue: arXiv cs.CV 2018
Year: 2018

Despite the recent advancements in deploying neural networks for image classification, it has been found that adversarial examples are able to fool these models leading them to misclassify the images. Since these models are now being widely deployed, we provide an insight on the threat of these adversarial examples by evaluating their characteristics and transferability to more complex models that utilize Image Classification as a subtask. We demonstrate the ineffectiveness of adversarial examples when applied to Instance Segmentation & Object Detection models. We show that this ineffectiveness arises from the inability of adversarial examples to withstand transformations such as scaling or a change in lighting conditions. Moreover, we show that there exists a small threshold below which the adversarial property is retained while applying these input transformations. Additionally, these attacks demonstrate weak cross-network transferability across neural network architectures, e.g. VGG16 and ResNet50, however, the attack may fool both the networks if passed sequentially through networks during its formation. The lack of scalability and transferability challenges the question of how adversarial images would be effective in the real world.
Evaluating Wikipedia as a source of information for disease understanding
Venue: arXiv cs.IR 2018
Year: 2018

The increasing availability of biological data is improving our understanding of diseases and providing new insight into their underlying relationships. Thanks to the improvements on both text mining techniques and computational capacity, the combination of biological data with semantic information obtained from medical publications has proven to be a very promising path. However, the limitations in the access to these data and their lack of structure pose challenges to this approach. In this document we propose the use of Wikipedia - the free online encyclopedia - as a source of accessible textual information for disease understanding research. To check its validity, we compare its performance in the determination of relationships between diseases with that of PubMed, one of the most consulted data sources of medical texts. The obtained results suggest that the information extracted from Wikipedia is as relevant as that obtained from PubMed abstracts (i.e. the free access portion of its articles), although further research is proposed to verify its reliability for medical studies.