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.

Maoxian Wan

dblp:359/5394 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0000-5396-0185ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

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
3 papers
Segmentation and scene understanding · 45% Trustworthy machine learning · 39% Learning paradigms · 13%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
semantic segmentation
1.522025
Incremental Few-Shot Semantic Segmentation Via Multi-Level Switchable Visual Prompts · ICCV 2025
Context and Spatial Feature Calibration for Real-Time Semantic Segmentation · IEEE Trans. Image Process. 2023
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
MAP: Masked Adversarial Perturbation for Boosting Black-Box Attack Transferability · IEEE Trans. Image Process. 2025
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial transferability
0.912025
MAP: Masked Adversarial Perturbation for Boosting Black-Box Attack Transferability · IEEE Trans. Image Process. 2025
Machine learning › Trustworthy machine learning › robustness › adversarial attack
black-box adversarial attack
0.912025
MAP: Masked Adversarial Perturbation for Boosting Black-Box Attack Transferability · IEEE Trans. Image Process. 2025
Computer vision › Segmentation and scene understanding › semantic segmentation
few-shot segmentation
0.912025
Incremental Few-Shot Semantic Segmentation Via Multi-Level Switchable Visual Prompts · ICCV 2025
Machine learning › Learning paradigms
incremental learning
0.912025
Incremental Few-Shot Semantic Segmentation Via Multi-Level Switchable Visual Prompts · ICCV 2025
Computer vision › Segmentation and scene understanding › semantic segmentation › efficient semantic segmentation
real-time semantic segmentation
0.712023
Context and Spatial Feature Calibration for Real-Time Semantic Segmentation · IEEE Trans. Image Process. 2023
Machine learning › Deep learning architectures and training
attention mechanism
0.212023
Context and Spatial Feature Calibration for Real-Time Semantic Segmentation · IEEE Trans. Image Process. 2023

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

visual prompt · 0.9surrogate model · 0.9multi-level switchable prompts · 0.9masked perturbation · 0.9pyramid pooling · 0.7feature calibration · 0.7attention mechanism · 0.7
YearPublicationVenuePosition
2026 Out-of-Distribution Semantic Segmentation With Disentangled and Calibrated Representation
abstract
Out-of-distribution (OoD) semantic segmentation aims to recognize pixels of classes undefined in the training dataset. Existing methods mostly focus on training the model to fit real OoD data samples to identify OoD pixels, which requires extra data collection and annotation efforts. By contrast, synthesizing OoD data with training data provides a more resource-efficient alternative. However, synthetic data generated from controlled settings lacks diversity, causing the model to suffer from overfitting. To this end, we propose a disentangled representation learning (DRL) method to guide the model to disentangle semantic-related and semantic-unrelated features from synthetic OoD data. DRL encourages the model to utilize the former to identify semantic categories, rather than overfitting to such semantic-unrelated features as synthetic artificiality. Specifically, DRL first incorporates two disentanglers to extract the semantic-related and -unrelated features and then applies a shuffle and reconstruction mechanism to regularize the disentangled features. Furthermore, to facilitate disentangling, we propose a pixel-wise feature similarity calibration (PSC) module, which utilizes more accurate ID-OoD similarity to calibrate inaccurate ID-OoD similarity learned exclusively from ID data. Thus, PSC delivers accurate and stable pixel-wise features for effective disentangling. Extensive experiments illustrate that the proposed method exhibits strong generalization ability. It attains 74.04% AuPRC and 20.82% FPR on Road Anomaly, 69.85% AuPRC and 5.78% FPR on Fishyscapes LostAndFound Validation Set, using SegFormer with the MiT-B5 backbone. Source code is available at https://github.com/WanMotion/DisentangledOoDSeg.
Maoxian Wan, Kaige Li, Qichuan Geng, Binyi Su, Zhong Zhou
IEEE Trans. Circuits Syst. Video Technol.1
2025 Incremental Few-Shot Semantic Segmentation Via Multi-Level Switchable Visual Prompts
Maoxian Wan, Kaige Li, Qichuan Geng, Zhong Zhou
ICCV1
2025 MAP: Masked Adversarial Perturbation for Boosting Black-Box Attack Transferability
abstract
The transferability of adversarial examples is vital for black-box attacks, as it enables the adversary to deceive the target model without knowing its internals. Despite numerous methods focusing on transferability, they still struggle with transferring across models with distinct architectural components (e.g., CNNs and ViTs). In this work, we argue that the limited adversarial perturbation diversity leads to overfitting of the surrogate model, which acts as a key factor in reducing transferability. To this end, we propose a Masked Adversarial Perturbation (MAP) method to boost adversarial transferability across various architectures from a novel perspective of diversifying perturbation. Specifically, MAP randomly masks perturbation patches during iterations and compels the remaining ones to retain the attack effect, which diversifies perturbations to mitigate their overfitting to the surrogate model. Naturally, MAP spreads perturbation over local patches to alleviate their co-adaptation and prevent perturbations from overly relying on specific patterns. Consequently, it can deceive convolution operation and self-attention mechanism indiscriminately by attacking their basic input units, i.e., a single patch, showing superior transferability over previous methods. Extensive experiments illustrate that MAP consistently and significantly boosts diverse black-box attacks to achieve state-of-the-art performance.
Kaige Li, Maoxian Wan, Qichuan Geng, Xiaochun Cao, Zhong Zhou
IEEE Trans. Image Process.2
2023 Context and Spatial Feature Calibration for Real-Time Semantic Segmentation
abstract
Context modeling or multi-level feature fusion methods have been proved to be effective in improving semantic segmentation performance. However, they are not specialized to deal with the problems of pixel-context mismatch and spatial feature misalignment, and the high computational complexity hinders their widespread application in real-time scenarios. In this work, we propose a lightweight Context and Spatial Feature Calibration Network (CSFCN) to address the above issues with pooling-based and sampling-based attention mechanisms. CSFCN contains two core modules: Context Feature Calibration (CFC) module and Spatial Feature Calibration (SFC) module. CFC adopts a cascaded pyramid pooling module to efficiently capture nested contexts, and then aggregates private contexts for each pixel based on pixel-context similarity to realize context feature calibration. SFC splits features into multiple groups of sub-features along the channel dimension and propagates sub-features therein by the learnable sampling to achieve spatial feature calibration. Extensive experiments on the Cityscapes and CamVid datasets illustrate that our method achieves a state-of-the-art trade-off between speed and accuracy. Concretely, our method achieves 78.7% mIoU with 70.0 FPS and 77.8% mIoU with 179.2 FPS on the Cityscapes and CamVid test sets, respectively. The code is available at https://nave.vr3i.com/ and https://github.com/kaigelee/CSFCN.
Kaige Li, Qichuan Geng, Maoxian Wan, Xiaochun Cao, Zhong Zhou
IEEE Trans. Image Process.3