default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Liang 0002
Person information
- affiliation: South China Normal University, Foshan, China
Other persons with the same name
- Jun Liang — disambiguation page
- Jun Liang 0001
![[0000-0001-7511-449X]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-7511-449X")
— Cardiff University, School of Engineering, Wales, UK - Jun Liang 0003 — Zhejiang University, State Key Laboratory of Industrial Control Technology, Hangzhou, China
- Jun Liang 0004 — Jiangsu University, Automotive Engineering Research Institute, Zhenjiang, China
- Jun Liang 0005 — Shanghai Jiao Tong University, School of Aeronautics and Astronautics, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j14]Hai Su, Jiamei Liu, Jun Liang:
PSDR-SNet: Siamese network of potential steganographic signal difference regions for image steganalysis. J. Vis. Commun. Image Represent. 111: 104542 (2025)- [j13]Hai Su, Xiangyun Li, Jun Liang:
Robust image hiding via conditional invertible neural network. J. Vis. Commun. Image Represent. 113: 104605 (2025) - [j12]Jun Liang, Xiaoyang Kuang, Hai Su:
DualRW: a dual fusion network for rating quicksketch works. Neural Comput. Appl. 37(19): 13283-13294 (2025) - [c13]Jun Liang, Rui Luo, Yang Peng, Hai Su:
DuCol: Text-Tag Adaptive Colorization of Dual-Character Line Art. ICASSP 2025: 1-5 - [c12]Jun Liang, Yang Peng, Rui Luo, Yunyu Zou, Yalong Cheng, Bingzhi Chen:
Learning Hierarchical Attribute Prompt for Vision-Language Models. ICASSP 2025: 1-5 - [c11]Yinghong Chen, Huanjia Zhu, Jieyi Cai, Huanyu Liu, Jun Liang, Bingzhi Chen:
Towards Differential Optimization: Rehearsal-Free Class-Incremental Learning with Slow Learners and Fast Adapters. ICASSP 2025: 1-5 - [c10]Xiang Qiu, Huanjia Zhu, Xiaocheng Fang, Jun Liang, Bingzhi Chen, Hui Lin:
Advancing Few-Shot Class-Incremental Learning with Virtual Prototype Guidance Prompting. ICASSP 2025: 1-5 - [c9]Jun Liang, Yunyu Zou, Yang Peng, Yalong Cheng, Rui Luo, Yishu Liu, Bingzhi Chen:
Task-Aware Knowledge Prompt and Distillation for Cross-Domain Few-Shot Learning. ICME 2025: 1-6 - [c8]Yunyu Zou, Yishu Liu, Jun Liang, Bingzhi Chen:
SG-FSL: Cross-Domain Few-Shot Learning with Style-Decoupled Augmentation and Gradient-Conflict Adjustment. ACM Multimedia 2025: 8759-8768 - 2024
- [j11]Jun Liang, Xinyao Liu, Dingjun Lou, Zan-Bo Zhang, Zixin Qin:
Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs. Discret. Appl. Math. 351: 94-104 (2024) - [j10]Jun Liang, Nuo Zhou, Jiahao Long, Songsen Yu, Muhammad Faizan Khan:
A Lightweight Object Detection Model for Low-End UAVs. Int. J. Pattern Recognit. Artif. Intell. 38(15): 2455020:1-2455020:15 (2024) - [c7]Xiaolin Huang, Binzhi Chen, Jiacheng Chen, Jingchun Lin, Ruihua Nie, Jun Liang:
Enhancing Semi-supervised Medical Image Segmentation with Asymmetric and Adversarial Cooperative Training. ICONIP (8) 2024: 225-239 - [c6]Songsen Yu, Shiqi Wu, Yifan Lin, Jun Liang:
Unpaired Multi-scenario Sketch Synthesis via Texture Enhancement. PRCV (4) 2024: 181-194 - [c5]Rui Luo, Yang Peng, Nuo Zhou, Jun Liang:
Periodic Iterative Segmentation-Colorization Training: Line Drawing Colorization Using Text Tag with CBAMCat. PRCV (3) 2024: 215-229 - 2023
- [j9]Zhiji Huang, Songsen Yu, Jun Liang:
Multi-level feature fusion capsule network with self-attention for facial expression recognition. J. Electronic Imaging 32(2) (2023) - [j8]Hai Su, Meiyin Han, Junle Liang, Jun Liang, Songsen Yu:
Deep supervised hashing with hard example pairs optimization for image retrieval. Vis. Comput. 39(11): 5405-5420 (2023) - 2022
- [j7]Jun Liang, Feiteng Xu, Songsen Yu:
A multi-scale semantic attention representation for multi-label image recognition with graph networks. Neurocomputing 491: 14-23 (2022) - 2021
- [j6]Jun Liang, Dingjun Lou, Zan-Bo Zhang:
The cubic graphs with finite cyclic vertex connectivity larger than girth. Discret. Math. 344(2): 112197 (2021) - [j5]Songsen Yu, ZeSheng Lin, Jun Liang, GangXu Shu, JiaLin Yu, Ao Zhu:
Sketch works ranking based on improved transfer learning model. Multim. Tools Appl. 80(25): 33663-33678 (2021) - [c4]Jun Liang, Zhaofeng Zeng, Songsen Yu, Zehong Hong:
An Improved Chinese Text Classification Ensemble Model. ICDSP 2021: 332-336 - [i1]Hai Su, Meiyin Han, Junle Liang, Jun Liang, Songsen Yu:
Hard Example Guided Hashing for Image Retrieval. CoRR abs/2112.13565 (2021) - 2020
- [j4]Zongrong Qin, Dingjun Lou, Huiquan Zhu, Jun Liang:
Characterization of k-subconnected graphs. Appl. Math. Comput. 364 (2020) - [c3]Jun Liang, Meixin Du, Ruihua Nie, Zhihao Liang, Zheng Li:
Distributed Algorithms for Cyclic Edge Connectivity and Cyclic Vertex Connectivity of Cubic Graphs. ICDSP 2020: 279-283
2010 – 2019
- 2019
- [j3]Jun Liang, Dingjun Lou:
A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k. J. Comb. Optim. 37(3): 1000-1010 (2019) - [j2]Jun Liang, Dingjun Lou, Zongrong Qin, Qinglin Yu:
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. J. Comb. Optim. 38(2): 589-607 (2019) - [c2]Jun Liang, Qin Liu, Ruihua Nie, Biqing Zeng, Zan-Bo Zhang:
An Improved Algorithm based on KNN and Random Forest. CSAE 2019: 74:1-74:6 - 2018
- [c1]Jun Liang:
An ensemble method. ICCIP 2018: 186-190 - 2017
- [j1]Jun Liang, Dingjun Lou, Zan-Bo Zhang:
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. Int. J. Comput. Math. 94(7): 1501-1514 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-01-29 02:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
