arXiv subjects

Hong Zhang

Publications and source records attributed to Hong Zhang.

At least 199 records · Page 11Linked to original sources

arXiv2022

Comparison of dynamical and kinematic reference frames via pulsar positions from timing, Gaia, and interferometric astrometry

Pulsars are special objects whose positions can be determined independently from timing, radio interferometric, and Gaia astrometry at sub-milliarcsecond (mas) precision; thus, they provide a unique way to monitor the link between dynamical and kinematic reference frames. We aimed to assess the orientation consistency between the dynamical reference frame represented by the planetary ephemeris and the kinematic reference frames constructed by Gaia and VLBI through pulsar positions. We identified 49 pulsars in Gaia Data Release 3 and 62 pulsars with very long baseline interferometry (VLBI) positions from the PSR$π$ and MSPSR$π$ projects and searched for the published timing solutions of these pulsars. We then compared pulsar positions measured by timing, VLBI, and Gaia to estimate the orientation offsets of the ephemeris frames with respect to the Gaia and VLBI reference frames by iterative fitting. We found orientation offsets of $\sim$10 mas in the DE200 frame with respect to the Gaia and VLBI frame. Our results depend strongly on the subset used in the comparison and could be biased by underestimated errors in the archival timing data, reflecting the limitation of using the literature timing solutions to determine the frame rotation.

astro-ph.IM↗

arXiv2022

RAPS: A Novel Few-Shot Relation Extraction Pipeline with Query-Information Guided Attention and Adaptive Prototype Fusion

Few-shot relation extraction (FSRE) aims at recognizing unseen relations by learning with merely a handful of annotated instances. To generalize to new relations more effectively, this paper proposes a novel pipeline for the FSRE task based on queRy-information guided Attention and adaptive Prototype fuSion, namely RAPS. Specifically, RAPS first derives the relation prototype by the query-information guided attention module, which exploits rich interactive information between the support instances and the query instances, in order to obtain more accurate initial prototype representations. Then RAPS elaborately combines the derived initial prototype with the relation information by the adaptive prototype fusion mechanism to get the integrated prototype for both train and prediction. Experiments on the benchmark dataset FewRel 1.0 show a significant improvement of our method against state-of-the-art methods.

cs.CL↗

arXiv2022

Novel 3D Scene Understanding Applications From Recurrence in a Single Image

We demonstrate the utility of recurring pattern discovery from a single image for spatial understanding of a 3D scene in terms of (1) vanishing point detection, (2) hypothesizing 3D translation symmetry and (3) counting the number of RP instances in the image. Furthermore, we illustrate the feasibility of leveraging RP discovery output to form a more precise, quantitative text description of the scene. Our quantitative evaluations on a new 1K+ Recurring Pattern (RP) benchmark with diverse variations show that visual perception of recurrence from one single view leads to scene understanding outcomes that are as good as or better than existing supervised methods and/or unsupervised methods that use millions of images.

cs.CV↗

arXiv2022

Low-rank Latent Matrix-factor Prediction Modeling for Generalized High-dimensional Matrix-variate Regression

Motivated by diagnosing the COVID-19 disease using 2D image biomarkers from computed tomography (CT) scans, we propose a novel latent matrix-factor regression model to predict responses that may come from an exponential distribution family, where covariates include high-dimensional matrix-variate biomarkers. A latent generalized matrix regression (LaGMaR) is formulated, where the latent predictor is a low-dimensional matrix factor score extracted from the low-rank signal of the matrix variate through a cutting-edge matrix factor model. Unlike the general spirit of penalizing vectorization plus the necessity of tuning parameters in the literature, instead, our prediction modeling in LaGMaR conducts dimension reduction that respects the geometry characteristic of intrinsic two-dimensional structure of the matrix covariate and thus avoids iteration. This greatly relieves the computation burden, and meanwhile maintains structural information so that the latent matrix factor feature can perfectly replace the intractable matrix-variate owing to high-dimensionality. The estimation procedure of LaGMaR is subtly derived by transforming the bilinear form matrix factor model onto a high-dimensional vector factor model, so that the method of principle components can be applied. We establish bilinear-form consistency of the estimated matrix coefficient of the latent predictor and consistency of prediction. The proposed approach can be implemented conveniently. Through simulation experiments, prediction capability of LaGMaR is shown to outperform existing penalized methods under diverse scenarios of generalized matrix regressions. Through the application to a real COVID-19 dataset, the proposed approach is shown to predict efficiently the COVID-19.

stat.AP↗

arXiv2022

NDD: A 3D Point Cloud Descriptor Based on Normal Distribution for Loop Closure Detection

Loop closure detection is a key technology for long-term robot navigation in complex environments. In this paper, we present a global descriptor, named Normal Distribution Descriptor (NDD), for 3D point cloud loop closure detection. The descriptor encodes both the probability density score and entropy of a point cloud as the descriptor. We also propose a fast rotation alignment process and use correlation coefficient as the similarity between descriptors. Experimental results show that our approach outperforms the state-of-the-art point cloud descriptors in both accuracy and efficency. The source code is available and can be integrated into existing LiDAR odometry and mapping (LOAM) systems.

cs.RO↗

arXiv2022

Prognostic Significance of Tumor-Infiltrating Lymphocytes Using Deep Learning on Pathology Images in Colorectal Cancers

Purpose Tumor-infiltrating lymphocytes (TILs) have significant prognostic values in cancers. However, very few automated, deep-learning-based TIL scoring algorithms have been developed for colorectal cancers (CRC). Methods We developed an automated, multiscale LinkNet workflow for quantifying cellular-level TILs for CRC tumors using H&E-stained images. The predictive performance of the automatic TIL scores (TIL) for disease progression and overall survival was evaluate using two international datasets, including 554 CRC patients from The Cancer Genome Atlas (TCGA) and 1130 CRC patients from Molecular and Cellular Oncology (MCO). Results The LinkNet model provided an outstanding precision (0.9508), recall (0.9185), and overall F1 score (0.9347). Clear dose-response relationships were observed between TILs and risk of disease progression or death decreased in both TCGA and MCO cohorts. Both univariate and multivariate Cox regression analyses for the TCGA data demonstrated that patients with high TILs had significant (approx. 75%) reduction of risk for disease progression. In both MCO and TCGA studies, the TIL-high group was significantly associated with improved overall survival in univariate analysis (30% and 54% reduction in risk, respectively). However, potential confounding was observed in the MCO dataset. The favorable effects of high TILs were consistently observed in different subgroups according to know risk factors. Conclusion A deep-learning workflow for automatic TIL quantification based on LinkNet was successfully developed.

q-bio.QM↗

arXiv2022

Colorectal cancer survival prediction using deep distribution based multiple-instance learning

Several deep learning algorithms have been developed to predict survival of cancer patients using whole slide images (WSIs).However, identification of image phenotypes within the WSIs that are relevant to patient survival and disease progression is difficult for both clinicians, and deep learning algorithms. Most deep learning based Multiple Instance Learning (MIL) algorithms for survival prediction use either top instances (e.g., maxpooling) or top/bottom instances (e.g., MesoNet) to identify image phenotypes. In this study, we hypothesize that wholistic information of the distribution of the patch scores within a WSI can predict the cancer survival better. We developed a distribution based multiple-instance survival learning algorithm (DeepDisMISL) to validate this hypothesis. We designed and executed experiments using two large international colorectal cancer WSIs datasets - MCO CRC and TCGA COAD-READ. Our results suggest that the more information about the distribution of the patch scores for a WSI, the better is the prediction performance. Including multiple neighborhood instances around each selected distribution location (e.g., percentiles) could further improve the prediction. DeepDisMISL demonstrated superior predictive ability compared to other recently published, state-of-the-art algorithms. Furthermore, our algorithm is interpretable and could assist in understanding the relationship between cancer morphological phenotypes and patients cancer survival risk.

eess.IV↗

arXiv2022

Predicting microsatellite instability and key biomarkers in colorectal cancer from H&E-stained images: Achieving SOTA predictive performance with fewer data using Swin Transformer

Artificial intelligence (AI) models have been developed for predicting clinically relevant biomarkers, including microsatellite instability (MSI), for colorectal cancers (CRC). However, the current deep-learning networks are data-hungry and require large training datasets, which are often lacking in the medical domain. In this study, based on the latest Hierarchical Vision Transformer using Shifted Windows (Swin-T), we developed an efficient workflow for biomarkers in CRC (MSI, hypermutation, chromosomal instability, CpG island methylator phenotype, BRAF, and TP53 mutation) that only required relatively small datasets, but achieved the state-of-the-art (SOTA) predictive performance. Our Swin-T workflow not only substantially outperformed published models in an intra-study cross-validation experiment using TCGA-CRC-DX dataset (N = 462), but also showed excellent generalizability in cross-study external validation and delivered a SOTA AUROC of 0.90 for MSI using the MCO dataset for training (N = 1065) and the same TCGA-CRC-DX for testing. Similar performance (AUROC=0.91) was achieved by Echle and colleagues using approximately 8000 training samples (ResNet18) on the same testing dataset. Swin-T was extremely efficient using small training datasets and exhibits robust predictive performance with only 200-500 training samples. These data indicate that Swin-T may be 5-10 times more efficient than the current state-of-the-art algorithms for MSI based on ResNet18 and ShuffleNet. Furthermore, the Swin-T models showed promise as pre-screening tests for MSI status and BRAF mutation status, which could exclude and reduce the samples before the subsequent standard testing in a cascading diagnostic workflow to allow turnaround time reduction and cost saving.

q-bio.QM↗

arXiv2022

A topological realization of spin polarization through vortex formation in collisions of Bose-Einstein condensates

The global spin polarization of hadrons in heavy ion collisions has been measured in STAR (the Solenoidal Tracker At Relativistic heavy ion collider) experiments, which opens up a new window in the study of the hottest, least viscous and most vortical fluid that has ever been produced in the laboratory. We present a different approach to spin polarization from conventional ones: a topological realization of spin polarization through quantum vortex formation in collisions of Bose-Einstein condensates (BEC). This approach is based on the observation that the vortex is a topological excitation in a superfluid in presence of local orbital angular momentum and is an analogue of spin degrees of freedom. The formation processes of vortices and vortex-antivortex pairs are investigated by solving the Gross-Pitaevskii Equation with a large-scale parallel algorithm on Graphics Processing Unit (GPU) to very high precision. In a rotating environment, the primary vortex with winding number one is stable against perturbation, which has a minimal energy and fixed orbital angular momentum (OAM), but the vortices with larger winding numbers are unstable and will decay into primary vortices through a redistribution of the energy and vorticity. The injection of OAM can also be realized in non-central collisions of self-interacting condensates, part of the OAM of the initial state will induce the formation of vortices through concentration of energy and vorticity density around topological defects. Different from a hydrodynamical description, the interference of the wave function plays an important role in the transport of energy and vorticity, reflecting the quantum nature of the vortex formation process. The study of the vortex formation may shed light on the nature of particle spin and spin-orbit couplings in strong interaction matter produced in heavy-ion collisions.

nucl-th↗

arXiv2022

Improved Analytic Solution of Black Hole Superradiance

The approximate solution of the Klein-Gordon equation for a real scalar field of mass $μ$ in the geometry of a Kerr black hole obtained by Detweiler \cite{Detweiler:1980uk} is widely used in the analysis of the stability of black holes as well as the search of axion-like particles. In this work, we confirm a missing factor $1/2$ in this solution, which was first identified in Ref.~\cite{Pani:2012bp}. The corrected result has strange features that put questions on the power-counting strategy. We solve this problem by adding the next-to-leading order (NLO) contribution. Compared to the numerical results, the NLO solution reduces the percentage error of the LO solution by a factor of 2 for all important values of $r_g μ$. Especially the percentage error is $\lesssim 10\%$ in the region of $r_gμ\lesssim 0.35$. The NLO solution also has a compact form and could be used straightforwardly.

gr-qc↗

arXiv2022

A general scheme of differential imaging employing weak measurement

We propose and experimentally realize a general scheme of differential imaging employing the idea of weak measurement. We show that the weak coupling between the system of interest and a two-level ancilla can introduce a two-beam circuit after an arbitrary pre-selection of the ancilla. By choosing the post-selection orthogonal to the pre-selection measurement, an effective imaging platform based on differential operations is shown achieved. Experimental results on both the Sagnac interferometer and ultra-thin Wollaston prism demonstrate that our imaging scheme successfully yields the boundary information of complex geometric configurations.

physics.optics↗

arXiv2022

Efficient inference of parental origin effects using case-control mother-child genotype data

Parental origin effects play an important role in mammal development and disorder. Case-control mother-child pair genotype data can be used to detect parental origin effects and is often convenient to collect in practice. Most existing methods for assessing parental origin effects do not incorporate any covariates, which may be required to control for confounding factors. We propose to model the parental origin effects through a logistic regression model, with predictors including maternal and child genotypes, parental origins, and covariates. The parental origins may not be fully inferred from genotypes of a target genetic marker, so we propose to use genotypes of markers tightly linked to the target marker to increase inference efficiency. A computationally robust statistical inference procedure is developed based on a modified profile likelihood in a retrospective way. A computationally feasible expectation-maximization algorithm is devised to estimate all unknown parameters involved in the modified profile likelihood. This algorithm differs from the conventional expectation-maximization algorithm in the sense that it is based on a modified instead of the original profile likelihood function. The convergence of the algorithm is established under some mild regularity conditions. This expectation-maximization algorithm also allows convenient handling of missing child genotypes. Large sample properties, including weak consistency, asymptotic normality, and asymptotic efficiency, are established for the proposed estimator under some mild regularity conditions. Finite sample properties are evaluated through extensive simulation studies and the application to a real dataset.

stat.ME↗

arXiv2022

Perspective Phase Angle Model for Polarimetric 3D Reconstruction

Current polarimetric 3D reconstruction methods, including those in the well-established shape from polarization literature, are all developed under the orthographic projection assumption. In the case of a large field of view, however, this assumption does not hold and may result in significant reconstruction errors in methods that make this assumption. To address this problem, we present the perspective phase angle (PPA) model that is applicable to perspective cameras. Compared with the orthographic model, the proposed PPA model accurately describes the relationship between polarization phase angle and surface normal under perspective projection. In addition, the PPA model makes it possible to estimate surface normals from only one single-view phase angle map and does not suffer from the so-called $π$-ambiguity problem. Experiments on real data show that the PPA model is more accurate for surface normal estimation with a perspective camera than the orthographic model.

cs.CV↗

arXiv2022

Are We Ready for Robust and Resilient SLAM? A Framework For Quantitative Characterization of SLAM Datasets

Reliability of SLAM systems is considered one of the critical requirements in modern autonomous systems. This directed the efforts to developing many state-of-the-art systems, creating challenging datasets, and introducing rigorous metrics to measure SLAM performance. However, the link between datasets and performance in the robustness/resilience context has rarely been explored. In order to fill this void, characterization of the operating conditions of SLAM systems is essential in order to provide an environment for quantitative measurement of robustness and resilience. In this paper, we argue that for proper evaluation of SLAM performance, the characterization of SLAM datasets serves as a critical first step. The study starts by reviewing previous efforts for quantitative characterization of SLAM datasets. Then, the problem of perturbation characterization is discussed and the linkage to SLAM robustness/resilience is established. After that, we propose a novel, generic and extendable framework for quantitative analysis and comparison of SLAM datasets. Additionally, a description of different characterization parameters is provided. Finally, we demonstrate the application of our framework by presenting the characterization results of three SLAM datasets: KITTI, EuroC-MAV, and TUM-VI highlighting the level of insights achieved by the proposed framework.

cs.RO↗

arXiv2022

Cell-average based neural network method for high dimensional parabolic differential equations

In this paper, we introduce cell-average based neural network (CANN) method to solve high-dimensional parabolic partial differential equations. The method is based on the integral or weak formulation of partial differential equations. A feedforward network is considered to train the solution average of cells in neighboring time. Initial values and approximate solution at $t=Δt$ obtained by high order numerical method are taken as the inputs and outputs of network, respectively. We use supervised training combined with a simple backpropagation algorithm to train the network parameters. We find that the neural network has been trained to optimality for high-dimensional problems, the CFL condition is not strictly limited for CANN method and the trained network is used to solve the same problem with different initial values. For the high-dimensional parabolic equations, the convergence is observed and the errors are shown related to spatial mesh size but independent of time step size.

math.NA↗

arXiv2022

Highlight Specular Reflection Separation based on Tensor Low-rank and Sparse Decomposition Using Polarimetric Cues

This paper is concerned with specular reflection removal based on tensor low-rank decomposition framework with the help of polarization information. Our method is motivated by the observation that the specular highlight of an image is sparsely distributed while the remaining diffuse reflection can be well approximated by a linear combination of several distinct colors using a low-rank and sparse decomposition framework. Unlike current solutions, our tensor low-rank decomposition keeps the spatial structure of specular and diffuse information which enables us to recover the diffuse image under strong specular reflection or in saturated regions. We further define and impose a new polarization regularization term as constraint on color channels. This regularization boosts the performance of the method to recover an accurate diffuse image by handling the color distortion, a common problem of chromaticity-based methods, especially in case of strong specular reflection. Through comprehensive experiments on both synthetic and real polarization images, we demonstrate that our method is able to significantly improve the accuracy of highlight specular removal, and outperform the competitive methods to recover the diffuse image, especially in regions of strong specular reflection or in saturated areas.

cs.CV↗

arXiv2022

Fire Together Wire Together: A Dynamic Pruning Approach with Self-Supervised Mask Prediction

Dynamic model pruning is a recent direction that allows for the inference of a different sub-network for each input sample during deployment. However, current dynamic methods rely on learning a continuous channel gating through regularization by inducing sparsity loss. This formulation introduces complexity in balancing different losses (e.g task loss, regularization loss). In addition, regularization based methods lack transparent tradeoff hyperparameter selection to realize a computational budget. Our contribution is two-fold: 1) decoupled task and pruning losses. 2) Simple hyperparameter selection that enables FLOPs reduction estimation before training. Inspired by the Hebbian theory in Neuroscience: "neurons that fire together wire together", we propose to predict a mask to process k filters in a layer based on the activation of its previous layer. We pose the problem as a self-supervised binary classification problem. Each mask predictor module is trained to predict if the log-likelihood for each filter in the current layer belongs to the top-k activated filters. The value k is dynamically estimated for each input based on a novel criterion using the mass of heatmaps. We show experiments on several neural architectures, such as VGG, ResNet and MobileNet on CIFAR and ImageNet datasets. On CIFAR, we reach similar accuracy to SOTA methods with 15% and 24% higher FLOPs reduction. Similarly in ImageNet, we achieve lower drop in accuracy with up to 13% improvement in FLOPs reduction.

cs.CV↗

arXiv2022

Diagnostic Communication and Visual System based on Vehicle UDS Protocol

Unified Diagnostic Services (UDS) is a diagnostic communication protocol used in electronic control units (ECUs) within automotive electronics, which is specified in the ISO 14229-1. It is derived from ISO 14230-3 (KWP2000) and the now obsolete ISO 15765-3 (Diagnostic Communication over Controller Area Network (DoCAN). 'Unified' in this context means that it is an international and not a company-specific standard. By now this communication protocol is used in all new ECUs made by Tier 1 suppliers of Original Equipment Manufacturer (OEM), and is incorporated into other standards, such as AUTOSAR. The ECUs in modern vehicles control nearly all functions, including electronic fuel injection (EFI), engine control, the transmission, anti-lock braking system, door locks, braking, window operation, and more.

cs.CV↗