OpenRaiser/Intern-Atlas huggingface dataset:
Analysis of the Impact of Mask-wearing in Viral Spread: Implications for COVID-19
Venue: arXiv cs.SI 2020
Year: 2020

Masks are used as part of a comprehensive strategy of measures to limit transmission and save lives during the COVID-19 pandemic. Research about the impact of mask-wearing in the COVID-19 pandemic has raised formidable interest across multiple disciplines. In this paper, we investigate the impact of mask-wearing in spreading processes over complex networks. This is done by studying a heterogeneous bond percolation process over a multi-type network model, where nodes can be one of two types (mask-wearing, and not-mask-wearing). We provide analytical results that accurately predict the expected epidemic size and probability of emergence as functions of the characteristics of the spreading process (e.g., transmission probabilities, inward and outward efficiency of the masks, etc.), the proportion of mask-wearers in the population, and the structure of the underlying contact network. In addition to the theoretical analysis, we also conduct extensive simulations on random networks. We also comment on the analogy between the mask-model studied here and the multiple-strain viral spreading model with mutations studied recently by Eletreby et al.
A New 4-DOF Robot for Rehabilitation of Knee and Ankle-Foot Complex: Simulation and Experiment
Venue: arXiv cs.RO 2020
Year: 2020

Stationary robotic trainers are lower limb rehab robots which often incorporate an exoskeleton attached to a stationary base. The issue observed in the stationery trainers for simultaneous knee and ankle-foot complex joints is that they restrict the natural motion of ankle-foot in the rehab trainings due to the insufficient Degrees of Freedom (DOFs) of these trainers. A new stationary knee-ankle-foot rehab robot with all necessary DOFs is developed here. A typical rehab training is first implemented in simulation, and then tested on a healthy subject. Results show that the proposed system functions naturally and meets the requirements of the desired rehab training.
End-to-end Lane Shape Prediction with Transformers
Venue: arXiv cs.CV 2020
Year: 2020

Lane detection, the process of identifying lane markings as approximated curves, is widely used for lane departure warning and adaptive cruise control in autonomous vehicles. The popular pipeline that solves it in two steps -- feature extraction plus post-processing, while useful, is too inefficient and flawed in learning the global context and lanes' long and thin structures. To tackle these issues, we propose an end-to-end method that directly outputs parameters of a lane shape model, using a network built with a transformer to learn richer structures and context. The lane shape model is formulated based on road structures and camera pose, providing physical interpretation for parameters of network output. The transformer models non-local interactions with a self-attention mechanism to capture slender structures and global context. The proposed method is validated on the TuSimple benchmark and shows state-of-the-art accuracy with the most lightweight model size and fastest speed. Additionally, our method shows excellent adaptability to a challenging self-collected lane detection dataset, showing its powerful deployment potential in real applications. Codes are available at https://github.com/liuruijin17/LSTR.
Robust Visual Tracking via Statistical Positive Sample Generation and Gradient Aware Learning
Venue: arXiv cs.CV 2020
Year: 2020

In recent years, Convolutional Neural Network (CNN) based trackers have achieved state-of-the-art performance on multiple benchmark datasets. Most of these trackers train a binary classifier to distinguish the target from its background. However, they suffer from two limitations. Firstly, these trackers cannot effectively handle significant appearance variations due to the limited number of positive samples. Secondly, there exists a significant imbalance of gradient contributions between easy and hard samples, where the easy samples usually dominate the computation of gradient. In this paper, we propose a robust tracking method via Statistical Positive sample generation and Gradient Aware learning (SPGA) to address the above two limitations. To enrich the diversity of positive samples, we present an effective and efficient statistical positive sample generation algorithm to generate positive samples in the feature space. Furthermore, to handle the issue of imbalance between easy and hard samples, we propose a gradient sensitive loss to harmonize the gradient contributions between easy and hard samples. Extensive experiments on three challenging benchmark datasets including OTB50, OTB100 and VOT2016 demonstrate that the proposed SPGA performs favorably against several state-of-the-art trackers.
CapWAP: Captioning with a Purpose
Venue: arXiv cs.CL 2020
Year: 2020

The traditional image captioning task uses generic reference captions to provide textual information about images. Different user populations, however, will care about different visual aspects of images. In this paper, we propose a new task, Captioning with a Purpose (CapWAP). Our goal is to develop systems that can be tailored to be useful for the information needs of an intended population, rather than merely provide generic information about an image. In this task, we use question-answer (QA) pairs---a natural expression of information need---from users, instead of reference captions, for both training and post-inference evaluation. We show that it is possible to use reinforcement learning to directly optimize for the intended information need, by rewarding outputs that allow a question answering model to provide correct answers to sampled user questions. We convert several visual question answering datasets into CapWAP datasets, and demonstrate that under a variety of scenarios our purposeful captioning system learns to anticipate and fulfill specific information needs better than its generic counterparts, as measured by QA performance on user questions from unseen images, when using the caption alone as context.
Solving Inverse Problems With Deep Neural Networks -- Robustness Included?
Venue: arXiv cs.LG 2020
Year: 2020

In the past five years, deep learning methods have become state-of-the-art in solving various inverse problems. Before such approaches can find application in safety-critical fields, a verification of their reliability appears mandatory. Recent works have pointed out instabilities of deep neural networks for several image reconstruction tasks. In analogy to adversarial attacks in classification, it was shown that slight distortions in the input domain may cause severe artifacts. The present article sheds new light on this concern, by conducting an extensive study of the robustness of deep-learning-based algorithms for solving underdetermined inverse problems. This covers compressed sensing with Gaussian measurements as well as image recovery from Fourier and Radon measurements, including a real-world scenario for magnetic resonance imaging (using the NYU-fastMRI dataset). Our main focus is on computing adversarial perturbations of the measurements that maximize the reconstruction error. A distinctive feature of our approach is the quantitative and qualitative comparison with total-variation minimization, which serves as a provably robust reference method. In contrast to previous findings, our results reveal that standard end-to-end network architectures are not only resilient against statistical noise, but also against adversarial perturbations. All considered networks are trained by common deep learning techniques, without sophisticated defense strategies.
Simultaneous Data Communication and Channel Estimation in Multi-User Full Duplex MIMO Systems
Venue: arXiv cs.IT 2020
Year: 2020

In this paper, we study Simultaneous Communication of Data and Control (SCDC) information signals in Full Duplex (FD) Multiple-Input Multiple-Output (MIMO) wireless systems. In particular, considering an FD MIMO base station serving multiple single-antenna FD users, a novel multi-user communication scheme for simultaneous DownLink (DL) beamformed data transmission and UpLink (UL) pilot-assisted channel estimation is presented. Capitalizing on a recent FD MIMO hardware architecture with reduced complexity self-interference analog cancellation, we jointly design the base station's transmit and receive beamforming matrices as well as the settings for the multiple analog taps and the digital SI canceller with the objective to maximize the DL sum rate. Our simulation results showcase that the proposed approach outperforms its conventional half duplex counterpart with 50% reduction in hardware complexity compared to the latest FD-based SCDC schemes.
STOI-Net: A Deep Learning based Non-Intrusive Speech Intelligibility Assessment Model
Venue: arXiv cs.SD 2020
Year: 2020

The calculation of most objective speech intelligibility assessment metrics requires clean speech as a reference. Such a requirement may limit the applicability of these metrics in real-world scenarios. To overcome this limitation, we propose a deep learning-based non-intrusive speech intelligibility assessment model, namely STOI-Net. The input and output of STOI-Net are speech spectral features and predicted STOI scores, respectively. The model is formed by the combination of a convolutional neural network and bidirectional long short-term memory (CNN-BLSTM) architecture with a multiplicative attention mechanism. Experimental results show that the STOI score estimated by STOI-Net has a good correlation with the actual STOI score when tested with noisy and enhanced speech utterances. The correlation values are 0.97 and 0.83, respectively, for the seen test condition (the test speakers and noise types are involved in the training set) and the unseen test condition (the test speakers and noise types are not involved in the training set). The results confirm the capability of STOI-Net to accurately predict the STOI scores without referring to clean speech.
COVID-19 Patient Detection from Telephone Quality Speech Data
Venue: arXiv cs.SD 2020
Year: 2020

In this paper, we try to investigate the presence of cues about the COVID-19 disease in the speech data. We use an approach that is similar to speaker recognition. Each sentence is represented as super vectors of short term Mel filter bank features for each phoneme. These features are used to learn a two-class classifier to separate the COVID-19 speech from normal. Experiments on a small dataset collected from YouTube videos show that an SVM classifier on this dataset is able to achieve an accuracy of 88.6% and an F1-Score of 92.7%. Further investigation reveals that some phone classes, such as nasals, stops, and mid vowels can distinguish the two classes better than the others.
Character-level Representations Improve DRS-based Semantic Parsing Even in the Age of BERT
Venue: arXiv cs.CL 2020
Year: 2020

We combine character-level and contextual language model representations to improve performance on Discourse Representation Structure parsing. Character representations can easily be added in a sequence-to-sequence model in either one encoder or as a fully separate encoder, with improvements that are robust to different language models, languages and data sets. For English, these improvements are larger than adding individual sources of linguistic information or adding non-contextual embeddings. A new method of analysis based on semantic tags demonstrates that the character-level representations improve performance across a subset of selected semantic phenomena.
Intelligent Reflecting Surface Aided Secure UAV Communications
Venue: arXiv cs.IT 2020
Year: 2020

In this letter, we study the secure communication problem in the unmanned aerial vehicle (UAV) enabled networks aided by an intelligent reflecting surface (IRS) from the physical-layer security perspective. Specifically, the IRS is deployed to assist the wireless transmission from the UAV to the ground user in the presence of an eavesdropper. The objective of this work is to maximize the secrecy rate by jointly optimizing the phase shifts at the IRS as well as the transmit power and location of the UAV. However, the formulated problem is difficult to solve directly due to the non-linear and non-convex objective function and constraints. By invoking fractional programming and successive convex approximation techniques, the original problem is decomposed into three subproblems, which are then transformed into convex ones. Next, a low-complexity alternating algorithm is proposed to solve the challenging non-convex problem effectively, where the closed-form expressions for transmit power and phase shifts are obtained at each iteration. Simulations results demonstrate that the designed algorithm for IRS-aided UAV communications can achieve higher secrecy rate than benchmarks.
EDEN: Multimodal Synthetic Dataset of Enclosed GarDEN Scenes
Venue: arXiv cs.CV 2020
Year: 2020

Multimodal large-scale datasets for outdoor scenes are mostly designed for urban driving problems. The scenes are highly structured and semantically different from scenarios seen in nature-centered scenes such as gardens or parks. To promote machine learning methods for nature-oriented applications, such as agriculture and gardening, we propose the multimodal synthetic dataset for Enclosed garDEN scenes (EDEN). The dataset features more than 300K images captured from more than 100 garden models. Each image is annotated with various low/high-level vision modalities, including semantic segmentation, depth, surface normals, intrinsic colors, and optical flow. Experimental results on the state-of-the-art methods for semantic segmentation and monocular depth prediction, two important tasks in computer vision, show positive impact of pre-training deep networks on our dataset for unstructured natural scenes. The dataset and related materials will be available at https://lhoangan.github.io/eden.
MatRec: Matrix Factorization for Highly Skewed Dataset
Venue: arXiv cs.IR 2020
Year: 2020

Recommender systems is one of the most successful AI technologies applied in the internet cooperations. Popular internet products such as TikTok, Amazon, and YouTube have all integrated recommender systems as their core product feature. Although recommender systems have received great success, it is well known for highly skewed datasets, engineers and researchers need to adjust their methods to tackle the specific problem to yield good results. Inability to deal with highly skewed dataset usually generates hard computational problems for big data clusters and unsatisfactory results for customers. In this paper, we propose a new algorithm solving the problem in the framework of matrix factorization. We model the data skewness factors in the theoretic modeling of the approach with easy to interpret and easy to implement formulas. We prove in experiments our method generates comparably favorite results with popular recommender system algorithms such as Learning to Rank , Alternating Least Squares and Deep Matrix Factorization.
Neural Architecture Search with an Efficient Multiobjective Evolutionary Framework
Venue: arXiv cs.CV 2020
Year: 2020

Deep learning methods have become very successful at solving many complex tasks such as image classification and segmentation, speech recognition and machine translation. Nevertheless, manually designing a neural network for a specific problem is very difficult and time-consuming due to the massive hyperparameter search space, long training times, and lack of technical guidelines for the hyperparameter selection. Moreover, most networks are highly complex, task specific and over-parametrized. Recently, multiobjective neural architecture search (NAS) methods have been proposed to automate the design of accurate and efficient architectures. However, they only optimize either the macro- or micro-structure of the architecture requiring the unset hyperparameters to be manually defined, and do not use the information produced during the optimization process to increase the efficiency of the search. In this work, we propose EMONAS, an Efficient MultiObjective Neural Architecture Search framework for the automatic design of neural architectures while optimizing the network's accuracy and size. EMONAS is composed of a search space that considers both the macro- and micro-structure of the architecture, and a surrogate-assisted multiobjective evolutionary based algorithm that efficiently searches for the best hyperparameters using a Random Forest surrogate and guiding selection probabilities. EMONAS is evaluated on the task of 3D cardiac segmentation from the MICCAI ACDC challenge, which is crucial for disease diagnosis, risk evaluation, and therapy decision. The architecture found with EMONAS is ranked within the top 10 submissions of the challenge in all evaluation metrics, performing better or comparable to other approaches while reducing the search time by more than 50% and having considerably fewer number of parameters.
Robot in the mirror: toward an embodied computational model of mirror self-recognition
Venue: arXiv cs.RO 2020
Year: 2020

Self-recognition or self-awareness is a capacity attributed typically only to humans and few other species. The definitions of these concepts vary and little is known about the mechanisms behind them. However, there is a Turing test-like benchmark: the mirror self-recognition, which consists in covertly putting a mark on the face of the tested subject, placing her in front of a mirror, and observing the reactions. In this work, first, we provide a mechanistic decomposition, or process model, of what components are required to pass this test. Based on these, we provide suggestions for empirical research. In particular, in our view, the way the infants or animals reach for the mark should be studied in detail. Second, we develop a model to enable the humanoid robot Nao to pass the test. The core of our technical contribution is learning the appearance representation and visual novelty detection by means of learning the generative model of the face with deep auto-encoders and exploiting the prediction error. The mark is identified as a salient region on the face and reaching action is triggered, relying on a previously learned mapping to arm joint angles. The architecture is tested on two robots with a completely different face.
MinkLoc3D: Point Cloud Based Large-Scale Place Recognition
Venue: arXiv cs.CV 2020
Year: 2020

The paper presents a learning-based method for computing a discriminative 3D point cloud descriptor for place recognition purposes. Existing methods, such as PointNetVLAD, are based on unordered point cloud representation. They use PointNet as the first processing step to extract local features, which are later aggregated into a global descriptor. The PointNet architecture is not well suited to capture local geometric structures. Thus, state-of-the-art methods enhance vanilla PointNet architecture by adding different mechanism to capture local contextual information, such as graph convolutional networks or using hand-crafted features. We present an alternative approach, dubbed MinkLoc3D, to compute a discriminative 3D point cloud descriptor, based on a sparse voxelized point cloud representation and sparse 3D convolutions. The proposed method has a simple and efficient architecture. Evaluation on standard benchmarks proves that MinkLoc3D outperforms current state-of-the-art. Our code is publicly available on the project website: https://github.com/jac99/MinkLoc3D
Data Augmentation For Children's Speech Recognition -- The "Ethiopian" System For The SLT 2021 Children Speech Recognition Challenge
Venue: arXiv cs.SD 2020
Year: 2020

This paper presents the "Ethiopian" system for the SLT 2021 Children Speech Recognition Challenge. Various data processing and augmentation techniques are proposed to tackle children's speech recognition problem, especially the lack of the children's speech recognition training data issue. Detailed experiments are designed and conducted to show the effectiveness of each technique, across different speech recognition toolkits and model architectures. Step by step, we explain how we come up with our final system, which provides the state-of-the-art results in the SLT 2021 Children Speech Recognition Challenge, with 21.66% CER on the Track 1 evaluation set (4th place overall), and 16.53% CER on the Track 2 evaluation set (1st place overall). Post-challenge analysis shows that our system actually achieves 18.82% CER on the Track 1 evaluation set, but we submitted the wrong version to the challenge organizer for Track 1.
Generating Image Descriptions via Sequential Cross-Modal Alignment Guided by Human Gaze
Venue: arXiv cs.CL 2020
Year: 2020

When speakers describe an image, they tend to look at objects before mentioning them. In this paper, we investigate such sequential cross-modal alignment by modelling the image description generation process computationally. We take as our starting point a state-of-the-art image captioning system and develop several model variants that exploit information from human gaze patterns recorded during language production. In particular, we propose the first approach to image description generation where visual processing is modelled $\textit{sequentially}$. Our experiments and analyses confirm that better descriptions can be obtained by exploiting gaze-driven attention and shed light on human cognitive processes by comparing different ways of aligning the gaze modality with language production. We find that processing gaze data sequentially leads to descriptions that are better aligned to those produced by speakers, more diverse, and more natural${-}$particularly when gaze is encoded with a dedicated recurrent component.
Action State Update Approach to Dialogue Management
Venue: arXiv cs.CL 2020
Year: 2020

Utterance interpretation is one of the main functions of a dialogue manager, which is the key component of a dialogue system. We propose the action state update approach (ASU) for utterance interpretation, featuring a statistically trained binary classifier used to detect dialogue state update actions in the text of a user utterance. Our goal is to interpret referring expressions in user input without a domain-specific natural language understanding component. For training the model, we use active learning to automatically select simulated training examples. With both user-simulated and interactive human evaluations, we show that the ASU approach successfully interprets user utterances in a dialogue system, including those with referring expressions.
Adversarial Semantic Collisions
Venue: arXiv cs.CL 2020
Year: 2020

We study semantic collisions: texts that are semantically unrelated but judged as similar by NLP models. We develop gradient-based approaches for generating semantic collisions and demonstrate that state-of-the-art models for many tasks which rely on analyzing the meaning and similarity of texts-- including paraphrase identification, document retrieval, response suggestion, and extractive summarization-- are vulnerable to semantic collisions. For example, given a target query, inserting a crafted collision into an irrelevant document can shift its retrieval rank from 1000 to top 3. We show how to generate semantic collisions that evade perplexity-based filtering and discuss other potential mitigations. Our code is available at https://github.com/csong27/collision-bert.