OpenRaiser/Intern-Atlas huggingface dataset:
A New Chaos and Permutation Based Algorithm for Image and Video Encryption
Venue: arXiv cs.CR 2020
Year: 2020

Images and video sequences carry large volumes of highly correlated and redundant data. Applications like military and telecommunication require encryption methods to protect the data from unwanted access. This requirement in most cases needs to be realized in real-time. In this paper, we propose a fast new Fiestal-structured approach for image and video encryption based on a chaotic random sequence generator and a Permutation-Inverse Permutation (PIP) pixel transform. This approach utilizes mathematical functions and transforms with low complexity. The algorithm at the same time, ensures no drastic pay off in terms of encryption quality. This renders the algorithm with promising scope for real time applications and easy hardware implementation. MATLAB simulation of the algorithm establishes its high quality of encryption in terms of elevated entropy values and negligible correlation of the encrypted data with the original. Simulation results also show high sensitivity to slight variation in keys ensuring high security.
Ear2Face: Deep Biometric Modality Mapping
Venue: arXiv cs.CV 2020
Year: 2020

In this paper, we explore the correlation between different visual biometric modalities. For this purpose, we present an end-to-end deep neural network model that learns a mapping between the biometric modalities. Namely, our goal is to generate a frontal face image of a subject given his/her ear image as the input. We formulated the problem as a paired image-to-image translation task and collected datasets of ear and face image pairs from the Multi-PIE and FERET datasets to train our GAN-based models. We employed feature reconstruction and style reconstruction losses in addition to adversarial and pixel losses. We evaluated the proposed method both in terms of reconstruction quality and in terms of person identification accuracy. To assess the generalization capability of the learned mapping models, we also run cross-dataset experiments. That is, we trained the model on the FERET dataset and tested it on the Multi-PIE dataset and vice versa. We have achieved very promising results, especially on the FERET dataset, generating visually appealing face images from ear image inputs. Moreover, we attained a very high cross-modality person identification performance, for example, reaching 90.9% Rank-10 identification accuracy on the FERET dataset.
Countering hate on social media: Large scale classification of hate and counter speech
Venue: arXiv cs.CY 2020
Year: 2020

Hateful rhetoric is plaguing online discourse, fostering extreme societal movements and possibly giving rise to real-world violence. A potential solution to this growing global problem is citizen-generated counter speech where citizens actively engage in hate-filled conversations to attempt to restore civil non-polarized discourse. However, its actual effectiveness in curbing the spread of hatred is unknown and hard to quantify. One major obstacle to researching this question is a lack of large labeled data sets for training automated classifiers to identify counter speech. Here we made use of a unique situation in Germany where self-labeling groups engaged in organized online hate and counter speech. We used an ensemble learning algorithm which pairs a variety of paragraph embeddings with regularized logistic regression functions to classify both hate and counter speech in a corpus of millions of relevant tweets from these two groups. Our pipeline achieved macro F1 scores on out of sample balanced test sets ranging from 0.76 to 0.97---accuracy in line and even exceeding the state of the art. On thousands of tweets, we used crowdsourcing to verify that the judgments made by the classifier are in close alignment with human judgment. We then used the classifier to discover hate and counter speech in more than 135,000 fully-resolved Twitter conversations occurring from 2013 to 2018 and study their frequency and interaction. Altogether, our results highlight the potential of automated methods to evaluate the impact of coordinated counter speech in stabilizing conversations on social media.
Towards Large-Scale Data Mining for Data-Driven Analysis of Sign Languages
Venue: arXiv cs.CL 2020
Year: 2020

Access to sign language data is far from adequate. We show that it is possible to collect the data from social networking services such as TikTok, Instagram, and YouTube by applying data filtering to enforce quality standards and by discovering patterns in the filtered data, making it easier to analyse and model. Using our data collection pipeline, we collect and examine the interpretation of songs in both the American Sign Language (ASL) and the Brazilian Sign Language (Libras). We explore their differences and similarities by looking at the co-dependence of the orientation and location phonological parameters
Multi-Temporal Scene Classification and Scene Change Detection with Correlation based Fusion
Venue: arXiv cs.CV 2020
Year: 2020

Classifying multi-temporal scene land-use categories and detecting their semantic scene-level changes for imagery covering urban regions could straightly reflect the land-use transitions. Existing methods for scene change detection rarely focus on the temporal correlation of bi-temporal features, and are mainly evaluated on small scale scene change detection datasets. In this work, we proposed a CorrFusion module that fuses the highly correlated components in bi-temporal feature embeddings. We firstly extracts the deep representations of the bi-temporal inputs with deep convolutional networks. Then the extracted features will be projected into a lower dimension space to computed the instance-level correlation. The cross-temporal fusion will be performed based on the computed correlation in CorrFusion module. The final scene classification are obtained with softmax activation layers. In the objective function, we introduced a new formulation for calculating the temporal correlation. The detailed derivation of backpropagation gradients for the proposed module is also given in this paper. Besides, we presented a much larger scale scene change detection dataset and conducted experiments on this dataset. The experimental results demonstrated that our proposed CorrFusion module could remarkably improve the multi-temporal scene classification and scene change detection results.
Cross entropy as objective function for music generative models
Venue: arXiv cs.SD 2020
Year: 2020

The election of the function to optimize when training a machine learning model is very important since this is which lets the model learn. It is not trivial since there are many options, each for different purposes. In the case of sequence generation of text, cross entropy is a common option because of its capability to quantify the predictive behavior of the model. In this paper, we test the validity of cross entropy for a music generator model with an experiment that aims to correlate improvements in the loss value with the reduction of randomness and the ability to keep consistent melodies. We also analyze the relationship between these two aspects which respectively relate to short and long term memory and how they behave and are learned differently.
A Multi-modal Neural Embeddings Approach for Detecting Mobile Counterfeit Apps: A Case Study on Google Play Store
Venue: arXiv cs.CR 2020
Year: 2020

Counterfeit apps impersonate existing popular apps in attempts to misguide users to install them for various reasons such as collecting personal information or spreading malware. Many counterfeits can be identified once installed, however even a tech-savvy user may struggle to detect them before installation. To this end, this paper proposes to leverage the recent advances in deep learning methods to create image and text embeddings so that counterfeit apps can be efficiently identified when they are submitted for publication. We show that a novel approach of combining content embeddings and style embeddings outperforms the baseline methods for image similarity such as SIFT, SURF, and various image hashing methods. We first evaluate the performance of the proposed method on two well-known datasets for evaluating image similarity methods and show that content, style, and combined embeddings increase precision@k and recall@k by 10%-15% and 12%-25%, respectively when retrieving five nearest neighbours. Second, specifically for the app counterfeit detection problem, combined content and style embeddings achieve 12% and 14% increase in precision@k and recall@k, respectively compared to the baseline methods. Third, we present an analysis of approximately 1.2 million apps from Google Play Store and identify a set of potential counterfeits for top-10,000 popular apps. Under a conservative assumption, we were able to find 2,040 potential counterfeits that contain malware in a set of 49,608 apps that showed high similarity to one of the top-10,000 popular apps in Google Play Store. We also find 1,565 potential counterfeits asking for at least five additional dangerous permissions than the original app and 1,407 potential counterfeits having at least five extra third party advertisement libraries.
milliEgo: Single-chip mmWave Radar Aided Egomotion Estimation via Deep Sensor Fusion
Venue: arXiv cs.RO 2020
Year: 2020

Robust and accurate trajectory estimation of mobile agents such as people and robots is a key requirement for providing spatial awareness for emerging capabilities such as augmented reality or autonomous interaction. Although currently dominated by optical techniques e.g., visual-inertial odometry, these suffer from challenges with scene illumination or featureless surfaces. As an alternative, we propose milliEgo, a novel deep-learning approach to robust egomotion estimation which exploits the capabilities of low-cost mmWave radar. Although mmWave radar has a fundamental advantage over monocular cameras of being metric i.e., providing absolute scale or depth, current single chip solutions have limited and sparse imaging resolution, making existing point-cloud registration techniques brittle. We propose a new architecture that is optimized for solving this challenging pose transformation problem. Secondly, to robustly fuse mmWave pose estimates with additional sensors, e.g. inertial or visual sensors we introduce a mixed attention approach to deep fusion. Through extensive experiments, we demonstrate our proposed system is able to achieve 1.3% 3D error drift and generalizes well to unseen environments. We also show that the neural architecture can be made highly efficient and suitable for real-time embedded applications.
Solenoid Maps, Automatic Sequences, Van Der Put Series, and Mealy-Moore Automata
Venue: arXiv cs.FL 2020
Year: 2020

The ring $\mathbb Z_d$ of $d$-adic integers has a natural interpretation as the boundary of a rooted $d$-ary tree $T_d$. Endomorphisms of this tree (i.e. solenoid maps) are in one-to-one correspondence with 1-Lipschitz mappings from $\mathbb Z_d$ to itself and automorphisms of $T_d$ constitute the group $\mathrm{Isom}(\mathbb Z_d)$. In the case when $d=p$ is prime, Anashin showed that $f\in\mathrm{Lip}^1(\mathbb Z_p)$ is defined by a finite Mealy automaton if and only if the reduced coefficients of its van der Put series constitute a $p$-automatic sequence over a finite subset of $\mathbb Z_p\cap\mathbb Q$. We generalize this result to arbitrary integer $d\geq 2$, describe the explicit connection between the Moore automaton producing such sequence and the Mealy automaton inducing the corresponding endomorphism. Along the process we produce two algorithms allowing to convert the Mealy automaton of an endomorphism to the corresponding Moore automaton generating the sequence of the reduced van der Put coefficients of the induced map on $\mathbb Z_d$ and vice versa. We demonstrate examples of applications of these algorithms for the case when the sequence of coefficients is Thue-Morse sequence, and also for one of the generators of the standard automaton representation of the lamplighter group.
Efficient Replication for Straggler Mitigation in Distributed Computing
Venue: arXiv cs.DC 2020
Year: 2020

Master-worker distributed computing systems use task replication in order to mitigate the effect of slow workers, known as stragglers. Tasks are grouped into batches and assigned to one or more workers for execution. We first consider the case when the batches do not overlap and, using the results from majorization theory, show that, for a general class of workers' service time distributions, a balanced assignment of batches to workers minimizes the average job compute time. We next show that this balanced assignment of non-overlapping batches achieves lower average job compute time compared to the overlapping schemes proposed in the literature. Furthermore, we derive the optimum redundancy level as a function of the service time distribution at workers. We show that the redundancy level that minimizes average job compute time is not necessarily the same as the redundancy level that maximizes the predictability of job compute time, and thus there exists a trade-off between optimizing the two metrics. Finally, by running experiments on Google cluster traces, we observe that redundancy can reduce the compute time of the jobs in Google clusters by an order of magnitude, and that the optimum level of redundancy depends on the distribution of tasks' service time.
At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe
Venue: arXiv cs.GT 2020
Year: 2020

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-toe game. Each move determines which field the next player must play in. We show that there exist a winning strategy for the first player, and therefore that there exist an optimal winning strategy taking at most 43 moves; that the second player can hold on at least 29 rounds; and identify any optimal strategy's first two moves.
Online adaptation in robots as biological development provides phenotypic plasticity
Venue: arXiv cs.RO 2020
Year: 2020

The ability of responding to environmental stimuli with appropriate actions is a property shared by all living organisms, and it is also sought in the design of robotic systems. Phenotypic plasticity provides a way for achieving this property as it characterises those organisms that, from one genotype, can express different phenotypes in response to different environments, without involving genetic modifications. In this work we study phenotypic plasticity in robots that are equipped with online sensor adaptation. We show that Boolean network controlled robots can attain navigation with collision avoidance by adapting the coupling between proximity sensors and their controlling network without changing its structure. In other terms, these robots, while being characterised by one genotype (i.e. the network) can express a phenotype among many that is suited for the specific environment. We also show that the dynamical regime that makes it possible to attain the best overall performance is the critical one, bringing further evidence to the hypothesis that natural and artificial systems capable of optimally balancing robustness and adaptivity are critical.
Assessing Holistic Impacts of Major Events on the Bitcoin Blockchain Network
Venue: arXiv cs.CY 2020
Year: 2020

As the pioneer of blockchain technology, Bitcoin is the most popular cryptocurrency to date. Given its dramatic price spikes (and crashes) along with the never-ending news from SEC regulations to security breaches, there seems to be a lack of understanding about the dynamics of cryptocurrencies. These dynamics are believed to be affected by various political, security, financial, and regulatory events. In this paper, we present an efficient framework for holistic analysis of cryptocurrency fluctuations by introducing the Impact-Score metric to distinguish event-induced changes from normal variations. We have applied our framework to 16 major worldwide events and the Bitcoin blockchain network (defined as Bitcoin transaction and users, blockchain data, and memory pool data) from 2016-2018. The results show that a majority of the events are correlated with substantial network changes. We observed roughly generalizable correlations between event types (e.g. financial events) and sub-structures of the Bitcoin blockchain network. Subgroups of these events have strongly consistent temporal impacts on specific facets (e.g. activity or fees) of the Bitcoin ecosystem. Furthermore, we demonstrate the robustness of our process by correlating a majority of spikes in network/subnetwork change with major events.
Visual Summarization of Lecture Video Segments for Enhanced Navigation
Venue: arXiv cs.CV 2020
Year: 2020

Lecture videos are an increasingly important learning resource for higher education. However, the challenge of quickly finding the content of interest in a lecture video is an important limitation of this format. This paper introduces visual summarization of lecture video segments to enhance navigation. A lecture video is divided into segments based on the frame-to-frame similarity of content. The user navigates the lecture video content by viewing a single frame visual and textual summary of each segment. The paper presents a novel methodology to generate the visual summary of a lecture video segment by computing similarities between images extracted from the segment and employing a graph-based algorithm to identify the subset of most representative images. The results from this research are integrated into a real-world lecture video management portal called Videopoints. To collect ground truth for evaluation, a survey was conducted where multiple users manually provided visual summaries for 40 lecture video segments. The users also stated whether any images were not selected for the summary because they were similar to other selected images. The graph based algorithm for identifying summary images achieves 78% precision and 72% F1-measure with frequently selected images as the ground truth, and 94% precision and 72% F1-measure with the union of all user selected images as the ground truth. For 98% of algorithm selected visual summary images, at least one user also selected that image for their summary or considered it similar to another image they selected. Over 65% of automatically generated summaries were rated as good or very good by the users on a 4-point scale from poor to very good. Overall, the results establish that the methodology introduced in this paper produces good quality visual summaries that are practically useful for lecture video navigation.
Causality and Batch Reinforcement Learning: Complementary Approaches To Planning In Unknown Domains
Venue: arXiv cs.LG 2020
Year: 2020

Reinforcement learning algorithms have had tremendous successes in online learning settings. However, these successes have relied on low-stakes interactions between the algorithmic agent and its environment. In many settings where RL could be of use, such as health care and autonomous driving, the mistakes made by most online RL algorithms during early training come with unacceptable costs. These settings require developing reinforcement learning algorithms that can operate in the so-called batch setting, where the algorithms must learn from set of data that is fixed, finite, and generated from some (possibly unknown) policy. Evaluating policies different from the one that collected the data is called off-policy evaluation, and naturally poses counter-factual questions. In this project we show how off-policy evaluation and the estimation of treatment effects in causal inference are two approaches to the same problem, and compare recent progress in these two areas.
COMET: Context-Aware IoU-Guided Network for Small Object Tracking
Venue: arXiv cs.CV 2020
Year: 2020

We consider the problem of tracking an unknown small target from aerial videos of medium to high altitudes. This is a challenging problem, which is even more pronounced in unavoidable scenarios of drastic camera motion and high density. To address this problem, we introduce a context-aware IoU-guided tracker (COMET) that exploits a multitask two-stream network and an offline reference proposal generation strategy. The proposed network fully exploits target-related information by multi-scale feature learning and attention modules. The proposed strategy introduces an efficient sampling strategy to generalize the network on the target and its parts without imposing extra computational complexity during online tracking. These strategies contribute considerably in handling significant occlusions and viewpoint changes. Empirically, COMET outperforms the state-of-the-arts in a range of aerial view datasets that focusing on tracking small objects. Specifically, COMET outperforms the celebrated ATOM tracker by an average margin of 6.2% (and 7%) in precision (and success) score on challenging benchmarks of UAVDT, VisDrone-2019, and Small-90.
Image Completion and Extrapolation with Contextual Cycle Consistency
Venue: arXiv cs.CV 2020
Year: 2020

Image Completion refers to the task of filling in the missing regions of an image and Image Extrapolation refers to the task of extending an image at its boundaries while keeping it coherent. Many recent works based on GAN have shown progress in addressing these problem statements but lack adaptability for these two cases, i.e. the neural network trained for the completion of interior masked images does not generalize well for extrapolating over the boundaries and vice-versa. In this paper, we present a technique to train both completion and extrapolation networks concurrently while benefiting each other. We demonstrate our method's efficiency in completing large missing regions and we show the comparisons with the contemporary state of the art baseline.
Stopwords in Technical Language Processing
Venue: arXiv cs.IR 2020
Year: 2020

There are increasingly applications of natural language processing techniques for information retrieval, indexing and topic modelling in the engineering contexts. A standard component of such tasks is the removal of stopwords, which are uninformative components of the data. While researchers use readily available stopword lists which are derived for general English language, the technical jargon of engineering fields contains their own highly frequent and uninformative words and there exists no standard stopword list for technical language processing applications. Here we address this gap by rigorously identifying generic, insignificant, uninformative stopwords in engineering texts beyond the stopwords in general texts, based on the synthesis of alternative data-driven approaches, and curating a stopword list ready for technical language processing applications.
Experiments on Paraphrase Identification Using Quora Question Pairs Dataset
Venue: arXiv cs.CL 2020
Year: 2020

We modeled the Quora question pairs dataset to identify a similar question. The dataset that we use is provided by Quora. The task is a binary classification. We tried several methods and algorithms and different approach from previous works. For feature extraction, we used Bag of Words including Count Vectorizer, and Term Frequency-Inverse Document Frequency with unigram for XGBoost and CatBoost. Furthermore, we also experimented with WordPiece tokenizer which improves the model performance significantly. We achieved up to 97 percent accuracy. Code and Dataset.