Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xinxin Chen

dblp:66/8309 · DBLP profile ↗
← Back
13ranked-venue papers
2as first author
8since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 2 since 2021Artificial intelligence and machine learning · 3 · 2 since 2021Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Autonomous driving · 28% 3D vision · 24% Efficient and distributed learning · 19%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › single-cell analysis
single-cell multiomics
1.012026
OTMODE: an optimal transport theory-based framework for identifying differential features in single-cell multi-omics data · Bioinform. 2026
Machine learning › Generative modeling
autoregressive model
0.912025
DriveGPT: Scaling Autoregressive Behavior Models for Driving · ICML 2025
Natural language and speech › Language models and text generation › neural language model
autoregressive transformer
0.912025
DriveGPT: Scaling Autoregressive Behavior Models for Driving · ICML 2025
Robotics › Autonomous driving
behavior modeling
0.912025
DriveGPT: Scaling Autoregressive Behavior Models for Driving · ICML 2025
Machine learning › Efficient and distributed learning › large-scale learning
model scaling
0.912025
DriveGPT: Scaling Autoregressive Behavior Models for Driving · ICML 2025
Robotics › Autonomous driving
trajectory prediction
0.912025
DriveGPT: Scaling Autoregressive Behavior Models for Driving · ICML 2025
Computer vision › 3D vision › depth estimation
high-resolution depth estimation
0.512021
HR-Depth: High Resolution Self-Supervised Monocular Depth Estimation · AAAI 2021
Computer vision › 3D vision › depth estimation
monocular depth estimation
0.512021
HR-Depth: High Resolution Self-Supervised Monocular Depth Estimation · AAAI 2021
Computer vision › 3D vision › depth estimation
self-supervised depth estimation
0.512021
HR-Depth: High Resolution Self-Supervised Monocular Depth Estimation · AAAI 2021
Machine learning › Efficient and distributed learning › model compression
lightweight neural network
0.112021
HR-Depth: High Resolution Self-Supervised Monocular Depth Estimation · AAAI 2021
Machine learning › Efficient and distributed learning
model compression
0.112021
HR-Depth: High Resolution Self-Supervised Monocular Depth Estimation · AAAI 2021

Methods — techniques the papers use, named apart from their topics

wald test · 1.0sinkhorn algorithm · 1.0optimal transport · 1.0transformer · 0.9pre-training · 0.9autoregressive modeling · 0.9squeeze-and-excitation · 0.5skip-connection redesign · 0.5feature fusion · 0.5
YearPublicationVenuePosition
2026 On Performance of NNVC Inter-Coding
Xinxin Chen, Nianxiang Fu, Junxi Zhang, Ding Ding 0004, Wenzhuo Ma, Zhenzhong Chen 0001
ISCAS1
2026 Learning-enhanced Video Compression with Capability beyond VVC
Luyi Qin, Xinxin Chen, Nianxiang Fu, Haodong Qu, Wenzhuo Ma, Junxi Zhang, Zhenzhong Chen 0001
ISCAS3
2026 OTMODE: an optimal transport theory-based framework for identifying differential features in single-cell multi-omics data
abstract
MOTIVATION: Single-cell technologies enable high-resolution cellular studies but face challenges in identifying differential features due to data complexity. RESULTS: We present OTMODE, a non-parametric method using unbalanced Sinkhorn algorithm and Wald test to improve differential feature identification in single-cell multi-omics data. Under simulation, OTMODE achieved superior performance (average 90% F1 score; average 92% AUC score) with high efficiency (2.2 s for 5000 cells). In practice, it shows greater sensitivity than other state-of-the-art methods in detecting meaningful processes and can evaluate annotation accuracy by identifying potentially misannotated clusters from auto-annotation tools. Furthermore, OTMODE integrates seamlessly with Scanpy, offering a user-friendly solution for researchers. AVAILABILITY AND IMPLEMENTATION: OTMODE is freely available at https://github.com/Eggong/OTMODE and also available at https://pypi.org/project/OTMODE/.
Huidong Su, Caicai Zhang, Frank Qingyun Wang, Chun Hing She, Xinxin Chen, Xiao Dang, Yao Lei, Ke Ni, Zewei Xiong, Danqing Yin, Xingtian Yang, Hong Feng, Philip H. Li, Wanling Yang
Bioinform.5
2025 DriveGPT: Scaling Autoregressive Behavior Models for Driving
abstract
We present DriveGPT, a scalable behavior model for autonomous driving. We model driving as a sequential decision-making task, and learn a transformer model to predict future agent states as tokens in an autoregressive fashion. We scale up our model parameters and training data by multiple orders of magnitude, enabling us to explore the scaling properties in terms of dataset size, model parameters, and compute. We evaluate DriveGPT across different scales in a planning task, through both quantitative metrics and qualitative examples, including closed-loop driving in complex real-world scenarios. In a separate prediction task, DriveGPT outperforms state-of-the-art baselines and exhibits improved performance by pretraining on a large-scale dataset, further validating the benefits of data scaling.
Eric M. Wolff, Paul Vernaza, Tung Phan-Minh, Hongge Chen, David S. Hayden, Mark Edmonds, Brian Pierce, Xinxin Chen, Pratik Elias Jacob, Xiaobai Chen, Chingiz Tairbekov, Pratik Agarwal, Tianshi Gao, Yuning Chai, Siddhartha S. Srinivasa
ICML9
2025 A framework for integrating GWAS and single-cell RNA-seq with healthy reference controls to identify disease-associated cells
abstract
Abstract Background Genome-wide association studies (GWAS) have revealed numerous loci for complex diseases, yet the cellular contexts through which these variants act remain poorly understood. Single-cell RNA sequencing (scRNA-seq) offers high-resolution profiling of cellular heterogeneity, but linking GWAS signals to disease-relevant cells remains a challenge. Methods We developed a statistical framework that integrates GWAS-prioritized genes with single-cell transcriptomes to detect disease-relevant cells. Each target cell is contrasted with pools of healthy reference cells, ensuring that differences reflect disease rather than technical variability. Two controls are implemented: reference cells matched by sequencing depth and expression-matched control genes without known disease associations. Iterative Monte Carlo sampling generates comparisons across random draws of reference cells and control genes, reducing stochastic noise. A difference-of-differences statistic captures disease-specific shifts, with Fisher’s method aggregating significance and enrichment tests identifying cell types overrepresented in patients. Results In simulations and real-world datasets, the framework showed strong performance. In large peripheral blood cohorts, it consistently identified trait-associated populations, with monocytes as a benchmark. Analyses of disease datasets revealed both established and novel pathogenic populations, including age-associated B cells and cytotoxic CD8+ T cells in systemic lupus erythematosus, antigen-presenting acinar cells in Sjögren’s syndrome, and dysregulated proximal tubules in chronic kidney disease. Conclusions These findings demonstrate the utility of integrating GWAS with single-cell transcriptomics to pinpoint disease-relevant cells in complex traits.
Caicai Zhang, Frank Qingyun Wang, Xiao Dang, Huidong Su, Xingtian Yang, Yao Lei, Youming Guo, Xinxin Chen, Wanling Yang
Briefings Bioinform.8
2024 A Fair Cooperation Strategy in the Edge-Edge Collaboration Scenario
Heping Gou, Xinxin Chen
NPC (2)5
2022 MSJAD: Multi-Source Joint Anomaly Detection of Web Application Access
abstract
Fixed broadband internet service can provide a stable broadband network of up to 100 megabits or even gigabits and users at home can use fixed broadband service for all kinds of internet surfing, including website and application access, watching videos, playing games, etc. Traditional maintenance for fixed broadband networks primarily uses human manual meth-ods, supplemented by some low-level semi-automation operations. Since the long processes with numerous network elements in the fixed broadband network, it is difficult for traditional operation and maintenance to support effectively with high quality. When abnormalities occur, it is quite manpower cost and time cost to monitor and locate faults. Therefore, to improve the autonomous capability of the fixed broadband network, intelligent operation and maintenance methods are necessary. First of all, a brand-new data pre-process method is proposed to detect anomalies and problems of slow access by selecting web services access commonly visited by users. Secondly, as the fixed broadband network is a multi-level and complex structure with only a small amount of anomaly sample data, we propose a multi-source joint anomaly detection model called MSJAD model on multi-dimensional features data. The model validation results on real datasets from the real fixed broadband network are state-of-the-art. The accuracy rate reaches 98 % and the recall is over 99 %. We have already begun to deploy the model on the real fixed broadband network and have achieved good feedback.
Xinxin Chen, Chengsen Wang, Guosong Lv, Jiankun Li, Dewei Chen, Lianyuan Li
MSN1
2021 HR-Depth: High Resolution Self-Supervised Monocular Depth Estimation
abstract
Self-supervised learning shows great potential in monocular depth estimation, using image sequences as the only source of supervision. Although people try to use the high-resolution image for depth estimation, the accuracy of prediction has not been significantly improved. In this work, we find the core reason comes from the inaccurate depth estimation in large gradient regions, making the bilinear interpolation error gradually disappear as the resolution increases. To obtain more accurate depth estimation in large gradient regions, it is necessary to obtain high-resolution features with spatial and semantic information. Therefore, we present an improved DepthNet, HR-Depth, with two effective strategies: (1) re-design the skip-connection in DepthNet to get better high-resolution features and (2) propose feature fusion Squeeze-and-Excitation(fSE) module to fuse feature more efficiently. Using Resnet-18 as the encoder, HR-Depth surpasses all previous state-of-the-art(SoTA) methods with the least parameters at both high and low resolution. Moreover, previous SoTA methods are based on fairly complex and deep networks with a mass of parameters which limits their real applications. Thus we also construct a lightweight network which uses MobileNetV3 as encoder. Experiments show that the lightweight network can perform on par with many large models like Monodepth2 at high-resolution with only20%parameters. All codes and models will be available at https://github.com/shawLyu/HR-Depth.
Xiaoyang Lyu, Liang Liu 0007, Mengmeng Wang 0005, Xin Kong, Lina Liu 0010, Yong Liu 0007, Xinxin Chen, Yi Yuan 0002
AAAI7
2019 An improved genetic algorithm for numerical function optimization
Yingying Song, Xinxin Chen
Appl. Intell.3
2019 A Multiparameter Numerical Modeling and Simulation of the Dipping Process in Microelectronics Packaging
abstract
In order to simulate the flux dipping process of microbump flip chip bonding, multiparameter experiments are designed. The dipping process of microbumps is captured by the high-speed camera, so that we can obtain the quantitative relationship between the dipping quantity and its viscosity, dipping speed, dipping depth, and dipping time by virtue of image processing. Furthermore, corresponding mathematical models are established by curve fitting. Finally, all of the numerical models are integrated; numerical simulation is carried out by MATLAB-Simulink and graphical user interface; and a new simulation software is developed, thus providing an important basis and guidance for flux dipping application and parameter selection.
Haoliang Zhang, Can Zhou 0005, Zhuo Chen 0032, Xinxin Chen, Zhili Long, Xiaohe Liu
IEEE Trans. Ind. Informatics5
2018 Study on Dipping Mathematical Models for the Solder Flip-Chip Bonding in Microelectronics Packaging
abstract
In order to develop the flux dipping process, a quantitative mathematical model that accurately describes the flux dipping process in the flip-chip bonding is proposed. The whole dynamic dipping process is captured by the high-speed transient imaging followed by image processing. Curve fitting of experimental results yields the relation between flux dipping quantity and process parameters. It suggests a quadratic function of quantity (Q) with respect to dipping depth (d), and a piece-wise function to dipping speed (v) including an exponential section and a quadratic or linear section. While the coupled effect of d- and v can be expressed as a merged function of Q = f(d,v), these mathematical models are proved to be effective when applied to the actual dipping process practiced on a flip-chip bonding machine, thus providing a reliable mathematical basis for optimizing dipping flux in industrial manufacturing.
Haoliang Zhang, Xinxin Chen, Xiaohe Liu
IEEE Trans. Ind. Informatics4
2016 An estimated method of urban concentration distribution for a mobile sensing system
Xinxin Chen, Guojun Dai
Pervasive Mob. Comput.4
2006 Explore New Profiting Method for TV Based on P2P Streaming Media Technology
abstract
Looking back on the transition of the profiting mode in internal broadcasting and television industry, the paper mainly analyzes the basic framework and applying prospect of a Web living broadcast system based on P2P mode. The system is comprised of four parts: directory server, channel information server, publishing server and client-end program. With the system, traditional TV station media can easily their programs on Internet by configuring one or two servers, which spends just a little cost. At last, we look in a new profiting mode, which is based on the new-generation P2P-IPTV platform for TV stations
Xinxin Chen
APSCC3