Xiaodong Wang

Dr. Xiaodong Wang


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
4 April 2023 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
XWXiaodong Wang
Xiaodong Wang
Zhedong ZhengZhedong Zheng
Zhedong Zheng
YHYang He
Yang He
FYFei Yan
Fei Yan
ZZZhiqiang Zeng
Zhiqiang Zeng
YYYi Yang
Yi Yang
Most image retrieval works aim at learning discriminative visual features, while little attention is paid to the retrieval efficiency. The speed of feature extraction is key to the real-world system. Therefore, in this paper, we focus on network pruning for image retrieval acceleration. Different from the classification models predicting discrete categories, image retrieval models usually extract continuous features for retrieval, which are more sensitive to network pruning. Such different characteristics of the retrieval and classification models make the traditional pruning method sub-optimal for image retrieval acceleration. Two points are critical for pruning image retrieval models: preserving the local geometry structure of filters and maintaining the model capacity during pruning. In view of the above considerations, we propose a Progressive Local Filter Pruning (PLFP) method. Specifically, we analyze the local geometry of filter distribution in every layer and select redundant filters according to one new criterion that the filter can be replaced locally by other similar filters. Furthermore, to preserve the model capacity of the original model, the proposed method progressively prune the filter by decreasing the scale of filter weights gradually. We evaluate our method on four scene retrieval datasets, i.e. , Oxford5K, Oxford105 K, Paris6K, and Paris106 K, and one person re-identification dataset, i.e. , Market-1501. Extensive experiments show that the proposed method (1) preserves the original model capacity while pruning (2) and achieves superior performance to other widely-used pruning methods.

15 December 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
XWXiaodong Wang
Xiaodong Wang
Zhedong ZhengZhedong Zheng
Zhedong Zheng
YHYang He
Yang He
FYFei Yan
Fei Yan
ZZZhiqiang Zeng
Zhiqiang Zeng
YYYi Yang
Yi Yang
Deep learning has shown significant successes in person reidentification (re-id) tasks. However, most existing works focus on discriminative feature learning and impose complex neural networks, suffering from low inference efficiency. In fact, feature extraction time is also crucial for real-world applications and lightweight models are needed. Prevailing pruning methods usually pay attention to compact classification models. However, these methods are suboptimal for compacting re-id models, which usually produce continuous features and are sensitive to network pruning. The key point of pruning re-id models is how to retain the original filter distribution in continuous features as much as possible. In this work, we propose a blockwise adjacent filter decaying method to fill this gap. Specifically, given a trained model, we first evaluate the redundancy of filters based on the adjacency relationships to preserve the original filter distribution. Second, previous layerwise pruning methods ignore that discriminative information is enhanced block-by-block. Therefore, we propose a blockwise filter pruning strategy to better utilize the block relations in the pretrained model. Third, we propose a novel filter decaying policy to progressively reduce the scale of redundant filters. Different from conventional soft filter pruning that directly sets the filter values as zeros, the proposed filter decaying can keep the pretrained knowledge as much as possible. We evaluate our method on three popular person reidentification datasets, that is: 1) Market-1501; 2) DukeMTMC-reID; and 3) MSMT17_V1. The proposed method shows superior performance to the existing state-of-the-art pruning methods. After pruning over 91.9% parameters on DukeMTMC-reID, the Rank-1 accuracy only drops 3.7%, demonstrating its effectiveness for compacting person reidentification.

15 November 2018 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZZZhiqiang Zeng
Zhiqiang Zeng
JZJian Zhang
Jian Zhang
XWXiaodong Wang
Xiaodong Wang
YCYuming Chen
Yuming Chen
CZChaoyang Zhu
Chaoyang Zhu
Place recognition is one of the most fundamental topics in the computer-vision and robotics communities, where the task is to accurately and efficiently recognize the location of a given query image. Despite years of knowledge accumulated in this field, place recognition still remains an open problem due to the various ways in which the appearance of real-world places may differ. This paper presents an overview of the place-recognition literature. Since condition-invariant and viewpoint-invariant features are essential factors to long-term robust visual place-recognition systems, we start with traditional image-description methodology developed in the past, which exploits techniques from the image-retrieval field. Recently, the rapid advances of related fields, such as object detection and image classification, have inspired a new technique to improve visual place-recognition systems, that is, convolutional neural networks (CNNs). Thus, we then introduce the recent progress of visual place-recognition systems based on CNNs to automatically learn better image representations for places. Finally, we close with discussions and mention of future work on place recognition.

1 November 2021 in Knowledge-Based Systems
Verified
Journal Article
Closed access
XWXiaodong Wang
Xiaodong Wang
PWPengtao Wu
Pengtao Wu
QXQinghua Xu
Qinghua Xu
ZZZhiqiang Zeng
Zhiqiang Zeng
YXYong Xie
Yong Xie

24 November 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
ZZZhiqiang Zeng
Zhiqiang Zeng
XWXiaodong Wang
Xiaodong Wang
WLWei Li
Wei Li
YYYuandi Ye
Yuandi Ye

7 January 2025 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
XWXiaodong Wang
Xiaodong Wang
JFJiangtao Fan
Jiangtao Fan
FYFei Yan
Fei Yan
HHHongmin Hu
Hongmin Hu
ZZZhiqiang Zeng
Zhiqiang Zeng
HHHaiyan Huang
Haiyan Huang