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

Shikun Chen

dblp:36/7435 · DBLP profile ↗
← Back
15ranked-venue papers
12as first author
13since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 7 · 5 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 first-author · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval › image retrieval
fine-grained image retrieval
0.712023
Attributes Grouping and Mining Hashing for Fine-Grained Image Retrieval · ACM Multimedia 2023
Multimedia analysis and retrieval › image retrieval
hashing-based image retrieval
0.712023
Attributes Grouping and Mining Hashing for Fine-Grained Image Retrieval · ACM Multimedia 2023
Multimedia analysis and retrieval
image retrieval
0.712023
Attributes Grouping and Mining Hashing for Fine-Grained Image Retrieval · ACM Multimedia 2023

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

stepwise interactive external attention · 0.7deep hashing · 0.7attention dispersion loss · 0.7
YearPublicationVenuePosition
2026 Class label enhanced Wasserstein distance for classification of remote sensing smoke-related scenes
Shikun Chen, Xin Lu 0007, Xiaobo Lu
Eng. Appl. Artif. Intell.1
2026 An accurate, generalized, and efficient detection framework for steel surface defect inspection
Lanxiang Chen, Shikun Chen, Shunwu Xu, Zhaowen Chen
Eng. Appl. Artif. Intell.4
2026 Hierarchical process-level generative reward modeling with adaptive long-horizon reasoning for robust LLM alignment
Shikun Chen, Yangguang Liu
Inf. Process. Manag.1
2026 Height-encoded vision-language distillation for edge automotive bushing inspection
Shikun Chen, Songquan Xiong, Longjin Lv, Xueqin Lu, Junjie Mao
J. Vis. Commun. Image Represent.1
2026 Dynamic multi-objective causal Bayesian optimization: Adaptive learning for complex systems under interventional constraints
Shikun Chen
Knowl. Based Syst.1
2026 Mixed-type tabular data generation with graph-augmented flow matching
Shikun Chen, Longjin Lv, Yangguang Liu
Pattern Recognit.1
2025 Predicted label distribution guided optimal transport for classification of remote sensing smoke-like scenes with noisy labels
Shikun Chen, Xiaobo Lu
Neurocomputing1
2025 Robust Optimal Transport With Exact Marginal Relaxation for Remote Sensing Scene Classification
abstract
Significant efforts have been made to develop techniques for extracting useful information from remote sensing (RS) images in view of their favorable properties such as wide coverage, good timeliness and large content. Such techniques often involve scene classification, which provides an effective way to interpret RS data. However, large intra-class variances and high inter-class similarities make remote sensing scene classification (RSSC) a tough task. Recently, deep learning has been brought to bear upon RSSC. Deep models with ever-improving classification accuracy are continually being put forward. This letter shifts focus from network structure optimization to the loss function and takes a principled approach based on optimal transport (OT). OT measures the divergence between two probability distributions by computing the minimum cost of converting one distribution to the other, which can help discriminate different data clusters in high-dimensional feature spaces. Relaxation of marginal constraints during computation of OT objective can accommodate certain potentially desirable transportation plans that are otherwise inadmissible. However, the effect of OT objective is sensitive to the extent of marginal relaxation. In this work, we propose a method, named exact marginal relaxation robust optimal transport (EMRROT), to estimate the optimal threshold for marginal relaxation and investigate its application to RSSC. Experimental results show that the proposed EMRROT achieves highly competitive performances on the benchmark RSSC datasets.
Shikun Chen, Jian Yang 0011
IEEE Geosci. Remote. Sens. Lett.1
2024 Distilling object detectors with efficient logit mimicking and mask-guided feature imitation
Xin Lu 0007, Yichao Cao, Shikun Chen, Xin Zhou 0030, Xiaobo Lu
Expert Syst. Appl.3
2023 Attributes Grouping and Mining Hashing for Fine-Grained Image Retrieval
abstract
In recent years, hashing methods have been popular in the large-scale media search for low storage and strong representation capabilities. To describe objects with similar overall appearance but subtle differences, more and more studies focus on hashing-based fine-grained image retrieval. Existing hashing networks usually generate both local and global features through attention guidance on the same deep activation tensor, which limits the diversity of feature representations. To handle this limitation, we substitute convolutional descriptors for attention-guided features and propose an Attributes Grouping and Mining Hashing (AGMH), which groups and embeds the category-specific visual attributes in multiple descriptors to generate a comprehensive feature representation for efficient fine-grained image retrieval. Specifically, an Attention Dispersion Loss (ADL) is designed to force the descriptors to attend to various local regions and capture diverse subtle details. Moreover, we propose a Stepwise Interactive External Attention (SIEA) to mine critical attributes in each descriptor and construct correlations between fine-grained attributes and objects. The attention mechanism is dedicated to learning discrete attributes, which will not cost additional computations in hash codes generation. Finally, the compact binary codes are learned by preserving pairwise similarities. Experimental results demonstrate that AGMH consistently yields the best performance against state-of-the-art methods on fine-grained benchmark datasets.
Xin Lu 0007, Shikun Chen, Yichao Cao, Xin Zhou 0030, Xiaobo Lu
ACM Multimedia2
2023 Bridging the MiniBatch and Adversarial Optimal Transport for Cross-Scene Classification of Remote Sensing Smoke-Related Scenes
abstract
Smoke in remote sensing (RS) images is regarded as the indicator of fire disasters and it is vital to distinguish smoke from other RS scenes. Convolutional neural network (CNN) based classification networks have viewed great success but the cross-entropy loss may suffer from domain gap when training data and testing data do not follow independent and identical distributions. Served as an objective function, the optimal transport (OT) distance is able to tackle the domain gap by aligning two distributions in domain adaptation tasks. Generally speaking, the OT-based algorithms can be divided into two categories: methods that compute OT distance on minibatches, and methods which rely on the adversarial training. In this letter, we propose a hybrid OT algorithm, termed Joint MiniBatch and Adversarial Optimal Transport (JMBAOT), to eliminate the domain gap for cross-scene classification of RS smoke-related scenes. JMBAOT takes advantages of both the minibatch and adversarial OT to better distinguish different classes on the feature space and improve the performance of domain adaptation. In a large amount of experiments, JMBAOT shows its effectiveness and achieves the state-of-the-art (SOTA) performance.
Shikun Chen, Xin Lu 0007, Xiaobo Lu
IEEE Geosci. Remote. Sens. Lett.1
2022 Combining the Convolution and Transformer for Classification of Smoke-Like Scenes in Remote Sensing Images
abstract
Remote sensing (RS) images are used in a wide range of tasks. In the fire detection field, smoke in RS images is considered as an indicator of wildfires. However, smoke-like scenes, e.g., cloud, in RS images increase the difficulty of smoke recognition. Convolutional neural networks (CNNs) have greatly promoted the development of image processing. CNNs are good at capturing local features; however, their ability to capture global features is relatively weak. Recently, the transformer deep learning model has shown strong potential in vision tasks. The transformer model utilizes self-attention modules to extract global features but may lose local details. Recognition of smoke in RS images depends strongly on the combination of both local and global features. Thus, this article proposes the transformer enhanced convolutional network (TECN) to classify RS smoke-like scenes. The proposed hybrid TECN model exploits the advantages of the CNN and transformer techniques at the same time. In TECN, the feature merge and intelligent aggregation modules are used to promote conversion and aggregation between CNN feature maps and transformer patch embeddings. Experiments are conducted on the USTC_SmokeRS dataset, which is developed for the classification of RS smoke-like scenes. The experimental results demonstrate that the proposed TECN achieves a competitive accuracy of 98.39% on this dataset.
Shikun Chen, Yichao Cao, Xiaobo Lu
IEEE Trans. Geosci. Remote. Sens.1
2021 Global2Salient: Self-adaptive feature aggregation for remote sensing smoke detection
Shikun Chen, Yichao Cao, Xiaoqiang Feng, Xiaobo Lu
Neurocomputing1
2018 Design and FPGA-Based Realization of a Chaotic Secure Video Communication System
abstract
This paper initiates a systematic methodology for real-time chaos-based video encryption and decryption communications on the system design and algorithm analysis. The proposed system design and algorithm analysis have been validated on an FPGA hardware platform via Verilog Hardware Description Language (Verilog HDL). Based on the fundamental anti-control principles of dynamical systems, a 6-D real domain chaotic system is designed, and then the corresponding Verilog HDL algorithm is developed. The proposed Verilog HDL algorithm is utilized to design a real-time chaos-based secure video communication system, with a generalized design principle derived, which is implemented on an FPGA hardware platform equipped with an XUP Virtex-II chip. Following this line, the designed working mechanism is demonstrated by hardware experiments. The security performance is tested using the TESTU01 statistical test suites, the differential analysis, and the sensitivity of key parameters mismatch. Both theoretical analysis and experimental results validate the feasibility and reliability of the proposed system.
Shikun Chen, Simin Yu, Jinhu Lü 0001, Guanrong Chen, Jianbin He
IEEE Trans. Circuits Syst. Video Technol.1
2009 Constructing Program Invariants via Solving QBF
abstract
Constructing program invariants is one of the key problems of program verification. A lot of approaches to invariant generation have been reported, and all of these methods assume that program variables are evaluated over infinite domains such as rational or integer. Actually, during the execution of program, all variables are expressed using bit-vectors with limited width and evaluated over finite domains. Many invariants suit for infinite domains may be invalid in finite domains, and vice versa. This paper proposes an approach to construct invariants for program whose variables are evaluated over finite domains. This method translates a program into constraints that are solved using a QBF (Quantified Boolean Formula) solver to yield desired program invariants. It can be used to discover a rich class of invariants including linear (or polynomial) equality (or inequality) invariants involving operations like addition, multiplication, division, shift, bitwise operation, even quantifiers. And we also show how this technique can be used to prove partial correctness, termination and total correctness.
Shikun Chen, Zhoujun Li 0001
TASE1