OpenRaiser/Intern-Atlas huggingface dataset:
A Streamline Selection Technique Overlaying with Isosurfaces
Venue: arXiv cs.GR 2017
Year: 2017

Integration of scalar and vector visualization has been an interesting topic. This paper presents a technique to appropriately select and display multiple streamlines while overlaying with isosurfaces, aiming an integrated scalar and vector field visualization. The technique visualizes a scalar field by multiple semitransparent isosurfaces, and a vector field by multiple streamlines, while the technique adequately selects the streamlines considering reduction of cluttering among the isosurfaces and streamlines. The technique first selects and renders isosurfaces, and then generates large number of streamlines from randomly selected seed points. The technique evaluates each of the streamlines according to their shapes on a 2D display space, distances to critical points of the given vector fields, and occlusion by isosurfaces. It then selects the specified number of highly evaluated streamlines. As a result, we can visualize both scalar and vector fields as a set of view-independently selected isosurfaces and view-dependently selected streamlines.
Do Neural Nets Learn Statistical Laws behind Natural Language?
Venue: arXiv cs.CL 2017
Year: 2017

The performance of deep learning in natural language processing has been spectacular, but the reasons for this success remain unclear because of the inherent complexity of deep learning. This paper provides empirical evidence of its effectiveness and of a limitation of neural networks for language engineering. Precisely, we demonstrate that a neural language model based on long short-term memory (LSTM) effectively reproduces Zipf's law and Heaps' law, two representative statistical properties underlying natural language. We discuss the quality of reproducibility and the emergence of Zipf's law and Heaps' law as training progresses. We also point out that the neural language model has a limitation in reproducing long-range correlation, another statistical property of natural language. This understanding could provide a direction for improving the architectures of neural networks.
A secure approach for embedding message text on an elliptic curve defined over prime fields, and building 'EC-RSA-ELGamal' Cryptographic System
Venue: arXiv cs.CR 2017
Year: 2017

This paper presents a new probabilistic approach to embedding message text on an elliptic curve, by using the concept of the RSA Algorithm and its security, and such approach allows us discovering the message from the point, only according to the security of the RSA Algorithm. By mixing between the concept of this approach and the concept of EC-ELGamal Cryptographic System, we have built a cryptographic System and we named it 'EC-RSA-ELGamal'
Expected exponential loss for gaze-based video and volume ground truth annotation
Venue: arXiv cs.CV 2017
Year: 2017

Many recent machine learning approaches used in medical imaging are highly reliant on large amounts of image and ground truth data. In the context of object segmentation, pixel-wise annotations are extremely expensive to collect, especially in video and 3D volumes. To reduce this annotation burden, we propose a novel framework to allow annotators to simply observe the object to segment and record where they have looked at with a \$200 eye gaze tracker. Our method then estimates pixel-wise probabilities for the presence of the object throughout the sequence from which we train a classifier in semi-supervised setting using a novel Expected Exponential loss function. We show that our framework provides superior performances on a wide range of medical image settings compared to existing strategies and that our method can be combined with current crowd-sourcing paradigms as well.
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems
Venue: arXiv cs.DS 2017
Year: 2017

For a family of graphs $\cal F$, the canonical Weighted $\cal F$ Vertex Deletion problem is defined as follows: given an $n$-vertex undirected graph $G$ and a weight function $w: V(G)\rightarrow\mathbb{R}$, find a minimum weight subset $S\subseteq V(G)$ such that $G-S$ belongs to $\cal F$. We devise a recursive scheme to obtain $O(\log^{O(1)}n)$-approximation algorithms for such problems, building upon the classic technique of finding balanced separators in a graph. Roughly speaking, our scheme applies to problems where an optimum solution $S$, together with a well-structured set $X$, form a balanced separator of $G$. We obtain the first $O(\log^{O(1)}n)$-approximation algorithms for the following problems. * We give an $O(\log^2n)$-factor approximation algorithm for Weighted Chordal Vertex Deletion (WCVD), the vertex deletion problem to the family of chordal graphs. On the way, we also obtain a constant factor approximation algorithm for Multicut on chordal graphs. * We give an $O(\log^3n)$-factor approximation algorithm for Weighted Distance Hereditary Vertex Deletion (WDHVD). This is the vertex deletion problem to the family of distance hereditary graphs, or equivalently, the family of graphs of rankwidth 1. Our methods also allow us to obtain in a clean fashion a $O(\log^{1.5}n)$-approximation algorithm for the Weighted $\cal F$ Vertex Deletion problem when $\cal F$ is a minor closed family excluding at least one planar graph. For the unweighted version of the problem constant factor approximation algorithms are were known~[Fomin et al., FOCS~2012], while for the weighted version considered here an $O(\log n \log\log n)$-approximation algorithm follows from~[Bansal et al., SODA~2017]. We believe that our recursive scheme can be applied to obtain $O(\log^{O(1)}n)$-approximation algorithms for many other problems as well.
Improving Deep Pancreas Segmentation in CT and MRI Images via Recurrent Neural Contextual Learning and Direct Loss Function
Venue: arXiv cs.CV 2017
Year: 2017

Deep neural networks have demonstrated very promising performance on accurate segmentation of challenging organs (e.g., pancreas) in abdominal CT and MRI scans. The current deep learning approaches conduct pancreas segmentation by processing sequences of 2D image slices independently through deep, dense per-pixel masking for each image, without explicitly enforcing spatial consistency constraint on segmentation of successive slices. We propose a new convolutional/recurrent neural network architecture to address the contextual learning and segmentation consistency problem. A deep convolutional sub-network is first designed and pre-trained from scratch. The output layer of this network module is then connected to recurrent layers and can be fine-tuned for contextual learning, in an end-to-end manner. Our recurrent sub-network is a type of Long short-term memory (LSTM) network that performs segmentation on an image by integrating its neighboring slice segmentation predictions, in the form of a dependent sequence processing. Additionally, a novel segmentation-direct loss function (named Jaccard Loss) is proposed and deep networks are trained to optimize Jaccard Index (JI) directly. Extensive experiments are conducted to validate our proposed deep models, on quantitative pancreas segmentation using both CT and MRI scans. Our method outperforms the state-of-the-art work on CT [11] and MRI pancreas segmentation [1], respectively.
End-to-End Information Extraction without Token-Level Supervision
Venue: arXiv cs.CL 2017
Year: 2017

Most state-of-the-art information extraction approaches rely on token-level labels to find the areas of interest in text. Unfortunately, these labels are time-consuming and costly to create, and consequently, not available for many real-life IE tasks. To make matters worse, token-level labels are usually not the desired output, but just an intermediary step. End-to-end (E2E) models, which take raw text as input and produce the desired output directly, need not depend on token-level labels. We propose an E2E model based on pointer networks, which can be trained directly on pairs of raw input and output text. We evaluate our model on the ATIS data set, MIT restaurant corpus and the MIT movie corpus and compare to neural baselines that do use token-level labels. We achieve competitive results, within a few percentage points of the baselines, showing the feasibility of E2E information extraction without the need for token-level labels. This opens up new possibilities, as for many tasks currently addressed by human extractors, raw input and output data are available, but not token-level labels.
Multi-label Music Genre Classification from Audio, Text, and Images Using Deep Features
Venue: arXiv cs.IR 2017
Year: 2017

Music genres allow to categorize musical items that share common characteristics. Although these categories are not mutually exclusive, most related research is traditionally focused on classifying tracks into a single class. Furthermore, these categories (e.g., Pop, Rock) tend to be too broad for certain applications. In this work we aim to expand this task by categorizing musical items into multiple and fine-grained labels, using three different data modalities: audio, text, and images. To this end we present MuMu, a new dataset of more than 31k albums classified into 250 genre classes. For every album we have collected the cover image, text reviews, and audio tracks. Additionally, we propose an approach for multi-label genre classification based on the combination of feature embeddings learned with state-of-the-art deep learning methodologies. Experiments show major differences between modalities, which not only introduce new baselines for multi-label genre classification, but also suggest that combining them yields improved results.
Artificial Error Generation with Machine Translation and Syntactic Patterns
Venue: arXiv cs.CL 2017
Year: 2017

Shortage of available training data is holding back progress in the area of automated error detection. This paper investigates two alternative methods for artificially generating writing errors, in order to create additional resources. We propose treating error generation as a machine translation task, where grammatically correct text is translated to contain errors. In addition, we explore a system for extracting textual patterns from an annotated corpus, which can then be used to insert errors into grammatically correct sentences. Our experiments show that the inclusion of artificially generated errors significantly improves error detection accuracy on both FCE and CoNLL 2014 datasets.
Explainable Entity-based Recommendations with Knowledge Graphs
Venue: arXiv cs.IR 2017
Year: 2017

Explainable recommendation is an important task. Many methods have been proposed which generate explanations from the content and reviews written for items. When review text is unavailable, generating explanations is still a hard problem. In this paper, we illustrate how explanations can be generated in such a scenario by leveraging external knowledge in the form of knowledge graphs. Our method jointly ranks items and knowledge graph entities using a Personalized PageRank procedure to produce recommendations together with their explanations.
Ethics of autonomous information systems towards an artificial thinking
Venue: arXiv cs.OH 2017
Year: 2017

Many projects relies on cognitives sciences, neurosciences, computer sciences and robotics. They concerned today the building of autonomous artificial beings able to think. This paper shows a model to compare the human thinking with an hypothetic numerical way of thinking based on four hierarchies : the information system classification, the cognitive pyramid, the linguistic pyramid and the digital information hierarchy. After a state of art on the nature of human thinking, feasibility of autonomous multi-agent systems provided with artificial consciousness which are able to think is discussed. The ethical aspects and consequences for humanity of such systems is evaluated. These systems lead the scientific community to react.
Learn More, Pay Less! Lessons Learned from Applying the Wizard-of-Oz Technique for Exploring Mobile App Requirements
Venue: arXiv cs.SE 2017
Year: 2017

Mobile apps have exploded in popularity, encouraging developers to provide content to the massive user base of the main app stores. Although there exist automated techniques that can classify user comments into various topics with high levels of precision, recent studies have shown that the top apps in the app stores do not have customer ratings that directly correlate with the app's success. This implies that no single requirements elicitation technique can cover the full depth required to produce a successful product and that applying alternative requirements gathering techniques can lead to success when these two are combined. Since user involvement has been found to be the most impactful contribution to project success, in this paper we will explore how the Wizard of Oz (WOz) technique and user reviews available in Google Play, can be integrated to produce a product that meets the demand of more stakeholders than either method alone. To compare the role of early interactive requirements specification and app reviews, we conducted two studies (i) a case study analysis on 13 mobile app development teams who used very early stages Requirements Engineering (RE) by applying WOz, and (ii) a study analyzing 40 (70, 592 reviews) similar mobile apps on Google Play. The results of both studies show that while each of WOz and app review analysis techniques can be applied to capture specific types of requirements, an integrated process including both methods would eliminate the communication gap between users and developers at early stages of the development process and mitigates the risk of requirements change in later stages.
MAG: A Multilingual, Knowledge-base Agnostic and Deterministic Entity Linking Approach
Venue: arXiv cs.CL 2017
Year: 2017

Entity linking has recently been the subject of a significant body of research. Currently, the best performing approaches rely on trained mono-lingual models. Porting these approaches to other languages is consequently a difficult endeavor as it requires corresponding training data and retraining of the models. We address this drawback by presenting a novel multilingual, knowledge-based agnostic and deterministic approach to entity linking, dubbed MAG. MAG is based on a combination of context-based retrieval on structured knowledge bases and graph algorithms. We evaluate MAG on 23 data sets and in 7 languages. Our results show that the best approach trained on English datasets (PBOH) achieves a micro F-measure that is up to 4 times worse on datasets in other languages. MAG, on the other hand, achieves state-of-the-art performance on English datasets and reaches a micro F-measure that is up to 0.6 higher than that of PBOH on non-English languages.
Aggressive Deep Driving: Model Predictive Control with a CNN Cost Model
Venue: arXiv cs.RO 2017
Year: 2017

We present a framework for vision-based model predictive control (MPC) for the task of aggressive, high-speed autonomous driving. Our approach uses deep convolutional neural networks to predict cost functions from input video which are directly suitable for online trajectory optimization with MPC. We demonstrate the method in a high speed autonomous driving scenario, where we use a single monocular camera and a deep convolutional neural network to predict a cost map of the track in front of the vehicle. Results are demonstrated on a 1:5 scale autonomous vehicle given the task of high speed, aggressive driving.
Knowledge will Propel Machine Understanding of Content: Extrapolating from Current Examples
Venue: arXiv cs.AI 2017
Year: 2017

Machine Learning has been a big success story during the AI resurgence. One particular stand out success relates to learning from a massive amount of data. In spite of early assertions of the unreasonable effectiveness of data, there is increasing recognition for utilizing knowledge whenever it is available or can be created purposefully. In this paper, we discuss the indispensable role of knowledge for deeper understanding of content where (i) large amounts of training data are unavailable, (ii) the objects to be recognized are complex, (e.g., implicit entities and highly subjective content), and (iii) applications need to use complementary or related data in multiple modalities/media. What brings us to the cusp of rapid progress is our ability to (a) create relevant and reliable knowledge and (b) carefully exploit knowledge to enhance ML/NLP techniques. Using diverse examples, we seek to foretell unprecedented progress in our ability for deeper understanding and exploitation of multimodal data and continued incorporation of knowledge in learning techniques.
Show and Recall: Learning What Makes Videos Memorable
Venue: arXiv cs.CV 2017
Year: 2017

With the explosion of video content on the Internet, there is a need for research on methods for video analysis which take human cognition into account. One such cognitive measure is memorability, or the ability to recall visual content after watching it. Prior research has looked into image memorability and shown that it is intrinsic to visual content, but the problem of modeling video memorability has not been addressed sufficiently. In this work, we develop a prediction model for video memorability, including complexities of video content in it. Detailed feature analysis reveals that the proposed method correlates well with existing findings on memorability. We also describe a novel experiment of predicting video sub-shot memorability and show that our approach improves over current memorability methods in this task. Experiments on standard datasets demonstrate that the proposed metric can achieve results on par or better than the state-of-the art methods for video summarization.
Multi-Element VLC Networks: LED Assignment, Power Control, and Optimum Combining
Venue: arXiv cs.IT 2017
Year: 2017

Visible light communications (VLC) is a promising technology to address the spectrum crunch problem in radio frequency (RF) networks. A major advantage of VLC networks is that they can use the existing lighting infrastructure in indoor environments, which may have large number of LEDs for illumination. While LEDs used for lighting typically have limited bandwidth, presence of many LEDs can be exploited for indoor VLC networks, to serve each user by multiple LEDs for improving link quality and throughput. In this paper, LEDs are grouped and assigned to the users based on received signal strength from each LED, for which different solutions are proposed to achieve maximum throughput, proportional fairness and quality of service (QoS). Additionally, power optimization of LEDs for a given assignment is investigated, and Jacobian and Hessian matrices of the corresponding optimization problem are derived. Moreover, for multi-element receivers with LED grouping at the transmitter, an improved optimal combining method is proposed. This method suppresses interference caused by simultaneous data transfer of LEDs and improves the overall signal-to-interference-plus-noise-ratio (SINR) by 2 dB to 5 dB. Lastly, an efficient calculation of channel response is presented to simulate multipath VLC channel with low computational complexity.
An Information Theoretic Measure for Robot Expressivity
Venue: arXiv cs.RO 2017
Year: 2017

This paper presents a principled way to think about articulated movement for artificial agents and a measurement of platforms that produce such movement. In particular, in human-facing scenarios, the shape evolution of robotic platforms will become essential in creating systems that integrate and communicate with human counterparts. This paper provides a tool to measure the expressive capacity or expressivity of articulated platforms. To do this, it points to the synergistic relationship between computation and mechanization. Importantly, this way of thinking gives an information theoretic basis for measuring and comparing robots of increasing complexity and capability. The paper will provide concrete examples of this measure in application to current robotic platforms. It will also provide a comparison between the computational and mechanical capabilities of robotic platforms and analyze order-of-magnitude trends over the last 15 years. Implications for future work made by the paper are to provide a method by which to quantify movement imitation, outline a way of thinking about designing expressive robotic systems, and contextualize the capabilities of current robotic systems.
Genetic Algorithm for Epidemic Mitigation by Removing Relationships
Venue: arXiv cs.SI 2017
Year: 2017

Min-SEIS-Cluster is an optimization problem which aims at minimizing the infection spreading in networks. In this problem, nodes can be susceptible to an infection, exposed to an infection, or infectious. One of the main features of this problem is the fact that nodes have different dynamics when interacting with other nodes from the same community. Thus, the problem is characterized by distinct probabilities of infecting nodes from both the same and from different communities. This paper presents a new genetic algorithm that solves the Min-SEIS-Cluster problem. This genetic algorithm surpassed the current heuristic of this problem significantly, reducing the number of infected nodes during the simulation of the epidemics. The results therefore suggest that our new genetic algorithm is the state-of-the-art heuristic to solve this problem.
Make Your Bone Great Again : A study on Osteoporosis Classification
Venue: arXiv cs.CV 2017
Year: 2017

Osteoporosis can be identified by looking at 2D x-ray images of the bone. The high degree of similarity between images of a healthy bone and a diseased one makes classification a challenge. A good bone texture characterization technique is essential for identifying osteoporosis cases. Standard texture feature extraction techniques like Local Binary Pattern (LBP), Gray Level Co-occurrence Matrix (GLCM) have been used for this purpose. In this paper, we draw a comparison between deep features extracted from convolution neural network against these traditional features. Our results show that deep features have more discriminative power as classifiers trained on them always outperform the ones trained on traditional features.
Visually Aligned Word Embeddings for Improving Zero-shot Learning
Venue: arXiv cs.CV 2017
Year: 2017

Zero-shot learning (ZSL) highly depends on a good semantic embedding to connect the seen and unseen classes. Recently, distributed word embeddings (DWE) pre-trained from large text corpus have become a popular choice to draw such a connection. Compared with human defined attributes, DWEs are more scalable and easier to obtain. However, they are designed to reflect semantic similarity rather than visual similarity and thus using them in ZSL often leads to inferior performance. To overcome this visual-semantic discrepancy, this work proposes an objective function to re-align the distributed word embeddings with visual information by learning a neural network to map it into a new representation called visually aligned word embedding (VAWE). Thus the neighbourhood structure of VAWEs becomes similar to that in the visual domain. Note that in this work we do not design a ZSL method that projects the visual features and semantic embeddings onto a shared space but just impose a requirement on the structure of the mapped word embeddings. This strategy allows the learned VAWE to generalize to various ZSL methods and visual features. As evaluated via four state-of-the-art ZSL methods on four benchmark datasets, the VAWE exhibit consistent performance improvement.