OpenRaiser/Intern-Atlas huggingface dataset:
On the influence of Dice loss function in multi-class organ segmentation of abdominal CT using 3D fully convolutional networks
Venue: arXiv cs.CV 2018
Year: 2018

Deep learning-based methods achieved impressive results for the segmentation of medical images. With the development of 3D fully convolutional networks (FCNs), it has become feasible to produce improved results for multi-organ segmentation of 3D computed tomography (CT) images. The results of multi-organ segmentation using deep learning-based methods not only depend on the choice of networks architecture, but also strongly rely on the choice of loss function. In this paper, we present a discussion on the influence of Dice-based loss functions for multi-class organ segmentation using a dataset of abdominal CT volumes. We investigated three different types of weighting the Dice loss functions based on class label frequencies (uniform, simple and square) and evaluate their influence on segmentation accuracies. Furthermore, we compared the influence of different initial learning rates. We achieved average Dice scores of 81.3%, 59.5% and 31.7% for uniform, simple and square types of weighting when the learning rate is 0.001, and 78.2%, 81.0% and 58.5% for each weighting when the learning rate is 0.01. Our experiments indicated a strong relationship between class balancing weights and initial learning rate in training.
An Energy-Efficient FPGA-based Deconvolutional Neural Networks Accelerator for Single Image Super-Resolution
Venue: arXiv cs.DC 2018
Year: 2018

Convolutional neural networks (CNNs) demonstrate excellent performance in various computer vision applications. In recent years, FPGA-based CNN accelerators have been proposed for optimizing performance and power efficiency. Most accelerators are designed for object detection and recognition algorithms that are performed on low-resolution (LR) images. However, real-time image super-resolution (SR) cannot be implemented on a typical accelerator because of the long execution cycles required to generate high-resolution (HR) images, such as those used in ultra-high-definition (UHD) systems. In this paper, we propose a novel CNN accelerator with efficient parallelization methods for SR applications. First, we propose a new methodology for optimizing the deconvolutional neural networks (DCNNs) used for increasing feature maps. Secondly, we propose a novel method to optimize CNN dataflow so that the SR algorithm can be driven at low power in display applications. Finally, we quantize and compress a DCNN-based SR algorithm into an optimal model for efficient inference using on-chip memory. We present an energy-efficient architecture for SR and validate our architecture on a mobile panel with quad-high-definition (QHD) resolution. Our experimental results show that, with the same hardware resources, the proposed DCNN accelerator achieves a throughput up to 108 times greater than that of a conventional DCNN accelerator. In addition, our SR system achieves an energy efficiency of 144.9 GOPS/W, 293.0 GOPS/W, and 500.2 GOPS/W at SR scale factors of 2, 3, and 4, respectively. Furthermore, we demonstrate that our system can restore HR images to a high quality while greatly reducing the data bit-width and the number of parameters compared to conventional SR algorithms.
Time-Slotted Scheduling Schemes for Multi-hop Concurrent Transmission in WPANs with Directional Antenna
Venue: arXiv cs.NI 2018
Year: 2018

To achieve high-speed (giga-bit) connectivity for short-range wireless multimedia applications, the millimeter-wave (mmWave) wireless personal area networks with directional antennas are gaining increased interest. Due to the use of directional antennas and mmWave communications, the probability of non-interfering transmissions increases in a localized region. Network throughput can be increased immensely by the concurrent time allocation of non-interfering transmissions. The problem of finding optimum time allocation for concurrent transmissions is an NP-hard problem. In this paper, we propose two enhanced versions of previously proposed multi-hop concurrent transmission (MHCT) schemes. To increase network capacity, the proposed schemes efficiently make use of the free holes in the time-allocation map of the MHCT scheme; thus, making it more compact.
Tamil Open-Source Landscape - Opportunities and Challenges
Venue: arXiv cs.CY 2018
Year: 2018

We report in this paper, Tamil open-source software community is a vibrant place with software developers, font designers, translators, voice-over artists, and general user testers, who come together for love of their language, and promotion of critical thinking, and modern language usage in Tamil. We identify a need for institutional support at various stages from grooming software developers in Tamil, to marketing platform for Tamil software. There is bright future for tamil software if we will meet challenges it brings with it.
Topic Lifecycle on Social Networks: Analyzing the Effects of Semantic Continuity and Social Communities
Venue: arXiv cs.SI 2018
Year: 2018

Topic lifecycle analysis on Twitter, a branch of study that investigates Twitter topics from their birth through lifecycle to death, has gained immense mainstream research popularity. In the literature, topics are often treated as one of (a) hashtags (independent from other hashtags), (b) a burst of keywords in a short time span or (c) a latent concept space captured by advanced text analysis methodologies, such as Latent Dirichlet Allocation (LDA). The first two approaches are not capable of recognizing topics where different users use different hashtags to express the same concept (semantically related), while the third approach misses out the user's explicit intent expressed via hashtags. In our work, we use a word embedding based approach to cluster different hashtags together, and the temporal concurrency of the hashtag usages, thus forming topics (a semantically and temporally related group of hashtags).We present a novel analysis of topic lifecycles with respect to communities. We characterize the participation of social communities in the topic clusters, and analyze the lifecycle of topic clusters with respect to such participation. We derive first-of-its-kind novel insights with respect to the complex evolution of topics over communities and time: temporal morphing of topics over hashtags within communities, how the hashtags die in some communities but morph into some other hashtags in some other communities (that, it is a community-level phenomenon), and how specific communities adopt to specific hashtags. Our work is fundamental in the space of topic lifecycle modeling and understanding in communities: it redefines our understanding of topic lifecycles and shows that the social boundaries of topic lifecycles are deeply ingrained with community behavior.
Non-Parametric Detection of Network Communities; The Natural Way; A Cascaded Stackelberg Game
Venue: arXiv cs.SI 2018
Year: 2018

Real-World networks have an inherently dynamic structure and are often composed of communities that are constantly changing in membership. Identifying these communities is of great importance when analyzing structural properties of networks. Hence, recent years have witnessed intense research in of solving the challenging problem of detecting such evolving communities. The mainstream approach towards community detection involves optimization of a global partition quality metric (e.g. modularity) over the network. Another technique, Spectral Clustering, involves mapping of original data points in a lower dimensional space, where the clustering properties of a graph are much more evident, and then applying standard clustering techniques for identifying communities. However, the traditional spectral clustering techniques cannot naturally learn the number of communities in networks. These techniques are based on external community connectivity properties, and often fail to identify smaller community structures in dense networks. In this article, we propose an algorithm, namely, the Cascaded Stackelberg Community Detection Algorithm (CASCODE) inspired by the Stackelberg Duopoly Game. This algorithm uses the notion of a leader-follower relationship between the nodes to influence the actions of either. The intuition of the algorithm is based on the natural expected internal structure in evolving communities in networks. Thus, the algorithm is able to naturally learn the number of communities in a network in contrast with other techniques such as Spectral Clustering, which require the expected number of communities as an input. Because this Stackelberg Model-based Community Detection algorithm detects communities through their internal structure, we are able to obtain a finer community structure resolution in dense networks.
Towards a Theory of Data-Diff: Optimal Synthesis of Succinct Data Modification Scripts
Venue: arXiv cs.DB 2018
Year: 2018

This paper addresses the Data-Diff problem: given a dataset and a subsequent version of the dataset, find the shortest sequence of operations that transforms the dataset to the subsequent version, under a restricted family of operations. We consider operations similar to SQL UPDATE, each with a condition (WHERE) that matches a subset of tuples and a modifier (SET) that makes changes to those matched tuples. We characterize the problem based on different constraints on the attributes and the allowed conditions and modifiers, providing complexity classification and algorithms in each case.
Mobile Machine Learning Hardware at ARM: A Systems-on-Chip (SoC) Perspective
Venue: arXiv cs.LG 2018
Year: 2018

Machine learning is playing an increasingly significant role in emerging mobile application domains such as AR/VR, ADAS, etc. Accordingly, hardware architects have designed customized hardware for machine learning algorithms, especially neural networks, to improve compute efficiency. However, machine learning is typically just one processing stage in complex end-to-end applications, involving multiple components in a mobile Systems-on-a-chip (SoC). Focusing only on ML accelerators loses bigger optimization opportunity at the system (SoC) level. This paper argues that hardware architects should expand the optimization scope to the entire SoC. We demonstrate one particular case-study in the domain of continuous computer vision where camera sensor, image signal processor (ISP), memory, and NN accelerator are synergistically co-designed to achieve optimal system-level efficiency.
IoT Security Techniques Based on Machine Learning
Venue: arXiv cs.CR 2018
Year: 2018

Internet of things (IoT) that integrate a variety of devices into networks to provide advanced and intelligent services have to protect user privacy and address attacks such as spoofing attacks, denial of service attacks, jamming and eavesdropping. In this article, we investigate the attack model for IoT systems, and review the IoT security solutions based on machine learning techniques including supervised learning, unsupervised learning and reinforcement learning. We focus on the machine learning based IoT authentication, access control, secure offloading and malware detection schemes to protect data privacy. In this article, we discuss the challenges that need to be addressed to implement these machine learning based security schemes in practical IoT systems.
Discontinuous energy shaping control of the Chaplygin sleigh
Venue: arXiv cs.SY 2018
Year: 2018

In this paper we present an energy shaping control law for set-point regulation of the Chaplygin sleigh. It is well known that nonholonomic mechanical systems cannot be asymptotically stabilised using smooth control laws as they do no satisfy Brockett's necessary condition for smooth stabilisation. Here, we propose a discontinuous control law that can be seen as a potential energy shaping and damping injection controller. The proposed controller is shown to be robust against the parameters of both the inertia matrix and the damping structure of the open-loop system.
Fully Point-wise Convolutional Neural Network for Modeling Statistical Regularities in Natural Images
Venue: arXiv cs.CV 2018
Year: 2018

Modeling statistical regularity plays an essential role in ill-posed image processing problems. Recently, deep learning based methods have been presented to implicitly learn statistical representation of pixel distributions in natural images and leverage it as a constraint to facilitate subsequent tasks, such as color constancy and image dehazing. However, the existing CNN architecture is prone to variability and diversity of pixel intensity within and between local regions, which may result in inaccurate statistical representation. To address this problem, this paper presents a novel fully point-wise CNN architecture for modeling statistical regularities in natural images. Specifically, we propose to randomly shuffle the pixels in the origin images and leverage the shuffled image as input to make CNN more concerned with the statistical properties. Moreover, since the pixels in the shuffled image are independent identically distributed, we can replace all the large convolution kernels in CNN with point-wise ($1*1$) convolution kernels while maintaining the representation ability. Experimental results on two applications: color constancy and image dehazing, demonstrate the superiority of our proposed network over the existing architectures, i.e., using 1/10$\sim$1/100 network parameters and computational cost while achieving comparable performance.
SCUT-FBP5500: A Diverse Benchmark Dataset for Multi-Paradigm Facial Beauty Prediction
Venue: arXiv cs.CV 2018
Year: 2018

Facial beauty prediction (FBP) is a significant visual recognition problem to make assessment of facial attractiveness that is consistent to human perception. To tackle this problem, various data-driven models, especially state-of-the-art deep learning techniques, were introduced, and benchmark dataset become one of the essential elements to achieve FBP. Previous works have formulated the recognition of facial beauty as a specific supervised learning problem of classification, regression or ranking, which indicates that FBP is intrinsically a computation problem with multiple paradigms. However, most of FBP benchmark datasets were built under specific computation constrains, which limits the performance and flexibility of the computational model trained on the dataset. In this paper, we argue that FBP is a multi-paradigm computation problem, and propose a new diverse benchmark dataset, called SCUT-FBP5500, to achieve multi-paradigm facial beauty prediction. The SCUT-FBP5500 dataset has totally 5500 frontal faces with diverse properties (male/female, Asian/Caucasian, ages) and diverse labels (face landmarks, beauty scores within [1,~5], beauty score distribution), which allows different computational models with different FBP paradigms, such as appearance-based/shape-based facial beauty classification/regression model for male/female of Asian/Caucasian. We evaluated the SCUT-FBP5500 dataset for FBP using different combinations of feature and predictor, and various deep learning methods. The results indicates the improvement of FBP and the potential applications based on the SCUT-FBP5500.
Sparse recovery based on q-ratio constrained minimal singular values
Venue: arXiv cs.IT 2018
Year: 2018

We study verifiable sufficient conditions and computable performance bounds for sparse recovery algorithms such as the Basis Pursuit, the Dantzig selector and the Lasso estimator, in terms of a newly defined family of quality measures for the measurement matrices. With high probability, the developed measures for subgaussian random matrices are bounded away from zero as long as the number of measurements is reasonably large. Comparing to the restricted isotropic constant based performance analysis, the arguments in this paper are much more concise and the obtained bounds are tighter. Numerical experiments are presented to illustrate our theoretical results.
No Silk Road for Online Gamers!: Using Social Network Analysis to Unveil Black Markets in Online Games
Venue: arXiv cs.CY 2018
Year: 2018

Online game involves a very large number of users who are interconnected and interact with each other via the Internet. We studied the characteristics of exchanging virtual goods with real money through processes called "real money trading (RMT)." This exchange might influence online game user behaviors and cause damage to the reputation of game companies. We examined in-game transactions to reveal RMT by constructing a social graph of virtual goods exchanges in an online game and identifying network communities of users. We analyzed approximately 6,000,000 transactions in a popular online game and inferred RMT transactions by comparing the RMT transactions crawled from an out-game market. Our findings are summarized as follows: (1) the size of the RMT market could be approximately estimated; (2) professional RMT providers typically form a specific network structure (either star-shape or chain) in the trading network, which can be used as a clue for tracing RMT transactions; and (3) the observed RMT market has evolved over time into a monopolized market with a small number of large-sized virtual goods providers.
Energy-Efficient SWIPT in IoT Distributed Antenna Systems
Venue: arXiv cs.IT 2018
Year: 2018

The rapid growth of Internet of Things (IoT) dramatically increases power consumption of wireless devices. Simultaneous wireless information and power transfer (SWIPT) is a promising solution for sustainable operation of IoT devices. In this paper, we study energy efficiency (EE) in SWIPT-based distributed antenna system (DAS), where power splitting (PS) is applied at IoT devices to coordinate the energy harvesting (EH) and information decoding (ID) processes by varying transmit power of distributed antenna (DA) ports and PS ratios of IoT devices. In the case of single IoT device, we find the optimal closed-form solution by deriving some useful properties based on Karush-Kuhn-Tucker (KKT) conditions and the solution is no need for numerical iterations. For the case of multiple IoT devices, we propose an efficient suboptimal algorithm to solve the EE maximization problem. Simulation results show that the proposed schemes achieve better EE performance compared with other benchmark schemes in both single and multiple IoT devices cases.
PRESTO: Probabilistic Cardinality Estimation for RDF Queries Based on Subgraph Overlapping
Venue: arXiv cs.DB 2018
Year: 2018

In query optimisation accurate cardinality estimation is essential for finding optimal query plans. It is especially challenging for RDF due to the lack of explicit schema and the excessive occurrence of joins in RDF queries. Existing approaches typically collect statistics based on the counts of triples and estimate the cardinality of a query as the product of its join components, where errors can accumulate even when the estimation of each component is accurate. As opposed to existing methods, we propose PRESTO, a cardinality estimation method that is based on the counts of subgraphs instead of triples and uses a probabilistic method to estimate cardinalities of RDF queries as a whole. PRESTO avoids some major issues of existing approaches and is able to accurately estimate arbitrary queries under a bound memory constraint. We evaluate PRESTO with YAGO and show that PRESTO is more accurate for both simple and complex queries.
Mobility Based Routing Protocol with MAC Collision Improvement in Vehicular Ad Hoc Networks
Venue: arXiv cs.OH 2018
Year: 2018

Intelligent transportation system attracts a great deal of research attention because it helps enhance traffic safety, improve driving experiences, and transportation efficiency. Vehicular Ad Hoc Network (VANET) supports wireless connections among vehicles and offers information exchange, thus significantly facilitating intelligent transportation systems. Since the vehicles move fast and often change lanes unpredictably, the network topology evolves rapidly in a random fashion, which imposes diverse challenges in routing protocol design over VANET. When it comes to the 5G era, the fulfilment of ultra low end-to-end delay and ultra high reliability becomes more crucial than ever. In this paper, we propose a novel routing protocol that incorporates mobility status and MAC layer channel contention information. The proposed routing protocol determines next hop by applying mobility information and MAC contention information which differs from existing greedy perimeter stateless routing (GPSR) protocol. Simulation results of the proposed routing protocol show its performance superiority over the existing approach.
HGum: Messaging Framework for Hardware Accelerators
Venue: arXiv cs.DC 2018
Year: 2018

Software messaging frameworks help avoid errors and reduce engineering efforts in building distributed systems by (1) providing an interface definition language (IDL) to specify precisely the structure of the message (i.e., the message schema), and (2) automatically generating the serialization and deserialization functions that transform user data structures into binary data for sending across the network and vice versa. Similarly, a hardware-accelerated system, which consists of host software and multiple FPGAs, could also benefit from a messaging framework to handle messages both between software and FPGA and also between different FPGAs. The key challenge for a hardware messaging framework is that it must be able to support large messages with complex schema while meeting critical constraints such as clock frequency, area, and throughput. In this paper, we present HGum, a messaging framework for hardware accelerators that meets all the above requirements. HGum is able to generate high-performance and low-cost hardware logic by employing a novel design that algorithmically parses the message schema to perform serialization and deserialization. Our evaluation of HGum shows that it not only significantly reduces engineering efforts but also generates hardware with comparable quality to manual implementation.
Passive Reaction Analysis for Grasp Stability
Venue: arXiv cs.RO 2018
Year: 2018

In this paper we focus on the following problem in multi-fingered robotic grasping: assuming that an external wrench is being applied to a grasped object, will the contact forces between the hand and the object, as well as the hand joints, respond in such a way as to preserve quasi-static equilibrium? In particular, we assume that there is no change in the joint torques being actively exerted by the motors; any change in contact forces and joint torques is due exclusively to passive effects arising in response to the external disturbance. Such passive effects include for example joints that are driven by highly geared motors (a common occurence in practice) and thus do not back drive in response to external torques. To account for non- linear phenomena encountered in such cases, and which existing methods do not consider, we formulate the problem as a mixed integer program used in the inner loop of an iterative solver. We present evidence showing that this formulation captures important effects for assessing the stability of a grasp employing some of the most commonly used actuation mechanisms.