OpenRaiser/Intern-Atlas huggingface dataset:
Characterizing and evaluating adversarial examples for Offline Handwritten Signature Verification
Venue: arXiv cs.CV 2019
Year: 2019

The phenomenon of Adversarial Examples is attracting increasing interest from the Machine Learning community, due to its significant impact to the security of Machine Learning systems. Adversarial examples are similar (from a perceptual notion of similarity) to samples from the data distribution, that "fool" a machine learning classifier. For computer vision applications, these are images with carefully crafted but almost imperceptible changes, that are misclassified. In this work, we characterize this phenomenon under an existing taxonomy of threats to biometric systems, in particular identifying new attacks for Offline Handwritten Signature Verification systems. We conducted an extensive set of experiments on four widely used datasets: MCYT-75, CEDAR, GPDS-160 and the Brazilian PUC-PR, considering both a CNN-based system and a system using a handcrafted feature extractor (CLBP). We found that attacks that aim to get a genuine signature rejected are easy to generate, even in a limited knowledge scenario, where the attacker does not have access to the trained classifier nor the signatures used for training. Attacks that get a forgery to be accepted are harder to produce, and often require a higher level of noise - in most cases, no longer "imperceptible" as previous findings in object recognition. We also evaluated the impact of two countermeasures on the success rate of the attacks and the amount of noise required for generating successful attacks.
Progress in Brain Computer Interfaces: Challenges and Trends
Venue: arXiv cs.HC 2019
Year: 2019

Brain computer interfaces (BCI) provide a direct communication link between the brain and a computer or other external devices. They offer an extended degree of freedom either by strengthening or by substituting human peripheral working capacity and have potential applications in various fields such as rehabilitation, affective computing, robotics, gaming and artificial intelligence. Significant research efforts on a global scale have delivered common platforms for technology standardization and help tackle highly complex and nonlinear brain dynamics and related feature extraction and classification challenges. Psycho-neurophysiological phenomena and their impact on brain signals impose another challenge for BCI researchers to transform the technology from laboratory experiments to plug-and-play daily life. This review summarizes progress in BCI field and highlights critical challenges.
Attitude Reconstruction from Inertial Measurements: QuatFIter and Its Comparison with RodFIter
Venue: arXiv cs.RO 2019
Year: 2019

RodFIter is a promising method of attitude reconstruction from inertial measurements based on the functional iterative integration of Rodrigues vector. The Rodrigues vector is used to encode the attitude in place of the popular rotation vector because it has a polynomial-like rate equation and could be cast into theoretically sound and exact integration. This paper further applies the approach of RodFIter to the unity-norm quaternion for attitude reconstruction, named QuatFIter, and shows that it is identical to the previous Picard-type quaternion method. The Chebyshev polynomial approximation and truncation techniques from the RodFIter are exploited to speed up its implementation. Numerical results demonstrate that the QuatFIter is comparable in accuracy to the RodFIter, although its convergence rate is relatively slower with respect to the number of iterations. Notably, the QuatFIter has about two times better computational efficiency, thanks to the linear quaternion kinematic equation.
LGAN: Lung Segmentation in CT Scans Using Generative Adversarial Network
Venue: arXiv cs.CV 2019
Year: 2019

Lung segmentation in computerized tomography (CT) images is an important procedure in various lung disease diagnosis. Most of the current lung segmentation approaches are performed through a series of procedures with manually empirical parameter adjustments in each step. Pursuing an automatic segmentation method with fewer steps, in this paper, we propose a novel deep learning Generative Adversarial Network (GAN) based lung segmentation schema, which we denote as LGAN. Our proposed schema can be generalized to different kinds of neural networks for lung segmentation in CT images and is evaluated on a dataset containing 220 individual CT scans with two metrics: segmentation quality and shape similarity. Also, we compared our work with current state of the art methods. The results obtained with this study demonstrate that the proposed LGAN schema can be used as a promising tool for automatic lung segmentation due to its simplified procedure as well as its good performance.
Answer Interaction in Non-factoid Question Answering Systems
Venue: arXiv cs.IR 2019
Year: 2019

Information retrieval systems are evolving from document retrieval to answer retrieval. Web search logs provide large amounts of data about how people interact with ranked lists of documents, but very little is known about interaction with answer texts. In this paper, we use Amazon Mechanical Turk to investigate three answer presentation and interaction approaches in a non-factoid question answering setting. We find that people perceive and react to good and bad answers very differently, and can identify good answers relatively quickly. Our results provide the basis for further investigation of effective answer interaction and feedback methods.
On Kernelization for Edge Dominating Set under Structural Parameters
Venue: arXiv cs.DS 2019
Year: 2019

In the NP-hard Edge Dominating Set problem (EDS) we are given a graph $G=(V,E)$ and an integer $k$, and need to determine whether there is a set $F\subseteq E$ of at most $k$ edges that are incident with all (other) edges of $G$. It is known that this problem is fixed-parameter tractable and admits a polynomial kernel when parameterized by $k$. A caveat for this parameter is that it needs to be large, i.e., at least equal to half the size of a maximum matching of $G$, for instances not to be trivially negative. Motivated by this, we study the existence of polynomial kernels for EDS when parameterized by structural parameters that may be much smaller than $k$. Unfortunately, at first glance this looks rather hopeless: Even when parameterized by the deletion distance to a disjoint union of paths $P_3$ of length two there is no polynomial kernelization (under standard assumptions), ruling out polynomial kernels for many smaller parameters like the feedback vertex set size. In contrast, somewhat surprisingly, there is a polynomial kernelization for deletion distance to a disjoint union of paths $P_5$ of length four. As our main result, we fully classify for all finite sets $\mathcal{H}$ of graphs, whether a kernel size polynomial in $|X|$ is possible when given $X$ such that each connected component of $G-X$ is isomorphic to a graph in $\mathcal{H}$.
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time
Venue: arXiv cs.DS 2019
Year: 2019

Computing the Strongly-Connected Components (SCCs) in a graph $G=(V,E)$ is known to take only $O(m + n)$ time using an algorithm by Tarjan from 1972[SICOMP 72] where $m = |E|$, $n=|V|$. For fully-dynamic graphs, conditional lower bounds provide evidence that the update time cannot be improved by polynomial factors over recomputing the SCCs from scratch after every update. Nevertheless, substantial progress has been made to find algorithms with fast update time for \emph{decremental} graphs, i.e. graphs that undergo edge deletions. In this paper, we present the first algorithm for general decremental graphs that maintains the SCCs in total update time $\tilde{O}(m)$, thus only a polylogarithmic factor from the optimal running time. Previously such a result was only known for the special case of planar graphs [Italiano et al, STOC 2017]. Our result should be compared to the formerly best algorithm for general graphs achieving $\tilde{O}(m\sqrt{n})$ total update time by Chechik et.al. [FOCS 16] which improved upon a breakthrough result leading to $O(mn^{0.9 + o(1)})$ total update time by Henzinger, Krinninger and Nanongkai [STOC 14, ICALP 15]; these results in turn improved upon the longstanding bound of $O(mn)$ by Roditty and Zwick [STOC 04]. All of the above results also apply to the decremental Single-Source Reachability (SSR) problem, which can be reduced to decrementally maintaining SCCs. A bound of $O(mn)$ total update time for decremental SSR was established already in 1981 by Even and Shiloach [JACM 1981]. Using a well known reduction, we can maintain the reachability of pairs $S \times V$, $S \subseteq V$ in fully-dynamic graphs with update time $\tilde{O}(\frac{|S|m}{t})$ and query time $O(t)$ for all $t \in [1,|S|]$; this generalizes an earlier All-Pairs Reachability where $S = V$ [Łącki, TALG 2013].
Weightless Neural Network with Transfer Learning to Detect Distress in Asphalt
Venue: arXiv cs.CV 2019
Year: 2019

The present paper shows a solution to the problem of automatic distress detection, more precisely the detection of holes in paved roads. To do so, the proposed solution uses a weightless neural network known as Wisard to decide whether an image of a road has any kind of cracks. In addition, the proposed architecture also shows how the use of transfer learning was able to improve the overall accuracy of the decision system. As a verification step of the research, an experiment was carried out using images from the streets at the Federal University of Tocantins, Brazil. The architecture of the developed solution presents a result of 85.71% accuracy in the dataset, proving to be superior to approaches of the state-of-the-art.
Enabling FDD Massive MIMO through Deep Learning-based Channel Prediction
Venue: arXiv cs.IT 2019
Year: 2019

A major obstacle for widespread deployment of frequency division duplex (FDD)-based Massive multiple-input multiple-output (MIMO) communications is the large signaling overhead for reporting full downlink (DL) channel state information (CSI) back to the basestation (BS), in order to enable closed-loop precoding. We completely remove this overhead by a deep-learning based channel extrapolation (or "prediction") approach and demonstrate that a neural network (NN) at the BS can infer the DL CSI centered around a frequency $f_\text{DL}$ by solely observing uplink (UL) CSI on a different, yet adjacent frequency band around $f_\text{UL}$; no more pilot/reporting overhead is needed than with a genuine time division duplex (TDD)-based system. The rationale is that scatterers and the large-scale propagation environment are sufficiently similar to allow a NN to learn about the physical connections and constraints between two neighboring frequency bands, and thus provide a well-operating system even when classic extrapolation methods, like the Wiener filter (used as a baseline for comparison throughout) fails. We study its performance for various state-of-the-art Massive MIMO channel models, and, even more so, evaluate the scheme using actual Massive MIMO channel measurements, rendering it to be practically feasible at negligible loss in spectral efficiency when compared to a genuine TDD-based system.
Low Level Control of a Quadrotor with Deep Model-Based Reinforcement Learning
Venue: arXiv cs.RO 2019
Year: 2019

Designing effective low-level robot controllers often entail platform-specific implementations that require manual heuristic parameter tuning, significant system knowledge, or long design times. With the rising number of robotic and mechatronic systems deployed across areas ranging from industrial automation to intelligent toys, the need for a general approach to generating low-level controllers is increasing. To address the challenge of rapidly generating low-level controllers, we argue for using model-based reinforcement learning (MBRL) trained on relatively small amounts of automatically generated (i.e., without system simulation) data. In this paper, we explore the capabilities of MBRL on a Crazyflie centimeter-scale quadrotor with rapid dynamics to predict and control at <50Hz. To our knowledge, this is the first use of MBRL for controlled hover of a quadrotor using only on-board sensors, direct motor input signals, and no initial dynamics knowledge. Our controller leverages rapid simulation of a neural network forward dynamics model on a GPU-enabled base station, which then transmits the best current action to the quadrotor firmware via radio. In our experiments, the quadrotor achieved hovering capability of up to 6 seconds with 3 minutes of experimental training data.
Automatic classification of geologic units in seismic images using partially interpreted examples
Venue: arXiv cs.CV 2019
Year: 2019

Geologic interpretation of large seismic stacked or migrated seismic images can be a time-consuming task for seismic interpreters. Neural network based semantic segmentation provides fast and automatic interpretations, provided a sufficient number of example interpretations are available. Networks that map from image-to-image emerged recently as powerful tools for automatic segmentation, but standard implementations require fully interpreted examples. Generating training labels for large images manually is time consuming. We introduce a partial loss-function and labeling strategies such that networks can learn from partially interpreted seismic images. This strategy requires only a small number of annotated pixels per seismic image. Tests on seismic images and interpretation information from the Sea of Ireland show that we obtain high-quality predicted interpretations from a small number of large seismic images. The combination of a partial-loss function, a multi-resolution network that explicitly takes small and large-scale geological features into account, and new labeling strategies make neural networks a more practical tool for automatic seismic interpretation.
The Importance of Socio-Cultural Differences for Annotating and Detecting the Affective States of Students
Venue: arXiv cs.HC 2019
Year: 2019

The development of real-time affect detection models often depends upon obtaining annotated data for supervised learning by employing human experts to label the student data. One open question in annotating affective data for affect detection is whether the labelers (i.e., human experts) need to be socio-culturally similar to the students being labeled, as this impacts the cost feasibility of obtaining the labels. In this study, we investigate the following research questions: For affective state annotation, how does the socio-cultural background of human expert labelers, compared to the subjects, impact the degree of consensus and distribution of affective states obtained? Secondly, how do differences in labeler background impact the performance of affect detection models that are trained using these labels?
Hybrid Recommender Systems: A Systematic Literature Review
Venue: arXiv cs.IR 2019
Year: 2019

Recommender systems are software tools used to generate and provide suggestions for items and other entities to the users by exploiting various strategies. Hybrid recommender systems combine two or more recommendation strategies in different ways to benefit from their complementary advantages. This systematic literature review presents the state of the art in hybrid recommender systems of the last decade. It is the first quantitative review work completely focused in hybrid recommenders. We address the most relevant problems considered and present the associated data mining and recommendation techniques used to overcome them. We also explore the hybridization classes each hybrid recommender belongs to, the application domains, the evaluation process and proposed future research directions. Based on our findings, most of the studies combine collaborative filtering with another technique often in a weighted way. Also cold-start and data sparsity are the two traditional and top problems being addressed in 23 and 22 studies each, while movies and movie datasets are still widely used by most of the authors. As most of the studies are evaluated by comparisons with similar methods using accuracy metrics, providing more credible and user oriented evaluations remains a typical challenge. Besides this, newer challenges were also identified such as responding to the variation of user context, evolving user tastes or providing cross-domain recommendations. Being a hot topic, hybrid recommenders represent a good basis with which to respond accordingly by exploring newer opportunities such as contextualizing recommendations, involving parallel hybrid algorithms, processing larger datasets, etc.
Auto-Retoucher(ART) - A framework for Background Replacement and Image Editing
Venue: arXiv cs.CV 2019
Year: 2019

Replacing the background and simultaneously adjusting foreground objects is a challenging task in image editing. Current techniques for generating such images relies heavily on user interactions with image editing softwares, which is a tedious job for professional retouchers. To reduce their workload, some exciting progress has been made on generating images with a given background. However, these models can neither adjust the position and scale of the foreground objects, nor guarantee the semantic consistency between foreground and background. To overcome these limitations, we propose a framework -- ART(Auto-Retoucher), to generate images with sufficient semantic and spatial consistency. Images are first processed by semantic matting and scene parsing modules, then a multi-task verifier model will give two confidence scores for the current background and position setting. We demonstrate that our jointly optimized verifier model successfully improves the visual consistency, and our ART framework performs well on images with the human body as foregrounds.
A Deep Recurrent Q Network towards Self-adapting Distributed Microservices architecture
Venue: arXiv cs.SE 2019
Year: 2019

One desired aspect of microservices architecture is the ability to self-adapt its own architecture and behaviour in response to changes in the operational environment. To achieve the desired high levels of self-adaptability, this research implements the distributed microservices architectures model, as informed by the MAPE-K model. The proposed architecture employs a multi adaptation agents supported by a centralised controller, that can observe the environment and execute a suitable adaptation action. The adaptation planning is managed by a deep recurrent Q-network (DRQN). It is argued that such integration between DRQN and MDP agents in a MAPE-K model offers distributed microservice architecture with self-adaptability and high levels of availability and scalability. Integrating DRQN into the adaptation process improves the effectiveness of the adaptation and reduces any adaptation risks, including resources over-provisioning and thrashing. The performance of DRQN is evaluated against deep Q-learning and policy gradient algorithms including: i) deep q-network (DQN), ii) dulling deep Q-network (DDQN), iii) a policy gradient neural network (PGNN), and iv) deep deterministic policy gradient (DDPG). The DRQN implementation in this paper manages to outperform the above mentioned algorithms in terms of total reward, less adaptation time, lower error rates, plus faster convergence and training times. We strongly believe that DRQN is more suitable for driving the adaptation in distributed services-oriented architecture and offers better performance than other dynamic decision-making algorithms.
Context Oriented Software Middleware
Venue: arXiv cs.SE 2019
Year: 2019

Our middleware approach, Context-Oriented Software Middleware (COSM), supports context-dependent software with self-adaptability and dependability in a mobile computing environment. The COSM-middleware is a generic and platform-independent adaptation engine, which performs a runtime composition of the software's context-dependent behaviours based on the execution contexts. Our middleware distinguishes between the context-dependent and context-independent functionality of software systems. This enables the COSM-middleware to adapt the application behaviour by composing a set of context-oriented components, that implement the context-dependent functionality of the software. Accordingly, the software dependability is achieved by considering the functionality of the COSM-middleware and the adaptation impact/costs. The COSM-middleware uses a dynamic policy-based engine to evaluate the adaptation outputs and verify the fitness of the adaptation output with the application's objectives, goals and the architecture quality attributes. These capabilities are demonstrated through an empirical evaluation of a case study implementation.
Periodic Analog Channel Estimation Aided Beamforming for Massive MIMO Systems
Venue: arXiv cs.IT 2019
Year: 2019

Analog beamforming is an attractive and cost-effective solution to exploit the benefits of massive multiple-input-multiple-output systems, by requiring only one up/down-conversion chain. However, the presence of only one chain imposes a significant overhead in estimating the channel state information required for beamforming, when conventional digital channel estimation (CE) approaches are used. As an alternative, this paper proposes a novel CE technique, called periodic analog CE (PACE), that can be performed by analog hardware. By avoiding digital processing, the estimation overhead is significantly lowered and does not scale with number of antennas. PACE involves periodic transmission of a sinusoidal reference signal by the transmitter, estimation of its amplitude and phase at each receive antenna via analog hardware, and using these estimates for beamforming. To enable such non-trivial operation, two reference tone recovery techniques and a novel receiver architecture for PACE are proposed and analyzed, both theoretically and via simulations. Results suggest that in sparse, wide-band channels and above a certain signal-to-noise ratio, PACE aided beamforming suffers only a small loss in beamforming gain and enjoys a much lower CE overhead, in comparison to conventional approaches. Benefits of using PACE aided beamforming during the initial access phase are also discussed.