OpenRaiser/Intern-Atlas huggingface dataset:
ANGUS: Real-time manipulation of vocal roughness for emotional speech transformations
Venue: arXiv cs.SD 2020
Year: 2020

Vocal arousal, the non-linear acoustic features taken on by human and animal vocalizations when highly aroused, has an important communicative function because it signals aversive states such as fear, pain or distress. In this work, we present a computationally-efficient, real-time voice transformation algorithm, ANGUS, which uses amplitude modulation and time-domain filtering to simulate roughness, an important component of vocal arousal, in arbitrary voice recordings. In a series of 4 studies, we show that ANGUS allows parametric control over the spectral features of roughness like the presence of sub-harmonics and noise; that ANGUS increases the emotional negativity perceived by listeners, to a comparable level as a non-real-time analysis/resynthesis algorithm from the state-of-the-art; that listeners cannot distinguish transformed and non-transformed sounds above chance level; and that ANGUS has a similar emotional effect on animal vocalizations and musical instrument sounds than on human vocalizations. A real-time implementation of ANGUS is made available as open-source software, for use in experimental emotion reseach and affective computing.
FeatGraph: A Flexible and Efficient Backend for Graph Neural Network Systems
Venue: arXiv cs.LG 2020
Year: 2020

Graph neural networks (GNNs) are gaining increasing popularity as a promising approach to machine learning on graphs. Unlike traditional graph workloads where each vertex/edge is associated with a scalar, GNNs attach a feature tensor to each vertex/edge. This additional feature dimension, along with consequently more complex vertex- and edge-wise computations, has enormous implications on locality and parallelism, which existing graph processing systems fail to exploit. This paper proposes FeatGraph to accelerate GNN workloads by co-optimizing graph traversal and feature dimension computation. FeatGraph provides a flexible programming interface to express diverse GNN models by composing coarse-grained sparse templates with fine-grained user-defined functions (UDFs) on each vertex/edge. FeatGraph incorporates optimizations for graph traversal into the sparse templates and allows users to specify optimizations for UDFs with a feature dimension schedule (FDS). FeatGraph speeds up end-to-end GNN training and inference by up to 32x on CPU and 7x on GPU.
Discriminative Cross-Domain Feature Learning for Partial Domain Adaptation
Venue: arXiv cs.CV 2020
Year: 2020

Partial domain adaptation aims to adapt knowledge from a larger and more diverse source domain to a smaller target domain with less number of classes, which has attracted appealing attention. Recent practice on domain adaptation manages to extract effective features by incorporating the pseudo labels for the target domain to better fight off the cross-domain distribution divergences. However, it is essential to align target data with only a small set of source data. In this paper, we develop a novel Discriminative Cross-Domain Feature Learning (DCDF) framework to iteratively optimize target labels with a cross-domain graph in a weighted scheme. Specifically, a weighted cross-domain center loss and weighted cross-domain graph propagation are proposed to couple unlabeled target data to related source samples for discriminative cross-domain feature learning, where irrelevant source centers will be ignored, to alleviate the marginal and conditional disparities simultaneously. Experimental evaluations on several popular benchmarks demonstrate the effectiveness of our proposed approach on facilitating the recognition for the unlabeled target domain, through comparing it to the state-of-the-art partial domain adaptation approaches.
Keypoint-Aligned Embeddings for Image Retrieval and Re-identification
Venue: arXiv cs.CV 2020
Year: 2020

Learning embeddings that are invariant to the pose of the object is crucial in visual image retrieval and re-identification. The existing approaches for person, vehicle, or animal re-identification tasks suffer from high intra-class variance due to deformable shapes and different camera viewpoints. To overcome this limitation, we propose to align the image embedding with a predefined order of the keypoints. The proposed keypoint aligned embeddings model (KAE-Net) learns part-level features via multi-task learning which is guided by keypoint locations. More specifically, KAE-Net extracts channels from a feature map activated by a specific keypoint through learning the auxiliary task of heatmap reconstruction for this keypoint. The KAE-Net is compact, generic and conceptually simple. It achieves state of the art performance on the benchmark datasets of CUB-200-2011, Cars196 and VeRi-776 for retrieval and re-identification tasks.
Low Complexity Trellis-Coded Quantization in Versatile Video Coding
Venue: arXiv cs.MM 2020
Year: 2020

The forthcoming Versatile Video Coding (VVC) standard adopts the trellis-coded quantization, which leverages the delicate trellis graph to map the quantization candidates within one block into the optimal path. Despite the high compression efficiency, the complex trellis search with soft decision quantization may hinder the applications due to high complexity and low throughput capacity. To reduce the complexity, in this paper, we propose a low complexity trellis-coded quantization scheme in a scientifically sound way with theoretical modeling of the rate and distortion. As such, the trellis departure point can be adaptively adjusted, and unnecessarily visited branches are accordingly pruned, leading to the shrink of total trellis stages and simplification of transition branches. Extensive experimental results on the VVC test model show that the proposed scheme is effective in reducing the encoding complexity by 11% and 5% with all intra and random access configurations, respectively, at the cost of only 0.11% and 0.05% BD-Rate increase. Meanwhile, on average 24% and 27% quantization time savings can be achieved under all intra and random access configurations. Due to the excellent performance, the VVC test model has adopted one implementation of the proposed scheme.
Wireless Communication via Double IRS: Channel Estimation and Passive Beamforming Designs
Venue: arXiv cs.IT 2020
Year: 2020

In this letter, we study efficient channel estimation and passive beamforming designs for a double-intelligent reflecting surface (IRS) aided single-user communication system, where a user communicates with an access point (AP) via the cascaded user-IRS 1-IRS 2-AP double-reflection link. First, a general channel estimation scheme is proposed for the system under any arbitrary inter-IRS channel, where all coefficients of the cascaded channel are estimated. Next, for the typical scenario with a line-of-sight (LoS)-dominant inter-IRS channel, we propose another customized scheme to estimate two signature vectors of the rank-one cascaded channel with significantly less channel training time than the first scheme. For the two proposed channel estimation schemes, we further optimize their corresponding cooperative passive beamforming for data transmission to maximize the achievable rate with the training overhead and channel estimation error taken into account. Numerical results show that deploying two cooperative IRSs with the proposed channel estimation and passive beamforming designs achieves significant rate enhancement as compared to the conventional case of single IRS deployment.
Fusion of Global-Local Features for Image Quality Inspection of Shipping Label
Venue: arXiv cs.CV 2020
Year: 2020

The demands of automated shipping address recognition and verification have increased to handle a large number of packages and to save costs associated with misdelivery. A previous study proposed a deep learning system where the shipping address is recognized and verified based on a camera image capturing the shipping address and barcode area. Because the system performance depends on the input image quality, inspection of input image quality is necessary for image preprocessing. In this paper, we propose an input image quality verification method combining global and local features. Object detection and scale-invariant feature transform in different feature spaces are developed to extract global and local features from several independent convolutional neural networks. The conditions of shipping label images are classified by fully connected fusion layers with concatenated global and local features. The experimental results regarding real captured and generated images show that the proposed method achieves better performance than other methods. These results are expected to improve the shipping address recognition and verification system by applying different image preprocessing steps based on the classified conditions.
Training Multimodal Systems for Classification with Multiple Objectives
Venue: arXiv cs.LG 2020
Year: 2020

We learn about the world from a diverse range of sensory information. Automated systems lack this ability as investigation has centred on processing information presented in a single form. Adapting architectures to learn from multiple modalities creates the potential to learn rich representations of the world - but current multimodal systems only deliver marginal improvements on unimodal approaches. Neural networks learn sampling noise during training with the result that performance on unseen data is degraded. This research introduces a second objective over the multimodal fusion process learned with variational inference. Regularisation methods are implemented in the inner training loop to control variance and the modular structure stabilises performance as additional neurons are added to layers. This framework is evaluated on a multilabel classification task with textual and visual inputs to demonstrate the potential for multiple objectives and probabilistic methods to lower variance and improve generalisation.
HipaccVX: Wedding of OpenVX and DSL-based Code Generation
Venue: arXiv cs.CV 2020
Year: 2020

Writing programs for heterogeneous platforms optimized for high performance is hard since this requires the code to be tuned at a low level with architecture-specific optimizations that are most times based on fundamentally differing programming paradigms and languages. OpenVX promises to solve this issue for computer vision applications with a royalty-free industry standard that is based on a graph-execution model. Yet, the OpenVX' algorithm space is constrained to a small set of vision functions. This hinders accelerating computations that are not included in the standard. In this paper, we analyze OpenVX vision functions to find an orthogonal set of computational abstractions. Based on these abstractions, we couple an existing Domain-Specific Language (DSL) back end to the OpenVX environment and provide language constructs to the programmer for the definition of user-defined nodes. In this way, we enable optimizations that are not possible to detect with OpenVX graph implementations using the standard computer vision functions. These optimizations can double the throughput on an Nvidia GTX GPU and decrease the resource usage of a Xilinx Zynq FPGA by 50% for our benchmarks. Finally, we show that our proposed compiler framework, called HipaccVX, can achieve better results than the state-of-the-art approaches Nvidia VisionWorks and Halide-HLS.
Cross-regional oil palm tree counting and detection via multi-level attention domain adaptation network
Venue: arXiv cs.CV 2020
Year: 2020

Providing an accurate evaluation of palm tree plantation in a large region can bring meaningful impacts in both economic and ecological aspects. However, the enormous spatial scale and the variety of geological features across regions has made it a grand challenge with limited solutions based on manual human monitoring efforts. Although deep learning based algorithms have demonstrated potential in forming an automated approach in recent years, the labelling efforts needed for covering different features in different regions largely constrain its effectiveness in large-scale problems. In this paper, we propose a novel domain adaptive oil palm tree detection method, i.e., a Multi-level Attention Domain Adaptation Network (MADAN) to reap cross-regional oil palm tree counting and detection. MADAN consists of 4 procedures: First, we adopted a batch-instance normalization network (BIN) based feature extractor for improving the generalization ability of the model, integrating batch normalization and instance normalization. Second, we embedded a multi-level attention mechanism (MLA) into our architecture for enhancing the transferability, including a feature level attention and an entropy level attention. Then we designed a minimum entropy regularization (MER) to increase the confidence of the classifier predictions through assigning the entropy level attention value to the entropy penalty. Finally, we employed a sliding window-based prediction and an IOU based post-processing approach to attain the final detection results. We conducted comprehensive ablation experiments using three different satellite images of large-scale oil palm plantation area with six transfer tasks. MADAN improves the detection accuracy by 14.98% in terms of average F1-score compared with the Baseline method (without DA), and performs 3.55%-14.49% better than existing domain adaptation methods.
Fractional-Order Structural Stability: Formulation and Application to the Critical Load of Slender Structures
Venue: arXiv cs.CE 2020
Year: 2020

This study presents the framework to perform a stability analysis of nonlocal solids whose response is formulated according to the fractional-order continuum theory. In this formulation, space fractional-order operators are used to capture the nonlocal response of the medium by introducing nonlocal kinematic relations. First, we use the geometrically nonlinear fractional-order kinematic relations within an energy-based approach to establish the Lagrange-Dirichlet stability criteria for fractional-order nonlocal structures. This energy-based approach to nonlocal structural stability is possible due to a positive-definite and thermodynamically consistent definition of deformation energy enabled by the fractional-order kinematic formulation. Then, the Rayleigh-Ritz coefficient for the critical load is derived for linear buckling conditions. The fractional-order formulation is finally used to determine critical buckling loads of slender nonlocal beams and plates using a dedicated fractional-order finite element solver. Results establish that, in contrast to existing studies, the effect of nonlocal interactions is observed on both the material and the geometric stiffness, when using the fractional-order kinematics approach. We support these observations quantitatively with the help of case studies focusing on the critical buckling response of fractional-order nonlocal slender structures, and qualitatively via direct comparison of the fractional-order approach with the classical nonlocal approaches.
Optimal Strategies in Weighted Limit Games (full version)
Venue: arXiv cs.GT 2020
Year: 2020

We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a Büchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular specification. Quality of plays is measured in the maximal weight of infixes between successive play prefixes that satisfy the specification.
Leveraging Kernelized Synergies on Shared Subspace for Precision Grasp and Dexterous Manipulation
Venue: arXiv cs.RO 2020
Year: 2020

Manipulation in contrast to grasping is a trajectorial task that needs to use dexterous hands. Improving the dexterity of robot hands, increases the controller complexity and thus requires to use the concept of postural synergies. Inspired from postural synergies, this research proposes a new framework called kernelized synergies that focuses on the re-usability of the same subspace for precision grasping and dexterous manipulation. In this work, the computed subspace of postural synergies; parameterized by probabilistic movement primitives, is treated with kernel to preserve its grasping and manipulation characteristics and allows its reuse for new objects. The grasp stability of the proposed framework is assessed with a force closure quality index. For performance evaluation, the proposed framework is tested on two different simulated robot hand models using the Syngrasp toolbox and experimentally, four complex grasping and manipulation tasks are performed and reported. The results confirm the hand agnostic approach of the proposed framework and its generalization to distinct objects irrespective of their shape and size.
Logic Signed Petri Net
Venue: arXiv cs.LO 2020
Year: 2020

In this paper,the authors show the versatility of the Signed Petri Net (SPN) introduced by them by showing the equivalence between a Logic Signed Petri Net (LSPN) and Logic Petri Net (LPN).The capacity of each place in all these nets is at most one, i.e.,a place has either zero or one token in it.
A Prospective Study on Sequence-Driven Temporal Sampling and Ego-Motion Compensation for Action Recognition in the EPIC-Kitchens Dataset
Venue: arXiv cs.CV 2020
Year: 2020

Action recognition is currently one of the top-challenging research fields in computer vision. Convolutional Neural Networks (CNNs) have significantly boosted its performance but rely on fixed-size spatio-temporal windows of analysis, reducing CNNs temporal receptive fields. Among action recognition datasets, egocentric recorded sequences have become of important relevance while entailing an additional challenge: ego-motion is unavoidably transferred to these sequences. The proposed method aims to cope with it by estimating this ego-motion or camera motion. The estimation is used to temporally partition video sequences into motion-compensated temporal \textit{chunks} showing the action under stable backgrounds and allowing for a content-driven temporal sampling. A CNN trained in an end-to-end fashion is used to extract temporal features from each \textit{chunk}, which are late fused. This process leads to the extraction of features from the whole temporal range of an action, increasing the temporal receptive field of the network.
Server-side Fingerprint-Based Indoor Localization Using Encrypted Sorting
Venue: arXiv cs.CR 2020
Year: 2020

GPS signals, the main origin of navigation, are not functional in indoor environments. Therefore, Wi-Fi access points have started to be increasingly used for localization and tracking inside the buildings by relying on a fingerprint-based approach. However, with these types of approaches, several concerns regarding the privacy of the users have arisen. Malicious individuals can determine a client's daily habits and activities by simply analyzing their wireless signals. While there are already efforts to incorporate privacy into the existing fingerprint-based approaches, they are limited to the characteristics of the homomorphic cryptographic schemes they employed. In this paper, we propose to enhance the performance of these approaches by exploiting another homomorphic algorithm, namely DGK, with its unique encrypted sorting capability and thus pushing most of the computations to the server side. We developed an Android app and tested our system within a Columbia University dormitory. Compared to existing systems, the results indicated that more power savings can be achieved at the client side and DGK can be a viable option with more powerful server computation capabilities.
A Bilateral Game Approach for Task Outsourcing in Multi-access Edge Computing
Venue: arXiv cs.DC 2020
Year: 2020

Multi-access edge computing (MEC) is a promising architecture to provide low-latency applications for future Internet of Things (IoT)-based network systems. Together with the increasing scholarly attention on task offloading, the problem of edge servers' resource allocation has been widely studied. Most of previous works focus on a single edge server (ES) serving multiple terminal entities (TEs), which restricts their access to sufficient resources. In this paper, we consider a MEC resource transaction market with multiple ESs and multiple TEs, which are interdependent and mutually influence each other. However, this many-to-many interaction requires resolving several problems, including task allocation, TEs' selection on ESs and conflicting interests of both parties. Game theory can be used as an effective tool to realize the interests of two or more conflicting individuals in the trading market. Therefore, we propose a bilateral game framework among multiple ESs and multiple TEs by modeling the task outsourcing problem as two noncooperative games: the supplier and customer side games. In the first game, the supply function bidding mechanism is employed to model the ESs' profit maximization problem. The ESs submit their bids to the scheduler, where the computing service price is computed and sent to the TEs. While in the second game, TEs determine the optimal demand profiles according to ESs' bids to maximize their payoff. The existence and uniqueness of the Nash equilibrium in the aforementioned games are proved. A distributed task outsourcing algorithm (DTOA) is designed to determine the equilibrium. Simulation results have demonstrated the superior performance of DTOA in increasing the ESs' profit and TEs' payoff, as well as flattening the peak and off-peak load.
The optimal network throughputs when the model-aware node coexists with other nodes using different MAC protocols
Venue: arXiv cs.NI 2020
Year: 2020

In this document, we give the optimal network throughput when the DR-DLMA node (see our paper for definition) coexists with the nodes using other protocol (e.g., TDMA and/or ALOHA). Then we use the optimal network throughput as the benchmark for our paper. The simulation results in our paper demonstrated that the DR-DLMA node can achieve performance similar to that of the model-aware node.
Impact on the Productivity of Remotely Working IT Professionals of Bangladesh during the Coronavirus Disease 2019
Venue: arXiv cs.CY 2020
Year: 2020

Similar to the rest of the world, the recent pandemic situation has forced the IT professionals of Bangladesh to adopt remote work. The aim of this study is to find out whether remote work can be continued even after the lockdown is lifted. As work from home may change various productivity related aspects of the employees, i.e., team dynamics and company dynamics, it is necessary to understand the nature of the change during WFH. Conducting a survey, we asked the IT professionals of Bangladesh how they perceive their level of productivity during WFH and how the factors related to productivity have changed. We analyzed the change and identified the areas affected by WFH. We discovered that resource and workspace related issues, emotional well-being of the employees have been hampered the most during WFH. We believe that the findings from this study will help to decide how to resolve those issues and will help to understand whether WFH can be continued even after the lockdown is lifted.