arXiv subjects

Jun Li

Publications and source records attributed to Jun Li.

At least 235 records · Page 13Linked to original sources

arXiv2025

The GMRES method for solving the large indefinite least squares problem via an accelerated preconditioner

In this research, to solve the large indefinite least squares problem, we firstly transform its normal equation into a sparse block three-by-three linear systems, then use GMRES method with an accelerated preconditioner to solve it. The construction idea of the preconditioner comes from the thought of Luo et.al [Luo, WH., Gu, XM., Carpentieri, B., BIT 62, 1983-2004(2022)], and the advantage of this is that the preconditioner is closer to the coefficient matrix of the block three-by-three linear systems when the parameter approachs zero. Theoretically, the iteration method under the preconditioner satisfies the conditional convergence, and all eigenvalues of the preconditioned matrix are real numbers and gathered at point $(1,0)$ as parameter is close to $0$. In the end, numerical results reflect that the theoretical results is correct and the proposed preconditioner is effective by comparing with serval existing preconditioners.

math.NA↗

arXiv2025

Feature Map Similarity Reduction in Convolutional Neural Networks

It has been observed that Convolutional Neural Networks (CNNs) suffer from redundancy in feature maps, leading to inefficient capacity utilization. Efforts to address this issue have largely focused on kernel orthogonality method. In this work, we theoretically and empirically demonstrate that kernel orthogonality does not necessarily lead to a reduction in feature map redundancy. Based on this analysis, we propose the Convolutional Similarity method to reduce feature map similarity, independently of the CNN's input. The Convolutional Similarity can be minimized as either a regularization term or an iterative initialization method. Experimental results show that minimizing Convolutional Similarity not only improves classification accuracy but also accelerates convergence. Furthermore, our method enables the use of significantly smaller models to achieve the same level of performance, promoting a more efficient use of model capacity. Future work will focus on coupling the iterative initialization method with the optimization momentum term and examining the method's impact on generative frameworks.

cs.CV↗

arXiv2025

NOVA: A Benchmark for Anomaly Localization and Clinical Reasoning in Brain MRI

In many real-world applications, deployed models encounter inputs that differ from the data seen during training. Out-of-distribution detection identifies whether an input stems from an unseen distribution, while open-world recognition flags such inputs to ensure the system remains robust as ever-emerging, previously $unknown$ categories appear and must be addressed without retraining. Foundation and vision-language models are pre-trained on large and diverse datasets with the expectation of broad generalization across domains, including medical imaging. However, benchmarking these models on test sets with only a few common outlier types silently collapses the evaluation back to a closed-set problem, masking failures on rare or truly novel conditions encountered in clinical use. We therefore present $NOVA$, a challenging, real-life $evaluation-only$ benchmark of $\sim$900 brain MRI scans that span 281 rare pathologies and heterogeneous acquisition protocols. Each case includes rich clinical narratives and double-blinded expert bounding-box annotations. Together, these enable joint assessment of anomaly localisation, visual captioning, and diagnostic reasoning. Because NOVA is never used for training, it serves as an $extreme$ stress-test of out-of-distribution generalisation: models must bridge a distribution gap both in sample appearance and in semantic space. Baseline results with leading vision-language models (GPT-4o, Gemini 2.0 Flash, and Qwen2.5-VL-72B) reveal substantial performance drops across all tasks, establishing NOVA as a rigorous testbed for advancing models that can detect, localize, and reason about truly unknown anomalies.

eess.IV↗

arXiv2025

Advancing Multiple Instance Learning with Continual Learning for Whole Slide Imaging

Advances in medical imaging and deep learning have propelled progress in whole slide image (WSI) analysis, with multiple instance learning (MIL) showing promise for efficient and accurate diagnostics. However, conventional MIL models often lack adaptability to evolving datasets, as they rely on static training that cannot incorporate new information without extensive retraining. Applying continual learning (CL) to MIL models is a possible solution, but often sees limited improvements. In this paper, we analyze CL in the context of attention MIL models and find that the model forgetting is mainly concentrated in the attention layers of the MIL model. Using the results of this analysis we propose two components for improving CL on MIL: Attention Knowledge Distillation (AKD) and the Pseudo-Bag Memory Pool (PMP). AKD mitigates catastrophic forgetting by focusing on retaining attention layer knowledge between learning sessions, while PMP reduces the memory footprint by selectively storing only the most informative patches, or ``pseudo-bags'' from WSIs. Experimental evaluations demonstrate that our method significantly improves both accuracy and memory efficiency on diverse WSI datasets, outperforming current state-of-the-art CL methods. This work provides a foundation for CL in large-scale, weakly annotated clinical datasets, paving the way for more adaptable and resilient diagnostic models.

cs.CV↗

arXiv2025

Generalizable Pancreas Segmentation via a Dual Self-Supervised Learning Framework

Recently, numerous pancreas segmentation methods have achieved promising performance on local single-source datasets. However, these methods don't adequately account for generalizability issues, and hence typically show limited performance and low stability on test data from other sources. Considering the limited availability of distinct data sources, we seek to improve the generalization performance of a pancreas segmentation model trained with a single-source dataset, i.e., the single source generalization task. In particular, we propose a dual self-supervised learning model that incorporates both global and local anatomical contexts. Our model aims to fully exploit the anatomical features of the intra-pancreatic and extra-pancreatic regions, and hence enhance the characterization of the high-uncertainty regions for more robust generalization. Specifically, we first construct a global-feature contrastive self-supervised learning module that is guided by the pancreatic spatial structure. This module obtains complete and consistent pancreatic features through promoting intra-class cohesion, and also extracts more discriminative features for differentiating between pancreatic and non-pancreatic tissues through maximizing inter-class separation. It mitigates the influence of surrounding tissue on the segmentation outcomes in high-uncertainty regions. Subsequently, a local-image restoration self-supervised learning module is introduced to further enhance the characterization of the high uncertainty regions. In this module, informative anatomical contexts are actually learned to recover randomly corrupted appearance patterns in those regions.

cs.CV↗

arXiv2025

Thermally driven two-sphere microswimmer with internal feedback control

We discuss the locomotion of a thermally driven elastic two-sphere microswimmer with internal feedback control that is realized by the position-dependent friction coefficients. In our model, the two spheres are in equilibrium with independent heat baths having different temperatures, causing a heat flow between the two spheres. We generally show that the average velocity of the microswimmer is nonzero when the friction coefficients are position-dependent. Using the method of stochastic thermodynamics, we obtain the entropy production rate and discuss the efficiency of the two-sphere microswimmer. The proposed self-propulsion mechanism highlights the importance of information in active matter and can be a fundamental process in various biological systems.

cond-mat.soft↗

arXiv2025

A Dual-Task Synergy-Driven Generalization Framework for Pancreatic Cancer Segmentation in CT Scans

Pancreatic cancer, characterized by its notable prevalence and mortality rates, demands accurate lesion delineation for effective diagnosis and therapeutic interventions. The generalizability of extant methods is frequently compromised due to the pronounced variability in imaging and the heterogeneous characteristics of pancreatic lesions, which may mimic normal tissues and exhibit significant inter-patient variability. Thus, we propose a generalization framework that synergizes pixel-level classification and regression tasks, to accurately delineate lesions and improve model stability. This framework not only seeks to align segmentation contours with actual lesions but also uses regression to elucidate spatial relationships between diseased and normal tissues, thereby improving tumor localization and morphological characterization. Enhanced by the reciprocal transformation of task outputs, our approach integrates additional regression supervision within the segmentation context, bolstering the model's generalization ability from a dual-task perspective. Besides, dual self-supervised learning in feature spaces and output spaces augments the model's representational capability and stability across different imaging views. Experiments on 594 samples composed of three datasets with significant imaging differences demonstrate that our generalized pancreas segmentation results comparable to mainstream in-domain validation performance (Dice: 84.07%). More importantly, it successfully improves the results of the highly challenging cross-lesion generalized pancreatic cancer segmentation task by 9.51%. Thus, our model constitutes a resilient and efficient foundational technological support for pancreatic disease management and wider medical applications. The codes will be released at https://github.com/SJTUBME-QianLab/Dual-Task-Seg.

eess.IV↗

arXiv2025

Wireless Communication as an Information Sensor for Multi-agent Cooperative Perception: A Survey

Cooperative perception extends the perception capabilities of autonomous vehicles by enabling multi-agent information sharing via Vehicle-to-Everything (V2X) communication. Unlike traditional onboard sensors, V2X acts as a dynamic "information sensor" characterized by limited communication, heterogeneity, mobility, and scalability. This survey provides a comprehensive review of recent advancements from the perspective of information-centric cooperative perception, focusing on three key dimensions: information representation, information fusion, and large-scale deployment. We categorize information representation into data-level, feature-level, and object-level schemes, and highlight emerging methods for reducing data volume and compressing messages under communication constraints. In information fusion, we explore techniques under both ideal and non-ideal conditions, including those addressing heterogeneity, localization errors, latency, and packet loss. Finally, we summarize system-level approaches to support scalability in dense traffic scenarios. Compared with existing surveys, this paper introduces a new perspective by treating V2X communication as an information sensor and emphasizing the challenges of deploying cooperative perception in real-world intelligent transportation systems.

cs.OH↗

arXiv2025

Automating Function-Level TARA for Automotive Full-Lifecycle Security

As modern vehicles evolve into intelligent and connected systems, their growing complexity introduces significant cybersecurity risks. Threat Analysis and Risk Assessment (TARA) has therefore become essential for managing these risks under mandatory regulations. However, existing TARA automation methods rely on static threat libraries, limiting their utility in the detailed, function-level analyses demanded by industry. This paper introduces DefenseWeaver, the first system that automates function-level TARA using component-specific details and large language models (LLMs). DefenseWeaver dynamically generates attack trees and risk evaluations from system configurations described in an extended OpenXSAM++ format, then employs a multi-agent framework to coordinate specialized LLM roles for more robust analysis. To further adapt to evolving threats and diverse standards, DefenseWeaver incorporates Low-Rank Adaptation (LoRA) fine-tuning and Retrieval-Augmented Generation (RAG) with expert-curated TARA reports. We validated DefenseWeaver through deployment in four automotive security projects, where it identified 11 critical attack paths, verified through penetration testing, and subsequently reported and remediated by the relevant automakers and suppliers. Additionally, DefenseWeaver demonstrated cross-domain adaptability, successfully applying to unmanned aerial vehicles (UAVs) and marine navigation systems. In comparison to human experts, DefenseWeaver outperformed manual attack tree generation across six assessment scenarios. Integrated into commercial cybersecurity platforms such as UAES and Xiaomi, DefenseWeaver has generated over 8,200 attack trees. These results highlight its ability to significantly reduce processing time, and its scalability and transformative impact on cybersecurity across industries.

cs.CR↗

arXiv2025

Industrial Metaverse: Enabling Technologies, Open Problems, and Future Trends

As an emerging technology that enables seamless integration between the physical and virtual worlds, the Metaverse has great potential to be deployed in the industrial production field with the development of extended reality (XR) and next-generation communication networks. This deployment, called the Industrial Metaverse, is used for product design, production operations, industrial quality inspection, and product testing. However, there lacks of in-depth understanding of the enabling technologies associated with the Industrial Metaverse. This encompasses both the precise industrial scenarios targeted by each technology and the potential migration of technologies developed in other domains to the industrial sector. Driven by this issue, in this article, we conduct a comprehensive survey of the state-of-the-art literature on the Industrial Metaverse. Specifically, we first analyze the advantages of the Metaverse for industrial production. Then, we review a collection of key enabling technologies of the Industrial Metaverse, including blockchain (BC), digital twin (DT), 6G, XR, and artificial intelligence (AI), and analyze how these technologies can support different aspects of industrial production. Subsequently, we present numerous formidable challenges encountered within the Industrial Metaverse, including confidentiality and security concerns, resource limitations, and interoperability constraints. Furthermore, we investigate the extant solutions devised to address them. Finally, we briefly outline several open issues and future research directions of the Industrial Metaverse.

cs.CE↗

arXiv2025

UniAP: Unifying Inter- and Intra-Layer Automatic Parallelism by Mixed Integer Quadratic Programming

Distributed learning is commonly used for training deep learning models, especially large models. In distributed learning, manual parallelism (MP) methods demand considerable human effort and have limited flexibility. Hence, automatic parallelism (AP) methods have recently been proposed for automating the parallel strategy optimization process. Existing AP methods suffer from sub-optimal solutions because they do not jointly optimize the two categories of parallel strategies (i.e., inter-layer parallelism and intra-layer parallelism). In this paper, we propose a novel AP method called UniAP, which unifies inter- and intra-layer automatic parallelism by mixed integer quadratic programming. To the best of our knowledge, UniAP is the first parallel method that can jointly optimize the two categories of parallel strategies to find an optimal solution. Experimental results show that UniAP outperforms state-of-the-art methods by up to 3.80$\times$ in throughput and reduces strategy optimization time by up to 107$\times$ across five Transformer-based models.

cs.LG↗

arXiv2025

SAM-Based Building Change Detection with Distribution-Aware Fourier Adaptation and Edge-Constrained Warping

Building change detection remains challenging for urban development, disaster assessment, and military reconnaissance. While foundation models like Segment Anything Model (SAM) show strong segmentation capabilities, SAM is limited in the task of building change detection due to domain gap issues. Existing adapter-based fine-tuning approaches face challenges with imbalanced building distribution, resulting in poor detection of subtle changes and inaccurate edge extraction. Additionally, bi-temporal misalignment in change detection, typically addressed by optical flow, remains vulnerable to background noises. This affects the detection of building changes and compromises both detection accuracy and edge recognition. To tackle these challenges, we propose a new SAM-Based Network with Distribution-Aware Fourier Adaptation and Edge-Constrained Warping (FAEWNet) for building change detection. FAEWNet utilizes the SAM encoder to extract rich visual features from remote sensing images. To guide SAM in focusing on specific ground objects in remote sensing scenes, we propose a Distribution-Aware Fourier Aggregated Adapter to aggregate task-oriented changed information. This adapter not only effectively addresses the domain gap issue, but also pays attention to the distribution of changed buildings. Furthermore, to mitigate noise interference and misalignment in height offset estimation, we design a novel flow module that refines building edge extraction and enhances the perception of changed buildings. Our state-of-the-art results on the LEVIR-CD, S2Looking and WHU-CD datasets highlight the effectiveness of FAEWNet. The code is available at https://github.com/SUPERMAN123000/FAEWNet.

cs.CV↗

arXiv2025

AeroLite: Tag-Guided Lightweight Generation of Aerial Image Captions

Accurate and automated captioning of aerial imagery is crucial for applications like environmental monitoring, urban planning, and disaster management. However, this task remains challenging due to complex spatial semantics and domain variability. To address these issues, we introduce \textbf{AeroLite}, a lightweight, tag-guided captioning framework designed to equip small-scale language models (1--3B parameters) with robust and interpretable captioning capabilities specifically for remote sensing images. \textbf{AeroLite} leverages GPT-4o to generate a large-scale, semantically rich pseudo-caption dataset by integrating multiple remote sensing benchmarks, including DLRSD, iSAID, LoveDA, WHU, and RSSCN7. To explicitly capture key semantic elements such as orientation and land-use types, AeroLite employs natural language processing techniques to extract relevant semantic tags. These tags are then learned by a dedicated multi-label CLIP encoder, ensuring precise semantic predictions. To effectively fuse visual and semantic information, we propose a novel bridging multilayer perceptron (MLP) architecture, aligning semantic tags with visual embeddings while maintaining minimal computational overhead. AeroLite's flexible design also enables seamless integration with various pretrained large language models. We adopt a two-stage LoRA-based training approach: the initial stage leverages our pseudo-caption dataset to capture broad remote sensing semantics, followed by fine-tuning on smaller, curated datasets like UCM and Sydney Captions to refine domain-specific alignment. Experimental evaluations demonstrate that AeroLite surpasses significantly larger models (e.g., 13B parameters) in standard captioning metrics, including BLEU and METEOR, while maintaining substantially lower computational costs.

cs.CV↗

arXiv2025

A Study of Multiple Molecular Lines at the 3 mm Band toward Gas Infalling Sources

The study of multiple molecular spectral lines in gas infalling sources can provide the physical and chemical properties of these sources and help us estimate their evolutionary stages. We report line detections within the 3 mm band using the FTS wide-sideband mode of the IRAM 30 m telescope toward 20 gas-infalling sources. Using XCLASS, we identify the emission lines of up to 22 molecular species (including a few isotopologues) and one hydrogen radio recombination line in these sources. H$^{13}$CO$^+$, HCO$^+$, HCN, HNC, c-C$_3$H$_2$, and CCH lines are detected in 15 sources. We estimate the rotation temperatures and column densities of these molecular species using the LTE radiative transfer model, and compare the molecular abundances of these sources with those from nine high-mass star-forming regions reported in previous studies and with those from the chemical model. Our results suggest that G012.79-0.20, G012.87-0.22 clump A and B, and G012.96-0.23 clump A may be in the high-mass protostellar object stage, while sources with fewer detected species may be in the earlier evolutionary stage. Additionally, the CCH and c-C$_3$H$_2$ column densities in our sources reveal a linear correlation, with a ratio of N(CCH)/N(c-C$_3$H$_2$) = 89.2$\pm$5.6, which is higher than the ratios reported in the literature. When considering only sources with lower column densities, this ratio decreases to 29.0$\pm$6.1, consistent with those of diffuse clouds. Furthermore, a comparison between the N(CCH)/N(c-C$_3$H$_2$) ratio and the sources' physical parameters reveals a correlation, with sources exhibiting higher ratios tending to have higher kinetic temperatures and H$_2$ column densities.

astro-ph.GA↗

arXiv2025

Entangling quantum memories over 420 km in fiber

Long-distance entanglement is pivotal for quantum communication, distributed quantum computing and sensing. Significant progresses have been made in extending the distribution distance of entangled photons, either in free space or fiber. For future quantum network applications, matter-based entanglement is more favorable since the capability of storage is essential for advanced applications. Extending entanglement distance for memory qubits was partially hindered by the mismatch of its photonic emission wavelength with the low-loss transmission window of optical fiber. By incorporating quantum frequency conversion, memory-memory entanglement has been successfully extended to several tens of kilometers. Here, we make a significant step further by reporting the entanglement between two atomic ensemble quantum memories over 420 km. We convert photons emitted from the memories to telecom S-band, which enable us to exploit the significantly low transmission loss in fiber (0.17 dB/km). We employ the DLCZ scheme for remote entanglement generation, and delicately stabilize the relative phase between the two memories by using fulltime far-off-resonant locking to reduce high-frequency noise and intermittent dual-band locking to compensate low-frequency drift jointly. We demonstrate that the memory-memory entangling probability beats the repeaterless channel capacity for direct entanglement distribution. Our experiment provides a testbed of studying quantum network applications from metropolitan scale to intercity scale.

quant-ph↗

arXiv2025

Ornstein-Uhlenbeck information swimmers with external and internal feedback controls

Using an underdamped active Ornstein-Uhlenbeck particle, we propose two information swimmer models having either external or internal feedback control and perform their numerical simulations. Depending on the velocity that is measured after every fixed time interval (measurement time), the friction coefficient is modified in the externally controlled model, whereas the persistence time for the activity is changed in the internally controlled one. In the steady state, both of these information swimmers acquire finite average velocities in the noisy environment, and the efficiency can be maximized by tuning the measurement time. The internally controlled swimmer can generally achieve a larger velocity and efficiency than the externally controlled one when the active fluctuation is large.

cond-mat.soft↗

arXiv2025

Entangling two Rydberg Superatoms via Heralded Storage

Heralded storage of photons is crucial for advancing quantum networks. Previous realizations have primarily relied on single atoms strongly coupled to optical cavities. In this work, we present the experimental realization of heralded storage using a Rydberg superatom, a mesoscopic atomic ensemble operating in the strong blockade regime. In our approach, an input photon is initially stored in the superatom via electromagnetically induced transparency. Subsequently, a second photon is emitted conditioned on the success of the first photon's storage. Due to the collectively enhanced interaction, both the storage and the emission of the herald photon can be rather efficient in principle. As a demonstration of this technique, we use it to entangle two remote Rydberg superatoms. This method obviates the need for an intermediate node, which is commonly employed in traditional interference-based remote entanglement schemes. Our results showcase the potential of performing cavity-QED-like experiments with Rydberg superatoms. This work opens pathways for numerous applications in quantum networks and linear optical quantum computing.

quant-ph↗

arXiv2025

AutoSSVH: Exploring Automated Frame Sampling for Efficient Self-Supervised Video Hashing

Self-Supervised Video Hashing (SSVH) compresses videos into hash codes for efficient indexing and retrieval using unlabeled training videos. Existing approaches rely on random frame sampling to learn video features and treat all frames equally. This results in suboptimal hash codes, as it ignores frame-specific information density and reconstruction difficulty. To address this limitation, we propose a new framework, termed AutoSSVH, that employs adversarial frame sampling with hash-based contrastive learning. Our adversarial sampling strategy automatically identifies and selects challenging frames with richer information for reconstruction, enhancing encoding capability. Additionally, we introduce a hash component voting strategy and a point-to-set (P2Set) hash-based contrastive objective, which help capture complex inter-video semantic relationships in the Hamming space and improve the discriminability of learned hash codes. Extensive experiments demonstrate that AutoSSVH achieves superior retrieval efficacy and efficiency compared to state-of-the-art approaches. Code is available at https://github.com/EliSpectre/CVPR25-AutoSSVH.

cs.CV↗