chengyun song

Dr. chengyun song

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 February 2025 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
ANAoxiang Ning
Aoxiang Ning
MXMinglong Xue
Minglong Xue
JHJinhong He
Jinhong He
CSchengyun song
chengyun song
Low-lightimage enhancement methods are difficult to fit the complex nonlinear relationship between normal and low-light images due to uneven illumination and noise effects. The recently proposed Kolmogorov-Arnold networks (KANs) feature spline-based convolutional layers and learnable activation functions, which can effectively capture nonlinear dependencies. In this paper, we design a KAN-Block based on KANs and innovatively apply it to low-light image enhancement. This method effectively alleviates the limitations of current methods constrained by linear network structures and lack of interpretability, further demonstrating the potential of KANs in low-level vision tasks. Given the poor perception of current low-light image enhancement methods and the stochastic nature of the inverse diffusion process, we further introduce frequency-domain perception for visually oriented enhancement. Extensive experiments demonstrate the competitive performance of our method on benchmark datasets.

10 November 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
LQLianpeng Qiu
Lianpeng Qiu
CQCuipeng Qiu
Cuipeng Qiu
CSchengyun song
chengyun song

1 February 2020 in Interpretation
Verified
Journal Article
Closed access
ZLZhining Liu
Zhining Liu
CSchengyun song
chengyun song
KLKunhong Li
Kunhong Li
BSBin She
Bin She
XYXingmiao Yao
Xingmiao Yao
GHGuangmin Hu
Guangmin Hu
Extracting horizons from a seismic image has been playing an important role in seismic interpretation. However, how to fully use global-level information contained in the seismic images such as the order of horizon sequences is not well-studied in existing works. To address this issue, we have developed a novel method based on a directed and colored graph, which encodes effective context information for horizon extraction. Following the commonly used framework, which generates horizon patches and then groups them into horizons, we first build a directed and colored graph by representing horizon patches as vertices. In addition, edges in the graph encode the relative spatial positions of horizon patches. This graph explicitly captures the geologic context, which guides the grouping of the horizon patches. Then, we conduct premerging to group horizon patches through matching some predefined subgraph patterns that are designed to capture some special spatial distributions of horizon patches. Finally, we have developed an ordered clustering method to group the rest of the horizon patches into horizons based on the pairwise similarities of horizon patches while preserving geologic reasonability. Experiments on real seismic data indicate that our method can outperform the autotracking approach solely based on the similarity of local waveforms and can correctly pick the horizons even across the fault without any crossing, which demonstrates the effectiveness of exploring the spatial information, i.e., the order of horizon sequences and special spatial distribution of horizon patches.

1 April 2018 in Exploration Geophysics
Verified
Journal Article
Closed access
PDF file
CSchengyun song
chengyun song
ZLZhining Liu
Zhining Liu
YWYaojun Wang
Yaojun Wang
FXFeng Xu
Feng Xu
XLXingming Li
Xingming Li
GHGuangmin Hu
Guangmin Hu
Exploration Geophysics is published by CSIRO PUBLISHING on behalf of the Australian Society of Exploration Geophysicists. Papers published report the results of significant case histories and relevant original research in geophysics, with emphasis on the Australian and similar environments.

6 November 2024 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
HLHengyang Liu
Hengyang Liu
PRPengcheng Ren
Pengcheng Ren
YYYang Yuan
Yang Yuan
CSchengyun song
chengyun song
FLFen Luo
Fen Luo
In semi-supervised medical image segmentation, the issue of fuzzy boundaries for segmented objects arises. With limited labeled data and the interaction of boundaries from different segmented objects, classifying segmentation boundaries becomes challenging. To mitigate this issue, we propose an uncertainty global contrastive learning (UGCL) framework. Specifically, we propose a patch filtering method and a classification entropy filtering method to provide reliable pseudo-labels for unlabelled data, while separating fuzzy boundaries and high-entropy pixel points as unreliable points. Considering that unreliable regions contain rich complementary information, we introduce an uncertainty global contrast learning method to distinguish these challenging unreliable regions, enhancing intra-class compactness and inter-class separability at the global data level. Within our optimization framework, we also integrate consistency regularization techniques and select unreliable points as targets for consistency. As demonstrated, the contrastive learning and consistency regularization applied to uncertain points enable us to glean valuable semantic information from unreliable data, which enhances segmentation accuracy. We evaluate our method on two publicly available medical image datasets and compare it with other state-of-the-art semi-supervised medical image segmentation methods, and a series of experimental results show that our method has achieved substantial improvements.

3 December 2019 in PLOS ONE
Verified
Journal Article
Open access
PDF file
CSchengyun song
chengyun song
WLWeiyi Liu
Weiyi Liu
ZLZhining Liu
Zhining Liu
XLXiaoyang Liu
Xiaoyang Liu
With the growing popularity of online services such as online banking and online shopping, one of the essential research topics is how to build a privacy-preserving user abnormal behavior recommendation system. However, a machine-learning based system may present a dilemma. On one aspect, such system requires large volume of features to pre-train the model, but on another aspect, it is challenging to design usable features without looking to plaintext private data. In this paper, we propose an unorthodox approach involving graph analysis to resolve this dilemma and build a novel private-preserving recommendation system under a multilayer network framework. In experiments, we use a large, state-of-the-art dataset (containing more than 40,000 nodes and 43 million encrypted features) to evaluate the recommendation ability of our system on abnormal user behavior, yielding an overall precision rate of around 0.9, a recall rate of 1.0, and an F1-score of around 0.94. Also, we have also reported a linear time complexity for our system. Last, we deploy our system on the “Wenjuanxing” crowd-sourced system and “Amazon Mechanical Turk” for other users to evaluate in all aspects. The result shows that almost all feedbacks have achieved up to 85% satisfaction.