Search arXiv⌕ Search

arXiv subjects

Li Xu

Publications and source records attributed to Li Xu.

At least 55 records · Page 3Linked to original sources

Deep Neural Network Identification of Limnonectes Species and New Class Detection Using Image Data

As is true of many complex tasks, the work of discovering, describing, and understanding the diversity of life on Earth (viz., biological systematics and taxonomy) requires many tools. Some of this work can be accomplished as it has been done in the past, but some aspects present us with challenges which traditional knowledge and tools cannot adequately resolve. One such challenge is presented by species complexes in which the morphological similarities among the group members make it difficult to reliably identify known species and detect new ones. We address this challenge by developing new tools using the principles of machine learning to resolve two specific questions related to species complexes. The first question is formulated as a classification problem in statistics and machine learning and the second question is an out-of-distribution (OOD) detection problem. We apply these tools to a species complex comprising Southeast Asian stream frogs (Limnonectes kuhlii complex) and employ a morphological character (hind limb skin texture) traditionally treated qualitatively in a quantitative and objective manner. We demonstrate that deep neural networks can successfully automate the classification of an image into a known species group for which it has been trained. We further demonstrate that the algorithm can successfully classify an image into a new class if the image does not belong to the existing classes. Additionally, we use the larger MNIST dataset to test the performance of our OOD detection algorithm. We finish our paper with some concluding remarks regarding the application of these methods to species complexes and our efforts to document true biodiversity. This paper has online supplementary materials.

stat.ML↗

Multi-modal Pre-training for Medical Vision-language Understanding and Generation: An Empirical Study with A New Benchmark

With the availability of large-scale, comprehensive, and general-purpose vision-language (VL) datasets such as MSCOCO, vision-language pre-training (VLP) has become an active area of research and proven to be effective for various VL tasks such as visual-question answering. However, studies on VLP in the medical domain have so far been scanty. To provide a comprehensive perspective on VLP for medical VL tasks, we conduct a thorough experimental analysis to study key factors that may affect the performance of VLP with a unified vision-language Transformer. To allow making sound and quick pre-training decisions, we propose RadioGraphy Captions (RGC), a high-quality, multi-modality radiographic dataset containing 18,434 image-caption pairs collected from an open-access online database MedPix. RGC can be used as a pre-training dataset or a new benchmark for medical report generation and medical image-text retrieval. By utilizing RGC and other available datasets for pre-training, we develop several key insights that can guide future medical VLP research and new strong baselines for various medical VL tasks.

cs.CV↗

Bridged-GNN: Knowledge Bridge Learning for Effective Knowledge Transfer

The data-hungry problem, characterized by insufficiency and low-quality of data, poses obstacles for deep learning models. Transfer learning has been a feasible way to transfer knowledge from high-quality external data of source domains to limited data of target domains, which follows a domain-level knowledge transfer to learn a shared posterior distribution. However, they are usually built on strong assumptions, e.g., the domain invariant posterior distribution, which is usually unsatisfied and may introduce noises, resulting in poor generalization ability on target domains. Inspired by Graph Neural Networks (GNNs) that aggregate information from neighboring nodes, we redefine the paradigm as learning a knowledge-enhanced posterior distribution for target domains, namely Knowledge Bridge Learning (KBL). KBL first learns the scope of knowledge transfer by constructing a Bridged-Graph that connects knowledgeable samples to each target sample and then performs sample-wise knowledge transfer via GNNs.KBL is free from strong assumptions and is robust to noises in the source data. Guided by KBL, we propose the Bridged-GNN} including an Adaptive Knowledge Retrieval module to build Bridged-Graph and a Graph Knowledge Transfer module. Comprehensive experiments on both un-relational and relational data-hungry scenarios demonstrate the significant improvements of Bridged-GNN compared with SOTA methods

cs.LG↗

Phases and magnetism at the microscale in compounds containing nominal Pb10-xCux(PO4)6O

Achieving superconductivity at room temperature could lead to substantial advancements in industry and technology. Recently, a compound known as Cu-doped lead-apatite, Pb10-xCux(PO4)6O (0.9 < x < 1.1), referred to as "LK-99", has been reported to exhibit unusual electrical and magnetic behaviors that appear to resemble a superconducting transition above room temperature. In this work we collected multiphase samples containing the nominal Pb10-xCux(PO4)6O phase (no superconductivity observed in our measured samples), synthesized by three independent groups, and studied their chemical, magnetic, and electrical properties at the microscale to overcome difficulties in bulk measurements. Through the utilization of optical, scanning electron, atomic force, and scanning diamond nitrogen-vacancy microscopy techniques, we are able to establish a link between local magnetic properties and specific microscale chemical phases. Our findings indicate that while the Pb10-xCux(PO4)6O phase seems to have a mixed magnetism contribution, a significant fraction of the diamagnetic response can be attributed to Cu-rich regions (e.g., Cu2S derived from a reagent used in the synthesis). Additionally, our electrical measurements reveal the phenomenon of current path switch and a change in resistance states of Cu2S. This provides a potential explanation for the electrical behavior observed in compounds related to Pb10-xCux(PO4)6O.

cond-mat.mtrl-sci↗

ET-WB: water balance-based estimations of terrestrial evaporation over global land and major global basins

The prevailing approaches for ET retrievals are either limited in spatiotemporal coverage or largely influenced by choice of input data or simplified model physics, or a combination thereof. Here, using an independent mass conservation approach, we develop water balance-based ET datasets (ET-WB) for the global land and the selected 168 major river basins. We generate 4669 probabilistic unique combinations of the ET-WB leveraging multi-source datasets (23 precipitation, 29 runoff, and 7 storage change datasets) from satellite products, in-situ measurements, reanalysis, and hydrological simulations. We compare our results with the four auxiliary global ET datasets and previous regional studies, followed by a rigorous discussion of the uncertainties, their possible sources, and potential ways to constrain them. The seasonal cycle of global ET-WB possesses a unimodal distribution with the highest (median value: 65.61 mm/month) and lowest (median value: 36.11 mm/month) values in July and January, respectively, with the spread range of roughly +/-10 mm/month from different subsets of the ensemble. Auxiliary ET products illustrate similar intra-annual characteristics with some over/under-estimation, which are completely within the range of the ET-WB ensemble. We found a gradual increase in global ET-WB from 2003 to 2010 and a subsequent decrease during 2010-2015, followed by a sharper reduction in the remaining years primarily attributed to the varying precipitation. Multiple statistical metrics show reasonably good accuracy of monthly ET-WB (e.g., a relative bias of +/-20%) in most river basins, which ameliorates at annual scales. The long-term mean annual ET-WB varies within 500-600 mm/yr and is consistent with the for auxiliary ET products (543-569 mm/yr). Observed trend estimates, though regionally divergent, are evidence of the increasing ET in a warming climate.

physics.ao-ph↗

On the existence and structures of almost axisymmetric solutions to 3-D Navier-Stokes equations

In this paper, we consider 3-D Navier-Stokes equations with almost axisymmetric initial data, which means that by writing $u_0 =u^r_0 e_r+u^θ_0 e_θ+u^z_0 e_z$ in the cylindrical coordinates, then $\partial_θu^r_0,\,\partial_θu^θ_0$ and $\partial_θu^z_0$ are small in some sense (recall axisymmetric means these three quantities vanish). Then with additional smallness assumption on $u^θ_0$, we prove the global existence of a unique strong solution $u$, and this solution keeps close to some axisymmetric vector field. We also establish some refined estimates for the integral average in $θ$ variable for $u$. Moreover, as $u^r_0,\,u^θ_0$ and $u^z_0$ here depend on $θ$, it is natural to expand them into Fourier series in $θ$ variable. And we shall consider one special form of $u_0$, with some small parameter $\varepsilon$ to measure its swirl part and oscillating part. We study the asymptotic expansion of the corresponding solution, and the influences between different profiles in the asymptotic expansion. In particular, we give some special symmetric structures that will persist for all time. These phenomena reflect some features of the nonlinear terms in Navier-Stokes equations.

math.AP↗

Meta Compositional Referring Expression Segmentation

Referring expression segmentation aims to segment an object described by a language expression from an image. Despite the recent progress on this task, existing models tackling this task may not be able to fully capture semantics and visual representations of individual concepts, which limits their generalization capability, especially when handling novel compositions of learned concepts. In this work, through the lens of meta learning, we propose a Meta Compositional Referring Expression Segmentation (MCRES) framework to enhance model compositional generalization performance. Specifically, to handle various levels of novel compositions, our framework first uses training data to construct a virtual training set and multiple virtual testing sets, where data samples in each virtual testing set contain a level of novel compositions w.r.t. the virtual training set. Then, following a novel meta optimization scheme to optimize the model to obtain good testing performance on the virtual testing sets after training on the virtual training set, our framework can effectively drive the model to better capture semantics and visual representations of individual concepts, and thus obtain robust generalization performance even when handling novel compositions. Extensive experiments on three benchmark datasets demonstrate the effectiveness of our framework.

cs.CV↗

Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network

Graphs consisting of vocal nodes ("the vocal minority") and silent nodes ("the silent majority"), namely VS-Graph, are ubiquitous in the real world. The vocal nodes tend to have abundant features and labels. In contrast, silent nodes only have incomplete features and rare labels, e.g., the description and political tendency of politicians (vocal) are abundant while not for ordinary people (silent) on the twitter's social network. Predicting the silent majority remains a crucial yet challenging problem. However, most existing message-passing based GNNs assume that all nodes belong to the same domain, without considering the missing features and distribution-shift between domains, leading to poor ability to deal with VS-Graph. To combat the above challenges, we propose Knowledge Transferable Graph Neural Network (KT-GNN), which models distribution shifts during message passing and representation learning by transferring knowledge from vocal nodes to silent nodes. Specifically, we design the domain-adapted "feature completion and message passing mechanism" for node representation learning while preserving domain difference. And a knowledge transferable classifier based on KL-divergence is followed. Comprehensive experiments on real-world scenarios (i.e., company financial risk assessment and political elections) demonstrate the superior performance of our method. Our source code has been open sourced.

cs.LG↗

Collaborative Authentication for 6G Networks: An Edge Intelligence based Autonomous Approach

The conventional device authentication of wireless networks usually relies on a security server and centralized process, leading to long latency and risk of single-point of failure. While these challenges might be mitigated by collaborative authentication schemes, their performance remains limited by the rigidity of data collection and aggregated result. They also tend to ignore attacker localization in the collaborative authentication process. To overcome these challenges, a novel collaborative authentication scheme is proposed, where multiple edge devices act as cooperative peers to assist the service provider in distributively authenticating its users by estimating their received signal strength indicator (RSSI) and mobility trajectory (TRA). More explicitly, a distributed learning-based collaborative authentication algorithm is conceived, where the cooperative peers update their authentication models locally, thus the network congestion and response time remain low. Moreover, a situation-aware secure group update algorithm is proposed for autonomously refreshing the set of cooperative peers in the dynamic environment. We also develop an algorithm for localizing a malicious user by the cooperative peers once it is identified. The simulation results demonstrate that the proposed scheme is eminently suitable for both indoor and outdoor communication scenarios, and outperforms some existing benchmark schemes.

cs.CR↗

Subfield Codes of Several Few-Weight Linear Codes Parametrized by Functions and Their Consequences

Subfield codes of linear codes over finite fields have recently received much attention. Some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, the $q$-ary subfield codes $C_{f,g}^{(q)}$ of six different families of linear codes $C_{f,g}$ parametrized by two functions $f, g$ over a finite field $F_{q^m}$ are considered and studied, respectively. The parameters and (Hamming) weight distribution of $C_{f,g}^{(q)}$ and their punctured codes $\bar{C}_{f,g}^{(q)}$ are explicitly determined. The parameters of the duals of these codes are also analyzed. Some of the resultant $q$-ary codes $C_{f,g}^{(q)},$ $\bar{C}_{f,g}^{(q)}$ and their dual codes are optimal and some have the best known parameters. The parameters and weight enumerators of the first two families of linear codes $C_{f,g}$ are also settled, among which the first family is an optimal two-weight linear code meeting the Griesmer bound, and the dual codes of these two families are almost MDS codes. As a byproduct of this paper, a family of $[2^{4m-2},2m+1,2^{4m-3}]$ quaternary Hermitian self-dual code are obtained with $m \geq 2$. As an application, we show that three families of the derived linear codes give rise to several infinite families of $t$-designs ($t \in \{2, 3\}$).

cs.IT↗

In-situ electrical and thermal transport properties of FeySe1-xTex films with ionic liquid gating

We combine in-situ electrical transport and Seebeck coefficient measurements with the ionic liquid gating technique to investigate superconductivity and the normal state of FeySe1-xTex (FST) films. We find that the pristine FST films feature a non-Fermi liquid temperature dependence of the Seebeck coefficient, i.e., S/T ~ AS lnT, and AS is strongly correlated with the superconducting transition temperature (Tc). Ionic liquid gating significantly raises Tc of FST films, for which the Seebeck coefficient displays a novel scaling behavior and retains the logarithmic temperature dependence. Moreover, a quantitative relationship between the slope of T-linear resistivity (A\r{ho}) and Tc for gated films is observed, i.e., (A\r{ho})1/2 ~ Tc, consistent with previous reports on cuprates and FeSe. The scaling behaviors of AS and A\r{ho} point to a spin-fluctuation-associated transport mechanism in gated FeySe1-xTex superconductors.

cond-mat.supr-con↗

Linearization of a dual-parallel Mach-Zehnder modulator using optical carrier band processing

The linearization of a microwave photonic link based on a dual-parallel Mach-Zehnder modulator is theoretically described and experimentally demonstrated. Up to four different radio frequency tones are considered in the study, which allow us to provide a complete mathematical description of all third-order distortion terms that arise at the photodetector. Simulations show that a complete linearization is obtained by properly tuning the DC bias voltages and processing the optical carrier and. As a result, a suppression of 17 dBm is experimentally obtained for the third-order distortion terms, as well as a SDFR improvement of 3 dB. The proposed linearization method enables the simultaneous modulation of four different signals without the need of additional radio frequency components, which is desirable to its implementation in integrated optics and makes it suitable for several applications in microwave photonics.

physics.optics↗

Global Priors Guided Modulation Network for Joint Super-Resolution and Inverse Tone-Mapping

Joint super-resolution and inverse tone-mapping (SR-ITM) aims to enhance the visual quality of videos that have quality deficiencies in resolution and dynamic range. This problem arises when using 4K high dynamic range (HDR) TVs to watch a low-resolution standard dynamic range (LR SDR) video. Previous methods that rely on learning local information typically cannot do well in preserving color conformity and long-range structural similarity, resulting in unnatural color transition and texture artifacts. In order to tackle these challenges, we propose a global priors guided modulation network (GPGMNet) for joint SR-ITM. In particular, we design a global priors extraction module (GPEM) to extract color conformity prior and structural similarity prior that are beneficial for ITM and SR tasks, respectively. To further exploit the global priors and preserve spatial information, we devise multiple global priors guided spatial-wise modulation blocks (GSMBs) with a few parameters for intermediate feature modulation, in which the modulation parameters are generated by the shared global priors and the spatial features map from the spatial pyramid convolution block (SPCB). With these elaborate designs, the GPGMNet can achieve higher visual quality with lower computational complexity. Extensive experiments demonstrate that our proposed GPGMNet is superior to the state-of-the-art methods. Specifically, our proposed model exceeds the state-of-the-art by 0.64 dB in PSNR, with 69$\%$ fewer parameters and 3.1$\times$ speedup. The code will be released soon.

cs.CV↗

SDRTV-to-HDRTV Conversion via Spatial-Temporal Feature Fusion

HDR(High Dynamic Range) video can reproduce realistic scenes more realistically, with a wider gamut and broader brightness range. HDR video resources are still scarce, and most videos are still stored in SDR (Standard Dynamic Range) format. Therefore, SDRTV-to-HDRTV Conversion (SDR video to HDR video) can significantly enhance the user's video viewing experience. Since the correlation between adjacent video frames is very high, the method utilizing the information of multiple frames can improve the quality of the converted HDRTV. Therefore, we propose a multi-frame fusion neural network \textbf{DSLNet} for SDRTV to HDRTV conversion. We first propose a dynamic spatial-temporal feature alignment module \textbf{DMFA}, which can align and fuse multi-frame. Then a novel spatial-temporal feature modulation module \textbf{STFM}, STFM extracts spatial-temporal information of adjacent frames for more accurate feature modulation. Finally, we design a quality enhancement module \textbf{LKQE} with large kernels, which can enhance the quality of generated HDR videos. To evaluate the performance of the proposed method, we construct a corresponding multi-frame dataset using HDR video of the HDR10 standard to conduct a comprehensive evaluation of different methods. The experimental results show that our method obtains state-of-the-art performance. The dataset and code will be released.

eess.IV↗

Individualized Conditioning and Negative Distances for Speaker Separation

Speaker separation aims to extract multiple voices from a mixed signal. In this paper, we propose two speaker-aware designs to improve the existing speaker separation solutions. The first model is a speaker conditioning network that integrates speech samples to generate individualized speaker conditions, which then provide informed guidance for a separation module to produce well-separated outputs. The second design aims to reduce non-target voices in the separated speech. To this end, we propose negative distances to penalize the appearance of any non-target voice in the channel outputs, and positive distances to drive the separated voices closer to the clean targets. We explore two different setups, weighted-sum and triplet-like, to integrate these two distances to form a combined auxiliary loss for the separation networks. Experiments conducted on LibriMix demonstrate the effectiveness of our proposed models.

cs.SD↗

Heatmap Distribution Matching for Human Pose Estimation

For tackling the task of 2D human pose estimation, the great majority of the recent methods regard this task as a heatmap estimation problem, and optimize the heatmap prediction using the Gaussian-smoothed heatmap as the optimization objective and using the pixel-wise loss (e.g. MSE) as the loss function. In this paper, we show that optimizing the heatmap prediction in such a way, the model performance of body joint localization, which is the intrinsic objective of this task, may not be consistently improved during the optimization process of the heatmap prediction. To address this problem, from a novel perspective, we propose to formulate the optimization of the heatmap prediction as a distribution matching problem between the predicted heatmap and the dot annotation of the body joint directly. By doing so, our proposed method does not need to construct the Gaussian-smoothed heatmap and can achieve a more consistent model performance improvement during the optimization of the heatmap prediction. We show the effectiveness of our proposed method through extensive experiments on the COCO dataset and the MPII dataset.

cs.CV↗

Hypothesis Testing for Detecting Outlier Evaluators

In epidemiological studies, very often, evaluators obtain measurements of disease outcomes for study participants. In this paper, we propose a two-stage procedure for detecting outlier evaluators. In the first stage, a regression model is fitted to obtain the evaluators' effects. The outlier evaluators are considered as those with different effects compared with the normal evaluators. In the second stage, stepwise hypothesis testings are performed to detect outlier evaluators. The true positive rate and true negative rate of the proposed procedure are assessed in a simulation study. We apply the proposed method to detect potential outlier audiologists among the audiologists who measured hearing threshold levels of the participants in the Audiology Assessment Arm of the Conservation of Hearing Study, which is an epidemiological study for examining risk factors of hearing loss.

stat.AP↗

Near-MDS Codes from Maximal Arcs in PG$(2,q)$

The singleton defect of an $[n,k,d]$ linear code ${\cal C}$ is defined as $s({\cal C})=n-k+1-d$. Codes with $S({\cal C})=0$ are called maximum distance separable (MDS) codes, and codes with $S(\cal C)=S(\cal C ^{\bot})=1$ are called near maximum distance separable (NMDS) codes. Both MDS codes and NMDS codes have good representations in finite projective geometry. MDS codes over $F_q$ with length $n$ and $n$-arcs in PG$(k-1,q)$ are equivalent objects. When $k=3$, NMDS codes of length $n$ are equivalent to $(n,3)$-arcs in PG$(2,q)$. In this paper, we deal with the NMDS codes with dimension 3. By adding some suitable projective points in maximal arcs of PG$(2,q)$, we can obtain two classes of $(q+5,3)$-arcs (or equivalently $[q+5,3,q+2]$ NMDS codes) for any prime power $q$. We also determine the exact weight distribution and the locality of such NMDS codes and their duals. It turns out that the resultant NMDS codes and their duals are both distance-optimal and dimension-optimal locally recoverable codes.

cs.IT↗