Searcharxiv⌕ Search

arXiv subjects

Wei Feng

Publications and source records attributed to Wei Feng.

At least 271 records · Page 15Linked to original sources

Learning Guided Convolutional Network for Depth Completion

Dense depth perception is critical for autonomous driving and other robotics applications. However, modern LiDAR sensors only provide sparse depth measurement. It is thus necessary to complete the sparse LiDAR data, where a synchronized guidance RGB image is often used to facilitate this completion. Many neural networks have been designed for this task. However, they often na\"ıvely fuse the LiDAR data and RGB image information by performing feature concatenation or element-wise addition. Inspired by the guided image filtering, we design a novel guided network to predict kernel weights from the guidance image. These predicted kernels are then applied to extract the depth image features. In this way, our network generates content-dependent and spatially-variant kernels for multi-modal feature fusion. Dynamically generated spatially-variant kernels could lead to prohibitive GPU memory consumption and computation overhead. We further design a convolution factorization to reduce computation and memory consumption. The GPU memory reduction makes it possible for feature fusion to work in multi-stage scheme. We conduct comprehensive experiments to verify our method on real-world outdoor, indoor and synthetic datasets. Our method produces strong results. It outperforms state-of-the-art methods on the NYUv2 dataset and ranks 1st on the KITTI depth completion benchmark at the time of submission. It also presents strong generalization capability under different 3D point densities, various lighting and weather conditions as well as cross-dataset evaluations. The code will be released for reproduction.

cs.CV↗

Generation and controllable switching of superradiant and subradiant states in a 10-qubit superconducting circuit

Superradiance and subradiance concerning enhanced and inhibited collective radiation of an ensemble of atoms have been a central topic in quantum optics. However, precise generation and control of these states remain challenging. Here we deterministically generate up to 10-qubit superradiant and 8-qubit subradiant states, each containing a single excitation, in a superconducting quantum circuit with multiple qubits interconnected by a cavity resonator. The $\sqrt{N}$-scaling enhancement of the coupling strength between the superradiant states and the cavity is validated. By applying appropriate phase gate on each qubit, we are able to switch the single collective excitation between superradiant and subradiant states. While the subradiant states containing a single excitation are forbidden from emitting photons, we demonstrate that they can still absorb photons from the resonator. However, for even number of qubits, a singlet state with half of the qubits being excited can neither emit nor absorb photons, which is verified with 4 qubits. This study is a step forward in coherent control of collective radiation and has promising applications in quantum information processing.

quant-ph↗

Multiple Human Association between Top and Horizontal Views by Matching Subjects' Spatial Distributions

Video surveillance can be significantly enhanced by using both top-view data, e.g., those from drone-mounted cameras in the air, and horizontal-view data, e.g., those from wearable cameras on the ground. Collaborative analysis of different-view data can facilitate various kinds of applications, such as human tracking, person identification, and human activity recognition. However, for such collaborative analysis, the first step is to associate people, referred to as subjects in this paper, across these two views. This is a very challenging problem due to large human-appearance difference between top and horizontal views. In this paper, we present a new approach to address this problem by exploring and matching the subjects' spatial distributions between the two views. More specifically, on the top-view image, we model and match subjects' relative positions to the horizontal-view camera in both views and define a matching cost to decide the actual location of horizontal-view camera and its view angle in the top-view image. We collect a new dataset consisting of top-view and horizontal-view image pairs for performance evaluation and the experimental results show the effectiveness of the proposed method.

cs.CV↗

Experimental Evidence of the Topological Surface States in Mg3Bi2 Films Grown by Molecular Beam Epitaxy

Type-II nodal line semimetal (NLS) is a new quantum state hosting one-dimensional closed loops formed by the crossing of two bands which have the same sign in their slopes along the radial direction of the loop. According to the theoretical prediction, Mg3Bi2 is an ideal candidate for studying the type-II NLS by tuning its spin-orbit coupling (SOC). In this paper, high quality Mg3Bi2 films are grown by molecular beam epitaxy (MBE). By in-situ angle resolved photoemission spectroscopy (ARPES), a pair of surface resonance bands (SRBs) around Gamma point is clearly seen. It shows that Mg3Bi2 films grown by MBE is Mg(1)-terminated by comparing the ARPES data with the first principles calculations results. And, the temperature dependent weak anti-localization (WAL) effect in Mg3Bi2 films is observed under low magnetic field, which shows a clear two dimensional (2D) e-e scattering characteristics by fitting with the Hikami-Larkin-Nagaoka (HLN) model. Combining with ARPES, magneto-transport measurements and the first principles calculations, this work proves that Mg3Bi2 is a semimetal with topological surface states TSSs, which paves the way for Mg3Bi2 as an ideal materials platform for studying the exotic features of type-II nodal line semimetals (NLSs) and the topological phase transition by tuning its SOC.

cond-mat.mtrl-sci↗

Neural Consciousness Flow

The ability of reasoning beyond data fitting is substantial to deep learning systems in order to make a leap forward towards artificial general intelligence. A lot of efforts have been made to model neural-based reasoning as an iterative decision-making process based on recurrent networks and reinforcement learning. Instead, inspired by the consciousness prior proposed by Yoshua Bengio, we explore reasoning with the notion of attentive awareness from a cognitive perspective, and formulate it in the form of attentive message passing on graphs, called neural consciousness flow (NeuCFlow). Aiming to bridge the gap between deep learning systems and reasoning, we propose an attentive computation framework with a three-layer architecture, which consists of an unconsciousness flow layer, a consciousness flow layer, and an attention flow layer. We implement the NeuCFlow model with graph neural networks (GNNs) and conditional transition matrices. Our attentive computation greatly reduces the complexity of vanilla GNN-based methods, capable of running on large-scale graphs. We validate our model for knowledge graph reasoning by solving a series of knowledge base completion (KBC) tasks. The experimental results show NeuCFlow significantly outperforms previous state-of-the-art KBC methods, including the embedding-based and the path-based. The reproducible code can be found by the link below.

cs.AI↗

High-Efficiency Second Harmonic Generation of Low-Temporal-Coherent Light Pulse

The nonlinear frequency conversion of low-temporal-coherent light holds a variety of applications and has attracted considerable interest. However, its physical mechanism remains relatively unexplored, and the conversion efficiency and bandwidth are extremely insufficient. Here, considering the instantaneous broadband characteristic, we establish a model of second harmonic generation (SHG) of low-temporal-coherent pulse, and reveal its differences from the coherent conditions. It is found that the second harmonic (SH) of low-temporal-coherent light is produced by not only the degenerate SH processes but also crossed sum-frequency processes. On the basis of this, we propose a method for realizing low-temporal-coherent SHG with high efficiency and broad bandwidth, and experimentally demonstrate a conversion efficiency up to 70% with a bandwidth of 3.1 THz (2.9 nm centered at 528 nm). To the best of our knowledge, this is the highest efficiency and broadest bandwidth of low-temporal-coherent SHG, and its efficiency is almost the same with that of the narrowband coherent condition. Furthermore, the spectral evolution characteristics of the broadband low-temporal-coherent pulse in SHG process are revealed in experiments, that the SH power spectral density (PSD) is proportional to the self-convolution of the fundamental wave PSD, which is greatly different from that of the coherent process. Our research opens a door for the study of the low-coherent nonlinear optical processes.

physics.optics↗

Maritime Coverage Enhancement Using UAVs Coordinated with Hybrid Satellite-Terrestrial Networks

Due to its agile maneuverability, unmanned aerial vehicles (UAVs) have shown great promise for ondemand communications. In practice, UAV-aided aerial base stations are not separate. Instead, they rely on existing satellites/terrestrial systems for spectrum sharing and efficient backhaul. In this case, how to coordinate satellites, UAVs and terrestrial systems is still an open issue. In this paper, we deploy UAVs for coverage enhancement of a hybrid satellite-terrestrial maritime communication network. Under the typical composite channel model including both large-scale and small-scale fading, the UAV trajectory and in-flight transmit power are jointly optimized, subject to constraints on UAV kinematics, tolerable interference, backhaul, and the total energy of UAV for communications. Different from existing studies, only the location-dependent large-scale channel state information (CSI) is assumed available, because it is difficult to obtain the small-scale CSI before takeoff in practice, and the ship positions can be obtained via the dedicated maritime Automatic Identification System. The optimization problem is non-convex. We solve it by problem decomposition, successive convex optimization and bisection searching tools. Simulation results demonstrate that the UAV fits well with existing satellite and terrestrial systems, using the proposed optimization framework.

cs.IT↗

Exploiting the Shipping Lane Information for Energy-Efficient Maritime Communications

Energy efficiency is a crucial issue for maritime communications, due to the limitation of geographically available base station sites. Different from previous studies, we promote the energy efficiency by exploiting the specific characteristics of maritime channels and user mobility. Particularly, we utilize the shipping lane information to obtain the long-term position information of marine users, from which the large-scale channel state information is estimated. Based on that, the resource allocation is jointly optimized for all users and all time slots during the voyage, leading to a mixed 0-1 non-convex programming problem. We transform this problem into a convex one by means of variable substitution and time-sharing relaxation, and propose an iterative algorithm to solve it based on the Lagrangian dual decomposition method. Simulation results demonstrate that the proposed scheme can significantly reduce the power consumption compared with existing approaches, due to the global optimization over a much larger time span by utilizing the shipping lane information.

cs.IT↗

Turbo Learning Framework for Human-Object Interactions Recognition and Human Pose Estimation

Human-object interactions (HOI) recognition and pose estimation are two closely related tasks. Human pose is an essential cue for recognizing actions and localizing the interacted objects. Meanwhile, human action and their interacted objects' localizations provide guidance for pose estimation. In this paper, we propose a turbo learning framework to perform HOI recognition and pose estimation simultaneously. First, two modules are designed to enforce message passing between the tasks, i.e. pose aware HOI recognition module and HOI guided pose estimation module. Then, these two modules form a closed loop to utilize the complementary information iteratively, which can be trained in an end-to-end manner. The proposed method achieves the state-of-the-art performance on two public benchmarks including Verbs in COCO (V-COCO) and HICO-DET datasets.

cs.CV↗

Gradual partial-collapse theory for ideal nondemolition measurements of qubits in circuit QED

The conventional method of qubit measurements in circuit QED is employing the dispersive regime of qubit-cavity coupling, which results in an approximated scheme of quantum nondemolition (QND) readout. This scheme becomes problematic in the case of strong coupling and/or strong measurement drive, owing to the so-called Purcell effect. A recent proposal by virtue of longitudinal coupling suggests a new scheme to realize fast, high-fidelity, and {\it ideal QND} readout of qubit state. The aim of the present work is twofold: (i) In parallel to what has been done in the past years for the dispersive readout, we carry out the gradual partial-collapse theory for this recent scheme, in terms of both the quantum trajectory equation and quantum Bayesian approaches. The partial-collapse weak measurement theory is useful for such as the measurement-based feedback control and other quantum applications. (ii) In the physical aspect, we construct the joint qubit-plus-cavity entangled state under continuous measurement and present a comprehensive analysis for the quantum efficiency,qubit-state purity, and signal-to-noise ratio in the output currents. The combination of the joint state and the quantum Bayesian rule provides a generalized scheme of cavity reset associated with the longitudinal coupling, which can restore the qubit to a quantum pure state from entanglement with the cavity states, and thus benefits the successive partial-collapse measurements after qubit rotations.

quant-ph↗

Estimation of parameters in circuit QED by continuous quantum measurement

Designing high-precision and efficient schemes is of crucial importance for quantum parameter estimation in practice. The estimation scheme based on continuous quantum measurement is one possible type of this, which looks also the most natural choice in case such as continuous dynamical process. In this work we specify the study to the stat-of-the-art superconducting circuit quantum-electrodynamics (QED) system, where the high-quality continuous measurement has been extensively exploited in the past decade. Within the framework of Bayesian estimation and particularly using the quantum Bayesian rule in circuit QED, we numerically simulate the likelihood function as estimator for the Rabi frequency of qubit oscillation. We find that, by proper design of the interaction strength of measurement, the estimate precision can scale with the measurement time beyond the standard quantum limit, which is usually assumed for this type of continuous measurement since no more special quantum resource is involved. We understand this remarkable result by quantum correlation in time between the output signals, and simulate the effect of quantum efficiency of the measurement on the precision scaling behavior.

quant-ph↗

A Graph Computation based Sequential Power Flow Calculation for Large-Scale ACDC Systems

This paper proposes a graph computation based sequential power flow calculation method for Line Commutated Converter (LCC) based large-scale AC/DC systems to achieve a high computing performance. Based on the graph theory, the complex AC/DC system is first converted to a graph model and stored in a graph database. Then, the hybrid system is divided into several isolated areas with graph partition algorithm by decoupling AC and DC networks. Thus, the power flow analysis can be executed in parallel for each independent area with the new selected slack buses. Furthermore, for each area, the node-based parallel computing (NPC) and hierarchical parallel computing (HPC) used in graph computation are employed to speed up fast decoupled power flow (FDPF). Comprehensive case studies on the IEEE 300-bus, polished South Carolina 12,000-bus system and a China 11,119-bus system are performed to demonstrate the accuracy and efficiency of the proposed method

cs.DC↗

Graph Computing based Distributed Fast Decoupled Power Flow Analysis

Power flow analysis plays a fundamental and critical role in the energy management system (EMS). It is required to well accommodate large and complex power system. To achieve a high performance and accurate power flow analysis, a graph computing based distributed power flow analysis approach is proposed in this paper. Firstly, a power system network is divided into multiple areas. Slack buses are selected for each area and, at each SCADA sampling period, the inter-area transmission line power flows are equivalently allocated as extra load injections to corresponding buses. Then, the system network is converted into multiple independent areas. In this way, the power flow analysis could be conducted in parallel for each area and the solved system states could be guaranteed without compromise of accuracy. Besides, for each area, graph computing based fast decoupled power flow (FDPF) is employed to quickly analyze system states. IEEE 118-bus system and MP 10790-bus system are employed to verify the results accuracy and present the promising computation performance of the proposed approach.

cs.DC↗

Backprop-Q: Generalized Backpropagation for Stochastic Computation Graphs

In real-world scenarios, it is appealing to learn a model carrying out stochastic operations internally, known as stochastic computation graphs (SCGs), rather than learning a deterministic mapping. However, standard backpropagation is not applicable to SCGs. We attempt to address this issue from the angle of cost propagation, with local surrogate costs, called Q-functions, constructed and learned for each stochastic node in an SCG. Then, the SCG can be trained based on these surrogate costs using standard backpropagation. We propose the entire framework as a solution to generalize backpropagation for SCGs, which resembles an actor-critic architecture but based on a graph. For broad applicability, we study a variety of SCG structures from one cost to multiple costs. We utilize recent advances in reinforcement learning (RL) and variational Bayes (VB), such as off-policy critic learning and unbiased-and-low-variance gradient estimation, and review them in the context of SCGs. The generalized backpropagation extends transported learning signals beyond gradients between stochastic nodes while preserving the benefit of backpropagating gradients through deterministic nodes. Experimental suggestions and concerns are listed to help design and test any specific model using this framework.

cs.LG↗

Modeling Attention Flow on Graphs

Real-world scenarios demand reasoning about process, more than final outcome prediction, to discover latent causal chains and better understand complex systems. It requires the learning algorithms to offer both accurate predictions and clear interpretations. We design a set of trajectory reasoning tasks on graphs with only the source and the destination observed. We present the attention flow mechanism to explicitly model the reasoning process, leveraging the relational inductive biases by basing our models on graph networks. We study the way attention flow can effectively act on the underlying information flow implemented by message passing. Experiments demonstrate that the attention flow driven by and interacting with graph networks can provide higher accuracy in prediction and better interpretation for trajectory reasoning.

cs.AI↗

Object Detection with Mask-based Feature Encoding

Region-based Convolutional Neural Networks (R-CNNs) have achieved great success in the field of object detection. The existing R-CNNs usually divide a Region-of-Interest (ROI) into grids, and then localize objects by utilizing the spatial information reflected by the relative position of each grid in the ROI. In this paper, we propose a novel feature-encoding approach, where spatial information is represented through the spatial distributions of visual patterns. In particular, we design a Mask Weight Network (MWN) to learn a set of masks and then apply channel-wise masking operations to ROI feature map, followed by a global pooling and a cheap fully-connected layer. We integrate the newly designed feature encoder into the Faster R-CNN architecture. The resulting new Faster R-CNNs can preserve the object-detection accuracy of the standard Faster R-CNNs by using substantially fewer parameters. Compared to R-FCNs using state-of-art PS ROI pooling and deformable PS ROI pooling, the new Faster R-CNNs can produce higher object-detection accuracy with good run-time efficiency. We also show that a specifically designed and learned MWN can capture global contextual information and further improve the object-detection accuracy. Validation experiments are conducted on both PASCAL VOC and MS COCO datasets.

cs.CV↗

Optimum Fairness for Non-Orthogonal Multiple Access

This paper focuses on the fairness issue in non-orthogonal multiple access (NOMA) and investigates the optimization problem that maximizes the worst user's achievable rate. Unlike previous studies, we derive a closed-form expression for the optimal value and solution, which are related to Perron-Frobenius eigenvalue and eigenvector of a defined positive matrix. On this basis, we propose an iterative algorithm to compute the optimal solution, which has linear convergence and requires only about half iterations of the classical bisection method.

cs.IT↗

Synthesis of antisymmetric spin exchange interaction and entanglement generation with chiral spin states in a superconducting circuit

We have synthesized the anti-symmetric spin exchange interaction (ASI), which is also called the Dzyaloshinskii-Moriya interaction, in a superconducting circuit containing five superconducting qubits connected to a bus resonator, by periodically modulating the transition frequencies of the qubits with different modulation phases. This allows us to show the chiral spin dynamics in three-, four- and five-spin clusters. We also demonstrate a three-spin chiral logic gate and entangle up to five qubits in Greenberger-Horne-Zeilinger states. Our results pave the way for quantum simulation of magnetism with ASI and quantum computation with chiral spin states.

quant-ph↗