arXiv subjects

Hui Feng

Publications and source records attributed to Hui Feng.

53 records · Page 3Linked to original sources

arXiv2019

On Critical Sampling of Time-Vertex Graph Signals

Joint time-vertex graph signals are pervasive in real-world. This paper focuses on the fundamental problem of sampling and reconstruction of joint time-vertex graph signals. We prove the existence and the necessary condition of a critical sampling set using minimum number of samples in time and graph domain respectively. The theory proposed in this paper suggests to assign heterogeneous sampling pattern for each node in a network under the constraint of minimum resources. An efficient algorithm is also provided to construct a critical sampling set.

eess.SP↗

arXiv2019

Toward Packet Routing with Fully-distributed Multi-agent Deep Reinforcement Learning

Packet routing is one of the fundamental problems in computer networks in which a router determines the next-hop of each packet in the queue to get it as quickly as possible to its destination. Reinforcement learning (RL) has been introduced to design autonomous packet routing policies with local information of stochastic packet arrival and service. However, the curse of dimensionality of RL prohibits the more comprehensive representation of dynamic network states, thus limiting its potential benefit. In this paper, we propose a novel packet routing framework based on \emph{multi-agent} deep reinforcement learning (DRL) in which each router possess an \emph{independent} LSTM recurrent neural network for training and decision making in a \emph{fully distributed} environment. The LSTM recurrent neural network extracts routing features from rich information regarding backlogged packets and past actions, and effectively approximates the value function of Q-learning. We further allow each route to communicate periodically with direct neighbors so that a broader view of network state can be incorporated. Experimental results manifest that our multi-agent DRL policy can strike the delicate balance between congestion-aware and shortest routes, and significantly reduce the packet delivery time in general network topologies compared with its counterparts.

cs.NI↗

arXiv2019

OD-GCN: Object Detection Boosted by Knowledge GCN

Classical CNN based object detection methods only extract the objects' image features, but do not consider the high-level relationship among objects in context. In this article, the graph convolutional networks (GCN) is integrated into the object detection framework to exploit the benefit of category relationship among objects, which is able to provide extra confidence for any pre-trained object detection model in our framework. In experiments, we test several popular base detection models on COCO dataset. The results show promising improvement on mAP by 1-5pp. In addition, visualized analysis reveals the benchmark improvement is quite reasonable in human's opinion.

cs.CV↗

arXiv2019

Matching Based Two-Timescale Resource Allocation for Cooperative D2D Communication

We consider a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist cellular users (CUs) in exchange for the opportunities to use the licensed spectrum. To reduce the overhead, we propose a novel two-timescale resource allocation scheme, in which the pairing between CUs and D2D pairs is decided at a long timescale and time allocation factor for CU and D2D pair is determined at a short timescale. Specifically, to characterize the long-term payoff of each potential CU-D2D pair, we investigate the optimal cooperation policy to decide the time allocation factor based on the instantaneous channel state information (CSI). We prove that the optimal policy is a threshold policy. Since CUs and D2D pairs are self-interested, they are paired only when they agree to cooperate mutually. Therefore, to study the behaviors of CUs and D2D pairs, we formulate the pairing problem as a matching game, based on the long-term payoff of each possible pairing. Furthermore, unlike most previous matching model in D2D networks, we allow transfer between CUs and D2D pairs to improve the performance. Besides, we propose an algorithm, which converges to an epsilon-stable matching.

cs.IT↗

arXiv2019

Bayesian Design of Sampling Set for Bandlimited Graph Signals

The design of sampling set (DoS) for bandlimited graph signals (GS) has been extensively studied in recent years, but few of them exploit the benefits of the stochastic prior of GS. In this work, we introduce the optimization framework for Bayesian DoS of bandlimited GS. We also illustrate how the choice of different sampling sets affects the estimation error and how the prior knowledge influences the result of DoS compared with the non-Bayesian DoS by the aid of analyzing Gershgorin discs of error metric matrix. Finally, based on our analysis, we propose a heuristic algorithm for DoS to avoid solving the optimization problem directly.

eess.SP↗

arXiv2019

Learning for Matching Game in Cooperative D2D Communication with Incomplete Information

This paper considers a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist cellular users (CUs) in exchange for the opportunities to use licensed spectrum. Based on the interaction of each D2D pair and each CU, we formulate the pairing problem between multiple cues and multiple D2D pairs as a one-to-one matching game. Unlike most existing works, we consider a realistic scenario with incomplete channel information. Thus, each CU lacks enough information to establish its preference over D2D pairs. Therefore, traditional matching algorithms are not suitable for our scenario. To this end, we convert the matching game to an equivalent non-cooperative game, and then propose a novel learning algorithm, which converges to a stable matching.

cs.IT↗

arXiv2019

Observation of multi-component atomic Schrödinger cat states of up to 20 qubits

We report on deterministic generation of 18-qubit genuinely entangled Greenberger-Horne-Zeilinger (GHZ) state and multi-component atomic Schrödinger cat states of up to 20 qubits on a quantum processor, which features 20 superconducting qubits interconnected by a bus resonator. By engineering a one-axis twisting Hamiltonian enabled by the resonator-mediated interactions, the system of qubits initialized coherently evolves to an over-squeezed, non-Gaussian regime, where atomic Schrödinger cat states, i.e., superpositions of atomic coherent states including GHZ state, appear at specific time intervals in excellent agreement with theory. With high controllability, we are able to take snapshots of the dynamics by plotting quasidistribution $Q$-functions of the 20-qubit atomic cat states, and globally characterize the 18-qubit GHZ state which yields a fidelity of $0.525\pm0.005$ confirming genuine eighteen-partite entanglement. Our results demonstrate the largest entanglement controllably created so far in solid state architectures, and the process of generating and detecting multipartite entanglement may promise applications in practical quantum metrology, quantum information processing and quantum computation.

quant-ph↗

arXiv2019

Active Sampling for Approximately Bandlimited Graph Signals

This paper investigates the active sampling for estimation of approximately bandlimited graph signals. With the assistance of a graph filter, an approximately bandlimited graph signal can be formulated by a Gaussian random field over the graph. In contrast to offline sampling set design methods which usually rely on accurate prior knowledge about the model, unknown parameters in signal and noise distribution are allowed in the proposed active sampling algorithm. The active sampling process is divided into two alternating stages: unknown parameters are first estimated by Expectation Maximization (EM), with which the next node to sample is selected based on historical observations according to predictive uncertainty. Validated by simulations compared with related approaches, the proposed algorithm can reduce the sample size to reach a certain estimation accuracy.

eess.SP↗

arXiv2018

A Cascaded Channel-Power Allocation for D2D Underlaid Cellular Networks Using Matching Theory

We consider a device-to-device (D2D) underlaid cellular network, where each cellular channel can be shared by several D2D pairs and only one channel can be allocated to each D2D pair. We try to maximize the sum rate of D2D pairs while limiting the interference to cellular links. Due to the lack of global information in large scale networks, resource allocation is hard to be implemented in a centralized way. Therefore, we design a novel distributed resource allocation scheme which is based on local information and requires little coordination and communication between D2D pairs. Specifically, we decompose the original problem into two cascaded subproblems, namely channel allocation and power control. The cascaded structure of our scheme enables us to cope with them respectively. Then a two-stage algorithm is proposed. In the first stage, we model the channel allocation problem as a many-to-one matching with externalities and try to find a strongly swap-stable matching. In the second stage, we adopt a pricing mechanism and develop an iterative two-step algorithm to solve the power control problem.

cs.IT↗

arXiv2018

Robust Beamforming for Downlink 3D-MIMO Systems with $l_1$-norm Bounded CSI Uncertainty

In this paper, a novel robust beamforming scheme is proposed in three dimensional multi-input multi-output (3D-MIMO) systems. As one of the typical deployments of massive MIMO, a 3D-MIMO system owns sparse channels in angular domain. Thus, various of sparse channel estimation algorithms produce sparse channel estimation errors which can be utilized to narrow down the perturbation region of imperfect CSI. We investigate a $l_1$-norm bounded channel uncertainty model for the robust beamforming problems, which captures the sparse nature of channel errors. Compared with the conventional spherical uncertainty, we prove that the scheme with $l_1$-norm bounded uncertainty consumes less beamforming power with the same signal to interference and noise ratio (SINR) thresholds. The proposed scheme is reformulated as a second-order cone programming (SOCP) and simulation results verify the effectiveness of our algorithm.

eess.SP↗

arXiv2018

Fine-grained visual recognition with salient feature detection

Computer vision based fine-grained recognition has received great attention in recent years. Existing works focus on discriminative part localization and feature learning. In this paper, to improve the performance of fine-grained recognition, we try to precisely locate as many salient parts of object as possible at first. Then, we figure out the classification probability that can be obtained by using separate parts for object classification. Finally, through extracting efficient features from each part and combining them, then feeding to a classifier for recognition, an improved accuracy over state-of-art algorithms has been obtained on CUB200-2011 bird dataset.

cs.CV↗

arXiv2018

Object Activity Scene Description, Construction and Recognition

Action recognition is a critical task for social robots to meaningfully engage with their environment. 3D human skeleton-based action recognition is an attractive research area in recent years. Although, the existing approaches are good at action recognition, it is a great challenge to recognize a group of actions in an activity scene. To tackle this problem, at first, we partition the scene into several primitive actions (PAs) based upon motion attention mechanism. Then, the primitive actions are described by the trajectory vectors of corresponding joints. After that, motivated by text classification based on word embedding, we employ convolution neural network (CNN) to recognize activity scenes by considering motion of joints as "word" of activity. The experimental results on the scenes of human activity dataset show the efficiency of the proposed approach.

cs.CV↗

arXiv2017

Design of Sampling Set for Bandlimited Graph Signal Estimation

It is of particular interest to reconstruct or estimate bandlimited graph signals, which are smoothly varying signals defined over graphs, from partial noisy measurements. However, choosing an optimal subset of nodes to sample is NP-hard. We formularize the problem as the experimental design of a linear regression model if we allow multiple measurements on a single node. By relaxing it to a convex optimization problem, we get the proportion of sample for each node given the budget of total sample size. Then, we use a probabilistic quantization to get the number of each node to be sampled. Moreover, we analyze how the sample size influences whether our object function is well-defined by perturbation analysis. Finally, we demonstrate the performance of the proposed approach through various numerical experiments.

eess.SP↗

arXiv2017

Traffic-Aware Transmission Mode Selection in D2D-enabled Cellular Networks with Token System

We consider a D2D-enabled cellular network where user equipments (UEs) owned by rational users are incentivized to form D2D pairs using tokens. They exchange tokens electronically to "buy" and "sell" D2D services. Meanwhile the devices have the ability to choose the transmission mode, i.e. receiving data via cellular links or D2D links. Thus taking the different benefits brought by diverse traffic types as a prior, the UEs can utilize their tokens more efficiently via transmission mode selection. In this paper, the optimal transmission mode selection strategy as well as token collection policy are investigated to maximize the long-term utility in the dynamic network environment. The optimal policy is proved to be a threshold strategy, and the thresholds have a monotonicity property. Numerical simulations verify our observations and the gain from transmission mode selection is observed.

cs.IT↗

arXiv2016

HISTORY: An Efficient and Robust Algorithm for Noisy 1-bit Compressed Sensing

We consider the problem of sparse signal recovery from 1-bit measurements. Due to the noise present in the acquisition and transmission process, some quantized bits may be flipped to their opposite states. These sign flips may result in severe performance degradation. In this study, a novel algorithm, termed HISTORY, is proposed. It consists of Hamming support detection and coefficients recovery. The HISTORY algorithm has high recovery accuracy and is robust to strong measurement noise. Numerical results are provided to demonstrate the effectiveness and superiority of the proposed algorithm.

cs.IT↗

arXiv2016

Modeling QoE of Video Streaming in Wireless Networks with Large-Scale Measurement of User Behavior

Unraveling quality of experience (QoE) of video streaming is very challenging in bandwidth shared wireless networks. It is unclear how QoE metrics such as starvation probability and buffering time interact with dynamics of streaming traffic load. In this paper, we collect view records from one of the largest streaming providers in China over two weeks and perform an in-depth measurement study on flow arrival and viewing time that shed light on the real traffic pattern. Our most important observation is that the viewing time of streaming users fits a hyper-exponential distribution quite well. This implies that all the views can be categorized into two classes, short and long views with separated time scales. We then map the measured traffic pattern to bandwidth shared cellular networks and propose an analytical framework to compute the closed-form starvation probability on the basis of ordinary differential equations (ODEs). Our framework can be naturally extended to investigate practical issues including the progressive downloading and the finite video duration. Extensive trace-driven simulations validate the accuracy of our models. Our study reveals that the starvation metrics of the short and long views possess different sensitivities to the scheduling priority at base station. Hence, a better QoE tradeoff between the short and long views has a potential to be leveraged by offering them different scheduling weights. The flow differentiation involves tremendous technical and non-technical challenges because video content is owned by content providers but not the network operators and the viewing time of each session is unknown beforehand. To overcome these difficulties, we propose an online Bayesian approach to infer the viewing time of each incoming flow with the "least" information from content providers.

cs.NI↗

arXiv2016

Inferring topologies via driving-based generalized synchronization of two-layer networks

The interaction topology among the constituents of a complex network plays a crucial role in the network's evolutionary mechanisms and functional behaviors. However, some network topologies are usually unknown or uncertain. Meanwhile, coupling delay are ubiquitous in various man-made and natural networks. Hence, it is necessary to gain knowledge of the whole or partial topology of a complex dynamical network by taking into consideration communication delay. In this paper, topology identification of complex dynamical networks is investigated via generalized synchronization of a two-layer network. Particularly, based on the LaSalle-type invariance principle of stochastic differential delay equations, an adaptive control technique is proposed by constructing an auxiliary layer and designing proper control input and updating laws so that the unknown topology can be recovered upon successful generalized synchronization. Numerical simulations are provided to illustrate the effectiveness of the proposed method. The technique provides a certain theoretical basis for topology inference of complex networks. In particular, when the considered network is composed of systems with high-dimension or complicated dynamics, a simpler response layer can be constructed, which is conducive to circuit design. Moreover, it is practical to take into consideration perturbations caused by control input. Finally, the method is applicable to infer topology of a subnetwork embedded within a complex system and locate hidden sources. We hope the results can provide basic insight into further research endeavors on understanding practical and economical topology inference of networks.

nlin.CD↗