Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhangping He

dblp:216/4570 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Video understanding and tracking · 33% Graph learning · 33% Image recognition and object detection · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
graph convolutional network
0.512021
Learning a Proposal Classifier for Multiple Object Tracking · CVPR 2021
Computer vision › Video understanding and tracking
multi-object tracking
0.512021
Learning a Proposal Classifier for Multiple Object Tracking · CVPR 2021
Computer vision › Image recognition and object detection › object detection › proposal-based detection
proposal classification
0.512021
Learning a Proposal Classifier for Multiple Object Tracking · CVPR 2021

Methods — techniques the papers use, named apart from their topics

graph convolutional network · 0.5graph clustering · 0.5
YearPublicationVenuePosition
2021 Learning a Proposal Classifier for Multiple Object Tracking
abstract
The recent trend in multiple object tracking (MOT) is heading towards leveraging deep learning to boost the tracking performance. However, it is not trivial to solve the data-association problem in an end-to-end fashion. In this paper, we propose a novel proposal-based learnable framework, which models MOT as a proposal generation, proposal scoring and trajectory inference paradigm on an affinity graph. This framework is similar to the two-stage object detector Faster RCNN, and can solve the MOT problem in a data-driven way. For proposal generation, we propose an iterative graph clustering method to reduce the computational cost while maintaining the quality of the generated proposals. For proposal scoring, we deploy a trainable graph-convolutional-network (GCN) to learn the structural patterns of the generated proposals and rank them according to the estimated quality scores. For trajectory inference, a simple deoverlapping strategy is adopted to generate tracking output while complying with the constraints that no detection can be assigned to more than one track. We experimentally demonstrate that the proposed method achieves a clear performance improvement in both MOTA and IDF1 with respect to previous state-of-the-art on two public benchmarks. Our code is available at https://github.com/daip13/LPC_MOT.git.
Renliang Weng, Wongun Choi, Changshui Zhang, Zhangping He
CVPR5
2019 Deep feature embedding learning for person re-identification based on lifted structured loss
Zhangping He, Cheolkon Jung, Qingtao Fu, Zhendong Zhang 0001
Multim. Tools Appl.1
2018 Deep Feature Embedding Learning for Person Re-Identification Using Lifted Structured Loss
abstract
In this paper, we propose deep feature embedding learning for person re-identification (re-id) using lifted structured loss. Although triplet loss has been commonly used in deep neural networks for person re-id, the triplet loss-based framework is not effective in fully using the batch information. Thus, it needs to choose hard negative samples manually that is very time-consuming. To address this problem, we adopt lifted structured loss for deep neural networks that makes the network learn better feature embedding by minimizing intra-class variation and maximizing inter-class variation. Extensive experiments on CUHK03, CUHKOI and VIPeR datasets demonstrate the superior performance of the proposed method over state-of-the-arts in terms of the cumulative match curve (CMC) metric.
Zhangping He, Zhendong Zhang 0001, Cheolkon Jung
ICASSP1