OpenRaiser/Intern-Atlas huggingface dataset:
Evasive Windows Malware: Impact on Antiviruses and Possible Countermeasures
Venue: arXiv cs.CR 2020
Year: 2020

The perpetual opposition between antiviruses and malware leads both parties to evolve continuously. On the one hand, antiviruses put in place solutions that are more and more sophisticated and propose more complex detection techniques in addition to the classic signature analysis. This sophistication leads antiviruses to leave more traces of their presence on the machine they protect. To remain undetected as long as possible, malware can avoid executing within such environments by hunting down the modifications left by the antiviruses. This paper aims at determining the possibilities for malware to detect the antiviruses and then evaluating the efficiency of these techniques on a panel of antiviruses that are the most used nowadays. We then collect samples showing this kind of behavior and propose to evaluate a countermeasure that creates false artifacts, thus forcing malware to evade.
Deep Learning of Individual Aesthetics
Venue: arXiv cs.NE 2020
Year: 2020

Accurate evaluation of human aesthetic preferences represents a major challenge for creative evolutionary and generative systems research. Prior work has tended to focus on feature measures of the artefact, such as symmetry, complexity and coherence. However, research models from Psychology suggest that human aesthetic experiences encapsulate factors beyond the artefact, making accurate computational models very difficult to design. The interactive genetic algorithm (IGA) circumvents the problem through human-in-the-loop, subjective evaluation of aesthetics, but is limited due to user fatigue and small population sizes. In this paper we look at how recent advances in deep learning can assist in automating personal aesthetic judgement. Using a leading artist's computer art dataset, we investigate the relationship between image measures, such as complexity, and human aesthetic evaluation. We use dimension reduction methods to visualise both genotype and phenotype space in order to support the exploration of new territory in a generative system. Convolutional Neural Networks trained on the artist's prior aesthetic evaluations are used to suggest new possibilities similar or between known high quality genotype-phenotype mappings. We integrate this classification and discovery system into a software tool for evolving complex generative art and design.
Database Annotation with few Examples: An Atlas-based Framework using Diffeomorphic Registration of 3D Trees
Venue: arXiv cs.CV 2020
Year: 2020

Automatic annotation of anatomical structures can help simplify workflow during interventions in numerous clinical applications but usually involves a large amount of annotated data. The complexity of the labeling task, together with the lack of representative data, slows down the development of robust solutions. In this paper, we propose a solution requiring very few annotated cases to label 3D pelvic arterial trees of patients with benign prostatic hyperplasia. We take advantage of Large Deformation Diffeomorphic Metric Mapping (LDDMM) to perform registration based on meaningful deformations from which we build an atlas. Branch pairing is then computed from the atlas to new cases using optimal transport to ensure one-to-one correspondence during the labeling process. To tackle topological variations in the tree, which usually degrades the performance of atlas-based techniques, we propose a simple bottom-up label assignment adapted to the pelvic anatomy. The proposed method achieves 97.6\% labeling precision with only 5 cases for training, while in comparison learning-based methods only reach 82.2\% on such small training sets.
CAD2Real: Deep learning with domain randomization of CAD data for 3D pose estimation of electronic control unit housings
Venue: arXiv cs.CV 2020
Year: 2020

Electronic control units (ECUs) are essential for many automobile components, e.g. engine, anti-lock braking system (ABS), steering and airbags. For some products, the 3D pose of each single ECU needs to be determined during series production. Deep learning approaches can not easily be applied to this problem, because labeled training data is not available in sufficient numbers. Thus, we train state-of-the-art artificial neural networks (ANNs) on purely synthetic training data, which is automatically created from a single CAD file. By randomizing parameters during rendering of training images, we enable inference on RGB images of a real sample part. In contrast to classic image processing approaches, this data-driven approach poses only few requirements regarding the measurement setup and transfers to related use cases with little development effort.
Process mining classification with a weightless neural network
Venue: arXiv cs.AI 2020
Year: 2020

Using a weightless neural network architecture WiSARD we propose a straightforward graph to retina codification to represent business process graph flows avoiding kernels, and we present how WiSARD outperforms the classification performance with small training sets in the process mining context.
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time
Venue: arXiv cs.DS 2020
Year: 2020

We consider the Hypergraph-$k$-cut problem. The input consists of a hypergraph $G=(V,E)$ with non-negative hyperedge-costs $c: E\rightarrow R_+$ and a positive integer $k$. The objective is to find a least-cost subset $F\subseteq E$ such that the number of connected components in $G-F$ is at least $k$. An alternative formulation of the objective is to find a partition of $V$ into $k$ non-empty sets $V_1,V_2,\ldots,V_k$ so as to minimize the cost of the hyperedges that cross the partition. Graph-$k$-cut, the special case of Hypergraph-$k$-cut obtained by restricting to graph inputs, has received considerable attention. Several different approaches lead to a polynomial-time algorithm for Graph-$k$-cut when $k$ is fixed, starting with the work of Goldschmidt and Hochbaum (1988). In contrast, it is only recently that a randomized polynomial time algorithm for Hypergraph-$k$-cut was developed (Chandrasekaran, Xu, Yu, 2018) via a subtle generalization of Karger's random contraction approach for graphs. In this work, we develop the first deterministic polynomial time algorithm for Hypergraph-$k$-cut for all fixed $k$. We describe two algorithms both of which are based on a divide and conquer approach. The first algorithm is simpler and runs in $n^{O(k^2)}$ time while the second one runs in $n^{O(k)}$ time. Our proof relies on new structural results that allow for efficient recovery of the parts of an optimum $k$-partition by solving minimum $(S,T)$-terminal cuts. Our techniques give new insights even for Graph-$k$-cut.
Investigating Misinformation in Online Marketplaces: An Audit Study on Amazon
Venue: arXiv cs.IR 2020
Year: 2020

Search and recommendation systems are ubiquitous and irreplaceable tools in our daily lives. Despite their critical role in selecting and ranking the most relevant information, they typically do not consider the veracity of information presented to the user. In this paper, we introduce an audit methodology to investigate the extent of misinformation presented in search results and recommendations on online marketplaces. We investigate the factors and personalization attributes that influence the amount of misinformation in searches and recommendations. Recently, several media reports criticized Amazon for hosting and recommending items that promote misinformation on topics such as vaccines. Motivated by those reports, we apply our algorithmic auditing methodology on Amazon to verify those claims. Our audit study investigates (a) factors that might influence the search algorithms of Amazon and (b) personalization attributes that contribute to amplifying the amount of misinformation recommended to users in their search results and recommendations. Our audit study collected ~526k search results and ~182k homepage recommendations, with ~8.5k unique items. Each item is annotated for its stance on vaccines' misinformation (pro, neutral, or anti). Our study reveals that (1) the selection and ranking by the default Featured search algorithm of search results that have misinformation stances are positively correlated with the stance of search queries and customers' evaluation of items (ratings and reviews), (2) misinformation stances of search results are neither affected by users' activities nor by interacting (browsing, wish-listing, shopping) with items that have a misinformation stance, and (3) a filter bubble built-in users' homepages have a misinformation stance positively correlated with the misinformation stance of items that a user interacts with.
Generating Realistic COVID19 X-rays with a Mean Teacher + Transfer Learning GAN
Venue: arXiv cs.LG 2020
Year: 2020

COVID-19 is a novel infectious disease responsible for over 800K deaths worldwide as of August 2020. The need for rapid testing is a high priority and alternative testing strategies including X-ray image classification are a promising area of research. However, at present, public datasets for COVID19 x-ray images have low data volumes, making it challenging to develop accurate image classifiers. Several recent papers have made use of Generative Adversarial Networks (GANs) in order to increase the training data volumes. But realistic synthetic COVID19 X-rays remain challenging to generate. We present a novel Mean Teacher + Transfer GAN (MTT-GAN) that generates COVID19 chest X-ray images of high quality. In order to create a more accurate GAN, we employ transfer learning from the Kaggle Pneumonia X-Ray dataset, a highly relevant data source orders of magnitude larger than public COVID19 datasets. Furthermore, we employ the Mean Teacher algorithm as a constraint to improve stability of training. Our qualitative analysis shows that the MTT-GAN generates X-ray images that are greatly superior to a baseline GAN and visually comparable to real X-rays. Although board-certified radiologists can distinguish MTT-GAN fakes from real COVID19 X-rays. Quantitative analysis shows that MTT-GAN greatly improves the accuracy of both a binary COVID19 classifier as well as a multi-class Pneumonia classifier as compared to a baseline GAN. Our classification accuracy is favourable as compared to recently reported results in the literature for similar binary and multi-class COVID19 screening tasks.
Joint User Scheduling and Resource Allocation for Millimeter Wave Systems Relying on Adaptive-Resolution ADCs
Venue: arXiv cs.IT 2020
Year: 2020

Millimeter wave (mmWave) communication systems using adaptive-resolution analog-to-digital converters (RADCs) have recently drawn considerable interests from the research community as benefit of their high energy efficiency and low implementation cost. In this paper, we focus on the mmWave uplink using RADCs and investigate the joint user scheduling and resource allocation problem. Specifically, we seek to maximize the system throughput of the scheduled users by jointly optimizing their transmit power level and hybrid combiners as well as the number of quantization bits, subject to practical constraints. By relying on fractional programming (FP) techniques, we first covert this problem into a form amenable to optimization and exploit the specific structures in its solutions with the aid of the so-called Ky Fan n-norm. Then, the resultant optimization problem is solved using a penalty block successive concave approximation (P-BSCA) algorithm. Our numerical results reveal that the proposed algorithm substantially enhances the throughput of the scheduled users compared to the state-of-theart benchmark schemes and provides more flexible and efficient resource allocation control.
Neural Twins Talk
Venue: arXiv cs.CV 2020
Year: 2020

Inspired by how the human brain employs more neural pathways when increasing the focus on a subject, we introduce a novel twin cascaded attention model that outperforms a state-of-the-art image captioning model that was originally implemented using one channel of attention for the visual grounding task. Visual grounding ensures the existence of words in the caption sentence that are grounded into a particular region in the input image. After a deep learning model is trained on visual grounding task, the model employs the learned patterns regarding the visual grounding and the order of objects in the caption sentences, when generating captions. We report the results of our experiments in three image captioning tasks on the COCO dataset. The results are reported using standard image captioning metrics to show the improvements achieved by our model over the previous image captioning model. The results gathered from our experiments suggest that employing more parallel attention pathways in a deep neural network leads to higher performance. Our implementation of NTT is publicly available at: https://github.com/zanyarz/NeuralTwinsTalk.
Latency Analysis for IMT-2020 Radio Interface Technology Evaluation
Venue: arXiv cs.IT 2020
Year: 2020

The International Telecommunication Union (ITU) is currently deliberating on the finalization of candidate radio interface technologies (RITs) for IMT-2020 (International Mobile Telecommunications) suitability. The candidate technologies are currently being evaluated and after a couple of ITU-Radiocommunication sector (ITU-R) working party (WP) meetings, they will become official. Although, products based on the candidate technology from 3GPP (5G new radio (NR)) is already commercial in several operator networks, the ITU is yet to officially declare it as IMT-2020 qualified. Along with evaluation of the 3GPP 5G NR specifications, our group has evaluated many other proponent technologies. 3GPP entire specifications were examined and evaluated through simulation using Matlab and using own developed simulator which is based on the Go-language. The simulator can evaluate complete 5G NR performance using the IMT-2020 evaluation framework. In this work, we are presenting latency parameters which has shown some minor differences from the 3GPP report. Especially, for time division duplexing (TDD) mode of operation, the differences are observed. It might be possible that the differences are due to assumptions made outside the scope of the evaluation. However, we considered the worst case parameter. Although, the report is submitted to ITU but it is also important for the research community to understand why the differences and what were the assumptions in scenario for which differences are observed.
Differentially Private and Fair Deep Learning: A Lagrangian Dual Approach
Venue: arXiv cs.LG 2020
Year: 2020

A critical concern in data-driven decision making is to build models whose outcomes do not discriminate against some demographic groups, including gender, ethnicity, or age. To ensure non-discrimination in learning tasks, knowledge of the sensitive attributes is essential, while, in practice, these attributes may not be available due to legal and ethical requirements. To address this challenge, this paper studies a model that protects the privacy of the individuals sensitive information while also allowing it to learn non-discriminatory predictors. The method relies on the notion of differential privacy and the use of Lagrangian duality to design neural networks that can accommodate fairness constraints while guaranteeing the privacy of sensitive attributes. The paper analyses the tension between accuracy, privacy, and fairness and the experimental evaluation illustrates the benefits of the proposed model on several prediction tasks.
An Explainable Model for EEG Seizure Detection based on Connectivity Features
Venue: arXiv cs.LG 2020
Year: 2020

Epilepsy which is characterized by seizures is studied using EEG signals by recording the electrical activity of the brain. Different types of communication between different parts of the brain are characterized by many state of the art connectivity measures which can be directed and undirected. We propose to employ a set of undirected (spectral matrix, the inverse of the spectral matrix, coherence, partial coherence, and phaselocking value) and directed features (directed coherence, the partial directed coherence) to learn a deep neural network that detects whether a particular data window belongs to a seizure or not, which is a new approach to standard seizure classification. Taking our data as a sequence of ten sub-windows, we aim at designing an optimal deep learning model using attention, CNN, BiLstm, and fully connected layers. We also compute the relevance using the weights of the learned model based on the activation values of the receptive fields at a particular layer. Our best model architecture resulted in 97.03% accuracy using balanced MITBIH data subset. Also, we were able to explain the relevance of each feature across all patients. We were able to experimentally validate some of the scientific facts concerning seizures by studying the impact of the contributions of the activations on the decision.
Infection Risk Score: Identifying the risk of infection propagation based on human contact
Venue: arXiv cs.CY 2020
Year: 2020

A wide range of approaches have been applied to manage the spread of global pandemic events such as COVID-19, which have met with varying degrees of success. Given the large-scale social and economic impact coupled with the increasing time span of the pandemic, it is important to not only manage the spread of the disease but also put extra efforts on measures that expedite resumption of social and economic life. It is therefore important to identify situations that carry high risk, and act early whenever such situations are identified. While a large number of mobile applications have been developed, they are aimed at obtaining information that can be used for contact tracing, but not at estimating the risk of social situations. In this paper, we introduce an infection risk score that provides an estimate of the infection risk arising from human contacts. Using a real-world human contact dataset, we show that the proposed risk score can provide a realistic estimate of the level of risk in the population. We also describe how the proposed infection risk score can be implemented on smartphones. Finally, we identify representative use cases that can leverage the risk score to minimize infection propagation.
TraceSim: A Method for Calculating Stack Trace Similarity
Venue: arXiv cs.SE 2020
Year: 2020

Many contemporary software products have subsystems for automatic crash reporting. However, it is well-known that the same bug can produce slightly different reports. To manage this problem, reports are usually grouped, often manually by developers. Manual triaging, however, becomes infeasible for products that have large userbases, which is the reason for many different approaches to automating this task. Moreover, it is important to improve quality of triaging due to the big volume of reports that needs to be processed properly. Therefore, even a relatively small improvement could play a significant role in overall accuracy of report bucketing. The majority of existing studies use some kind of a stack trace similarity metric, either based on information retrieval techniques or string matching methods. However, it should be stressed that the quality of triaging is still insufficient. In this paper, we describe TraceSim -- a novel approach to address this problem which combines TF-IDF, Levenshtein distance, and machine learning to construct a similarity metric. Our metric has been implemented inside an industrial-grade report triaging system. The evaluation on a manually labeled dataset shows significantly better results compared to baseline approaches.
Interactive White Balancing for Camera-Rendered Images
Venue: arXiv cs.CV 2020
Year: 2020

White balance (WB) is one of the first photo-finishing steps used to render a captured image to its final output. WB is applied to remove the color cast caused by the scene's illumination. Interactive photo-editing software allows users to manually select different regions in a photo as examples of the illumination for WB correction (e.g., clicking on achromatic objects). Such interactive editing is possible only with images saved in a RAW image format. This is because RAW images have no photo-rendering operations applied and photo-editing software is able to apply WB and other photo-finishing procedures to render the final image. Interactively editing WB in camera-rendered images is significantly more challenging. This is because the camera hardware has already applied WB to the image and subsequent nonlinear photo-processing routines. These nonlinear rendering operations make it difficult to change the WB post-capture. The goal of this paper is to allow interactive WB manipulation of camera-rendered images. The proposed method is an extension of our recent work \cite{afifi2019color} that proposed a post-capture method for WB correction based on nonlinear color-mapping functions. Here, we introduce a new framework that links the nonlinear color-mapping functions directly to user-selected colors to enable {\it interactive} WB manipulation. This new framework is also more efficient in terms of memory and run-time (99\% reduction in memory and 3$\times$ speed-up). Lastly, we describe how our framework can leverage a simple illumination estimation method (i.e., gray-world) to perform auto-WB correction that is on a par with the WB correction results in \cite{afifi2019color}. The source code is publicly available at https://github.com/mahmoudnafifi/Interactive_WB_correction.
Domain Generalization via Semi-supervised Meta Learning
Venue: arXiv cs.LG 2020
Year: 2020

The goal of domain generalization is to learn from multiple source domains to generalize to unseen target domains under distribution discrepancy. Current state-of-the-art methods in this area are fully supervised, but for many real-world problems it is hardly possible to obtain enough labeled samples. In this paper, we propose the first method of domain generalization to leverage unlabeled samples, combining of meta learning's episodic training and semi-supervised learning, called DGSML. DGSML employs an entropy-based pseudo-labeling approach to assign labels to unlabeled samples and then utilizes a novel discrepancy loss to ensure that class centroids before and after labeling unlabeled samples are close to each other. To learn a domain-invariant representation, it also utilizes a novel alignment loss to ensure that the distance between pairs of class centroids, computed after adding the unlabeled samples, is preserved across different domains. DGSML is trained by a meta learning approach to mimic the distribution shift between the input source domains and unseen target domains. Experimental results on benchmark datasets indicate that DGSML outperforms state-of-the-art domain generalization and semi-supervised learning methods.
Co-Planar Parametrization for Stereo-SLAM and Visual-Inertial Odometry
Venue: arXiv cs.RO 2020
Year: 2020

This work proposes a novel SLAM framework for stereo and visual inertial odometry estimation. It builds an efficient and robust parametrization of co-planar points and lines which leverages specific geometric constraints to improve camera pose optimization in terms of both efficiency and accuracy. %reduce the size of the Hessian matrix in the optimization. The pipeline consists of extracting 2D points and lines, predicting planar regions and filtering the outliers via RANSAC. Our parametrization scheme then represents co-planar points and lines as their 2D image coordinates and parameters of planes. We demonstrate the effectiveness of the proposed method by comparing it to traditional parametrizations in a novel Monte-Carlo simulation set. Further, the whole stereo SLAM and VIO system is compared with state-of-the-art methods on the public real-world dataset EuRoC. Our method shows better results in terms of accuracy and efficiency than the state-of-the-art. The code is released at https://github.com/LiXin97/Co-Planar-Parametrization.