OpenRaiser/Intern-Atlas huggingface dataset:
Multi-User Cooperative Computation Framework Based on Bertrand Game
Venue: arXiv cs.GT 2021
Year: 2021

In this paper, a multi-user cooperative computing framework is applied to enable mobile users to utilize available computing resources from other neighboring users via direct communication links. An incentive scheme based on Bertrand game is proposed for the user to determine \textit{who} and \textit{how} to cooperate. We model the resource demand users as \textit{buyers} who aim to use minimal payments to maximize energy savings, whereas resource supply users as \textit{sellers} who aim to earn payments for their computing resource provision. A Bertrand game against \textit{buyer's market} is formulated. When the users have \textit{complete information} of their opponents, the Nash equilibrium (NE) of the game is obtained in closed form, while in the case of \textit{incomplete information}, a distributed iterative algorithm is proposed to find the NE. The simulation results verify the effectiveness of the proposed scheme.
Safe Vessel Navigation Visually Aided by Autonomous Unmanned Aerial Vehicles in Congested Harbors and Waterways
Venue: arXiv cs.RO 2021
Year: 2021

In the maritime sector, safe vessel navigation is of great importance, particularly in congested harbors and waterways. The focus of this work is to estimate the distance between an object of interest and potential obstacles using a companion UAV. The proposed approach fuses GPS data with long-range aerial images. First, we employ semantic segmentation DNN for discriminating the vessel of interest, water, and potential solid objects using raw image data. The network is trained with both real and images generated and automatically labeled from a realistic AirSim simulation environment. Then, the distances between the extracted vessel and non-water obstacle blobs are computed using a novel GSD estimation algorithm. To the best of our knowledge, this work is the first attempt to detect and estimate distances to unknown objects from long-range visual data captured with conventional RGB cameras and auxiliary absolute positioning systems (e.g. GPS). The simulation results illustrate the accuracy and efficacy of the proposed method for visually aided navigation of vessels assisted by UAV.
Self-supervised Learning of Occlusion Aware Flow Guided 3D Geometry Perception with Adaptive Cross Weighted Loss from Monocular Videos
Venue: arXiv cs.CV 2021
Year: 2021

Self-supervised deep learning-based 3D scene understanding methods can overcome the difficulty of acquiring the densely labeled ground-truth and have made a lot of advances. However, occlusions and moving objects are still some of the major limitations. In this paper, we explore the learnable occlusion aware optical flow guided self-supervised depth and camera pose estimation by an adaptive cross weighted loss to address the above limitations. Firstly, we explore to train the learnable occlusion mask fused optical flow network by an occlusion-aware photometric loss with the temporally supplemental information and backward-forward consistency of adjacent views. And then, we design an adaptive cross-weighted loss between the depth-pose and optical flow loss of the geometric and photometric error to distinguish the moving objects which violate the static scene assumption. Our method shows promising results on KITTI, Make3D, and Cityscapes datasets under multiple tasks. We also show good generalization ability under a variety of challenging scenarios.
FIFA: Fast Inference Approximation for Action Segmentation
Venue: arXiv cs.CV 2021
Year: 2021

We introduce FIFA, a fast approximate inference method for action segmentation and alignment. Unlike previous approaches, FIFA does not rely on expensive dynamic programming for inference. Instead, it uses an approximate differentiable energy function that can be minimized using gradient-descent. FIFA is a general approach that can replace exact inference improving its speed by more than 5 times while maintaining its performance. FIFA is an anytime inference algorithm that provides a better speed vs. accuracy trade-off compared to exact inference. We apply FIFA on top of state-of-the-art approaches for weakly supervised action segmentation and alignment as well as fully supervised action segmentation. FIFA achieves state-of-the-art results on most metrics on two action segmentation datasets.
Sinogram Denoise Based on Generative Adversarial Networks
Venue: arXiv cs.AI 2021
Year: 2021

A novel method for sinogram denoise based on Generative Adversarial Networks (GANs) in the field of SPECT imaging is presented. Projection data from software phantoms were used to train the proposed model. For evaluation of the efficacy of the method Shepp Logan based phantom, with various noise levels added where used. The resulting denoised sinograms are reconstructed using Ordered Subset Expectation Maximization (OSEM) and compared to the reconstructions of the original noised sinograms. As the results show, the proposed method significantly denoise the sinograms and significantly improves the reconstructions. Finally, to demonstrate the efficacy and capability of the proposed method results from real-world DAT-SPECT sinograms are presented.
Decentralized Deep Learning for Multi-Access Edge Computing: A Survey on Communication Efficiency and Trustworthiness
Venue: arXiv cs.DC 2021
Year: 2021

Wider coverage and a better solution to a latency reduction in 5G necessitate its combination with multi-access edge computing (MEC) technology. Decentralized deep learning (DDL) such as federated learning and swarm learning as a promising solution to privacy-preserving data processing for millions of smart edge devices, leverages distributed computing of multi-layer neural networks within the networking of local clients, whereas, without disclosing the original local training data. Notably, in industries such as finance and healthcare where sensitive data of transactions and personal medical records is cautiously maintained, DDL can facilitate the collaboration among these institutes to improve the performance of trained models while protecting the data privacy of participating clients. In this survey paper, we demonstrate the technical fundamentals of DDL that benefit many walks of society through decentralized learning. Furthermore, we offer a comprehensive overview of the current state-of-the-art in the field by outlining the challenges of DDL and the most relevant solutions from novel perspectives of communication efficiency and trustworthiness.
Knowledge accumulating: The general pattern of learning
Venue: arXiv cs.AI 2021
Year: 2021

Artificial Intelligence has been developed for decades with the achievement of great progress. Recently, deep learning shows its ability to solve many real world problems, e.g. image classification and detection, natural language processing, playing GO. Theoretically speaking, an artificial neural network can fit any function and reinforcement learning can learn from any delayed reward. But in solving real world tasks, we still need to spend a lot of effort to adjust algorithms to fit task unique features. This paper proposes that the reason of this phenomenon is the sparse feedback feature of the nature, and a single algorithm, no matter how we improve it, can only solve dense feedback tasks or specific sparse feedback tasks. This paper first analyses how sparse feedback affects algorithm perfomance, and then proposes a pattern that explains how to accumulate knowledge to solve sparse feedback problems.
Predicting Mechanically Driven Full-Field Quantities of Interest with Deep Learning-Based Metamodels
Venue: arXiv cs.LG 2021
Year: 2021

Using simulation to predict the mechanical behavior of heterogeneous materials has applications ranging from topology optimization to multi-scale structural analysis. However, full-fidelity simulation techniques such as Finite Element Analysis can be prohibitively computationally expensive when they are used to explore the massive input parameter space of heterogeneous materials. Therefore, there has been significant recent interest in machine learning-based models that, once trained, can predict mechanical behavior at a fraction of the computational cost. Over the past several years, research in this area has been focused mainly on predicting single Quantities of Interest (QoIs). However, there has recently been an increased interest in a more challenging problem: predicting full-field QoI (e.g., displacement/strain fields, damage fields) for mechanical problems. Due to the added complexity of full-field information, network architectures that perform well on single QoI problems may perform poorly in the full-field QoI problem setting. The work presented in this paper is twofold. First, we made a significant extension to the Mechanical MNIST dataset designed to enable the investigation of full field QoI prediction. Specifically, we added Finite Element simulation results of quasi-static brittle fracture in a heterogeneous material captured with the phase-field method. Second, we established strong baseline performance for predicting full-field QoI with MultiRes-WNet architecture. In addition to presenting the results in this paper, we have released our model implementation and the Mechanical MNIST Crack Path dataset under open-source licenses. We anticipate that future researchers will directly use our model architecture on related datasets and potentially design models that exceed the baseline performance for predicting full-field QoI established in this paper.
Development of Human Motion Prediction Strategy using Inception Residual Block
Venue: arXiv cs.AI 2021
Year: 2021

Human Motion Prediction is a crucial task in computer vision and robotics. It has versatile application potentials such as in the area of human-robot interactions, human action tracking for airport security systems, autonomous car navigation, computer gaming to name a few. However, predicting human motion based on past actions is an extremely challenging task due to the difficulties in detecting spatial and temporal features correctly. To detect temporal features in human poses, we propose an Inception Residual Block(IRB), due to its inherent capability of processing multiple kernels to capture salient features. Here, we propose to use multiple 1-D Convolution Neural Network (CNN) with different kernel sizes and input sequence lengths and concatenate them to get proper embedding. As kernels strides over different receptive fields, they detect smaller and bigger salient features at multiple temporal scales. Our main contribution is to propose a residual connection between input and the output of the inception block to have a continuity between the previously observed pose and the next predicted pose. With this proposed architecture, it learns prior knowledge much better about human poses and we achieve much higher prediction accuracy as detailed in the paper. Subsequently, we further propose to feed the output of the inception residual block as an input to the Graph Convolution Neural Network (GCN) due to its better spatial feature learning capability. We perform a parametric analysis for better designing of our model and subsequently, we evaluate our approach on the Human 3.6M dataset and compare our short-term as well as long-term predictions with the state of the art papers, where our model outperforms most of the pose results, the detailed reasons of which have been elaborated in the paper.
Unknown Object Segmentation through Domain Adaptation
Venue: arXiv cs.RO 2021
Year: 2021

The ability to segment unknown objects in cluttered scenes has a profound impact on robot grasping. The rise of deep learning has greatly transformed the pipeline of robotic grasping from model-based approach to data-driven stream, which generally requires a large scale of grasping data either collected in simulation or from real-world examples. In this paper, we proposed a sim-to-real framework to transfer the object segmentation model learned in simulation to the real-world. First, data samples are collected in simulation, including RGB, 6D pose, and point cloud. Second, we also present a GAN-based unknown object segmentation method through domain adaptation, which consists of an image translation module and an image segmentation module. The image translation module is used to shorten the reality gap and the segmentation module is responsible for the segmentation mask generation. We used the above method to perform segmentation experiments on unknown objects in a bin-picking scenario. Finally, the experimental result shows that the segmentation model learned in simulation can be used for real-world data segmentation.
Towards Automated Fatigue Assessment using Wearable Sensing and Mixed-Effects Models
Venue: arXiv cs.HC 2021
Year: 2021

Fatigue is a broad, multifactorial concept that includes the subjective perception of reduced physical and mental energy levels. It is also one of the key factors that strongly affect patients' health-related quality of life. To date, most fatigue assessment methods were based on self-reporting, which may suffer from many factors such as recall bias. To address this issue, in this work, we recorded multi-modal physiological data (including ECG, accelerometer, skin temperature and respiratory rate, as well as demographic information such as age, BMI) in free-living environments and developed automated fatigue assessment models. Specifically, we extracted features from each modality and employed the random forest-based mixed-effects models, which can take advantage of the demographic information for improved performance. We conducted experiments on our collected dataset, and very promising preliminary results were achieved. Our results suggested ECG played an important role in the fatigue assessment tasks.
Detecting Visual Design Principles in Art and Architecture through Deep Convolutional Neural Networks
Venue: arXiv cs.CV 2021
Year: 2021

Visual design is associated with the use of some basic design elements and principles. Those are applied by the designers in the various disciplines for aesthetic purposes, relying on an intuitive and subjective process. Thus, numerical analysis of design visuals and disclosure of the aesthetic value embedded in them are considered as hard. However, it has become possible with emerging artificial intelligence technologies. This research aims at a neural network model, which recognizes and classifies the design principles over different domains. The domains include artwork produced since the late 20th century; professional photos; and facade pictures of contemporary buildings. The data collection and curation processes, including the production of computationally-based synthetic dataset, is genuine. The proposed model learns from the knowledge of myriads of original designs, by capturing the underlying shared patterns. It is expected to consolidate design processes by providing an aesthetic evaluation of the visual compositions with objectivity.
A Self-Configurable Grouping Method for Integrated Wi-SUN FAN and TSCH-based Networks
Venue: arXiv cs.NI 2021
Year: 2021

Recent applications in large-scale wireless mesh networks (WSN), e.g., Advanced Metering Infrastructure (AMI) scenarios, expect to support an extended number of nodes with higher throughput, which cannot be sufficiently supported by the current WSN protocols. Two prior protocols, Wi-SUN Field Area Network (Wi-SUN FAN) and IETF 6TiSCH standards, are popularly used that are respectively based on asynchronous Carrier Sense Multiple Access / Collision Avoidance (CSMA/CA) and IEEE 802.15.4 Time Scheduled Channel Hopping (TSCH). However, the former one with CSMA/CA can be prone to the Hidden Node Problem (HNP) that leads to a degradation of reliability, while the latter one with TSCH avoids HNP by using synchronously scheduling but requires massive control signalling that degrades the upper-bound of throughput. Accordingly, this paper tackles the challenge of how to improve the upper-bound of throughput without loss of reliability. To do so, we first present an in-depth evaluation of reliability and throughput between the two existing standards via system-level simulation. We then propose a self-configurable grouping (SCG) method to cluster nodes without using location information of each node. This SCG method eliminates around 99\% HNP in CSMA/CA, thus greatly improves its reliability with maintaining the relatively high upper-bound of throughput. Our results show that the SCG method almost doubles the network throughput compared with both 6TiSCH and Wi-SUN FAN in heavy traffic scenarios, while providing extremely high reliability of more than 99.999\%.
Towards better data discovery and collection with flow-based programming
Venue: arXiv cs.SE 2021
Year: 2021

Despite huge successes reported by the field of machine learning, such as voice assistants or self-driving cars, businesses still observe very high failure rate when it comes to deployment of ML in production. We argue that part of the reason is infrastructure that was not designed for data-oriented activities. This paper explores the potential of flow-based programming (FBP) for simplifying data discovery and collection in software systems. We compare FBP with the currently prevalent service-oriented paradigm to assess characteristics of each paradigm in the context of ML deployment. We develop a data processing application, formulate a subsequent ML deployment task, and measure the impact of the task implementation within both programming paradigms. Our main conclusion is that FBP shows great potential for providing data-centric infrastructural benefits for deployment of ML. Additionally, we provide an insight into the current trend that prioritizes model development over data quality management.
A Concept for a Qualifiable (Meta)-Modeling Framework Deployable in Systems and Tools of Safety-critical and Cyber-physical Environments
Venue: arXiv cs.SE 2021
Year: 2021

The development of cyber-physical systems can significantly benefit from domain-specific modeling and requires adequate (meta)-modeling frameworks. If such systems are designed for the safety-critical area, the systems must undergo qualification processes defined and monitored by a certification authority. To use the resulting artifacts of modeling tools without further qualification activities, the modeling tool must be additionally qualified. Tool qualification has to be conducted by the tool user and can be assisted by the tool developer by providing qualification artifacts. However, state-of-the-art domain-specific modeling frameworks barely support the user in the qualification process, which results in an extensive manual effort. To reduce this effort and to avoid modeling constructs that can hardly be implemented in a qualifiable way, we propose the development of an open source (meta)-modeling framework that inherently considers qualification issues. Based on the functionality of existing frameworks, we have identified components that necessarily need to be rethought or changed. This leads to the consideration of the following six cornerstones for our framework: (1) an essential meta-language, (2) a minimal runtime, (3) deterministic transformations, (4) a qualification artifact generation, (5) a sophisticated visualization, and (6) a decoupled interaction of framework components. All these cornerstones consider the aspect of a safety-critical (meta)-modeling framework in their own manner. This combination leads to a holistic framework usable in the safety-critical system development domain.
Technical Report on a Virtual CTAP2 WebAuthn Authenticator
Venue: arXiv cs.CR 2021
Year: 2021

Even though passwordless authentication to online accounts offers greater security and protection from attack, passwords remain prevalent. Passwordless authentication adoption is impacted by the slow adoption of external hardware keys required to generate the security keys within the authentication protocol. We have developed a virtual WebAuthn authenticator in order to provide an extensible open source platform for understanding the associated standards of WebAuthn and CTAP2. Our authenticator provides secure software authentication for devices that do not have access to a physical hardware interface. Our authenticator also provides an alternative to an external physical hardware key and supports the use of a trusted platform module (TPM) on a device to generate the security keys within a WebAuthn protocol.
Segmentation-free Heart Pathology Detection Using Deep Learning
Venue: arXiv cs.SD 2021
Year: 2021

Cardiovascular (CV) diseases are the leading cause of death in the world, and auscultation is typically an essential part of a cardiovascular examination. The ability to diagnose a patient based on their heart sounds is a rather difficult skill to master. Thus, many approaches for automated heart auscultation have been explored. However, most of the previously proposed methods involve a segmentation step, the performance of which drops significantly for high pulse rates or noisy signals. In this work, we propose a novel segmentation-free heart sound classification method. Specifically, we apply discrete wavelet transform to denoise the signal, followed by feature extraction and feature reduction. Then, Support Vector Machines and Deep Neural Networks are utilised for classification. On the PASCAL heart sound dataset our approach showed superior performance compared to others, achieving 81% and 96% precision on normal and murmur classes, respectively. In addition, for the first time, the data were further explored under a user-independent setting, where the proposed method achieved 92% and 86% precision on normal and murmur, demonstrating the potential of enabling automatic murmur detection for practical use.
Understanding Fuchsia Security
Venue: arXiv cs.CR 2021
Year: 2021

Fuchsia is a new open-source operating system created at Google that is currently under active development. The core architectural principles guiding the design and development of the OS include high system modularity and a specific focus on security and privacy. This paper analyzes the architecture and the software model of Fuchsia, giving a specific focus on the core security mechanisms of this new operating system.
Modal Logic S5 Satisfiability in Answer Set Programming
Venue: arXiv cs.AI 2021
Year: 2021

Modal logic S5 has attracted significant attention and has led to several practical applications, owing to its simplified approach to dealing with nesting modal operators. Efficient implementations for evaluating satisfiability of S5 formulas commonly rely on Skolemisation to convert them into propositional logic formulas, essentially by introducing copies of propositional atoms for each set of interpretations (possible worlds). This approach is simple, but often results into large formulas that are too difficult to process, and therefore more parsimonious constructions are required. In this work, we propose to use Answer Set Programming for implementing such constructions, and in particular for identifying the propositional atoms that are relevant in every world by means of a reachability relation. The proposed encodings are designed to take advantage of other properties such as entailment relations of subformulas rooted by modal operators. An empirical assessment of the proposed encodings shows that the reachability relation is very effective and leads to comparable performance to a state-of-the-art S5 solver based on SAT, while entailment relations are possibly too expensive to reason about and may result in overhead. This paper is under consideration for acceptance in TPLP.