Zhaobin Chang

Zhaobin Chang

Auto-generated profile, based on publicly available information

Zhaobin Chang

School of Information Science and Engineering, Lanzhou University, Lanzhou, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
25 January 2024 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
ZCZhaobin Chang
Zhaobin Chang
XGXiong Gao
Xiong Gao
NLNa Li
Na Li
HZHuiyu Zhou
Huiyu Zhou
Yonggang LuYonggang Lu
Yonggang Lu
Few-shot semantic segmentation (FSS) aims to segment novel classes with only a few annotated samples. Existing methods to FSS generally combine the annotated mask and the corresponding support image to generate the class-specific representation, and perform the segmentation for the query image by matching the features of the query image to these representations. However, the segmentation performance could be fragile for the lack of an effective method to handle the inappropriate use of query features and the neglection of correlation between features in support and query images. In this work, we propose a novel Disentanglement and Recombination Network (DRNet) to alleviate this problem. Concretely, we first apply the self-attention on both support foreground features and query foreground features. Then, the foreground features of the support and query branches are recombined using the cross-attention after self-attention computation, which can encourage the foreground feature alignment between branches. Finally, the prototypes are generated from the recombined foreground features and support background features, and are utilized to guide the segmentation for given images. Considering the sensitivity of prototypes related to the subtle differences among objects from different classes and the same class, we further introduce a joint learning strategy to derive accurate segmentation of both seen and unseen objects in the support image and the query image respectively. Extensive experiments on the PASCAL-5 i and COCO-20 i datasets demonstrate the superiority of our DRNet comparing with the recent popular methods. The code is released on https://github.com/GS-Chang-Hn/DRNet-fss.

3 February 2019 in Journal of Computer Networks and Communications
Verified
Journal Article
Open access
PDF file
HZHong Zhao
Hong Zhao
ZCZhaobin Chang
Zhaobin Chang
GBGuangbin Bao
Guangbin Bao
XZXiangyan Zeng
Xiangyan Zeng
Malicious domain name attacks have become a serious issue for Internet security. In this study, a malicious domain names detection algorithm based on N-Gram is proposed. The top 100,000 domain names in Alexa 2013 are used in the N-Gram method. Each domain name excluding the top-level domain is segmented into substrings according to its domain level with the lengths of 3, 4, 5, 6, and 7. The substring set of the 100,000 domain names is established, and the weight value of a substring is calculated according to its occurrence number in the substring set. To detect a malicious attack, the domain name is also segmented by the N-Gram method and its reputation value is calculated based on the weight values of its substrings. Finally, the judgment of whether the domain name is malicious is made by thresholding. In the experiments on Alexa 2017 and Malware domain list, the proposed detection algorithm yielded an accuracy rate of 94.04%, a false negative rate of 7.42%, and a false positive rate of 6.14%. The time complexity is lower than other popular malicious domain names detection algorithms.

16 September 2022 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
ZCZhaobin Chang
Zhaobin Chang
Yonggang LuYonggang Lu
Yonggang Lu
XWXiangwen Wang
Xiangwen Wang
XRXingcheng Ran
Xingcheng Ran

10 September 2019 in IEEE Access
Verified
Journal Article
Open access
HZHong Zhao
Hong Zhao
ZCZhaobin Chang
Zhaobin Chang
WWWeijie Wang
Weijie Wang
XZXiangyan Zeng
Xiangyan Zeng
Malicious domain names usually refer to a series of illegal activities, posing threats to people’s privacy and property. Therefore, the problem of detecting malicious domain names has aroused widespread concerns. In this study, a malicious domain names detection algorithm based on lexical analysis and feature quantification is proposed. To achieve efficient and accurate detection, the method includes two phases. The first phase checks an observed domain name against a blacklist of known malicious uniform resource locator (URLs). The observed domain name is classified as being definitely malicious or potentially malicious based on its edit distances to the domain names on the blacklist. The second phase further evaluates a potential malicious domain name by its reputation value that represents its lexical feature and is calculated based on an N-gram model. The top 100,000 normal domain names in Alexa are used to obtain a whitelist substring set using the N-gram method in which each domain name excluding the top-level domain is segmented into substrings with the length of 3, 4, 5, 6 and 7. The weighted values of the substrings are calculated according to their occurrence counts in the whitelist substring set. A potential malicious domain name is segmented by the N-gram method and its reputation value is calculated based on the weighted values of its substrings. Finally, the potential malicious domain name is determined to be malicious or normal based on its reputation value. The effectiveness of the proposed detection method has been demonstrated by experiments on public available data.

1 January 2019 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
HZHong Zhao
Hong Zhao
WWWeijie Wang
Weijie Wang
TWTao Wang
Tao Wang
ZCZhao-Bin Chang
Zhao-Bin Chang
XZXiangyan Zeng
Xiangyan Zeng
Along with the fast development of digital information technology and the application of Internet, video data begins to grow explosively. Some applications with high real‐time requirements, such as object detection, require strong online video storage and analysis capabilities. Key‐frame extraction is an important technique in video analysis, which provides an organizational framework for dealing with video content and reduces the amount of data required in video indexing. To address the problem, this study proposes a key‐frame extraction method based on HSV (hue, saturation, value) histogram and adaptive clustering. The HSV histogram is used as color features for each frame, which reduces the amount of data. Furthermore, by using the transformed one‐dimensional eigenvector, the fixed number of features can be extracted for images with different sizes. Then, a cluster validation technique, the silhouette coefficient, is employed to get the appropriate number of clusters without setting any clustering parameters. Finally, several algorithms are compared in the experiments. The density peak clustering algorithm (DPCA) model is shown to be more effective than the other four models in precision and F‐measure.

26 August 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ZCZhaobin Chang
Zhaobin Chang
Yonggang LuYonggang Lu
Yonggang Lu
XRXingcheng Ran
Xingcheng Ran
XGXiong Gao
Xiong Gao
HZHong Zhao
Hong Zhao