Dapeng Tao

Dr. Dapeng Tao


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 April 2020 in Neurocomputing
Verified
Journal Article
Closed access
YZYuanxin Zhu
Yuanxin Zhu
ZYZhao Yang
Zhao Yang
LWLi Wang
Li Wang
SZSai Zhao
Sai Zhao
XHXiao Hu
Xiao Hu
DTDapeng Tao
Dapeng Tao

1 July 2018 in Pattern Recognition
Verified
Journal Article
Closed access
HLHuafeng Li
Huafeng Li
XHXiaoge He
Xiaoge He
DTDapeng Tao
Dapeng Tao
YTYuanyan Tang
Yuanyan Tang
Ruxin WangRuxin Wang
Ruxin Wang

12 April 2016 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
DTDapeng Tao
Dapeng Tao
YGYanan Guo
Yanan Guo
MSMingli Song
Mingli Song
YLYaotang Li
Yaotang Li
ZYZhengtao Yu
Zhengtao Yu
YTYuan Yan Tang
Yuan Yan Tang
Person re-identification aims to match the images of pedestrians across different camera views from different locations. This is a challenging intelligent video surveillance problem that remains an active area of research due to the need for performance improvement. Person re-identification involves two main steps: feature representation and metric learning. Although the keep it simple and straightforward (KISS) metric learning method for discriminative distance metric learning has been shown to be effective for the person re-identification, the estimation of the inverse of a covariance matrix is unstable and indeed may not exist when the training set is small, resulting in poor performance. Here, we present dual-regularized KISS (DR-KISS) metric learning. By regularizing the two covariance matrices, DR-KISS improves on KISS by reducing overestimation of large eigenvalues of the two estimated covariance matrices and, in doing so, guarantees that the covariance matrix is irreversible. Furthermore, we provide theoretical analyses for supporting the motivations. Specifically, we first prove why the regularization is necessary. Then, we prove that the proposed method is robust for generalization. We conduct extensive experiments on three challenging person re-identification datasets, VIPeR, GRID, and CUHK 01, and show that DR-KISS achieves new state-of-the-art performance.

9 November 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
Huafeng LiHuafeng Li
Huafeng Li
YCYiwen Chen
Yiwen Chen
DTDapeng Tao
Dapeng Tao
ZYZhengtao Yu
Zhengtao Yu
Guanqiu QiGuanqiu Qi
Guanqiu Qi
Domain invariance and discrimination of learned features as two crucial factors affect the performance of unsupervised domain adaptation (UDA) person re-identification (Re-ID). Person attributes (such as “backpack”“, boots”“, handbag”, etc) remaining unchanged across multiple domains have been used as mid-level visual-semantic information in UDA person Re-ID. As two main challenges, both misalignment of attribute-related regions across multiple images and domain shift between source and target domains affect the learning of domain-invariant features (DIF). To address the above two challenges, this paper proposes to take advantage of the stability of person attributes and the complementarity of person attributes and the corresponding low-level visual features to guide the learning of discriminative DIF. Specifically, the proposed solution contains the generation of latent attribute-correlated visual features (GLAVF), DIF learning under the guidance of person attributes, and the alignment of person attributes corresponding to the local regions of pedestrian images. Due to the gap between person attributes and visual features, person attributes are first converted into latent attribute-correlated visual features (LAVF) without any specific domain information in GLAVF, and then LAVF are used as the substitutions of person attributes to guide the learning of DIF. To enhance the discrimination of learned features, the proposed solution mainly explores the alignment between person attributes and corresponding local regions, and the alignment of the same person attributes across multiple pedestrian images. A fully connected layer is used to achieve the above two types of alignment in the proposed framework, which reduces the adverse impacts of inference information and ensures the semantic consistency between person attributes and corresponding local regions across multiple pedestrian images. The effectiveness of the proposed solution is confirmed on four existing datasets by comparative experiments.

1 July 2015 in Neurocomputing
Verified
Journal Article
Closed access
YTYushuang Tian
Yushuang Tian
XMXiaoli Meng
Xiaoli Meng
DTDapeng Tao
Dapeng Tao
DLDongquan Liu
Dongquan Liu
CFChen Feng
Chen Feng

1 June 2017 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
RHRichang Hong
Richang Hong
LLLei Li
Lei Li
JCJunjie Cai
Junjie Cai
DTDapeng Tao
Dapeng Tao
MWMeng Wang
Meng Wang
QTQi Tian
Qi Tian
The rapidly increasing number of images on the internet has further increased the need for efficient indexing for digital image searching of large databases. The design of a cloud service that provides high efficiency but compact image indexing remains challenging, partly due to the well-known semantic gap between user queries and the rich semantics of large-scale data sets. In this paper, we construct a novel joint semantic-visual space by leveraging visual descriptors and semantic attributes, which narrows the semantic gap by combining both attributes and indexing into a single framework. Such a joint space embraces the flexibility of coherent semantic-visual indexing, which employs binary codes to boost retrieval speed while maintaining accuracy. To solve the proposed model, we make the following contributions. First, we propose an interactive optimization method to find the joint semantic and visual descriptor space. Second, we prove convergence of our optimization algorithm, which guarantees a good solution after a certain number of iterations. Third, we integrate the semantic-visual joint space system with spectral hashing, which finds an efficient solution to search up to billion-scale data sets. Finally, we design an online cloud service to provide a more efficient online multimedia service. Experiments on two standard retrieval datasets ( i.e., Holidays1M, Oxford5K ) show that the proposed method is promising compared with the current state-of-the-art and that the cloud system significantly improves performance.