arXiv subjects

Jing Li

Publications and source records attributed to Jing Li.

At least 487 records · Page 27Linked to original sources

arXiv2023

Point Transformer For Coronary Artery Labeling

Coronary CT angiography (CCTA) scans are widely used for diagnosis of coronary artery diseases. An accurate and automatic vessel labeling algorithm for CCTA analysis can significantly improve the diagnostic efficiency and reduce the clinicians'manual efforts. In this paper, we propose a simple vessel labeling method based on the Point Transformer, which only needs the coronary artery segmentation. Specifically, firstly, the coronary segmentation is transformed to point cloud. Then, these points are fed into the hierarchical transformer blocks to obtain the multi-level features, including local and global features. Finally, the network output the semantic classification points and map them to centerline labeling. This method is only based on the structure of coronary segmentation and need not other features, so it is easy to generalize to other vessel labeling tasks, e.g., head and neck vessel labeling. To evaluate the performance of our proposed method, CCTA scans of 53 subjects are collected in our experiment. The experimental results demonstrate the efficacy of this approach.

eess.IV↗

arXiv2023

Solvable non-Hermitian skin effects and real-space exceptional points: Non-Hermitian generalized Bloch theorem

Non-Hermitian systems can exhibit extraordinary boundary behaviors, known as the non-Hermitian skin effects, where all the eigenstates are localized exponentially at one side of lattice model. To give a full understanding and control of non-Hermitian skin effects, we have developed the non-Hermitian generalized Bloch theorem to provide the analytical expression for all solvable eigenvalues and eigenstates, in which translation symmetry is broken due to the open boundary condition. By introducing the Vieta's theorem for any polynomial equation with arbitrary degree, our approach is widely applicable for one-dimensional non-Hermitian tight-binding models. With the non-Hermitian generalized Bloch theorem, we can analyze the condition of existence or non-existence of the non-Hermitian skin effects at a mathematically rigorous level. Additionally, the non-Hermitian generalized Bloch theorem allows us to explore the real-space exceptional points. We also establish the connection between our approach and the generalized Brillouin zone method. To illustrate our main results, we examine two concrete examples including the Su-Schrieffer-Heeger chain model with long-range couplings, and the ladder model with non-reciprocal interaction. Our non-Hermitian generalized Bloch theorem provides an efficient way to analytically study various non-Hermitian phenomena in more general cases.

quant-ph↗

arXiv2023

Disentangled higher-orbital bands and chiral symmetric topology in confined Mie resonance photonic crystals

Topological phases based on tight-binding models have been extensively studied in recent decades. By mimicking the linear combination of atomic orbitals in tight-binding models based on the evanescent couplings between resonators in classical waves, numerous experimental demonstrations of topological phases have been successfully conducted. However, in dielectric photonic crystals, the Mie resonances' states decay too slowly as $1/r$ when $r$ $\to$ $\infty$, leading to intrinsically different physical properties between tight-binding models and dielectric photonic crystals. Here, we propose a confined Mie resonance photonic crystal by embedding perfect electric conductors in between dielectric rods, leading to a perfectly matched band structure as the tight-binding models with nearest-neighbour couplings. As a consequence, disentangled band structure spanned by higher atomic orbitals is observed. Moreover, we also achieve a three-dimensional photonic crystal with a complete photonic bandgap and third-order topology based on our design. Our implementation provides a versatile platform for studying exotic higher-orbital bands and achieving tight-binding-like 3D topological photonic crystals.

cond-mat.mes-hall↗

arXiv2023

Highly-Entangled Polyradical Nanographene with Coexisting Strong Correlation and Topological Frustration

Open-shell benzenoid polycyclic aromatic hydrocarbons, known as magnetic nanographenes, exhibit unconventional p-magnetism arising from topological frustration or strong electronic-electron (e-e) interaction. Imprinting multiple strongly entangled spins into polyradical nanographenes creates a major paradigm shift in realizing non-trivial collective quantum behaviors and exotic quantum phases in organic quantum materials. However, conventional design approaches are limited by a single magnetic origin, which can restrict the number of correlated spins or the type of magnetic ordering in open-shell nanographenes. Here, we present a novel design strategy combing topological frustration and e-e interactions to fabricate the largest fully-fused open-shell nanographene reported to date, a 'butterfly'-shaped tetraradical on Au(111). We employed bond-resolved scanning tunneling microscopy and spin excitation spectroscopy to unambiguously resolve the molecular backbone and reveal the strongly correlated open-shell character, respectively. This nanographene contains four unpaired electrons with both ferromagnetic and anti-ferromagnetic interactions, harboring a many-body singlet ground state and strong multi-spin entanglement, which can be well described by many-body calculations. Furthermore, we demonstrate that the nickelocene magnetic probe can sense highly-correlated spin states in nanographene. The ability to imprint and characterize many-body strongly correlated spins in polyradical nanographenes not only presents exciting opportunities for realizing non-trivial quantum magnetism and phases in organic materials but also paves the way toward high-density ultrafast spintronic devices and quantum information technologies.

cond-mat.mtrl-sci↗

arXiv2023

Temporal superimposed crossover module for effective continuous sign language

The ultimate goal of continuous sign language recognition(CSLR) is to facilitate the communication between special people and normal people, which requires a certain degree of real-time and deploy-ability of the model. However, in the previous research on CSLR, little attention has been paid to the real-time and deploy-ability. In order to improve the real-time and deploy-ability of the model, this paper proposes a zero parameter, zero computation temporal superposition crossover module(TSCM), and combines it with 2D convolution to form a "TSCM+2D convolution" hybrid convolution, which enables 2D convolution to have strong spatial-temporal modelling capability with zero parameter increase and lower deployment cost compared with other spatial-temporal convolutions. The overall CSLR model based on TSCM is built on the improved ResBlockT network in this paper. The hybrid convolution of "TSCM+2D convolution" is applied to the ResBlock of the ResNet network to form the new ResBlockT, and random gradient stop and multi-level CTC loss are introduced to train the model, which reduces the final recognition WER while reducing the training memory usage, and extends the ResNet network from image classification task to video recognition task. In addition, this study is the first in CSLR to use only 2D convolution extraction of sign language video temporal-spatial features for end-to-end learning for recognition. Experiments on two large-scale continuous sign language datasets demonstrate the effectiveness of the proposed method and achieve highly competitive results.

cs.CV↗

arXiv2023

Value-added catalog of M-giant stars in LAMOST DR9

In this work, we update the catalog of M-giant stars from the low-resolution spectra of the Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) Data Release 9. There are 58,076 M giants identified from the classification pipeline with seven temperature subtypes from M0 to M6. The 2471 misclassified non-M-giant stars are white dwarf binaries, early types, and M dwarfs. And the contamination rate is 4.2$\%$ in the M-giants sample. A total of 372 carbon stars were identified by CaH spectral indices, and were further confirmed by the LAMOST spectra. We update the correlation between the $(W1-W2)_0$ color and [M/H] from APOGEE DR17. We calculate the radial velocities of all M giants by applying cross-correlation to the spectra between 8000 and 8950 Åwith synthetic spectra from ATLAS9. Taking star distances less than 4 kpc from Gaia EDR3 as the standard, we refitted the photometric distance relation of M giants. And based on our M-giant stars, we select a group of Sagittarius stream members, whose sky and 3D velocity distributions are well consistent with K-giant Saggitarius stream members found in Yang et al. With our M giants, we find that the disk is asymmetric out to R = 25 kpc, which is 5 kpc further out than detected using K giants.

astro-ph.SR↗

arXiv2023

Quantum K-nearest neighbor classification algorithm based on Hamming distance

K-nearest neighbor classification algorithm is one of the most basic algorithms in machine learning, which determines the sample's category by the similarity between samples. In this paper, we propose a quantum K-nearest neighbor classification algorithm with Hamming distance. In this algorithm, quantum computation is firstly utilized to obtain Hamming distance in parallel. Then, a core sub-algorithm for searching the minimum of unordered integer sequence is presented to find out the minimum distance. Based on these two sub-algorithms, the whole quantum frame of K-nearest neighbor classification algorithm is presented. At last, it is shown that the proposed algorithm can achieve a quadratical speedup by analyzing its time complexity briefly.

quant-ph↗

arXiv2023

Multi-View Clustering via Semi-non-negative Tensor Factorization

Multi-view clustering (MVC) based on non-negative matrix factorization (NMF) and its variants have received a huge amount of attention in recent years due to their advantages in clustering interpretability. However, existing NMF-based multi-view clustering methods perform NMF on each view data respectively and ignore the impact of between-view. Thus, they can't well exploit the within-view spatial structure and between-view complementary information. To resolve this issue, we present semi-non-negative tensor factorization (Semi-NTF) and develop a novel multi-view clustering based on Semi-NTF with one-side orthogonal constraint. Our model directly performs Semi-NTF on the 3rd-order tensor which is composed of anchor graphs of views. Thus, our model directly considers the between-view relationship. Moreover, we use the tensor Schatten p-norm regularization as a rank approximation of the 3rd-order tensor which characterizes the cluster structure of multi-view data and exploits the between-view complementary information. In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point. Extensive experiments on various benchmark datasets indicate that our proposed method is able to achieve satisfactory clustering performance.

cs.LG↗

arXiv2023

Probing Heavy Neutrinos at the LHC from Fat-jet using Machine Learning

We explore the potential to use machine learning methods to search for heavy neutrinos, from their hadronic final states including a fat-jet signal, via the processes $pp \rightarrow W^{\pm *}\rightarrow μ^{\pm} N \rightarrow μ^{\pm} μ^{\mp} W^{\pm} \rightarrow μ^{\pm} μ^{\mp} J$ at hadron colliders. We use either the Gradient Boosted Decision Tree or Multi-Layer Perceptron methods to analyse the observables incorporating the jet substructure information, which is performed at hadron colliders with $\sqrt{s}=$ 13, 27, 100 TeV. It is found that, among the observables, the invariant masses of variable system and the observables from the leptons are the most powerful ones to distinguish the signal from the background. With the help of machine learning techniques, the limits on the active-sterile mixing have been improved by about one magnitude comparing to the cut-based analyses, with $V_{μN}^2 \lesssim 10^{-4}$ for the heavy neutrinos with masses, 100 GeV$~<m_N<~$1 TeV.

hep-ph↗

arXiv2023

Borrowing Human Senses: Comment-Aware Self-Training for Social Media Multimodal Classification

Social media is daily creating massive multimedia content with paired image and text, presenting the pressing need to automate the vision and language understanding for various multimodal classification tasks. Compared to the commonly researched visual-lingual data, social media posts tend to exhibit more implicit image-text relations. To better glue the cross-modal semantics therein, we capture hinting features from user comments, which are retrieved via jointly leveraging visual and lingual similarity. Afterwards, the classification tasks are explored via self-training in a teacher-student framework, motivated by the usually limited labeled data scales in existing benchmarks. Substantial experiments are conducted on four multimodal social media benchmarks for image text relation classification, sarcasm detection, sentiment classification, and hate speech detection. The results show that our method further advances the performance of previous state-of-the-art models, which do not employ comment modeling or self-training.

cs.CL↗

arXiv2023

Response to "Comment on 'Faraday waves in a Hele-Shaw cell' Phys Fluids 30,042106 (2018)"

This is a response to the comment cited as PoF2023,35:029101. We show that the depth will have an impact on the wave height and the scaling law we obtained before is more feasible to use as a prior to give an initial guess of the wave height without any experimental information. This response strongly supports our previous work and the capability of the scaling law.

physics.flu-dyn↗

arXiv2023

Atmospheric parameters and kinematic information for the M giants stars from LAMOST DR9

A catalog of more than 43,000 M giant stars has been selected by Li et al. from the ninth data release of LAMOST. Using the data-driven method SLAM, we obtain the stellar parameters (Teff, logg, [M/H], [$α$/M]) for all the M giant stars with uncertainties of 57 K, 0.25 dex, 0.16 dex and 0.06 dex at SNR > 100, respectively. With those stellar parameters, we constrain the absolute magnitude in K-band, which brings distance with relative uncertainties around 25% statistically. Radial velocities are also calculated by applying cross correlation on the spectra between 8000 A $Å$ and 8950 A $Å$ with synthetic spectra from ATLAS9, which covers the Ca II triplet. Comparison between our radial velocities and those from APOGEE DR17 and Gaia DR3 shows that our radial velocities have a system offset and dispersion around 1 and 4.6 km s$^{-1}$, respectively. With the distances and radial velocities combining with the astrometric data from Gaia DR3, we calculate the full 6D position and velocity information, which are able to be used for further chemo-dynamic studies on the disk and substructures in the halo, especially the Sagittarius Stream.

astro-ph.SR↗

arXiv2023

Continuous sign language recognition based on cross-resolution knowledge distillation

The goal of continuous sign language recognition(CSLR) research is to apply CSLR models as a communication tool in real life, and the real-time requirement of the models is important. In this paper, we address the model real-time problem through cross-resolution knowledge distillation. In our study, we found that keeping the frame-level feature scales consistent between the output of the student network and the teacher network is better than recovering the frame-level feature sizes for feature distillation. Based on this finding, we propose a new frame-level feature extractor that keeps the output frame-level features at the same scale as the output of by the teacher network. We further combined with the TSCM+2D hybrid convolution proposed in our previous study to form a new lightweight end-to-end CSLR network-Low resolution input net(LRINet). It is then used to combine cross-resolution knowledge distillation and traditional knowledge distillation methods to form a CSLR model based on cross-resolution knowledge distillation (CRKD). The CRKD uses high-resolution frames as input to the teacher network for training, locks the weights after training, and then uses low-resolution frames as input to the student network LRINet to perform knowledge distillation on frame-level features and classification features respectively. Experiments on two large-scale continuous sign language datasets have proved the effectiveness of CRKD. Compared with the model with high-resolution data as input, the calculation amount, parameter amount and inference time of the model have been significantly reduced under the same experimental conditions, while ensuring the accuracy of the model, and has achieved very competitive results in comparison with other advanced methods.

cs.CV↗

arXiv2023

Augmentation with Projection: Towards an Effective and Efficient Data Augmentation Paradigm for Distillation

Knowledge distillation is one of the primary methods of transferring knowledge from large to small models. However, it requires massive task-specific data, which may not be plausible in many real-world applications. Data augmentation methods such as representation interpolation, token replacement, or augmentation with models are applied to tackle this problem. However, these data augmentation methods either potentially cause shifts in decision boundaries (representation interpolation), are not expressive enough (token replacement), or introduce too much computational overhead (augmentation with models). To this end, we propose AugPro (Augmentation with Projection), an effective and efficient data augmentation method for distillation. Our method builds on top of representation interpolation augmentation methods to maintain the diversity of expressions and converts the augmented data to tokens to avoid shifting decision boundaries. It uses simple operations that come with little computational overhead. The results on multiple GLUE tasks show that our methods can improve distillation performance by a large margin at a low time cost. Codes are available at https://github.com/google-research/google-research/tree/master/augpro.

cs.CL↗

arXiv2023

Epitaxial van der Waals heterostructures of Cr2Te3 on 2D materials

Achieving large-scale growth of two-dimensional (2D) ferromagnetic materials with high Curie temperature (TC) and perpendicular magnetic anisotropy (PMA) is highly desirable for the development of ultra-compact magnetic sensors and magnetic memories. In this context, van der Waals (vdW) Cr2Te3 appears as a promising candidate. Bulk Cr2Te3 exhibits strong PMA and a TC of 180 K. Moreover, both PMA and TC might be adjusted in ultrathin films by engineering composition, strain, or applying an electric field. In this work, we demonstrate the molecular beam epitaxy (MBE) growth of vdW heterostructures of five-monolayer quasi-freestanding Cr2Te3 on three classes of 2D materials: graphene (semimetal), WSe2 (semiconductor) and Bi2Te3 (topological insulator). By combining structural and chemical analysis down to the atomic level with ab initio calculations, we confirm the single crystalline character of Cr2Te3 films on the 2D materials with sharp vdW interfaces. They all exhibit PMA and TC close to the bulk Cr2Te3 value of 180 K. Ab initio calculations confirm this PMA and show how its strength depends on strain. Finally, Hall measurements reveal a strong anomalous Hall effect, which changes sign at a given temperature. We theoretically explain this effect by a sign change of the Berry phase close to the Fermi level. This transition temperature depends on the 2D material in proximity, notably as a consequence of charge transfer. MBE-grown Cr2Te3/2D material bilayers constitute model systems for the further development of spintronic devices combining PMA, large spin-orbit coupling and sharp vdW interface.

cond-mat.mtrl-sci↗

arXiv2023

Joint Optimization of Relay Selection and Transmission Scheduling for UAV-Aided mmWave Vehicular Networks

To deal with the explosive growth of mobile traffic, millimeter-wave (mmWave) communications with abundant bandwidth resources have been applied to vehicular networks. As mmWave signal is sensitive to blockage, we introduce the unmanned aerial vehicle (UAV)-aided two-way relaying system for vehicular connection enhancement and coverage expansion. How to improve transmission efficiency and to reduce latency time in such a dynamic scenario is a challenging problem. In this paper, we formulate the joint optimization problem of relay selection and transmission scheduling, aiming to reduce transmission time while meeting the throughput requirements. To solve this problem, two schemes are proposed. The first one is the random relay selection with concurrent scheduling (RCS), a low-complexity algorithm implemented in two steps. The second one is the joint relay selection with dynamic scheduling (JRDS), which fully avoids relay contentions and exploits potential concurrent ability, to obtain further performance enhancement over RCS. Through extensive simulations under different environments with various flow numbers and vehicle speeds, we demonstrate that both RCS and JRDS schemes outperform the existing schemes significantly in terms of transmission time and network throughput. We also analyze the impact of threshold selection on achievable performance.

cs.IT↗

arXiv2023

P$^2$SDF for Neural Indoor Scene Reconstruction

Given only a set of images, neural implicit surface representation has shown its capability in 3D surface reconstruction. However, as the nature of per-scene optimization is based on the volumetric rendering of color, previous neural implicit surface reconstruction methods usually fail in low-textured regions, including the floors, walls, etc., which commonly exist for indoor scenes. Being aware of the fact that these low-textured regions usually correspond to planes, without introducing additional ground-truth supervisory signals or making additional assumptions about the room layout, we propose to leverage a novel Pseudo Plane-regularized Signed Distance Field (P$^2$SDF) for indoor scene reconstruction. Specifically, we consider adjacent pixels with similar colors to be on the same pseudo planes. The plane parameters are then estimated on the fly during training by an efficient and effective two-step scheme. Then the signed distances of the points on the planes are regularized by the estimated plane parameters in the training phase. As the unsupervised plane segments are usually noisy and inaccurate, we propose to assign different weights to the sampled points on the plane in plane estimation as well as the regularization loss. The weights come by fusing the plane segments from different views. As the sampled rays in the planar regions are redundant, leading to inefficient training, we further propose a keypoint-guided rays sampling strategy that attends to the informative textured regions with large color variations, and the implicit network gets a better reconstruction, compared with the original uniform ray sampling strategy. Experiments show that our P$^2$SDF achieves competitive reconstruction performance in Manhattan scenes. Further, as we do not introduce any additional room layout assumption, our P$^2$SDF generalizes well to the reconstruction of non-Manhattan scenes.

cs.CV↗

arXiv2023

AdaSAM: Boosting Sharpness-Aware Minimization with Adaptive Learning Rate and Momentum for Training Deep Neural Networks

Sharpness aware minimization (SAM) optimizer has been extensively explored as it can generalize better for training deep neural networks via introducing extra perturbation steps to flatten the landscape of deep learning models. Integrating SAM with adaptive learning rate and momentum acceleration, dubbed AdaSAM, has already been explored empirically to train large-scale deep neural networks without theoretical guarantee due to the triple difficulties in analyzing the coupled perturbation step, adaptive learning rate and momentum step. In this paper, we try to analyze the convergence rate of AdaSAM in the stochastic non-convex setting. We theoretically show that AdaSAM admits a $\mathcal{O}(1/\sqrt{bT})$ convergence rate, which achieves linear speedup property with respect to mini-batch size $b$. Specifically, to decouple the stochastic gradient steps with the adaptive learning rate and perturbed gradient, we introduce the delayed second-order momentum term to decompose them to make them independent while taking an expectation during the analysis. Then we bound them by showing the adaptive learning rate has a limited range, which makes our analysis feasible. To the best of our knowledge, we are the first to provide the non-trivial convergence rate of SAM with an adaptive learning rate and momentum acceleration. At last, we conduct several experiments on several NLP tasks, which show that AdaSAM could achieve superior performance compared with SGD, AMSGrad, and SAM optimizers.

cs.LG↗