arXiv subjects

Xinyi Li

Publications and source records attributed to Xinyi Li.

At least 145 records · Page 8Linked to original sources

arXiv2021

Multidimensional imaging reveals mechanisms controlling label-free biosensing in vertical 2DM-heterostructures

Two-dimensional materials and their van der Waals heterostructures enable a large range of applications, including label-free biosensing. Lattice mismatch and work function difference in the heterostructure material result in strain and charge transfer, often varying at nanometer scale, that influence device performance. In this work, a multidimensional optical imaging technique is developed in order to map sub-diffractional distributions for doping and strain and understand the role of those for modulation of electronic properties of the material. As an example, vertical heterostructure comprised of monolayer graphene and single layer flakes of transition metal dichalcogenide MoS$_2$ is fabricated and used for biosensing. Herein, an optical label-free detection of doxorubicin, a common cancer drug, is reported via three independent optical detection channels (photoluminescence shift, Raman shift and Graphene Enhanced Raman Scattering). Non-uniform broadening of components of multimodal signal correlates with the statistical distribution of local optical properties of the heterostructure. Multidimensional nanoscale imaging allows one to reveal the physical origin for such a local response and propose the best strategy for mitigation of materials variability and future device fabrication.

cond-mat.mes-hall↗

arXiv2021

Sharpness of phase transition for Voronoi percolation in hyperbolic space

In this paper, we consider Voronoi percolation in the hyperbolic space $\mathbb{H}^d$ ($d\ge 2$) and show that the phase transition is sharp. More precisely, we show that for Voronoi percolation with parameter $p$ generated by a homogeneous Poisson point process with intensity $λ$, there exists $p_c:=p_c(λ,d)$ such that the probability of a monochromatic path from the origin reaching a distance of $n$ decays exponentially fast in $n$. We also prove the mean-field lower bound $\mathbb{P}_{λ,p}(0\leftrightarrow \infty)\ge c(p-p_c)$ for $p>p_c$.

math.PR↗

arXiv2021

TransCamP: Graph Transformer for 6-DoF Camera Pose Estimation

Camera pose estimation or camera relocalization is the centerpiece in numerous computer vision tasks such as visual odometry, structure from motion (SfM) and SLAM. In this paper we propose a neural network approach with a graph transformer backbone, namely TransCamP, to address the camera relocalization problem. In contrast with prior work where the pose regression is mainly guided by photometric consistency, TransCamP effectively fuses the image features, camera pose information and inter-frame relative camera motions into encoded graph attributes and is trained towards the graph consistency and accuracy instead, yielding significantly higher computational efficiency. By leveraging graph transformer layers with edge features and enabling tensorized adjacency matrix, TransCamP dynamically captures the global attention and thus endows the pose graph with evolving structures to achieve improved robustness and accuracy. In addition, optional temporal transformer layers actively enhance the spatiotemporal inter-frame relation for sequential inputs. Evaluation of the proposed network on various public benchmarks demonstrates that TransCamP outperforms state-of-the-art approaches.

cs.CV↗

arXiv2021

Natural parametrization of percolation interface and pivotal points

We prove that the interface of critical site percolation on the triangular lattice converges to SLE$_6$ in its natural parametrization, where the discrete interface is parametrized such that each edge is crossed in one unit of time, while the limiting curve is parametrized by the $7/4$-dimensional Minkowski content. We also prove that the scaling limit of counting measure on the pivotal points, which was proved to exist by Garban, Pete, and Schramm (2013), is the $3/4$-dimensional Minkowski content up to a deterministic multiplicative constant.

math.PR↗

arXiv2021

Minkowski content of Brownian cut points

Let $W(t)$, $0\leq t\leq T$, be a Brownian motion in $\mathbb{R}^d$, $d=2,3$. We say that $x$ is a cut point for $W$ if $x=W(t)$ for some $t\in(0,T)$ such that $W [0,t) $ and $W (t,T]$ are disjoint. In this work, we prove that a.s. the Minkowski content of the set of cut points for $W$ exists and is finite and non-trivial.

math.PR↗

arXiv2021

On the Robustness of Multi-View Rotation Averaging

Rotation averaging is a synchronization process on single or multiple rotation groups, and is a fundamental problem in many computer vision tasks such as multi-view structure from motion (SfM). Specifically, rotation averaging involves the recovery of an underlying pose-graph consistency from pairwise relative camera poses. Specifically, given pairwise motion in rotation groups, especially 3-dimensional rotation groups (\eg, $\mathbb{SO}(3)$), one is interested in recovering the original signal of multiple rotations with respect to a fixed frame. In this paper, we propose a robust framework to solve multiple rotation averaging problem, especially in the cases that a significant amount of noisy measurements are present. By introducing the $ε$-cycle consistency term into the solver, we enable the robust initialization scheme to be implemented into the IRLS solver. Instead of conducting the costly edge removal, we implicitly constrain the negative effect of erroneous measurements by weight reducing, such that IRLS failures caused by poor initialization can be effectively avoided. Experiment results demonstrate that our proposed approach outperforms state of the arts on various benchmarks.

cs.CV↗

arXiv2021

Towards Entity Alignment in the Open World: An Unsupervised Approach

Entity alignment (EA) aims to discover the equivalent entities in different knowledge graphs (KGs). It is a pivotal step for integrating KGs to increase knowledge coverage and quality. Recent years have witnessed a rapid increase of EA frameworks. However, state-of-the-art solutions tend to rely on labeled data for model training. Additionally, they work under the closed-domain setting and cannot deal with entities that are unmatchable. To address these deficiencies, we offer an unsupervised framework that performs entity alignment in the open world. Specifically, we first mine useful features from the side information of KGs. Then, we devise an unmatchable entity prediction module to filter out unmatchable entities and produce preliminary alignment results. These preliminary results are regarded as the pseudo-labeled data and forwarded to the progressive learning framework to generate structural representations, which are integrated with the side information to provide a more comprehensive view for alignment. Finally, the progressive learning framework gradually improves the quality of structural embeddings and enhances the alignment performance by enriching the pseudo-labeled data with alignment results from the previous round. Our solution does not require labeled data and can effectively filter out unmatchable entities. Comprehensive experimental evaluations validate its superiority.

cs.AI↗

arXiv2021

Abstractive Opinion Tagging

In e-commerce, opinion tags refer to a ranked list of tags provided by the e-commerce platform that reflect characteristics of reviews of an item. To assist consumers to quickly grasp a large number of reviews about an item, opinion tags are increasingly being applied by e-commerce platforms. Current mechanisms for generating opinion tags rely on either manual labelling or heuristic methods, which is time-consuming and ineffective. In this paper, we propose the abstractive opinion tagging task, where systems have to automatically generate a ranked list of opinion tags that are based on, but need not occur in, a given set of user-generated reviews. The abstractive opinion tagging task comes with three main challenges: (1) the noisy nature of reviews; (2) the formal nature of opinion tags vs. the colloquial language usage in reviews; and (3) the need to distinguish between different items with very similar aspects. To address these challenges, we propose an abstractive opinion tagging framework, named AOT-Net, to generate a ranked list of opinion tags given a large number of reviews. First, a sentence-level salience estimation component estimates each review's salience score. Next, a review clustering and ranking component ranks reviews in two steps: first, reviews are grouped into clusters and ranked by cluster size; then, reviews within each cluster are ranked by their distance to the cluster center. Finally, given the ranked reviews, a rank-aware opinion tagging component incorporates an alignment feature and alignment loss to generate a ranked list of opinion tags. To facilitate the study of this task, we create and release a large-scale dataset, called eComTag, crawled from real-world e-commerce websites. Extensive experiments conducted on the eComTag dataset verify the effectiveness of the proposed AOT-Net in terms of various evaluation metrics.

cs.CL↗

arXiv2021

Controlling Entity Integrity with Key Sets

Codd's rule of entity integrity stipulates that every table has a primary key. Hence, the attributes of the primary key carry unique and complete value combinations. In practice, data cannot always meet such requirements. Previous work proposed the superior notion of key sets for controlling entity integrity. We establish a linear-time algorithm for validating whether a given key set holds on a given data set, and demonstrate its efficiency on real-world data. We establish a binary axiomatization for the associated implication problem, and prove its coNP-completeness. However, the implication of unary by arbitrary key sets has better properties. The fragment enjoys a unary axiomatization and is decidable in quadratic time. Hence, we can minimize overheads before validating key sets. While perfect models do not always exist in general, we show how to compute them for any instance of our fragment. This provides computational support towards the acquisition of key sets.

cs.DB↗

arXiv2020

Discovery of A candidate Hypervelocity star originated from the Sagittarius Dwarf Spheroidal galaxy

In this letter, we report the discovery of an intriguing HVS (J1443+1453) candidate that is probably from the Sagittarius Dwarf Spheroidal galaxy (Sgr dSph). The star is an old and very metal-poor low-mass main-sequence turn-off star (age $\sim14.0$ Gyr and [Fe/H] $= -2.23$ dex) and has a total velocity of $559.01^{+135.07}_{-87.40}$ km s$^{-1}$ in the Galactic rest-frame and a heliocentric distance of $2.90^{+0.72}_{-0.48}$ kpc. The velocity of J1443+1453 is larger than the escape speed at its position, suggesting it a promising HVS candidate. By reconstructing its trajectory in the Galactic potential, we find that the orbit of J1443+1453 intersects closely with that of the Sgr dSph $37.8^{+4.6}_{-6.0}$ Myr ago, when the latter has its latest pericentric passage through the Milky Way. The encounter occurs at a distance $2.42^{+1.80}_{-0.77}$ kpc from the centre of Sgr dSph, smaller than the size of the Sgr dSph. Chemical properties of this star are also consistent with those of one Sgr dSph associated globular cluster or of the Sgr stream member stars. Our finding suggests that J1443+1453 is an HVS either tidally stripped from the Sgr dSph or ejected from the Sgr dSph by the gravitational slingshot effect, requiring a (central) massive/intermediate-mass black hole or a (central) massive primordial black hole in the Sgr dSph.

astro-ph.GA↗

arXiv2020

Spatiotemporal Dynamics, Nowcasting and Forecasting of COVID-19 in the United States

Epidemic modeling is an essential tool to understand the spread of the novel coronavirus and ultimately assist in disease prevention, policymaking, and resource allocation. In this article, we establish a state of the art interface between classic mathematical and statistical models and propose a novel space-time epidemic modeling framework to study the spatial-temporal pattern in the spread of infectious disease. We propose a quasi-likelihood approach via the penalized spline approximation and alternatively reweighted least-squares technique to estimate the model. Furthermore, we provide a short-term and long-term county-level prediction of the infected/death count for the U.S. by accounting for the control measures, health service resources, and other local features. Utilizing spatiotemporal analysis, our proposed model enhances the dynamics of the epidemiological mechanism and dissects the spatiotemporal structure of the spreading disease. To assess the uncertainty associated with the prediction, we develop a projection band based on the envelope of the bootstrap forecast paths. The performance of the proposed method is evaluated by a simulation study. We apply the proposed method to model and forecast the spread of COVID-19 at both county and state levels in the United States.

stat.AP↗

arXiv2020

An Artificial Intelligence-Driven Agent for Real-Time Head-and-Neck IMRT Plan Generation using Conditional Generative Adversarial Network (cGAN)

Purpose: To develop an Artificial Intelligence (AI) agent for fully-automated rapid head and neck (H&N) IMRT plan generation without time-consuming inverse planning.$$$$ Methods: This AI agent was trained using a conditional Generative Adversarial Network architecture. The generator, PyraNet, is a novel Deep Learning network that implements 28 classic ResNet blocks in pyramid-like concatenations. The discriminator is a customized 4-layer DenseNet. The AI agent first generates customized 2D projections at 9 template beam angles from 3D CT volume and structures of a patient. These projections are then stacked as 4D inputs of PyraNet, from which 9 radiation fluence maps are generated simultaneously. Finally, the predicted fluence maps are imported into a commercial treatment planning system (TPS) for plan integrity checks. The AI agent was built and tested upon 231 oropharyngeal plans from a TPS plan library. Only the primary plans in the sequential boost regime were studied. A customized Harr wavelet loss was adopted for fluence map comparison. Isodose distributions in test AI plans and TPS plans were qualitatively evaluated. Key dosimetric metrics were statistically compared.$$$$ Results: All test AI plans were successfully generated. Isodose gradients outside of PTV in AI plans were comparable with TPS plans. After PTV coverage normalization, $D_{mean}$ of parotids and oral cavity in AI plans and TPS plans were comparable without statistical significance. AI plans achieved comparable $D_{max}$ at 0.01cc of brainstem and cord+5mm without clinically relevant differences, but body $D_{max}$ was higher than the TPS plan results. The AI agent needs ~3s per case to predict fluence maps.$$$$ Conclusions: The developed AI agent can generate H&N IMRT plans with satisfying dosimetry quality. With rapid and fully automated implementation, it holds great potential for clinical applications.

physics.med-ph↗

arXiv2020

Comparing and Integrating US COVID-19 Data from Multiple Sources with Anomaly Detection and Repairing

Over the past few months, the outbreak of Coronavirus disease (COVID-19) has been expanding over the world. A reliable and accurate dataset of the cases is vital for scientists to conduct related research and for policy-makers to make better decisions. We collect the United States COVID-19 daily reported data from four open sources: the New York Times, the COVID-19 Data Repository by Johns Hopkins University, the COVID Tracking Project at the Atlantic, and the USAFacts, then compare the similarities and differences among them. To obtain reliable data for further analysis, we first examine the cyclical pattern and the following anomalies, which frequently occur in the reported cases: (1) the order dependencies violation, (2) the point or period anomalies, and (3) the issue of reporting delay. To address these detected issues, we propose the corresponding repairing methods and procedures if corrections are necessary. In addition, we integrate the COVID-19 reported cases with the county-level auxiliary information of the local features from official sources, such as health infrastructure, demographic, socioeconomic, and environmental information, which are also essential for understanding the spread of the virus.

stat.AP↗

arXiv2020

Pushing the Envelope of Rotation Averaging for Visual SLAM

As an essential part of structure from motion (SfM) and Simultaneous Localization and Mapping (SLAM) systems, motion averaging has been extensively studied in the past years and continues to attract surging research attention. While canonical approaches such as bundle adjustment are predominantly inherited in most of state-of-the-art SLAM systems to estimate and update the trajectory in the robot navigation, the practical implementation of bundle adjustment in SLAM systems is intrinsically limited by the high computational complexity, unreliable convergence and strict requirements of ideal initializations. In this paper, we lift these limitations and propose a novel optimization backbone for visual SLAM systems, where we leverage rotation averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM pipelines. In our approach, we first decouple the rotational and translational parameters in the camera rigid body transformation and convert the high-dimensional non-convex nonlinear problem into tractable linear subproblems in lower dimensions, and show that the subproblems can be solved independently with proper constraints. We apply the scale parameter with $l_1$-norm in the pose-graph optimization to address the rotation averaging robustness against outliers. We further validate the global optimality of our proposed approach, revisit and address the initialization schemes, pure rotational scene handling and outlier treatments. We demonstrate that our approach can exhibit up to 10x faster speed with comparable accuracy against the state of the art on public benchmarks.

cs.CV↗

arXiv2020

Hybrid Camera Pose Estimation with Online Partitioning for SLAM

This paper presents a hybrid real-time camera pose estimation framework with a novel partitioning scheme and introduces motion averaging to monocular Simultaneous Localization and Mapping (SLAM) systems. Breaking through the limitations of fixed-size temporal partitioning in many conventional SLAM pipelines, our approach significantly improves the accuracy of local bundle adjustment by gathering spatially-strongly-connected cameras into each block. With the dynamic initialization using intermediate computation values, \XL{we improve the Levenberg-Marquardt solver to further enhance the efficiency of the local optimization.} Moreover, the dense data association between blocks by our co-visibility-based partitioning enables us to explore and implement motion averaging to efficiently align the blocks globally, updating camera motion estimations on-the-fly. Experiments on benchmarks convincingly demonstrate the practicality and robustness of our proposed approach by significantly outperforming conventional approaches.

cs.CV↗

arXiv2020

Approximating the Geometric Edit Distance

Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as signal analysis, bioinformatics, etc., need to be solved in a geometric space. Therefore, the geometric edit distance (GED) has been studied. In this paper, we describe the first strictly sublinear approximate near-linear time algorithm for computing the GED of two point sequences in constant dimensional Euclidean space. Specifically, we present a randomized (O(n\log^2n)) time (O(\sqrt n))-approximation algorithm. Then, we generalize our result to give a randomized $α$-approximation algorithm for any $α\in [\sqrt{\log n}, \sqrt{n / \log n}]$, running in time $O(n^2/α^2 \log n)$. Both algorithms are Monte Carlo and return approximately optimal solutions with high probability.

cs.CG↗

arXiv2020

Mapping the Galactic disk with the LAMOST and $Gaia$ Red clump sample: V: On the origin of the "young" [$α$/Fe]-enhanced stars

Using a sample of nearly 140,000 primary red clump stars selected from the LAMOST and $Gaia$ surveys, we have identified a large sample of "young" [$α$/Fe]-enhanced stars with stellar ages younger than 6.0 Gyr and [$α$/Fe] ratios greater than 0.15 dex. The stellar ages and [$α$/Fe] ratios are measured from LAMOST spectra, using a machine learning method trained with common stars in the LAMOST-APOGEE fields (for [$α$/Fe]) and in the LAMOST-$Kepler$ fields (for stellar age). The existence of these "young" [$α$/Fe]-enhanced stars is not expected from the classical Galactic chemical evolution models. To explore their possible origins, we have analyzed the spatial distribution, and the chemical and kinematic properties of those stars and compared the results with those of the chemically thin and thick disk populations. We find that those "young" [$α$/Fe]-enhanced stars have distributions in number density, metallicity, [C/N] abundance ratio, velocity dispersion and orbital eccentricity that are essentially the same as those of the chemically thick disk population. Our results clearly show those so-called "young" [$α$/Fe]-enhanced stars are not really young but $genuinely$ $old$. Although other alternative explanations can not be fully ruled out, our results suggest that the most possible origin of these old stars is the result of stellar mergers or mass transfer.

astro-ph.GA↗

arXiv2020

Mapping the Galactic disk with the LAMOST and Gaia Red clump sample: I: precise distances, masses, ages and 3D velocities of $\sim$ 140000 red clump stars

We present a sample of $\sim$ 140,000 primary red clump (RC) stars of spectral signal-to-noise ratios higher than 20 from the LAMOST Galactic spectroscopic surveys, selected based on their positions in the metallicity-dependent effective temperature--surface gravity and color--metallicity diagrams, supervised by high-quality $Kepler$ asteroseismology data. The stellar masses and ages of those stars are further determined from the LAMOST spectra, using the Kernel Principal Component Analysis method, trained with thousands of RCs in the LAMOST-$Kepler$ fields with accurate asteroseismic mass measurements. The purity and completeness of our primary RC sample are generally higher than 80 per cent. For the mass and age, a variety of tests show typical uncertainties of 15 and 30 per cent, respectively. Using over ten thousand primary RCs with accurate distance measurements from the parallaxes of Gaia DR2, we re-calibrate the $K_{\rm s}$ absolute magnitudes of primary RCs by, for the first time, considering both the metallicity and age dependencies. With the the new calibration, distances are derived for all the primary RCs, with a typical uncertainty of 5--10 per cent, even better than the values yielded by the Gaia parallax measurements for stars beyond 3--4 kpc. The sample covers a significant volume of the Galactic disk of $4 \leq R \leq 16$ kpc, $|Z| \leq 5$ kpc, and $-20 \leq ϕ\leq 50^{\circ}$. Stellar atmospheric parameters, line-of-sight velocities and elemental abundances derived from the LAMOST spectra and proper motions of Gaia DR2 are also provided for the sample stars. Finally, the selection function of the sample is carefully evaluated in the color-magnitude plane for different sky areas. The sample is publicly available.

astro-ph.SR↗