arXiv subjects

Bo Hu

Publications and source records attributed to Bo Hu.

At least 109 records · Page 6Linked to original sources

arXiv2021

Recovery of Graph Signals from Sign Measurements

Sampling and interpolation have been extensively studied, in order to reconstruct or estimate the entire graph signal from the signal values on a subset of vertexes, of which most achievements are about continuous signals. While in a lot of signal processing tasks, signals are not fully observed, and only the signs of signals are available, for example a rating system may only provide several simple options. In this paper, the reconstruction of band-limited graph signals based on sign sampling is discussed and a greedy sampling strategy is proposed. The simulation experiments are presented, and the greedy sampling algorithm is compared with random sampling algorithm, which verify the validity of the proposed approach.

eess.SP↗

arXiv2021

The discovery of the largest gas filament in our Galaxy, or a new spiral arm?

Using the Five-hundred-meter Aperture Spherical radio Telescope (FAST), we detect a giant HI filamentary structure in the sky region of 307$.\!\!^{\circ}$7 $<$ $α$ $<$ 311$.\!\!^{\circ}$0 and 40$.\!\!^{\circ}$9 $<$ $δ$ $<$ 43$.\!\!^{\circ}$4. The structure has a velocity range of $-$170 km s$^{-1}$ to $-$130 km s$^{-1}$, and a mean velocity of $-$150 km s$^{-1}$, putting it to a Galactocentric distance of 22 kpc. The HI structure has a length of 1.1 kpc, which appears to be so far the furthest and largest giant filament in the Galaxy and we name it Cattail. Its mass is calculated to be 6.5 $\times$ 10$^4$ M$_{\odot}$ and the linear mass density is 60 M$_{\odot}$ pc$^{-1}$. Its width is 207 pc, corresponding to an aspect ratio of 5:1. Cattail possesses a small velocity gradient (0.02 km s$^{-1}$ pc$^{-1}$) along its major axis. Together with the HI4PI data, we find that Cattail could have an even larger length, up to 5 kpc. We also identify another new elongated structure to be the extension into the Galactic first quadrant of the Outer Scutum-Centaurus (OSC) arm, and Cattail appears to be located far behind the OSC. The question about how such a huge filament is produced at the extreme Galactic location remains open. Alternatively, Cattail might be part of a new arm beyond the OSC, though it is puzzling that the structure does not fully follow the warp of the Galactic disk.

astro-ph.GA↗

arXiv2021

Domain Generalization under Conditional and Label Shifts via Variational Bayesian Inference

In this work, we propose a domain generalization (DG) approach to learn on several labeled source domains and transfer knowledge to a target domain that is inaccessible in training. Considering the inherent conditional and label shifts, we would expect the alignment of $p(x|y)$ and $p(y)$. However, the widely used domain invariant feature learning (IFL) methods relies on aligning the marginal concept shift w.r.t. $p(x)$, which rests on an unrealistic assumption that $p(y)$ is invariant across domains. We thereby propose a novel variational Bayesian inference framework to enforce the conditional distribution alignment w.r.t. $p(x|y)$ via the prior distribution matching in a latent space, which also takes the marginal label shift w.r.t. $p(y)$ into consideration with the posterior alignment. Extensive experiments on various benchmarks demonstrate that our framework is robust to the label shift and the cross-domain accuracy is significantly improved, thereby achieving superior performance over the conventional IFL counterparts.

cs.LG↗

arXiv2021

Optical Mouse: 3D Mouse Pose From Single-View Video

We present a method to infer the 3D pose of mice, including the limbs and feet, from monocular videos. Many human clinical conditions and their corresponding animal models result in abnormal motion, and accurately measuring 3D motion at scale offers insights into health. The 3D poses improve classification of health-related attributes over 2D representations. The inferred poses are accurate enough to estimate stride length even when the feet are mostly occluded. This method could be applied as part of a continuous monitoring system to non-invasively measure animal health.

cs.CV↗

arXiv2021

Regularized Recovery by Multi-order Partial Hypergraph Total Variation

Capturing complex high-order interactions among data is an important task in many scenarios. A common way to model high-order interactions is to use hypergraphs whose topology can be mathematically represented by tensors. Existing methods use a fixed-order tensor to describe the topology of the whole hypergraph, which ignores the divergence of different-order interactions. In this work, we take this divergence into consideration, and propose a multi-order hypergraph Laplacian and the corresponding total variation. Taking this total variation as a regularization term, we can utilize the topology information contained by it to smooth the hypergraph signal. This can help distinguish different-order interactions and represent high-order interactions accurately.

cs.LG↗

arXiv2021

Performance Analysis for Correlated AoI and Energy Efficiency in Heterogeneous CR-IoT System

We consider a cognitive radio based Internet of Things (CR-IoT) system where the secondary IoT device (SD) accesses the licensed channel during the transmission vacancies of the primary IoT device (PD). We focus on the impact of the IoT devices' heterogeneous traffic pattern on the energy efficiency and on the age of information (AoI) performance of the SD. We first derive closed-form expressions of the energy efficiency and the average AoI, and subsequently explore their convexity and monotonicity to the transmit power. Following these characterizations, an optimal transmit power optimization algorithm (TPOA) is proposed for the SD to maximize the energy efficiency while maintaining the average AoI under a predefined threshold. Numerical results verify the different preferences of the SD toward different PD traffic patterns, and provides insights into the tradeoff between the energy efficiency and the average AoI.

cs.IT↗

arXiv2021

A Risk-Sensitive Task Offloading Strategy for Edge Computing in Industrial Internet of Things

Edge computing has become one of the key enablers for ultra-reliable and low-latency communications in the industrial Internet of Things in the fifth generation communication systems, and is also a promising technology in the future sixth generation communication systems. In this work, we consider the application of edge computing to smart factories for mission-critical task offloading through wireless links. In such scenarios, although high end-to-end delays from the generation to completion of tasks happen with low probability, they may incur severe casualties and property loss, and should be seriously treated. Inspired by the risk management theory widely used in finance, we adopt the Conditional Value at Risk to capture the tail of the delay distribution. An upper bound of the Conditional Value at Risk is derived through analysis of the queues both at the devices and the edge computing servers. We aim to find out the optimal offloading policy taking into consideration both the average and the worst case delay performance of the system. Given that the formulated optimization problem is a non-convex mixed integer non-linear programming problem, a decomposition into sub-problems is performed and a two-stage heuristic algorithm is proposed. Simulation results validate our analysis and indicate that the proposed algorithm can reduce the risk in both the queuing and end-to-end delay.

cs.IT↗

arXiv2021

Active Anomaly Detection with Switching Cost

The problem of detecting a single anomalous process among multiple independent processes is considered. Under a constraint on the number of processes that can be probed simultaneously, the decision maker should decide which processes to probe at each time and when to terminate the probing. Compared with previous work considering only the observation costs, the switching costs of switchings across processes also need to be taken into account in many practical scenarios. The objective is an active inference strategy that minimizes the Bayesian risk taking into account of the sample complexity, switching cost, as well as detection errors. Based on the framework of sequential design of experiments, we propose a low-complexity, low-switching deterministic policy for two scenarios where the total switching cost is negligible and the total switching cost is comparable to the total observation cost. We show that the proposed algorithm is asymptotically optimal in the former scenario and is order optimal in the latter scenario. Simulation results demonstrate strong performance in the finite regime for both scenarios.

eess.SP↗

arXiv2021

Subtype-aware Unsupervised Domain Adaptation for Medical Diagnosis

Recent advances in unsupervised domain adaptation (UDA) show that transferable prototypical learning presents a powerful means for class conditional alignment, which encourages the closeness of cross-domain class centroids. However, the cross-domain inner-class compactness and the underlying fine-grained subtype structure remained largely underexplored. In this work, we propose to adaptively carry out the fine-grained subtype-aware alignment by explicitly enforcing the class-wise separation and subtype-wise compactness with intermediate pseudo labels. Our key insight is that the unlabeled subtypes of a class can be divergent to one another with different conditional and label shifts, while inheriting the local proximity within a subtype. The cases of with or without the prior information on subtype numbers are investigated to discover the underlying subtype structure in an online fashion. The proposed subtype-aware dynamic UDA achieves promising results on medical diagnosis tasks.

cs.CV↗

arXiv2021

Energy-constrained Self-training for Unsupervised Domain Adaptation

Unsupervised domain adaptation (UDA) aims to transfer the knowledge on a labeled source domain distribution to perform well on an unlabeled target domain. Recently, the deep self-training involves an iterative process of predicting on the target domain and then taking the confident predictions as hard pseudo-labels for retraining. However, the pseudo-labels are usually unreliable, and easily leading to deviated solutions with propagated errors. In this paper, we resort to the energy-based model and constrain the training of the unlabeled target sample with the energy function minimization objective. It can be applied as a simple additional regularization. In this framework, it is possible to gain the benefits of the energy-based model, while retaining strong discriminative performance following a plug-and-play fashion. We deliver extensive experiments on the most popular and large scale UDA benchmarks of image classification as well as semantic segmentation to demonstrate its generality and effectiveness.

cs.CV↗

arXiv2020

Two-Timescale Resource Allocation for Cooperative D2D Communication: A Matching Game Approach

In this paper, we consider a cooperative device-todevice (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist the densified cellular network users (CUs) for transmission quality of service (QoS) improvement. The proposed system achieves a win-win situation, i.e. improving the spectrum efficiency of the CUs that cannot meet their rate requirement while providing spectrum access for D2D pairs. Unlike previous works, to reduce the overhead, we design a novel two-timescale resource allocation scheme, in which the pairing between CUs and D2D pairs is decided at a long timescale and transmission time 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 transmission time based on the instantaneous channel state information (CSI). We prove that the optimal policy is a threshold policy which can be achieved via binary search. Since CUs and D2D pairs are self-interested, they are paired only when they agree to cooperate mutually. Therefore, to study the cooperation behaviors of CUs and D2D pairs, we formulate the pairing problem as a matching game, based on the long-term payoff achieved by the optimal cooperation policy of each possible pairing. Furthermore, unlike most previous matching models in D2D networks, we allow transfer between CUs and D2D pairs to improve the performance. To solve the pairing problem, a distributed algorithm is proposed, which converges to an ε-stable matching. We show that there is a tradeoff between the optimality and the computational complexity of the algorithm. We also analyze the algorithm in terms of the robustness to the unilateral deviation of D2D pairs. Finally, the simulation results verify the efficiency of the proposed matching algorithm.

cs.IT↗

arXiv2020

DR 21 South Filament: a Parsec-sized Dense Gas Accretion Flow onto the DR 21 Massive Young Cluster

DR21 south filament (DR21SF) is a unique component of the giant network of filamentary molecular clouds in the north region of Cygnus X complex. Unlike the highly fragmented and star-forming active environment it resides, DR21SF exhibits a coherent profile in the column density map with very few star formation signposts, even though the previously reported linear density of the filament is an order of magnitude higher than the thermal stable threshold. We derive the size (3.6~pc by 0.13~pc), temperature (10 to 15~K), and mass (1048~\textit{M$_\odot$}) of DR21SF from Shanghai 65 m TianMa Radio Telescope (TMRT) observations of NH$_3$ (1, 1) and (2, 2) inversion lines in conjunction with the column density map from our previous work. Star-forming sites are identified along the filament where gas temperature excesses. We find clear gradients in radial velocity and intrinsic line-width along the spine of the filament. The gradients can be well interpreted with a scenario of an accretion flow feeding DR 21 at a mass transfer rate of $1.1 \times 10^{-3}$~\textit{M$_\odot$} yr$^{-1}$. Based on the analysis of its kinematic temperature, intrinsic line-width and mass distribution, we conclude that DR21SF is in an overall trans-critical status, which indicates an early evolutionary stage.

astro-ph.GA↗

arXiv2020

Sampling Policy Design for Tracking Time-Varying Graph Signals with Adaptive Budget Allocation

There have been many works that focus on the sampling set design for a static graph signal, but few for time-varying graph signals (GS). In this paper, we concentrate on how to select vertices to sample and how to allocate the sampling budget for a time-varying GS to achieve a minimal tracking error for the long-term. In the Kalman Filter (KF) framework, the problem of sampling policy design and budget allocation is formulated as an infinite horizon sequential decision process, in which the optimal sampling policy is obtained by Dynamic Programming (DP). Since the optimal policy is intractable, an approximate algorithm is proposed by truncating the infinite horizon. By introducing a new tool for analyzing the convexity or concavity of composite functions, we prove that the truncated problem is convex. Finally, we demonstrate the performance of the proposed approach through numerical experiments.

eess.SP↗

arXiv2020

Multiple outflows in the high-mass cluster forming region, G25.82-0.17

We present results of continuum and spectral line observations with ALMA and 22 GHz water (H$_2$O) maser observations using KaVA and VERA toward a high-mass star-forming region, G25.82-0.17. Multiple 1.3 mm continuum sources are revealed, indicating the presence of young stellar objects (YSOs) at different evolutionary stages, namely an ultra-compact HII region, G25.82-E, a high-mass young stellar object (HM-YSO), G25.82-W1, and starless cores, G25.82-W2 and G25.82-W3. Two SiO outflows, at N-S and SE-NW orientations, are identified. The CH$_3$OH 8$_{-1}$-7$_{0}$ E line, known to be a class I CH$_3$OH maser at 229 GHz is also detected showing a mixture of thermal and maser emission. Moreover, the H$_2$O masers are distributed in a region ~0.25" shifted from G25.82-W1. The CH$_3$OH 22$_{4}$-21$_{5}$ E line shows a compact ring-like structure at the position of G25.82-W1 with a velocity gradient, indicating a rotating disk or envelope. Assuming Keplerian rotation, the dynamical mass of G25.82-W1 is estimated to be $>$25 M$_{\odot}$ and the total mass of 20 M$_\odot$-84 M$_\odot$ is derived from the 1.3 mm continuum emission. The driving source of the N-S SiO outflow is G25.82-W1 while that of the SE-NW SiO outflow is uncertain. Detection of multiple high-mass starless$/$protostellar cores and candidates without low-mass cores implies that HM-YSOs could form in individual high-mass cores as predicted by the turbulent core accretion model. If this is the case, the high-mass star formation process in G25.82 would be consistent with a scaled-up version of low-mass star formation.

astro-ph.GA↗

arXiv2019

Fast Color-guided Depth Denoising for RGB-D Images by Graph Filtering

Depth images captured by off-the-shelf RGB-D cameras suffer from much stronger noise than color images. In this paper, we propose a method to denoise the depth images in RGB-D images by color-guided graph filtering. Our iterative method contains two components: color-guided similarity graph construction, and graph filtering on the depth signal. Implemented in graph vertex domain, filtering is accelerated as computation only occurs among neighboring vertices. Experimental results show that our method outperforms state-of-art depth image denoising methods significantly both on quality and efficiency.

eess.IV↗

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

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↗