Jing Sun

Jing Sun

Auto-generated profile, based on publicly available information

Jing Sun

School of Information and Communication Engineering, Dalian Minzu University, Dalian, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
2 January 2024 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
XHXihang Hu
Xihang Hu
XZXiaoli Zhang
Xiaoli Zhang
FWFasheng Wang
Fasheng Wang
JSJing Sun
Jing Sun
FSFuming Sun
Fuming Sun
Camouflaged Object Detection (COD) is a challenging visual task due to its complex contour, diverse scales, and high similarity to the background. Existing COD methods encounter two predicaments: One is that they are prone to falling into local perception, resulting in inaccurate object localization; Another issue is the difficulty in achieving precise object segmentation due to a lack of detailed information. In addition, most COD methods typically require larger parameter amounts and higher computational complexity in pursuit of better performance. To this end, we propose a global localization perception and local guidance refinement network (PRNet), that simultaneously addresses performance and computational costs. Through effective aggregation and use of semantic and details information, the PRNet can achieve accurate localization and refined segmentation of camouflaged objects. Specifically, with the help of a Cascaded Attention Perceptron (CAP) designed, we can effectively integrate and perceive multi-scale information to localize camouflaged objects. We also design a Guided Refinement Decoder (GRD) in a top-down manner to extract context information and aggregate details to further refine camouflaged prediction results. Extensive experimental results demonstrate that our PRNet outperforms 12 state-of-the-art models on 4 challenging datasets. Meanwhile, the PRNet has a smaller number of parameters (12.74M), lower computational complexity (10.24G), and real-time inference speed (105FPS). Source codes are available at https://github.com/hu-xh/PRNet.

2 March 2024 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
XHXihang Hu
Xihang Hu
FSFuming Sun
Fuming Sun
JSJing Sun
Jing Sun
FWFasheng Wang
Fasheng Wang
HLHaojie Li
Haojie Li

18 August 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
MYMingshi Yan
Mingshi Yan
ZCZhiyong Cheng
Zhiyong Cheng
CGChen Gao
Chen Gao
JSJing Sun
Jing Sun
FLFan Liu
Fan Liu
HLHaojie Li
Haojie Li
Multi-behavior recommendation exploits multiple types of user-item interactions, such as view and cart , to learn user preferences and has demonstrated to be an effective solution to alleviate the data sparsity problem faced by the traditional models that often utilize only one type of interaction for recommendation. In real scenarios, users often take a sequence of actions to interact with an item, in order to get more information about the item and thus accurately evaluate whether an item fits their personal preferences. Those interaction behaviors often obey a certain order, and more importantly, different behaviors reveal different information or aspects of user preferences towards the target item. Most existing multi-behavior recommendation methods take the strategy to first extract information from different behaviors separately and then fuse them for final prediction. However, they have not exploited the connections between different behaviors to learn user preferences. Besides, they often introduce complex model structures and more parameters to model multiple behaviors, largely increasing the space and time complexity. In this work, we propose a lightweight multi-behavior recommendation model named Cascading Residual Graph Convolutional Network ( CRGCN for short) for multi-behavior recommendation, which can explicitly exploit the connections between different behaviors into the embedding learning process without introducing any additional parameters (with comparison to the single-behavior based recommendation model). In particular, we design a cascading residual graph convolutional network (GCN) structure, which enables our model to learn user preferences by continuously refining the embeddings across different types of behaviors. The multi-task learning method is adopted to jointly optimize our model based on different behaviors. Extensive experimental results on three real-world benchmark datasets show that CRGCN can substantially outperform the state-of-the-art methods, achieving 24.76%, 27.28%, and 25.10% relative gains on average in terms of HR@K (K = {10,20,50,80}) over the best baseline across the three datasets. Further studies also analyze the effects of leveraging multi-behaviors in different numbers and orders on the final performance.

15 June 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
MZMingyu Zhong
Mingyu Zhong
JSJing Sun
Jing Sun
PRPeng Ren
Peng Ren
FWFasheng Wang
Fasheng Wang
FSFuming Sun
Fuming Sun

10 July 2024
Verified
Conference Paper
Open access
MYMingshi Yan
Mingshi Yan
FLFan Liu
Fan Liu
JSJing Sun
Jing Sun
FSFuming Sun
Fuming Sun
ZCZhiyong Cheng
Zhiyong Cheng
YHYahong Han
Yahong Han
In recommender systems, multi-behavior methods have demonstrated their effectiveness in mitigating issues like data sparsity, a common challenge in traditional single-behavior recommendation approaches. These methods typically infer user preferences from various auxiliary behaviors and apply them to the target behavior for recommendations. However, this direct transfer can introduce noise to the target behavior in recommendation, due to variations in user attention across different behaviors. To address this issue, this paper introduces a novel approach, Behavior-Contextualized Item Preference Modeling (BCIPM), for multi-behavior recommendation. Our proposed Behavior-Contextualized Item Preference Network discerns and learns users' specific item preferences within each behavior. It then considers only those preferences relevant to the target behavior for final recommendations, significantly reducing noise from auxiliary behaviors. These auxiliary behaviors are utilized solely for training the network parameters, thereby refining the learning process without compromising the accuracy of the target behavior recommendations. To further enhance the effectiveness of BCIPM, we adopt a strategy of pre-training the initial embeddings. This step is crucial for enriching the item-aware preferences, particularly in scenarios where data related to the target behavior is sparse. Comprehensive experiments conducted on four real-world datasets demonstrate BCIPM's superior performance compared to several leading state-of-the-art models, validating the robustness and efficiency of our proposed approach.

27 December 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
BZBing Zhang
Bing Zhang
JSJing Sun
Jing Sun
FSFuming Sun
Fuming Sun
FWFasheng Wang
Fasheng Wang
BZBing Zhu
Bing Zhu