Yujie Dun

Dr. Yujie Dun

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
TYTianwei Yue
Tianwei Yue
YWYuanxin Wang
Yuanxin Wang
LZLongxiang Zhang
Longxiang Zhang
CGChunming Gu
Chunming Gu
HXHaoru Xue
Haoru Xue
YDYujie Dun
Yujie Dun
The data explosion driven by advancements in genomic research, such as high-throughput sequencing techniques, is constantly challenging conventional methods used in genomics. In parallel with the urgent demand for robust algorithms, deep learning has succeeded in various fields such as vision, speech, and text processing. Yet genomics entails unique challenges to deep learning, since we expect a superhuman intelligence that explores beyond our knowledge to interpret the genome from deep learning. A powerful deep learning model should rely on the insightful utilization of task-specific knowledge. In this paper, we briefly discuss the strengths of different deep learning models from a genomic perspective so as to fit each particular task with proper deep learning-based architecture, and we remark on practical considerations of developing deep learning architectures for genomics. We also provide a concise review of deep learning applications in various aspects of genomic research and point out current challenges and potential research directions for future genomics applications. We believe the collaborative use of ever-growing diverse data and the fast iteration of deep learning models will continue to contribute to the future of genomics.

27 May 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
HWHuake Wang
Huake Wang
XYXiaoyang Yan
Xiaoyang Yan
JLJunhui Li
Junhui Li
JLJunhui Li
Junhui Li
YDYujie Dun
Yujie Dun
KZKaibing Zhang
Kaibing Zhang

15 October 2024 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HWHuake Wang
Huake Wang
XYXiaoyang Yan
Xiaoyang Yan
JLJunhui Li
Junhui Li
KZKaibing Zhang
Kaibing Zhang
YDYujie Dun
Yujie Dun
The complex entanglement between darkness and noise hinders the advance of low-light image enhancement. Most existing methods adopted lightening-then-denoising or embedded a special denoising module into enhancement network without specific noise knowledge as supervision to restore low-light images. However, they either fail to remove the amplified noise or blur the detail information. Against above drawbacks, we propose a novel dual prior guidance method for low-light image enhancement that relights darkness and suppresses noise simultaneously. Concretely, the main novelties of our proposed method are three-fold. Firstly, our formulation originates from a statistic observation that darkness can be disentangled into luminance channel, yet noise still exists each channel when low-light images are transformed from RGB space to YCbCr space. It inspires us to design an ingenious method, extracting noise and darkness, termed END, to enhance low-light images. Secondly, we propose a prior extraction network with prior composition module to extract luminance and noise priors from different channels. Thirdly, an image enhancement network deployed with prior guidance module is proposed to progressively lighten the darkness and remove noise. Extensive experiments on multiple benchmarks demonstrate that our proposed method achieves remarkable performance compared to other state-of-the-art low-light image enhancement methods. The source code and trained model can be found in https://github.com/WHK-Huake/END.

18 March 2024 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HZHao Zhang
Hao Zhang
YDYujie Dun
Yujie Dun
YPYixuan Pei
Yixuan Pei
SLShenqi Lai
Shenqi Lai
CLChengxu Liu
Chengxu Liu
XQXueming Qian
Xueming Qian
High-resolution networks have made significant progress in dense prediction tasks such as human pose estimation and semantic segmentation. To better explore this high-resolution mechanism on mobile devices, Lite-HRNet incorporates shuffle operations to reduce computational complexity in the channel dimension, while Dite-HRNet employs dynamic convolution and pooling to capture long-range interactions with low computational complexity in the spatial dimension. The core idea behind both approaches is to efficiently capture information in either the channel or spatial dimension. However, shuffle operations and dynamic operations are not hardware-friendly. As a result, both Lite-HRNet and Dite-HRNet cannot achieve the desired inference speed on specialized devices, including Neural Processing Units (NPUs) and Graphics Processing Units (GPUs). To overcome these limitations, we present a simple Hardware-Friendly Lightweight High-resolution Network (HF-HRNet) based on our proposed Hardware-Friendly Uniform-sized Mug (HUM) block. HUM block mainly consists of the Cascaded Depthwise (CAD) block and Multi-Scale Context Embedding (MCE) block. The CAD block cascades depthwise convolutions to obtain a larger receptive field in the spatial dimension, while the MCE block aggregates multi-scale spatial feature information from different scales and adjusts channel features. Extensive experiments are conducted on human pose estimation (COCO, MPII) and semantic segmentation (Cityscapes), resulting in a better trade-off between inference speed and accuracy on both NPUs and GPUs. It is noteworthy that on the COCO test-dev set, HF-HRNet-30 outperforms Dite-HRNet-30 and Lite-HRNet-30 by 1.9 AP and 2.8 AP, respectively, while running about 13 times faster and 9 times faster on NPUs, respectively. Our code are publicly available for use: https://github.com/zhanghao5201/HF-HRNet.

14 July 2021 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
JHJunmei Hao
Junmei Hao
YDYujie Dun
Yujie Dun
GZGuoshuai Zhao
Guoshuai Zhao
YWYuxia Wu
Yuxia Wu
XQXueming Qian
Xueming Qian
Sequential recommendations aim to predict the user’s next behaviors items based on their successive historical behaviors sequence. It has been widely applied in lots of online services. However, current sequential recommendations use the adjacent behaviors to capture the features of the sequence, ignoring the features among nonadjacent sequential items and the summarized features of the sequence. To address the above problems, in this paper, we propose an annular-graph attention based sequential recommendation (AGSR) model by exploring user’s long-term and short-term preferences for the personalized sequential recommendation. For user’s short-term preferences, AGSR builds an annular-graph on the sequence of user behavior. Then, AGSR proposes an annular-graph attention applying on the sub annular-graph to explore local features and applying annular-graph attention on entire annular-graph to explore the global features and the skip features. For user’s long-term preferences, the latent factor model are introduced in AGSR. The experimental results on two public datasets show that our model outperforms the state-of-the-art methods.

1 February 2021 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YDYujie Dun
Yujie Dun
ZDZongyang Da
Zongyang Da
SYShuai Yang
Shuai Yang
YXYao Xue
Yao Xue
XQXueming Qian
Xueming Qian