OpenRaiser/Intern-Atlas huggingface dataset:
Classification of radiology reports by modality and anatomy: A comparative study
Venue: arXiv cs.LG 2018
Year: 2018

Data labeling is currently a time-consuming task that often requires expert knowledge. In research settings, the availability of correctly labeled data is crucial to ensure that model predictions are accurate and useful. We propose relatively simple machine learning-based models that achieve high performance metrics in the binary and multiclass classification of radiology reports. We compare the performance of these algorithms to that of a data-driven approach based on NLP, and find that the logistic regression classifier outperforms all other models, in both the binary and multiclass classification tasks. We then choose the logistic regression binary classifier to predict chest X-ray (CXR)/ non-chest X-ray (non-CXR) labels in reports from different datasets, unseen during any training phase of any of the models. Even in unseen report collections, the binary logistic regression classifier achieves average precision values of above 0.9. Based on the regression coefficient values, we also identify frequent tokens in CXR and non-CXR reports that are features with possibly high predictive power.
A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach
Venue: arXiv cs.AI 2018
Year: 2018

In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal solvers were introduced in the past decade - two prominent categories of solvers can be distinguished: search-based solvers and compilation-based solvers. Search-based solvers were developed and tested for the sum-of-costs objective while the most prominent compilation-based solvers that are built around Boolean satisfiability (SAT) were designed for the makespan objective. Very little was known on the performance and relevance of the compilation-based approach on the sum-of-costs objective. In this paper we show how to close the gap between these cost functions in the compilation-based approach. Moreover we study applicability of various techniques developed for search-based solvers in the compilation-based approach. A part of this paper introduces a SAT-solver that is directly aimed to solve the sum-of-costs objective function. Using both a lower bound on the sum-of-costs and an upper bound on the makespan, we are able to have a reasonable number of variables in our SAT encoding. We then further improve the encoding by borrowing ideas from ICTS, a search-based solver. Experimental evaluation on several domains show that there are many scenarios where our new SAT-based methods outperforms the best variants of previous sum-of-costs search solvers - the ICTS, CBS algorithms, and ICBS algorithms.
Signal Classification under structure sparsity constraints
Venue: arXiv cs.CV 2018
Year: 2018

Object Classification is a key direction of research in signal and image processing, computer vision and artificial intelligence. The goal is to come up with algorithms that automatically analyze images and put them in predefined categories. This dissertation focuses on the theory and application of sparse signal processing and learning algorithms for image processing and computer vision, especially object classification problems. A key emphasis of this work is to formulate novel optimization problems for learning dictionary and structured sparse representations. Tractable solutions are proposed subsequently for the corresponding optimization problems. An important goal of this dissertation is to demonstrate the wide applications of these algorithmic tools for real-world applications. To that end, we explored important problems in the areas of: 1. Medical imaging: histopathological images acquired from mammalian tissues, human breast tissues, and human brain tissues. 2. Low-frequency (UHF to L-band) ultra-wideband (UWB) synthetic aperture radar: detecting bombs and mines buried under rough surfaces. 3. General object classification: face, flowers, objects, dogs, indoor scenes, etc.
Improving the Interpretability of Deep Neural Networks with Knowledge Distillation
Venue: arXiv cs.LG 2018
Year: 2018

Deep Neural Networks have achieved huge success at a wide spectrum of applications from language modeling, computer vision to speech recognition. However, nowadays, good performance alone is not sufficient to satisfy the needs of practical deployment where interpretability is demanded for cases involving ethics and mission critical applications. The complex models of Deep Neural Networks make it hard to understand and reason the predictions, which hinders its further progress. To tackle this problem, we apply the Knowledge Distillation technique to distill Deep Neural Networks into decision trees in order to attain good performance and interpretability simultaneously. We formulate the problem at hand as a multi-output regression problem and the experiments demonstrate that the student model achieves significantly better accuracy performance (about 1\% to 5\%) than vanilla decision trees at the same level of tree depth. The experiments are implemented on the TensorFlow platform to make it scalable to big datasets. To the best of our knowledge, we are the first to distill Deep Neural Networks into vanilla decision trees on multi-class datasets.
A Precedent Approach to Assigning Access Rights
Venue: arXiv cs.CR 2018
Year: 2018

To design a discretionary access control policy, a technique is proposed that uses the principle of analogies and is based on both the properties of objects and the properties of subjects. As attributes characterizing these properties, the values of the security attributes of subjects and objects are chosen. The concept of precedent is defined as an access rule explicitly specified by the security administrator. The problem of interpolation of the access matrix is formulated: the security administrator defines a sequence of precedents, it is required to automate the process of filling the remaining cells of the access matrix. On the family of sets of security attributes, a linear order is introduced. The principles of filling the access matrix on the basis of analogy with the dominant precedent in accordance with a given order relation are developed. The analysis of the proposed methodology is performed and its main advantages are revealed.
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks
Venue: arXiv cs.DM 2018
Year: 2018

In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers $w$ as reducible permutation flow-graphs $F[π^*]$ through the use of self-inverting permutations $π^*$. Following up on our proposed methods, we theoretically study the oldest one, which we call W-RPG, in order to investigate and prove its resilience to edge-modification attacks on the flow-graphs $F[π^*]$. In particular, we characterize the integer $w\equivπ^*$ as strong or weak watermark through the structure of self-inverting permutations $π^*$ which encodes it. To this end, for any integer watermark $w \in R_n=[2^{n-1}, 2^n-1]$, where $n$ is the length of the binary representation $b(w)$ of $w$, we compute the minimum number of 01-modifications needed to be applied on $b(w)$ so that the resulting $b(w')$ represents the valid watermark number $w'$; note that a number $w'$ is called valid (or, true-incorrect watermark number) if $w'$ can be produced by the W-RPG codec system and, thus, it incorporates all the structural properties of $π^* \equiv w$.
Towards a constructive formalization of Perfect Graph Theorems
Venue: arXiv cs.LO 2018
Year: 2018

Interaction between clique number $ω(G) $ and chromatic number $χ(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called \emph{perfect} if $χ(H)=ω(H)$ for every induced subgraph $H$ of $G$. The Strong Perfect Graph Theorem (SPGT) states that a graph is perfect if and only if it does not contain an odd hole (or an odd anti-hole) as its induced subgraph. The Weak Perfect Graph Theorem (WPGT) states that a graph is perfect if and only if its complement is perfect. In this paper, we present a formal framework for verifying these results. We model finite simple graphs in the constructive type theory of Coq Proof Assistant without adding any axiom to it. Finally, we use this framework to present a constructive proof of the Lovász Replication Lemma, which is the central idea in the proof of Weak Perfect Graph Theorem.
Artistic Object Recognition by Unsupervised Style Adaptation
Venue: arXiv cs.CV 2018
Year: 2018

Computer vision systems currently lack the ability to reliably recognize artistically rendered objects, especially when such data is limited. In this paper, we propose a method for recognizing objects in artistic modalities (such as paintings, cartoons, or sketches), without requiring any labeled data from those modalities. Our method explicitly accounts for stylistic domain shifts between and within domains. To do so, we introduce a complementary training modality constructed to be similar in artistic style to the target domain, and enforce that the network learns features that are invariant between the two training modalities. We show how such artificial labeled source domains can be generated automatically through the use of style transfer techniques, using diverse target images to represent the style in the target domain. Unlike existing methods which require a large amount of unlabeled target data, our method can work with as few as ten unlabeled images. We evaluate it on a number of cross-domain object and scene classification tasks and on a new dataset we release. Our experiments show that our approach, though conceptually simple, significantly improves the accuracy that existing domain adaptation techniques obtain for artistic object recognition.
The Diagrammatic AI Language (DIAL): Version 0.1
Venue: arXiv cs.AI 2018
Year: 2018

Currently, there is no consistent model for visually or formally representing the architecture of AI systems. This lack of representation brings interpretability, correctness and completeness challenges in the description of existing models and systems. DIAL (The Diagrammatic AI Language) has been created with the aspiration of being an "engineering schematic" for AI Systems. It is presented here as a starting point for a community dialogue towards a common diagrammatic language for AI Systems.
CamLoc: Pedestrian Location Detection from Pose Estimation on Resource-constrained Smart-cameras
Venue: arXiv cs.CV 2018
Year: 2018

Recent advancements in energy-efficient hardware technology is driving the exponential growth we are experiencing in the Internet of Things (IoT) space, with more pervasive computations being performed near to data generation sources. A range of intelligent devices and applications performing local detection is emerging (activity recognition, fitness monitoring, etc.) bringing with them obvious advantages such as reducing detection latency for improved interaction with devices and safeguarding user data by not leaving the device. Video processing holds utility for many emerging applications and data labelling in the IoT space. However, performing this video processing with deep neural networks at the edge of the Internet is not trivial. In this paper we show that pedestrian location estimation using deep neural networks is achievable on fixed cameras with limited compute resources. Our approach uses pose estimation from key body points detection to extend pedestrian skeleton when whole body not in image (occluded by obstacles or partially outside of frame), which achieves better location estimation performance (infrence time and memory footprint) compared to fitting a bounding box over pedestrian and scaling. We collect a sizable dataset comprising of over 2100 frames in videos from one and two surveillance cameras pointing from different angles at the scene, and annotate each frame with the exact position of person in image, in 42 different scenarios of activity and occlusion. We compare our pose estimation based location detection with a popular detection algorithm, YOLOv2, for overlapping bounding-box generation, our solution achieving faster inference time (15x speedup) at half the memory footprint, within resource capabilities on embedded devices, which demonstrate that CamLoc is an efficient solution for location estimation in videos on smart-cameras.
Annotation-cost Minimization for Medical Image Segmentation using Suggestive Mixed Supervision Fully Convolutional Networks
Venue: arXiv cs.CV 2018
Year: 2018

For medical image segmentation, most fully convolutional networks (FCNs) need strong supervision through a large sample of high-quality dense segmentations, which is taxing in terms of costs, time and logistics involved. This burden of annotation can be alleviated by exploiting weak inexpensive annotations such as bounding boxes and anatomical landmarks. However, it is very difficult to \textit{a priori} estimate the optimal balance between the number of annotations needed for each supervision type that leads to maximum performance with the least annotation cost. To optimize this cost-performance trade off, we present a budget-based cost-minimization framework in a mixed-supervision setting via dense segmentations, bounding boxes, and landmarks. We propose a linear programming (LP) formulation combined with uncertainty and similarity based ranking strategy to judiciously select samples to be annotated next for optimal performance. In the results section, we show that our proposed method achieves comparable performance to state-of-the-art approaches with significantly reduced cost of annotations.
Feature Preserving and Uniformity-controllable Point Cloud Simplification on Graph
Venue: arXiv cs.CV 2018
Year: 2018

With the development of 3D sensing technologies, point clouds have attracted increasing attention in a variety of applications for 3D object representation, such as autonomous driving, 3D immersive tele-presence and heritage reconstruction. However, it is challenging to process large-scale point clouds in terms of both computation time and storage due to the tremendous amounts of data. Hence, we propose a point cloud simplification algorithm, aiming to strike a balance between preserving sharp features and keeping uniform density during resampling. In particular, leveraging on graph spectral processing, we represent irregular point clouds naturally on graphs, and propose concise formulations of feature preservation and density uniformity based on graph filters. The problem of point cloud simplification is finally formulated as a trade-off between the two factors and efficiently solved by our proposed algorithm. Experimental results demonstrate the superiority of our method, as well as its efficient application in point cloud registration.
Boosting Fronthaul Capacity: Global Optimization of Power Sharing for Centralized Radio Access Network
Venue: arXiv cs.IT 2018
Year: 2018

The limited fronthaul capacity imposes a challenge on the uplink of centralized radio access network (C-RAN). We propose to boost the fronthaul capacity of massive multiple-input multiple-output (MIMO) aided C-RAN by globally optimizing the power sharing between channel estimation and data transmission both for the user devices (UDs) and the remote radio units (RRUs). Intuitively, allocating more power to the channel estimation will result in more accurate channel estimates, which increases the achievable throughput. However, increasing the power allocated to the pilot training will reduce the power assigned to data transmission, which reduces the achievable throughput. In order to optimize the powers allocated to the pilot training and to the data transmission of both the UDs and the RRUs, we assign an individual power sharing factor to each of them and derive an asymptotic closed-form expression of the signal-to-interference-plus-noise for the massive MIMO aided C-RAN consisting of both the UD-to-RRU links and the RRU-to-baseband unit (BBU) links. We then exploit the C-RAN architecture's central computing and control capability for jointly optimizing the UDs' power sharing factors and the RRUs' power sharing factors aiming for maximizing the fronthaul capacity. Our simulation results show that the fronthaul capacity is significantly boosted by the proposed global optimization of the power allocation between channel estimation and data transmission both for the UDs and for their host RRUs. As a specific example of 32 receive antennas (RAs) deployed by RRU and 128 RAs deployed by BBU, the sum-rate of 10 UDs achieved with the optimal power sharing factors improves 33\% compared with the one attained without optimizing power sharing factors.
Loss Aversion in Recommender Systems: Utilizing Negative User Preference to Improve Recommendation Quality
Venue: arXiv cs.IR 2018
Year: 2018

Negative user preference is an important context that is not sufficiently utilized by many existing recommender systems. This context is especially useful in scenarios where the cost of negative items is high for the users. In this work, we describe a new recommender algorithm that explicitly models negative user preferences in order to recommend more positive items at the top of recommendation-lists. We build upon existing machine-learning model to incorporate the contextual information provided by negative user preference. With experimental evaluations on two openly available datasets, we show that our method is able to improve recommendation quality: by improving accuracy and at the same time reducing the number of negative items at the top of recommendation-lists. Our work demonstrates the value of the contextual information provided by negative feedback, and can also be extended to signed social networks and link prediction in other networks.
Coordination and Control of Multiple Climbing Robots in Transport of Heavy Loads through Extreme Terrain
Venue: arXiv cs.RO 2018
Year: 2018

The discovery of ice deposits in the permanently shadowed craters of the lunar North and South Pole Moon presents an important opportunity for In-Situ Resource Utilization. These ice deposits maybe the source for sustaining a lunar base or for enabling an interplanetary refueling station. These ice deposits also preserve a unique record of the geology and environment of their hosts, both in terms of impact history and the supply of volatile compounds, and so are of immense scientific interest. To date, these ice deposits have been studied indirectly and by remote active radar, but they need to be analyzed in-situ by robotic systems that can study the depths of the deposits, their purity and composition. However, these shadowed craters never see sunlight and are one of the coldest places in the solar system. NASA JPL proposed use of solar reflectors mounted on crater rims to project sunlight into the crater depths for use by ground robots. The solar reflectors would heat the crater base and vehicles positioned at the base sufficiently to survive the cold-temperatures. Our approach analyzes part of the logistics of the approach, with teams of robots climbing up and down to the crater to access the ice deposits. The mission will require robots to climb down extreme environments and carry large structures, including instruments and communication devices.
Stability of Local Information based Centrality Measurements under Degree Preserving Randomizations
Venue: arXiv cs.SI 2018
Year: 2018

Node centrality is one of the integral measures in network analysis with wide range of applications from socio-economic to personalized recommendation. We argue that an effective centrality measure should undertake stability even under information loss or noise introduced in the network. With six local information based centrality metric, we investigate the effect of varying assortativity while keeping degree distribution unchanged, using networks with scale free and exponential degree distribution. This model provides a novel scope to analyze stability of centrality metric which can further finds many applications in social science, biology, information science, community detection and so on.
Universal network deployment model for universal connectivity
Venue: arXiv cs.NI 2018
Year: 2018

There is interest in the deployment of cable and other networking infrastructure for private use in public land, but the lack of clear guidelines to regulate deployment in public land can block authorization decisions, which can be controversial due to the consequences of the private ownership and use of a private infrastructure in public space. The guifi.net Foundation proposed a universal deployment model for municipalities, where new deployments by a private requester are allowed as long it provides paths that simultaneously allow for three uses: self-service for the city council, private for the requester, and shared or common use for everyone else. The principle can be extended to apply to any other regional or even international infrastructure deployed in non-private land, although the proportion of resources for each uses can be adjusted. The effect of this model is that the deployment of private infrastructures generate a direct return as infrastructure for shared use by everyone can contribute to deliver universal connectivity.
A New Deflation Method For Verifying the Isolated Singular Zeros of Polynomial Systems
Venue: arXiv cs.SC 2018
Year: 2018

In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input polynomials directly or the linear combinations of the related polynomials, we construct a new system, which can be used to refine or verify the isolated singular zero of the input system. In order to preserve the accuracy in numerical computation as much as possible, new variables are introduced to represent the coefficients of the linear combinations of the related polynomials. To our knowledge, it is the first time that considering the deflation problem of polynomial systems from the perspective of the linear combination. Some acceleration strategies are proposed to reduce the scale of the final system. We also give some further analysis of the tolerances we use, which can help us have a better understanding of our method.The experiments show that our method is effective and efficient. Especially, it works well for zeros with high multiplicities of large systems. It also works for isolated singular zeros of non-polynomial systems.
Visibly Pushdown Languages over Sliding Windows
Venue: arXiv cs.FL 2018
Year: 2018

We investigate the class of visibly pushdown languages in the sliding window model. A sliding window algorithm for a language $L$ receives a stream of symbols and has to decide at each time step whether the suffix of length $n$ belongs to $L$ or not. The window size $n$ is either a fixed number (in the fixed-size model) or can be controlled by an adversary in a limited way (in the variable-size model). The main result of this paper states that for every visibly pushdown language the space complexity in the variable-size sliding window model is either constant, logarithmic or linear in the window size. This extends previous results for regular languages.