Searcharxiv⌕ Search

arXiv subjects

Hao Chen

Publications and source records attributed to Hao Chen.

At least 1,225 records · Page 68Linked to original sources

Remote Sensing Image Change Detection with Transformers

Modern change detection (CD) has achieved remarkable success by the powerful discriminative ability of deep convolutions. However, high-resolution remote sensing CD remains challenging due to the complexity of objects in the scene. Objects with the same semantic concept may show distinct spectral characteristics at different times and spatial locations. Most recent CD pipelines using pure convolutions are still struggling to relate long-range concepts in space-time. Non-local self-attention approaches show promising performance via modeling dense relations among pixels, yet are computationally inefficient. Here, we propose a bitemporal image transformer (BIT) to efficiently and effectively model contexts within the spatial-temporal domain. Our intuition is that the high-level concepts of the change of interest can be represented by a few visual words, i.e., semantic tokens. To achieve this, we express the bitemporal image into a few tokens, and use a transformer encoder to model contexts in the compact token-based space-time. The learned context-rich tokens are then feedback to the pixel-space for refining the original features via a transformer decoder. We incorporate BIT in a deep feature differencing-based CD framework. Extensive experiments on three CD datasets demonstrate the effectiveness and efficiency of the proposed method. Notably, our BIT-based model significantly outperforms the purely convolutional baseline using only 3 times lower computational costs and model parameters. Based on a naive backbone (ResNet18) without sophisticated structures (e.g., FPN, UNet), our model surpasses several state-of-the-art CD methods, including better than four recent attention-based methods in terms of efficiency and accuracy. Our code is available at https://github.com/justchenhao/BIT\_CD.

cs.CV↗

OXnet: Omni-supervised Thoracic Disease Detection from Chest X-rays

Chest X-ray (CXR) is the most typical diagnostic X-ray examination for screening various thoracic diseases. Automatically localizing lesions from CXR is promising for alleviating radiologists' reading burden. However, CXR datasets are often with massive image-level annotations and scarce lesion-level annotations, and more often, without annotations. Thus far, unifying different supervision granularities to develop thoracic disease detection algorithms has not been comprehensively addressed. In this paper, we present OXnet, the first deep omni-supervised thoracic disease detection network to our best knowledge that uses as much available supervision as possible for CXR diagnosis. We first introduce supervised learning via a one-stage detection model. Then, we inject a global classification head to the detection model and propose dual attention alignment to guide the global gradient to the local detection branch, which enables learning lesion detection from image-level annotations. We also impose intra-class compactness and inter-class separability with global prototype alignment to further enhance the global information learning. Moreover, we leverage a soft focal loss to distill the soft pseudo-labels of unlabeled data generated by a teacher model. Extensive experiments on a large-scale chest X-ray dataset show the proposed OXnet outperforms competitive methods with significant margins. Further, we investigate omni-supervision under various annotation granularities and corroborate OXnet is a promising choice to mitigate the plight of annotation shortage for medical image diagnosis.

cs.CV↗

Dual-Consistency Semi-Supervised Learning with Uncertainty Quantification for COVID-19 Lesion Segmentation from CT Images

The novel coronavirus disease 2019 (COVID-19) characterized by atypical pneumonia has caused millions of deaths worldwide. Automatically segmenting lesions from chest Computed Tomography (CT) is a promising way to assist doctors in COVID-19 screening, treatment planning, and follow-up monitoring. However, voxel-wise annotations are extremely expert-demanding and scarce, especially when it comes to novel diseases, while an abundance of unlabeled data could be available. To tackle the challenge of limited annotations, in this paper, we propose an uncertainty-guided dual-consistency learning network (UDC-Net) for semi-supervised COVID-19 lesion segmentation from CT images. Specifically, we present a dual-consistency learning scheme that simultaneously imposes image transformation equivalence and feature perturbation invariance to effectively harness the knowledge from unlabeled data. We then quantify the segmentation uncertainty in two forms and employ them together to guide the consistency regularization for more reliable unsupervised learning. Extensive experiments showed that our proposed UDC-Net improves the fully supervised method by 6.3% in Dice and outperforms other competitive semi-supervised approaches by significant margins, demonstrating high potential in real-world clinical practice.

eess.IV↗

Some remarks on $X(6900)$

The analysis of the LHCb data on $X(6900)$ found in the di-$\jpsi$ system is performed using a momentum-dependent Flatté-like parameterization. The use of the pole counting rule and spectral density function sum rule give consistent conclusions that both confining states and molecular states are possible, or it is unable to distinguish the nature of $X(6900)$, if only the di-$\jpsi$ experimental data with current statistics are available. Nevertheless, we found that the lowest state in the di-$J/ψ$ system has very likely the same quantum numbers as $X(6900)$, and $X(6900)$ is probably not interpreted as a $J/ψ-ψ(2S)$ molecular state.

hep-ph↗

Gluing Karcher-Scherk saddle towers I: Triply periodic minimal surfaces

We construct minimal surfaces by gluing simply periodic Karcher--Scherk saddle towers along their wings. Such constructions were previously implemented assuming a horizontal reflection plane. We break this symmetry by prescribing phase differences between the saddle towers. It turns out that, in addition to the previously known horizontal balancing condition, the saddle towers must also be balanced under a subtle vertical interaction. This interaction vanishes in the presence of a horizontal reflection plane, hence was not perceived in previous works. Our construction will be presented in a series of papers. In this first paper of the series, we will explain the background of the project and establish the graph theoretical setup that will be useful for all papers in the series. The main task of the current paper is to glue saddle towers into triply periodic minimal surfaces (TPMSs). Our construction expands many previously known TPMSs into new 5-parameter families, therefore significantly advances our knowledge on the space of TPMSs.

math.DG↗

The generalized Klein-Gordon oscillator with position-dependent mass in a particular Gödel-type space-time

The relativistic quantum dynamics of the generalized Klein-Gordon (KG) oscillator having position-dependent mass in the Gödel-type space-time is investigated. We have presented the generalized KG oscillator in this space-time, and discussed the effect of Cornell potential and linear potential for our considered system. The modification from the parameters of position-dependent mass and characterizing the space-time for the energy spectrums are presented.

quant-ph↗

Aharonov-Bohm effect on the generalized Duffin-Kemmer-Petiau oscillator in the Som-Raychaudhuri space-time

The generalized Duffin-Kemmer-Petiau (DKP) oscillator with electromagnetic interactions in the curved space-times are investigated. We introduce firstly the generalized DKP oscillator in Som-Raychaudhuri space-time with Cornell potential. Then, we consider the electromagnetic interactions into the generalized DKP oscillator. The energy eigenvalues and eigenfunction of our problem are obtained. The effect from the parameters of space-time, the frequency of oscillator, the Cornell potential and the magnetic flux on the energy eigenvalues have been analyzed. We find a analogs effect for the bound states from the Aharonov-Bohm effect in our considered system.

quant-ph↗

DKP oscillator in the presence of a spinning cosmic string

We investigate the modification of gravitational fields generated by topological defects on a generalized Duffin-Kemmer-Petiau (DKP) oscillator for spin-0 particle under spinning cosmic string background. The generalized DKP oscillator equation under spinning cosmic string background is established, and the impact of the Cornell potential on the generalized DKP oscillator is presented. We give the influence of space-time and potential parameters on energy levels.

quant-ph↗

AMA-GCN: Adaptive Multi-layer Aggregation Graph Convolutional Network for Disease Prediction

Recently, Graph Convolutional Networks (GCNs) have proven to be a powerful mean for Computer Aided Diagnosis (CADx). This approach requires building a population graph to aggregate structural information, where the graph adjacency matrix represents the relationship between nodes. Until now, this adjacency matrix is usually defined manually based on phenotypic information. In this paper, we propose an encoder that automatically selects the appropriate phenotypic measures according to their spatial distribution, and uses the text similarity awareness mechanism to calculate the edge weights between nodes. The encoder can automatically construct the population graph using phenotypic measures which have a positive impact on the final results, and further realizes the fusion of multimodal information. In addition, a novel graph convolution network architecture using multi-layer aggregation mechanism is proposed. The structure can obtain deep structure information while suppressing over-smooth, and increase the similarity between the same type of nodes. Experimental results on two databases show that our method can significantly improve the diagnostic accuracy for Autism spectrum disorder and breast cancer, indicating its universality in leveraging multimodal data for disease prediction.

cs.AI↗

Learning to Compensate: A Deep Neural Network Framework for 5G Power Amplifier Compensation

Owing to the complicated characteristics of 5G communication system, designing RF components through mathematical modeling becomes a challenging obstacle. Moreover, such mathematical models need numerous manual adjustments for various specification requirements. In this paper, we present a learning-based framework to model and compensate Power Amplifiers (PAs) in 5G communication. In the proposed framework, Deep Neural Networks (DNNs) are used to learn the characteristics of the PAs, while, correspondent Digital Pre-Distortions (DPDs) are also learned to compensate for the nonlinear and memory effects of PAs. On top of the framework, we further propose two frequency domain losses to guide the learning process to better optimize the target, compared to naive time domain Mean Square Error (MSE). The proposed framework serves as a drop-in replacement for the conventional approach. The proposed approach achieves an average of 56.7% reduction of nonlinear and memory effects, which converts to an average of 16.3% improvement over a carefully-designed mathematical model, and even reaches 34% enhancement in severe distortion scenarios.

eess.SP↗

Joint Learning of Multiple Differential Networks with fMRI data for Brain Connectivity Alteration Detection

In this study we focus on the problem of joint learning of multiple differential networks with function Magnetic Resonance Imaging (fMRI) data sets from multiple research centers. As the research centers may use different scanners and imaging parameters, joint learning of differential networks with fMRI data from different centers may reflect the underlying mechanism of neurological diseases from different perspectives while capturing the common structures. We transform the task as a penalized logistic regression problem, and exploit sparse group Minimax Concave Penalty (gMCP) to induce common structures among multiple differential networks and the sparse structures of each differential network. To further enhance the empirical performance, we develop an ensemble-learning procedure. We conduct thorough simulation study to assess the finite-sample performance of the proposed method and compare with state-of-the-art alternatives. We apply the proposed method to analyze fMRI datasets related with Attention Deficit Hyperactivity Disorder from various research centers. The identified common hub nodes and differential interaction patterns coincides with the existing experimental studies.

stat.ME↗

Panoramic annular SLAM with loop closure and global optimization

In this paper, we propose panoramic annular simultaneous localization and mapping (PA-SLAM), a visual SLAM system based on panoramic annular lens. A hybrid point selection strategy is put forward in the tracking front-end, which ensures repeatability of keypoints and enables loop closure detection based on the bag-of-words approach. Every detected loop candidate is verified geometrically and the $Sim(3)$ relative pose constraint is estimated to perform pose graph optimization and global bundle adjustment in the back-end. A comprehensive set of experiments on real-world datasets demonstrates that the hybrid point selection strategy allows reliable loop closure detection, and the accumulated error and scale drift have been significantly reduced via global optimization, enabling PA-SLAM to reach state-of-the-art accuracy while maintaining high robustness and efficiency.

cs.RO↗

Non-Recursive Graph Convolutional Networks

Graph Convolutional Networks (GCNs) are powerful models for node representation learning tasks. However, the node representation in existing GCN models is usually generated by performing recursive neighborhood aggregation across multiple graph convolutional layers with certain sampling methods, which may lead to redundant feature mixing, needless information loss, and extensive computations. Therefore, in this paper, we propose a novel architecture named Non-Recursive Graph Convolutional Network (NRGCN) to improve both the training efficiency and the learning performance of GCNs in the context of node classification. Specifically, NRGCN proposes to represent different hops of neighbors for each node based on inner-layer aggregation and layer-independent sampling. In this way, each node can be directly represented by concatenating the information extracted independently from each hop of its neighbors thereby avoiding the recursive neighborhood expansion across layers. Moreover, the layer-independent sampling and aggregation can be precomputed before the model training, thus the training process can be accelerated considerably. Extensive experiments on benchmark datasets verify that our NRGCN outperforms the state-of-the-art GCN models, in terms of the node classification performance and reliability.

cs.LG↗

A Comprehensive Review for MRF and CRF Approaches in Pathology Image Analysis

Pathology image analysis is an essential procedure for clinical diagnosis of many diseases. To boost the accuracy and objectivity of detection, nowadays, an increasing number of computer-aided diagnosis (CAD) system is proposed. Among these methods, random field models play an indispensable role in improving the analysis performance. In this review, we present a comprehensive overview of pathology image analysis based on the markov random fields (MRFs) and conditional random fields (CRFs), which are two popular random field models. Firstly, we introduce the background of two random fields and pathology images. Secondly, we summarize the basic mathematical knowledge of MRFs and CRFs from modelling to optimization. Then, a thorough review of the recent research on the MRFs and CRFs of pathology images analysis is presented. Finally, we investigate the popular methodologies in the related works and discuss the method migration among CAD field.

cs.CV↗

Multi-intersection Traffic Optimisation: A Benchmark Dataset and a Strong Baseline

The control of traffic signals is fundamental and critical to alleviate traffic congestion in urban areas. However, it is challenging since traffic dynamics are complicated in real-world scenarios. Because of the high complexity of the optimisation problem for modelling the traffic, experimental settings of existing works are often inconsistent. Moreover, it is not trivial to control multiple intersections properly in real complex traffic scenarios due to its vast state and action space. Failing to take intersection topology relations into account also results in inferior solutions. To address these issues, in this work we carefully design our settings and propose a new dataset including both synthetic and real traffic data in more complex scenarios. Additionally, we propose a novel baseline model with strong performance. It is based on deep reinforcement learning with an encoder-decoder structure: an edge-weighted graph convolutional encoder to excavate multi-intersection relations; and an unified structure decoder to jointly model multiple junctions in a comprehensive manner, which significantly reduces the number of the model parameters. By doing so, the proposed model is able to effectively deal with the multi-intersection traffic optimisation problem. Models are trained/tested on both synthetic and real maps and traffic data with the Simulation of Urban Mobility (SUMO) simulator. Experimental results show that the proposed model surpasses multiple competitive methods.

eess.SY↗

ANT: Learning Accurate Network Throughput for Better Adaptive Video Streaming

Adaptive Bit Rate (ABR) decision plays a crucial role for ensuring satisfactory Quality of Experience (QoE) in video streaming applications, in which past network statistics are mainly leveraged for future network bandwidth prediction. However, most algorithms, either rules-based or learning-driven approaches, feed throughput traces or classified traces based on traditional statistics (i.e., mean/standard deviation) to drive ABR decision, leading to compromised performances in specific scenarios. Given the diverse network connections (e.g., WiFi, cellular and wired link) from time to time, this paper thus proposes to learn the ANT (a.k.a., Accurate Network Throughput) model to characterize the full spectrum of network throughput dynamics in the past for deriving the proper network condition associated with a specific cluster of network throughput segments (NTS). Each cluster of NTS is then used to generate a dedicated ABR model, by which we wish to better capture the network dynamics for diverse connections. We have integrated the ANT model with existing reinforcement learning (RL)-based ABR decision engine, where different ABR models are applied to respond to the accurate network sensing for better rate decision. Extensive experiment results show that our approach can significantly improve the user QoE by 65.5% and 31.3% respectively, compared with the state-of-the-art Pensive and Oboe, across a wide range of network scenarios.

cs.MM↗

A Normality Test for High-dimensional Data based on a Nearest Neighbor Approach

Many statistical methodologies for high-dimensional data assume the population is normal. Although a few multivariate normality tests have been proposed, to the best of our knowledge, none of them can properly control the type I error when the dimension is larger than the number of observations. In this work, we propose a novel nonparametric test that utilizes the nearest neighbor information. The proposed method guarantees the asymptotic type I error control under the high-dimensional setting. Simulation studies verify the empirical size performance of the proposed test when the dimension grows with the sample size and at the same time exhibit a superior power performance of the new test compared with alternative methods. We also illustrate our approach through two popularly used data sets in high-dimensional classification and clustering literatures where deviation from the normality assumption may lead to invalid conclusions.

stat.ME↗

Electronic Structure Examination on the Topological Properties of CaMnSb$_{2}$ by Angle-Resolved Photoemission Spectroscopy

We have carried out detailed high resolution ARPES measurements and band structure calculations to study the electronic structure of CaMnSb$_{2}$. The observed Fermi surface mainly consists of one hole pocket around $Γ$ point and one tiny hole pocket at Y point. Strong spectral weight accumulation along the $Γ$-X direction is observed on the hole-like Fermi surface around $Γ$ point, suggesting strong anisotropy of the density of states along the Fermi surface. The tiny hole pocket at Y point originates from an anisotropic Dirac-like band with the crossing point of the linear bands lying $\sim$ 10 meV above the Fermi level. These observations are in a good agreement with the band structure calculations. In addition, we observe additional features along the $Γ$-Y line that cannot be accounted for by the band structure calculations. Our results provide important information in understanding and exploration of novel properties in CaMnSb$_{2}$ and related materials.

cond-mat.mtrl-sci↗