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

Juncheng Zhou

dblp:330/2017 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
8since 2021 · last 2026
0009-0006-4501-7190ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
1 paper
Deep learning architectures and training · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › attention mechanism
self-attention
0.912025
Devil is in the Uniformity: Exploring Diverse Learners Within Transformer for Image Restoration · ICCV 2025
Image and video processing
image restoration
0.912025
Devil is in the Uniformity: Exploring Diverse Learners Within Transformer for Image Restoration · ICCV 2025

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

transformer · 1.7query-key cache updating · 1.7
YearPublicationVenuePosition
2026 An Energy-Tiered Clustering-Based Blind Detector for RIS-RSM Systems
abstract
ABSTRACT Reconfigurable intelligent surface (RIS)‐assisted received spatial modulation (RIS‐RSM) has emerged as a promising technique to enhance spectral and energy efficiency in next‐generation wireless systems. However, performing accurate signal detection without channel state information (CSI) remains a critical challenge, particularly in blind detection scenarios. In this paper, we propose a novel clustering‐based blind detector named energy‐tiered structure initialization (ETSI). The proposed method exploits the amplitude heterogeneity of modulation symbols—originating from the unequal energy levels of QAM or hybrid constellations—by partitioning the signal space into multiple energy tiers. Each receive antenna is associated with a structure prototype, representing a normalized statistical channel pattern, which is initialized using the distribution of the underlying fading model (e.g., Rayleigh) rather than instantaneous CSI. During clustering, these prototypes are iteratively refined through tier‐wise averaging of normalized signal samples, thereby enforcing structural consistency and mitigating amplitude‐induced bias. After convergence, the constellation‐aligned cluster centres are reconstructed by combining the updated prototypes with their corresponding modulation amplitudes, inherently enabling the joint detection of both the modulation symbol and the RIS‐assisted spatial index. Simulation results show that ETSI achieves around 0.5–1 dB SNR gain over amplitude–phase aware clustering under 8PSK, and about 1–1.5 dB improvement under 16QAM, while outperforming the CSI‐based greedy detector (GD) across both modulations. Moreover, ETSI achieves BER performance close to that of the perfect‐CSI maximum likelihood detector, confirming its accuracy, scalability and practical feasibility for blind RIS‐RSM detection.
Juncheng Zhou, Zhongpeng Wang
IET Commun.2
2025 A Novel Negative Sample Generation Method for Contrastive Learning in Hierarchical Text Classification
abstract
Hierarchical text classification (HTC) is an important task in natural language processing (NLP). Existing methods typically utilize both text features and the hierarchical structure of labels to categorize text effectively. However, these approaches often struggle with fine-grained labels, which are closely similar, leading to difficulties in accurate classification. At the same time, contrastive learning has significant advantages in strengthening fine-grained label features and discrimination. However, the performance of contrastive learning strongly depends on the construction of negative samples. In this paper, we design a hierarchical sequence ranking (HiSR) method for generating diverse negative samples. These samples maximize the effectiveness of contrastive learning to enhance the ability of the model to distinguish between fine-grained labels and improve the performance of the model in HTC. Specifically, we transform the entire label set into linear sequences based on the hierarchical structure and rank these sequences according to their quality. During model training, the most suitable negative samples were dynamically selected from the ranked sequences. Then contrastive learning amplifies the differences between similar fine-grained labels by emphasizing the distinction between the ground truth and the generated negative samples, thereby enhancing the discriminative ability of the model. Our method has been tested on three public datasets and achieves state-of-art (SOTA) on two of them, demonstrating its effectiveness.
Juncheng Zhou, Lijuan Zhang 0004, Yachen He, Rongli Fan, Lei Zhang 0196, Jian Wan 0001
COLING1
2025 Devil is in the Uniformity: Exploring Diverse Learners Within Transformer for Image Restoration
abstract
Transformer-based approaches have gained significant attention in image restoration, where the core component, i.e, Multi-Head Attention (MHA), plays a crucial role in capturing diverse features and recovering high-quality results. In MHA, heads perform attention calculation independently from uniform split subspaces, and a redundancy issue is triggered to hinder the model from achieving satisfactory outputs. In this paper, we propose to improve MHA by exploring diverse learners and introducing various interactions between heads, which results in a Hierarchical multI-head atteNtion driven Transformer model, termed HINT, for image restoration. HINT contains two modules, i.e., the Hierarchical Multi-Head Attention (HMHA) and the Query-Key Cache Updating (QKCU) module, to address the redundancy problem that is rooted in vanilla MHA. Specifically, HMHA extracts diverse contextual features by employing heads to learn from subspaces of varying sizes and containing different information. Moreover, QKCU, comprising intra- and inter-layer schemes, further reduces the redundancy problem by facilitating enhanced interactions between attention heads within and across layers. Extensive experiments are conducted on 12 benchmarks across 5 image restoration tasks, including low-light enhancement, dehazing, desnowing, denoising, and deraining, to demonstrate the superiority of HINT. The source code is available in the supplementary materials.
Shihao Zhou 0003, Dayu Li, Jinshan Pan, Juncheng Zhou, Jinglei Shi, Jufeng Yang
ICCV4
2025 An improved two-stage zero-shot relation triplet extraction model with hybrid cross-entropy loss and discriminative reranking
Diyou Li, Lijuan Zhang 0004, Juncheng Zhou, Jie Huang 0014, Naixue Xiong, Lei Zhang 0196, Jian Wan 0001
Expert Syst. Appl.3
2025 Type affinity network for distantly supervised relation extraction
abstract
Distantly Supervised Relation Extraction (DSRE) focuses on mining relational information between entities from text, which is a critical step in constructing and expanding knowledge graphs. However, this task typically faces the problem of long-tail distribution of relationships. Furthermore, much previous research has been limited to specific relational features, overlooking the potential discriminative information in the dependencies among these features. To address these issues, we propose a Type Affinity Network (TAN) that explicitly models the dependencies among relational features. Using differentiated entity-type information and local context information, we extract high-quality feature representations. The dynamic integration of type dependency information via a type affinity matrix effectively leverages potential discriminative information, enhancing relation extraction accuracy. Furthermore, aggregating implicit features of relationships forms base points as references, improving the ability of the model to handle long-tail relations. These relationship base points differ from traditional hierarchical structures, providing a more general method. We conduct extensive experiments on two benchmark DSRE datasets, namely NYT-10 and WIKI-20 m. Compared with multiple state-of-the-art DSRE methods, the TAN not only shows significant performance improvements in handling long-tail relations, but also demonstrates overall performance improvement.
Juncheng Zhou
Neurocomputing2
2025 Paraphrase-Augmented Evaluation for Dialogue Models: A Unified Framework with AMR and GPT-Based Rewriting
abstract
In recent years, large language models (LLMs) have achieved remarkable progress in dialogue generation. However, existing automatic evaluation methods still face challenges in diverse scenarios, particularly in terms of limited generalization and low alignment with human judgment. To address these issues, we propose a paraphrase-based evaluation framework that integrates Abstract Meaning Representation (AMR) with general-purpose language models (GPT). This approach generates diverse paraphrases across lexical, syntactic and stylistic dimensions to enhance the coverage of traditional evaluation metrics. Experimental results show that incorporating paraphrase augmentation significantly improves the correlation between automatic metrics and human evaluation on multiple datasets. Additionally, extensive experiments on six mainstream LLMs demonstrate the effectiveness and generalizability of the proposed method. This study offers new insights into improving the human alignment of automatic evaluation and lays a foundation for the application and optimization of LLMs in open-domain dialogue systems.
Zhenping Xie, Juncheng Zhou, Senlin Jiang
Int. J. Softw. Eng. Knowl. Eng.3
2025 Sequences and nodes: Probability-guided contrastive learning for hierarchical text classification
Lijuan Zhang 0004, Juncheng Zhou, Rongli Fan, Naixue Xiong, Lei Zhang 0196, Jian Wan 0001
Knowl. Based Syst.2
2023 Distance Adaptive Imaging Algorithm for Synthetic Aperture Interferometric Radiometer in Near-Field
abstract
For near-field Synthetic Aperture Interferometric Radiometer (SAIR) systems, imaging distance plays an important role in the imaging reconstruction. However, most current SAIR imaging algorithms treat the imaging distance as an exact known value, which may have a serious influence on imaging reconstruction quality caused by the misestimate of the practical imaging distance. In this letter, we propose a distance adaptive near-field SAIR imaging algorithm based on deep learning approach to handle this problem. The Complex Correlation Operation Block (CCOB) is proposed to predict the distance parameter and reconstruct the image firstly. And the residual attention enhanced module is utilized to further improve the imaging quality. The simulation results indicate that the proposed algorithm can accurately predict the imaging distance and achieve high-precision image reconstruction at different distances.
Jianfei Chen 0003, Juncheng Zhou, Ruyue Peng
IEEE Geosci. Remote. Sens. Lett.2