Guoliang Kang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Guoliang Kang has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Yi Yang
Zhejiang University, China
9 shared publications - Yunchao Wei
Beijing Jiaotong University, Beijing, China
4 shared publications - Alexander G. Hauptmann
Carnegie Mellon University
3 shared publications - Baochang Zhang
Beihang University
2 shared publications - Bo Zhao
School of AI Shanghai Jiao Tong University
2 shared publications - Cilin Yan
School of Automation Science and Electrical Engineering, Beihang University, Beijing, China
2 shared publications
Latest Publications
- 15 October 2026
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 134 (10) , 477
SLCA++: Unleash the Power of Sequential Fine-Tuning for Continual Learning with Pre-training
- 15 October 2026
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 134 (10) , 477
SLCA++: Unleash the Power of Sequential Fine-Tuning for Continual Learning with Pre-training
- 29 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 306
Additional encoder is not what you need: Unleashing the potential of CLIP for weakly-supervised semantic segmentation
- 29 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 306
Additional encoder is not what you need: Unleashing the potential of CLIP for weakly-supervised semantic segmentation
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 9227-9236
Separate Motion from Appearance: Customizing Motion via Customizing Text-to-Video Diffusion Models
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 9227-9236
Open AccessSeparate Motion from Appearance: Customizing Motion via Customizing Text-to-Video Diffusion Models
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 7883-7892
Cross-Domain Attribute Alignment with CLIP: A Rehearsal-Free Approach for Class-Incremental Unsupervised Domain Adaptation
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 7883-7892
Open AccessCross-Domain Attribute Alignment with CLIP: A Rehearsal-Free Approach for Class-Incremental Unsupervised Domain Adaptation
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 4778-4787
Enhancing Visual Reliance in Text Generation: A Bayesian Perspective on Mitigating Hallucination in Large Vision-Language Models
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 4778-4787
Open AccessEnhancing Visual Reliance in Text Generation: A Bayesian Perspective on Mitigating Hallucination in Large Vision-Language Models
- Open Access
LTCA: Long-range Temporal Context Attention for Referring Video Object Segmentation
Referring Video Segmentation (RVOS) aims to segment objects in videos given linguistic expressions. The key to solving RVOS is to extract long-range temporal context information from the interactions of expressions and videos to depict the dynamic attributes of each object. Previous works either adopt attention across all the frames or stack dense local attention to achieve a global view of temporal context. However, they fail to strike a good balance between locality and globality, and the computation complexity significantly increases with the increase of video length. In this paper, we propose an effective long-range temporal context attention (LTCA) mechanism to aggregate global context information into object features. Specifically, we aggregate the global context information from two aspects. Firstly, we stack sparse local attentions to balance the locality and globality. We design a dilated window attention across frames to aggregate local context information and perform such attention in a stack of layers to enable a global view. Further, we enable each query to attend to a small group of keys randomly selected from a global pool to enhance the globality. Secondly, we design a global query to interact with all the other queries to directly encode the global context information. Experiments show our method achieves new state-of-the-art on four referring video segmentation benchmarks. Notably, our method shows an improvement of 11.3% and 8.3% on the MeViS valu and val datasets respectively.
Open AccessLTCA: Long-range Temporal Context Attention for Referring Video Object Segmentation
Referring Video Segmentation (RVOS) aims to segment objects in videos given linguistic expressions. The key to solving RVOS is to extract long-range temporal context information from the interactions of expressions and videos to depict the dynamic attributes of each object. Previous works either adopt attention across all the frames or stack dense local attention to achieve a global view of temporal context. However, they fail to strike a good balance between locality and globality, and the computation complexity significantly increases with the increase of video length. In this paper, we propose an effective long-range temporal context attention (LTCA) mechanism to aggregate global context information into object features. Specifically, we aggregate the global context information from two aspects. Firstly, we stack sparse local attentions to balance the locality and globality. We design a dilated window attention across frames to aggregate local context information and perform such attention in a stack of layers to enable a global view. Further, we enable each query to attend to a small group of keys randomly selected from a global pool to enhance the globality. Secondly, we design a global query to interact with all the other queries to directly encode the global context information. Experiments show our method achieves new state-of-the-art on four referring video segmentation benchmarks. Notably, our method shows an improvement of 11.3% and 8.3% on the MeViS valu and val datasets respectively.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (3) , 2968-2979
LTCA: Long-Range Temporal Context Attention for Referring Video Object Segmentation
Referring Video Segmentation (RVOS) aims to segment objects in videos given linguistic expressions. The key to solving RVOS is to extract long-range temporal context information from the interactions of expressions and videos to depict the dynamic attributes of each object. Previous works either adopt attention across all the frames or stack dense local attention to achieve a global view of temporal context. However, they fail to strike a good balance between locality and globality, and the computation complexity significantly increases with the increase of video length. In this paper, we propose an effective long-range temporal context attention (LTCA) mechanism to aggregate global context information into object features. Specifically, we aggregate the global context information from two aspects. Firstly, we stack sparse local attentions to balance the locality and globality. We design a dilated window attention across frames to aggregate local context information and perform such attention in a stack of layers to enable a global view. Further, we enable each query to attend to a small group of keys randomly selected from a global pool to enhance the globality. Secondly, we design a global query to interact with all the other queries to directly encode the global context information. Experiments show our method achieves new state-of-the-art on four referring video segmentation benchmarks. Notably, our method shows an improvement of 11.3% and 8.3% on the MeViS valu and val datasets respectively. The code is available at https://github.com/cilinyan/LTCA.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (3) , 2968-2979
LTCA: Long-Range Temporal Context Attention for Referring Video Object Segmentation
Referring Video Segmentation (RVOS) aims to segment objects in videos given linguistic expressions. The key to solving RVOS is to extract long-range temporal context information from the interactions of expressions and videos to depict the dynamic attributes of each object. Previous works either adopt attention across all the frames or stack dense local attention to achieve a global view of temporal context. However, they fail to strike a good balance between locality and globality, and the computation complexity significantly increases with the increase of video length. In this paper, we propose an effective long-range temporal context attention (LTCA) mechanism to aggregate global context information into object features. Specifically, we aggregate the global context information from two aspects. Firstly, we stack sparse local attentions to balance the locality and globality. We design a dilated window attention across frames to aggregate local context information and perform such attention in a stack of layers to enable a global view. Further, we enable each query to attend to a small group of keys randomly selected from a global pool to enhance the globality. Secondly, we design a global query to interact with all the other queries to directly encode the global context information. Experiments show our method achieves new state-of-the-art on four referring video segmentation benchmarks. Notably, our method shows an improvement of 11.3% and 8.3% on the MeViS valu and val datasets respectively. The code is available at https://github.com/cilinyan/LTCA.
- 22 August 2025
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 133 (11) , 7946-7968
ReCLIP++: Learn to Rectify the Bias of CLIP for Unsupervised Semantic Segmentation
- 22 August 2025
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 133 (11) , 7946-7968
ReCLIP++: Learn to Rectify the Bias of CLIP for Unsupervised Semantic Segmentation
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 34 (10577149) , 3377-3388
PLGS: Robust Panoptic Lifting With 3D Gaussian Splatting
Previous methods utilize the Neural Radiance Field (NeRF) for panoptic lifting, while their training and rendering speed are unsatisfactory. In contrast, 3D Gaussian Splatting (3DGS) has emerged as a prominent technique due to its rapid training and rendering speed. However, unlike NeRF, the conventional 3DGS may not satisfy the basic smoothness assumption as it does not rely on any parameterized structures to render (e.g., MLPs). Consequently, the conventional 3DGS is, in nature, more susceptible to noisy 2D mask supervision. In this paper, we propose a new method called PLGS that enables 3DGS to generate consistent panoptic segmentation masks from noisy 2D segmentation masks while maintaining superior efficiency compared to NeRF-based methods. Specifically, we build a panoptic-aware structured 3D Gaussian model to introduce smoothness and design effective noise reduction strategies. For the semantic field, instead of initialization with structure from motion, we construct reliable semantic anchor points to initialize the 3D Gaussians. We then use these anchor points as smooth regularization during training. Additionally, we present a self-training approach using pseudo labels generated by merging the rendered masks with the noisy masks to enhance the robustness of PLGS. For the instance field, we project the 2D instance masks into 3D space and match them with oriented bounding boxes to generate cross-view consistent instance masks for supervision. Experiments on various benchmarks demonstrate that our method outperforms previous state-of-the-art methods in terms of both segmentation quality and speed.
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 34 (10577149) , 3377-3388
PLGS: Robust Panoptic Lifting With 3D Gaussian Splatting
Previous methods utilize the Neural Radiance Field (NeRF) for panoptic lifting, while their training and rendering speed are unsatisfactory. In contrast, 3D Gaussian Splatting (3DGS) has emerged as a prominent technique due to its rapid training and rendering speed. However, unlike NeRF, the conventional 3DGS may not satisfy the basic smoothness assumption as it does not rely on any parameterized structures to render (e.g., MLPs). Consequently, the conventional 3DGS is, in nature, more susceptible to noisy 2D mask supervision. In this paper, we propose a new method called PLGS that enables 3DGS to generate consistent panoptic segmentation masks from noisy 2D segmentation masks while maintaining superior efficiency compared to NeRF-based methods. Specifically, we build a panoptic-aware structured 3D Gaussian model to introduce smoothness and design effective noise reduction strategies. For the semantic field, instead of initialization with structure from motion, we construct reliable semantic anchor points to initialize the 3D Gaussians. We then use these anchor points as smooth regularization during training. Additionally, we present a self-training approach using pseudo labels generated by merging the rendered masks with the noisy masks to enhance the robustness of PLGS. For the instance field, we project the 2D instance masks into 3D space and match them with oriented bounding boxes to generate cross-view consistent instance masks for supervision. Experiments on various benchmarks demonstrate that our method outperforms previous state-of-the-art methods in terms of both segmentation quality and speed.
- 15 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (8) , 6294-6304
DADN: A Dynamic Anomaly Detection Network for Multivariate Time Series Data of the Industrial Internet of Things
Industrial Internet of Things (IIoT) faces significant security challenges such as data privacy and vulnerabilities. Unsupervised anomaly detection aims to identify abnormal patterns by monitoring multivariate time series data of IIoT without anomaly annotation. Previous deep-learning-based methods have high-computation cost, which hinders their deployment in edge devices. In this article, we propose a dynamic anomaly detection network (DADN), which introduces a dynamic anomaly detection mechanism to enable efficient inference. Specifically, a bilateral early-exit mechanism is designed so that each sample can dynamically exit at a certain layer during the forward process to support the anomaly judgement, and the layer where sample exits is adaptively determined at the inference stage. Experimental results show that DADN significantly reduces computational costs and enhances F1 scores in industrial anomaly-detection benchmarks, as shown by a 58.22% decrease in GFLOPS on the SWAT dataset, outperforming previous representative method (anomaly transformer).
- 15 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (8) , 6294-6304
DADN: A Dynamic Anomaly Detection Network for Multivariate Time Series Data of the Industrial Internet of Things
Industrial Internet of Things (IIoT) faces significant security challenges such as data privacy and vulnerabilities. Unsupervised anomaly detection aims to identify abnormal patterns by monitoring multivariate time series data of IIoT without anomaly annotation. Previous deep-learning-based methods have high-computation cost, which hinders their deployment in edge devices. In this article, we propose a dynamic anomaly detection network (DADN), which introduces a dynamic anomaly detection mechanism to enable efficient inference. Specifically, a bilateral early-exit mechanism is designed so that each sample can dynamically exit at a certain layer during the forward process to support the anomaly judgement, and the layer where sample exits is adaptively determined at the inference stage. Experimental results show that DADN significantly reduces computational costs and enhances F1 scores in industrial anomaly-detection benchmarks, as shown by a 58.22% decrease in GFLOPS on the SWAT dataset, outperforming previous representative method (anomaly transformer).