Yang Hong

Mrs. Yang Hong

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-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
YHYang Hong
Yang Hong
XZXiaowei Zhou
Xiaowei Zhou
RHRuzhuang Hua
Ruzhuang Hua
QLqingxuan Lv
qingxuan Lv
Junyu DongJunyu Dong
Junyu Dong
Object segmentation, a key type of image segmentation, focuses on detecting and delineating individual objects within an image, essential for applications like robotic vision and augmented reality. Despite advancements in deep learning improving object segmentation, underwater object segmentation remains challenging due to unique underwater complexities such as turbulence diffusion, light absorption, noise, low contrast, uneven illumination, and intricate backgrounds. The scarcity of underwater datasets further complicates these challenges. The Segment Anything Model (SAM) has shown potential in addressing these issues, but its adaptation for underwater environments, AquaSAM, requires fine-tuning all parameters, demanding more labeled data and high computational costs. In this paper, we propose WaterSAM, an adapted model for underwater object segmentation. Inspired by Low-Rank Adaptation (LoRA), WaterSAM incorporates trainable rank decomposition matrices into the Transformer’s layers, specifically enhancing the image encoder. This approach significantly reduces the number of trainable parameters to 6.7% of SAM’s parameters, lowering computational costs. We validated WaterSAM on three underwater image datasets: COD10K, SUIM, and UIIS. Results demonstrate that WaterSAM significantly outperforms pre-trained SAM in underwater segmentation tasks, contributing to advancements in marine biology, underwater archaeology, and environmental monitoring.

19 August 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Open access
YCYankai Chen
Yankai Chen
Yixiang FangYixiang Fang
Yixiang Fang
YZYifei Zhang
Yifei Zhang
Chenhao MaChenhao Ma
Chenhao Ma
YHYang Hong
Yang Hong
IKIrwin King
Irwin King
Searching on bipartite graphs serves as a fundamental task for various real-world applications, such as recommendation systems, database retrieval, and document querying. Conventional approaches rely on similarity matching in continuous euclidean space of vectorized node embeddings. To handle intensive similarity computation efficiently, hashing techniques for graph-structured data have emerged as a prominent research direction. However, despite the retrieval efficiency in Hamming space, previous studies have encountered catastrophic performance decay . To address this challenge, we investigate the problem of hashing with Graph Convolutional Network for effective Top-N search. Our findings indicate the learning effectiveness of incorporating hashing techniques within the exploration of bipartite graph reception fields, as opposed to simply treating hashing as post-processing to output embeddings. To further enhance the model performance, we advance upon these findings and propose B ipartite G raph C ontrastive H ashing ( BGCH+ ). BGCH+ introduces a novel dual augmentation approach to both intermediate information and hash code outputs in the latent feature spaces, thereby producing more expressive and robust hash codes within a dual self-supervised learning paradigm. Comprehensive empirical analyses on six real-world benchmarks validate the effectiveness of our dual feature contrastive learning in boosting the performance of BGCH+ compared to existing approaches.

Verified
Journal Article
Open access
PDF file
YSYingrui Sun
Yingrui Sun
YHYang Hong
Yang Hong
XZXiaowei Zhou
Xiaowei Zhou
Junyu DongJunyu Dong
Junyu Dong
Foundation segmentation models exhibit strong generalization on natural images yet degrade substantially in underwater scenes due to color distortion, scattering, and low contrast, which collectively impair feature representation. Parameter-efficient fine-tuning strategies have been explored to adapt SAM to marine domains while preserving generalization, but degraded image quality still hampers feature extraction. Moreover, existing SAM-based underwater methods typically rely on ground-truth box prompts during inference. Since ground-truth boxes are inherently unavailable in real-world underwater scenarios, this dependence yields evaluation outcomes that fail to reflect actual deployment conditions, thereby limiting their practical applicability. To address these issues, Water-AutoSAM is introduced—a dual-domain enhanced auto-prompting framework tailored for underwater image segmentation. The auto-prompting mechanism decouples semantic and positional representations for generalized point generation, which are optimized via enhanced sharpness, correctness, and diversity losses under staged training. To counter the degrading effects typical of underwater imagery, a lightweight module designated SS-UIE is integrated as a frozen pre-enhancement stage. This module operates with spatial–frequency dual-branch processing and utilizes a fixed residual fusion coefficient to combine the two streams. Operating entirely without box prompts, Water-AutoSAM achieves competitive annotation-free performance, attaining 92.38% mIoU on SUIM and reducing the gap to the fully supervised upper bound to 2.08% on COD10K.

17 August 2024 in arXiv
Verified
Preprint
Open access
PDF file
YCYankai Chen
Yankai Chen
YFYixiang Fang
Yixiang Fang
YZYifei Zhang
Yifei Zhang
CMChenhao Ma
Chenhao Ma
YHYang Hong
Yang Hong
IKIrwin King
Irwin King
Searching on bipartite graphs serves as a fundamental task for various real-world applications, such as recommendation systems, database retrieval, and document querying. Conventional approaches rely on similarity matching in continuous Euclidean space of vectorized node embeddings. To handle intensive similarity computation efficiently, hashing techniques for graph-structured data have emerged as a prominent research direction. However, despite the retrieval efficiency in Hamming space, previous studies have encountered catastrophic performance decay. To address this challenge, we investigate the problem of hashing with Graph Convolutional Network for effective Top-N search. Our findings indicate the learning effectiveness of incorporating hashing techniques within the exploration of bipartite graph reception fields, as opposed to simply treating hashing as post-processing to output embeddings. To further enhance the model performance, we advance upon these findings and propose Bipartite Graph Contrastive Hashing (BGCH+). BGCH+ introduces a novel dual augmentation approach to both intermediate information and hash code outputs in the latent feature spaces, thereby producing more expressive and robust hash codes within a dual self-supervised learning paradigm. Comprehensive empirical analyses on six real-world benchmarks validate the effectiveness of our dual feature contrastive learning in boosting the performance of BGCH+ compared to existing approaches.