OpenRaiser/Intern-Atlas huggingface dataset:
Multi-Task Learning in Utterance-Level and Segmental-Level Spoof Detection
Venue: arXiv cs.SD 2021
Year: 2021

In this paper, we provide a series of multi-tasking benchmarks for simultaneously detecting spoofing at the segmental and utterance levels in the PartialSpoof database. First, we propose the SELCNN network, which inserts squeeze-and-excitation (SE) blocks into a light convolutional neural network (LCNN) to enhance the capacity of hidden feature selection. Then, we implement multi-task learning (MTL) frameworks with SELCNN followed by bidirectional long short-term memory (Bi-LSTM) as the basic model. We discuss MTL in PartialSpoof in terms of architecture (uni-branch/multi-branch) and training strategies (from-scratch/warm-up) step-by-step. Experiments show that the multi-task model performs relatively better than single-task models. Also, in MTL, a binary-branch architecture more adequately utilizes information from two levels than a uni-branch model. For the binary-branch architecture, fine-tuning a warm-up model works better than training from scratch. Models can handle both segment-level and utterance-level predictions simultaneously overall under a binary-branch multi-task architecture. Furthermore, the multi-task model trained by fine-tuning a segmental warm-up model performs relatively better at both levels except on the evaluation set for segmental detection. Segmental detection should be explored further.
Video-based Point Cloud Compression Artifact Removal
Venue: arXiv cs.MM 2021
Year: 2021

Photo-realistic point cloud capture and transmission are the fundamental enablers for immersive visual communication. The coding process of dynamic point clouds, especially video-based point cloud compression (V-PCC) developed by the MPEG standardization group, is now delivering state-of-the-art performance in compression efficiency. V-PCC is based on the projection of the point cloud patches to 2D planes and encoding the sequence as 2D texture and geometry patch sequences. However, the resulting quantization errors from coding can introduce compression artifacts, which can be very unpleasant for the quality of experience (QoE). In this work, we developed a novel out-of-the-loop point cloud geometry artifact removal solution that can significantly improve reconstruction quality without additional bandwidth cost. Our novel framework consists of a point cloud sampling scheme, an artifact removal network, and an aggregation scheme. The point cloud sampling scheme employs a cube-based neighborhood patch extraction to divide the point cloud into patches. The geometry artifact removal network then processes these patches to obtain artifact-removed patches. The artifact-removed patches are then merged together using an aggregation scheme to obtain the final artifact-removed point cloud. We employ 3D deep convolutional feature learning for geometry artifact removal that jointly recovers both the quantization direction and the quantization noise level by exploiting projection and quantization prior. The simulation results demonstrate that the proposed method is highly effective and can considerably improve the quality of the reconstructed point cloud.
On the combined effect of class imbalance and concept complexity in deep learning
Venue: arXiv cs.LG 2021
Year: 2021

Structural concept complexity, class overlap, and data scarcity are some of the most important factors influencing the performance of classifiers under class imbalance conditions. When these effects were uncovered in the early 2000s, understandably, the classifiers on which they were demonstrated belonged to the classical rather than Deep Learning categories of approaches. As Deep Learning is gaining ground over classical machine learning and is beginning to be used in critical applied settings, it is important to assess systematically how well they respond to the kind of challenges their classical counterparts have struggled with in the past two decades. The purpose of this paper is to study the behavior of deep learning systems in settings that have previously been deemed challenging to classical machine learning systems to find out whether the depth of the systems is an asset in such settings. The results in both artificial and real-world image datasets (MNIST Fashion, CIFAR-10) show that these settings remain mostly challenging for Deep Learning systems and that deeper architectures seem to help with structural concept complexity but not with overlap challenges in simple artificial domains. Data scarcity is not overcome by deeper layers, either. In the real-world image domains, where overfitting is a greater concern than in the artificial domains, the advantage of deeper architectures is less obvious: while it is observed in certain cases, it is quickly cancelled as models get deeper and perform worse than their shallower counterparts.
Interactive Region-of-Interest Discovery using Exploratory Feedback
Venue: arXiv cs.DB 2021
Year: 2021

In this paper, we propose a geospatial data management framework called IRIDEF which captures and analyzes user's exploratory feedback for an enriched guidance mechanism in the context of interactive analysis. We discuss that exploratory feedback can be a proxy for decision-making feedback when the latter is scarce or unavailable. IRIDEF identifies regions of interest (ROIs) via exploratory feedback and highlights a few interesting and out-of-sight POIs in each ROI. These highlights enable the user to shape up his/her future interactions with the system. We detail the components of our proposed framework in the form of a data analysis pipeline and present the aspects of efficiency and effectiveness for each component. We also discuss evaluation plans and future directions for IRIDEF.
PiBase: An IoT-based Security System using Raspberry Pi and Google Firebase
Venue: arXiv cs.CR 2021
Year: 2021

Smart environments are environments where digital devices are connected to each other over the Internet and operate in sync. Security is of paramount importance in such environments. This paper addresses aspects of authorized access and intruder detection for smart environments. Proposed is PiBase, an Internet of Things (IoT)-based app that aids in detecting intruders and providing security. The hardware for the application consists of a Raspberry Pi, a PIR motion sensor to detect motion from infrared radiation in the environment, an Android mobile phone and a camera. The software for the application is written in Java, Python and NodeJS. The PIR sensor and Pi camera module connected to the Raspberry Pi aid in detecting human intrusion. Machine learning algorithms, namely Haar-feature based cascade classifiers and Linear Binary Pattern Histograms (LBPH), are used for face detection and face recognition, respectively. The app lets the user create a list of non-intruders and anyone that is not on the list is identified as an intruder. The app alerts the user only in the event of an intrusion by using the Google Firebase Cloud Messaging service to trigger a notification to the app. The user may choose to add the detected intruder to the list of non-intruders through the app to avoid further detections as intruder. Face detection by the Haar Cascade algorithm yields a recall of 94.6%. Thus, the system is both highly effective and relatively low cost.
Otimizacao de pesos e funcoes de ativacao de redes neurais aplicadas na previsao de series temporais
Venue: arXiv cs.LG 2021
Year: 2021

Neural Networks have been applied for time series prediction with good experimental results that indicate the high capacity to approximate functions with good precision. Most neural models used in these applications use activation functions with fixed parameters. However, it is known that the choice of activation function strongly influences the complexity and performance of the neural network and that a limited number of activation functions have been used. In this work, we propose the use of a family of free parameter asymmetric activation functions for neural networks and show that this family of defined activation functions satisfies the requirements of the universal approximation theorem. A methodology for the global optimization of this family of activation functions with free parameter and the weights of the connections between the processing units of the neural network is used. The central idea of the proposed methodology is to simultaneously optimize the weights and the activation function used in a multilayer perceptron network (MLP), through an approach that combines the advantages of simulated annealing, tabu search and a local learning algorithm, with the purpose of improving performance in the adjustment and forecasting of time series. We chose two learning algorithms: backpropagation with the term momentum (BPM) and LevenbergMarquardt (LM).
DPT: Deformable Patch-based Transformer for Visual Recognition
Venue: arXiv cs.CV 2021
Year: 2021

Transformer has achieved great success in computer vision, while how to split patches in an image remains a problem. Existing methods usually use a fixed-size patch embedding which might destroy the semantics of objects. To address this problem, we propose a new Deformable Patch (DePatch) module which learns to adaptively split the images into patches with different positions and scales in a data-driven way rather than using predefined fixed patches. In this way, our method can well preserve the semantics in patches. The DePatch module can work as a plug-and-play module, which can easily be incorporated into different transformers to achieve an end-to-end training. We term this DePatch-embedded transformer as Deformable Patch-based Transformer (DPT) and conduct extensive evaluations of DPT on image classification and object detection. Results show DPT can achieve 81.9% top-1 accuracy on ImageNet classification, and 43.7% box mAP with RetinaNet, 44.3% with Mask R-CNN on MSCOCO object detection. Code has been made available at: https://github.com/CASIA-IVA-Lab/DPT .
Iterative, Deep, and Unsupervised Synthetic Aperture Sonar Image Segmentation
Venue: arXiv cs.CV 2021
Year: 2021

Deep learning has not been routinely employed for semantic segmentation of seabed environment for synthetic aperture sonar (SAS) imagery due to the implicit need of abundant training data such methods necessitate. Abundant training data, specifically pixel-level labels for all images, is usually not available for SAS imagery due to the complex logistics (e.g., diver survey, chase boat, precision position information) needed for obtaining accurate ground-truth. Many hand-crafted feature based algorithms have been proposed to segment SAS in an unsupervised fashion. However, there is still room for improvement as the feature extraction step of these methods is fixed. In this work, we present a new iterative unsupervised algorithm for learning deep features for SAS image segmentation. Our proposed algorithm alternates between clustering superpixels and updating the parameters of a convolutional neural network (CNN) so that the feature extraction for image segmentation can be optimized. We demonstrate the efficacy of our method on a realistic benchmark dataset. Our results show that the performance of our proposed method is considerably better than current state-of-the-art methods in SAS image segmentation.
Fast direct access to variable length codes
Venue: arXiv cs.IT 2021
Year: 2021

We consider the issue of direct access to any letter of a sequence encoded with a variable length code and stored in the computer's memory, which is a special case of the random access problem to compressed memory. The characteristics according to which methods are evaluated are the access time to one letter and the memory used. The proposed methods, with various trade-offs between the characteristics, outperform the known ones.
Dynamic optimal congestion pricing in multi-region urban networks by application of a Multi-Layer-Neural network
Venue: arXiv cs.RO 2021
Year: 2021

Traffic management by applying congestion pricing is a measure for mitigating congestion in protected city corridors. As a promising tool, pricing improves the level of service in a network and reduces travel delays. However, real-world implementations are restricted to static pricing, i.e., the price is fixed and not responsive to the prevailing regional traffic conditions. Dynamic pricing overcomes these limitations but also affects the users route choices. This work uses dynamic pricing's influence and predicts pricing functions to aim for a system optimal traffic distribution. The framework models a large-scale network where every region is considered homogeneous, allowing for the Macroscopic Fundamental Diagram (MFD) application. We compute Dynamic System Optimum (DSO) and a Quasi Dynamic User Equilibrium (QDUE) of the macroscopic model by formulating a linear optimization problem and utilizing the Dijkstra algorithm and a Multinomial Logit model (MNL), respectively. The equilibria allow us to find an optimal pricing methodology by training Multi-Layer-Neural (MLN) network models. We test our framework on a case study in Zurich, Switzerland, and showcase that (a) our neural network model learns the complex user behavior and (b) allows predicting optimal pricing functions. Results show a significant performance improvement when operating a transportation network in the DSO and highlight how dynamic pricing influences the user's route choice behavior towards the system optimal equilibrium.
Self-supervision for health insurance claims data: a Covid-19 use case
Venue: arXiv cs.CL 2021
Year: 2021

In this work, we modify and apply self-supervision techniques to the domain of medical health insurance claims. We model patients' healthcare claims history analogous to free-text narratives, and introduce pre-trained `prior knowledge', later utilized for patient outcome predictions on a challenging task: predicting Covid-19 hospitalization, given a patient's pre-Covid-19 insurance claims history. Results suggest that pre-training on insurance claims not only produces better prediction performance, but, more importantly, improves the model's `clinical trustworthiness' and model stability/reliability.
Simulation-Based Optimization of High-Performance Wheel Loading
Venue: arXiv cs.CE 2021
Year: 2021

Having smart and autonomous earthmoving in mind, we explore high-performance wheel loading in a simulated environment. This paper introduces a wheel loader simulator that combines contacting 3D multibody dynamics with a hybrid continuum-particle terrain model, supporting realistic digging forces and soil displacements at real-time performance. A total of 270,000 simulations are run with different loading actions, pile slopes, and soil to analyze how they affect the loading performance. The results suggest that the preferred digging actions should preserve and exploit a steep pile slope. High digging speed favors high productivity, while energy-efficient loading requires a lower dig speed.
Spherical Cap Harmonic Analysis (SCHA) for Characterising the Morphology of Rough Surface Patches
Venue: arXiv cs.GR 2021
Year: 2021

We use spherical cap harmonic (SCH) basis functions to analyse and reconstruct the morphology of scanned genus-0 rough surface patches with open edges. We first develop a novel one-to-one conformal mapping algorithm with minimal area distortion for parameterising a surface onto a polar spherical cap with a prescribed half angle. We then show that as a generalisation of the hemispherical harmonic analysis, the SCH analysis provides the most added value for small half angles, i.e., for nominally flat surfaces where the distortion introduced by the parameterisation algorithm is smaller when the surface is projected onto a spherical cap with a small half angle than onto a hemisphere. From the power spectral analysis of the expanded SCH coefficients, we estimate a direction-independent Hurst exponent. We also estimate the wavelengths associated with the orders of the SCH basis functions from the dimensions of the first degree ellipsoidal cap. By windowing the spectral domain, we limit the bandwidth of wavelengths included in a reconstructed surface geometry. This bandlimiting can be used for modifying surfaces, such as for generating finite or discrete element meshes for contact problems. The codes and data developed in this paper are made available under the GNU LGPLv2.1 license.
Representing preorders with injective monotones
Venue: arXiv cs.IT 2021
Year: 2021

We introduce a new class of real-valued monotones in preordered spaces, injective monotones. We show that the class of preorders for which they exist lies in between the class of preorders with strict monotones and preorders with countable multi-utilities, improving upon the known classification of preordered spaces through real-valued monotones. We extend several well-known results for strict monotones (Richter-Peleg functions) to injective monotones, we provide a construction of injective monotones from countable multi-utilities, and relate injective monotones to classic results concerning Debreu denseness and order separability. Along the way, we connect our results to Shannon entropy and the uncertainty preorder, obtaining new insights into how they are related. In particular, we show how injective montones can be used to generalize some appealing properties of Jaynes' maximum entropy principle, which is considered a basis for statistical inference and serves as a justification for many regularization techniques that appear throughout machine learning and decision theory.
Can non-specialists provide high quality gold standard labels in challenging modalities?
Venue: arXiv cs.CV 2021
Year: 2021

Probably yes. -- Supervised Deep Learning dominates performance scores for many computer vision tasks and defines the state-of-the-art. However, medical image analysis lags behind natural image applications. One of the many reasons is the lack of well annotated medical image data available to researchers. One of the first things researchers are told is that we require significant expertise to reliably and accurately interpret and label such data. We see significant inter- and intra-observer variability between expert annotations of medical images. Still, it is a widely held assumption that novice annotators are unable to provide useful annotations for use by clinical Deep Learning models. In this work we challenge this assumption and examine the implications of using a minimally trained novice labelling workforce to acquire annotations for a complex medical image dataset. We study the time and cost implications of using novice annotators, the raw performance of novice annotators compared to gold-standard expert annotators, and the downstream effects on a trained Deep Learning segmentation model's performance for detecting a specific congenital heart disease (hypoplastic left heart syndrome) in fetal ultrasound imaging.
Debiased Explainable Pairwise Ranking from Implicit Feedback
Venue: arXiv cs.IR 2021
Year: 2021

Recent work in recommender systems has emphasized the importance of fairness, with a particular interest in bias and transparency, in addition to predictive accuracy. In this paper, we focus on the state of the art pairwise ranking model, Bayesian Personalized Ranking (BPR), which has previously been found to outperform pointwise models in predictive accuracy, while also being able to handle implicit feedback. Specifically, we address two limitations of BPR: (1) BPR is a black box model that does not explain its outputs, thus limiting the user's trust in the recommendations, and the analyst's ability to scrutinize a model's outputs; and (2) BPR is vulnerable to exposure bias due to the data being Missing Not At Random (MNAR). This exposure bias usually translates into an unfairness against the least popular items because they risk being under-exposed by the recommender system. In this work, we first propose a novel explainable loss function and a corresponding Matrix Factorization-based model called Explainable Bayesian Personalized Ranking (EBPR) that generates recommendations along with item-based explanations. Then, we theoretically quantify additional exposure bias resulting from the explainability, and use it as a basis to propose an unbiased estimator for the ideal EBPR loss. The result is a ranking model that aptly captures both debiased and explainable user preferences. Finally, we perform an empirical study on three real-world datasets that demonstrate the advantages of our proposed models.
Three-Dimensional Central Moment Lattice Boltzmann Method on a Cuboid Lattice for Anisotropic and Inhomogeneous Flows
Venue: arXiv cs.CE 2021
Year: 2021

We present a new 3D lattice Boltzmann (LB) algorithm based on central moments for the D3Q27 lattice using a cuboid grid, which is parameterized by two grid aspect ratios that are related to the ratios of the particle speeds with respect to that along a reference coordinate direction. The use of the cuboid lattice grid enables the method to compute flows having different characteristic length scales in different directions more efficiently. It is constructed to simulate the Navier-Stokes equations consistently via introducing counteracting corrections to the second order moment equilibria obtained via a Chapman-Enskog analysis that eliminate the errors associated with the grid anisotropy and the non-Galilean invariant terms. The implementation is shown to be compact and modular, with an interpretation based on special matrices, admitting ready extension of the standard algorithm for the cubic lattice to the cuboid lattice via appropriate scaling of moments based on grid aspect ratios before and after collision step and equilibria corrections. The resulting formulation is general in that the same grid corrections developed for the D3Q27 lattice for recovering the correct viscous stress tensor is applicable for other lattice subsets, and a variety of collision models, including those based on the relaxation of raw moments, central moments and cumulants, as well as their special case involving the distribution functions. The cuboid central moment LBM is validated against a variety of benchmark flows, and when used in lieu of the corresponding raw moment formulation for simulating shear flows, we show that it results in significant improvements in numerical stability. Finally, we demonstrate that our cuboid LB approach is efficient in simulating anisotropic shear flow problems with significant savings in computational cost and memory storage when compared to that based on the cubic lattice.
Controlling Weather Field Synthesis Using Variational Autoencoders
Venue: arXiv cs.CV 2021
Year: 2021

One of the consequences of climate change is anobserved increase in the frequency of extreme cli-mate events. That poses a challenge for weatherforecast and generation algorithms, which learnfrom historical data but should embed an often un-certain bias to create correct scenarios. This paperinvestigates how mapping climate data to a knowndistribution using variational autoencoders mighthelp explore such biases and control the synthesisof weather fields towards more extreme climatescenarios. We experimented using a monsoon-affected precipitation dataset from southwest In-dia, which should give a roughly stable pattern ofrainy days and ease our investigation. We reportcompelling results showing that mapping complexweather data to a known distribution implementsan efficient control for weather field synthesis to-wards more (or less) extreme scenarios.