Zhen Zhang

Zhen Zhang

Auto-generated profile, based on publicly available information

Zhen Zhang

Northwestern Polytechnical University

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 December 2015
Verified
Conference Paper
Closed access
SRSeyed Hamid Rezatofighi
Seyed Hamid Rezatofighi
AMAnton Milan
Anton Milan
ZZZhen Zhang
Zhen Zhang
QSQinfeng Shi
Qinfeng Shi
ADAnthony Dick
Anthony Dick
IRIan Reid
Ian Reid
In this paper, we revisit the joint probabilistic data association (JPDA) technique and propose a novel solution based on recent developments in finding the m-best solutions to an integer linear program. The key advantage of this approach is that it makes JPDA computationally tractable in applications with high target and/or clutter density, such as spot tracking in fluorescence microscopy sequences and pedestrian tracking in surveillance footage. We also show that our JPDA algorithm embedded in a simple tracking framework is surprisingly competitive with state-of-the-art global tracking methods in these two applications, while needing considerably less processing time.

1 June 2016
Verified
Conference Paper
Closed access
ZZZhen Zhang
Zhen Zhang
QSQinfeng Shi
Qinfeng Shi
JMJulian McAuley
Julian McAuley
WWWei Wei
Wei Wei
YZYanning Zhang
Yanning Zhang
AHAnton van Den Hengel
Anton van Den Hengel
Feature matching is a key problem in computer vision and pattern recognition. One way to encode the essential interdependence between potential feature matches is to cast the problem as inference in a graphical model, though recently alternatives such as spectral methods, or approaches based on the convex-concave procedure have achieved the state-of-the-art. Here we revisit the use of graphical models for feature matching, and propose a belief propagation scheme which exhibits the following advantages: (1) we explicitly enforce one-to-one matching constraints, (2) we offer a tighter relaxation of the original cost function than previous graphical-model-based approaches, and (3) our sub-problems decompose into max-weight bipartite matching, which can be solved efficiently, leading to orders-of-magnitude reductions in execution time. Experimental results show that the proposed algorithm produces results superior to those of the current state-of-the-art.

1 June 2015
Verified
Conference Paper
Closed access
MTMingkui Tan
Mingkui Tan
QSQinfeng Shi
Qinfeng Shi
AHAnton van Den Hengel
Anton van Den Hengel
CSChunhua Shen
Chunhua Shen
JGJunbin Gao
Junbin Gao
ZZZhen Zhang
Zhen Zhang
Exploiting label dependency for multi-label image classification can significantly improve classification performance. Probabilistic Graphical Models are one of the primary methods for representing such dependencies. The structure of graphical models, however, is either determined heuristically or learned from very limited information. Moreover, neither of these approaches scales well to large or complex graphs. We propose a principled way to learn the structure of a graphical model by considering input features and labels, together with loss functions. We formulate this problem into a max-margin framework initially, and then transform it into a convex programming problem. Finally, we propose a highly scalable procedure that activates a set of cliques iteratively. Our approach exhibits both strong theoretical properties and a significant performance improvement over state-of-the-art methods on both synthetic and real-world data sets.

22 November 2016 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
RYRui Yao
Rui Yao
SXShixiong Xia
Shixiong Xia
ZZZhen Zhang
Zhen Zhang
YZYanning Zhang
Yanning Zhang
Patch-based models that combine local image features or regions into loose geometric assemblies are a powerful paradigm for visual object tracking, and they present favorable properties such as robustness to partial occlusion, deformation, and the ability to address viewpoint changes. However, effectively exploiting the spatial-temporal confidence scores of each patch to construct a robust tracker while ensuring a low computational cost with dense discrete search remains a challenging problem. In this paper, we propose a unified Markov random field (MRF) model that can effectively capture spatio-temporal intrapatch relations and occlusion priors to enhance the tracking performance, and we derive a highly efficient dense belief propagation for inference of the proposed MRF model. We propose a tracker that models the tracking object with a constellation topology (i.e., a global object and several local patches), where the graph structure model describes the pairwise spatial structure and the image observation model corresponding to the correlation filter with occlusion handling measuring the appearance similarity. Furthermore, these two models are updated online by exploiting the flexibility of local patches. Extensive experimental results on single- and multiple-object tracking show that the proposed algorithm performs favorably against state-of-the-art methods and runs in real time.

1 June 2016
Verified
Conference Paper
Closed access
SRSeyed Hamid Rezatofighi
Seyed Hamid Rezatofighi
AMAnton Milani
Anton Milani
ZZZhen Zhang
Zhen Zhang
Qinfeng ShiQinfeng Shi
Qinfeng Shi
ADAnthony Dick
Anthony Dick
IRIan Reid
Ian Reid
Matching between two sets of objects is typically approached by finding the object pairs that collectively maximize the joint matching score. In this paper, we argue that this single solution does not necessarily lead to the optimal matching accuracy and that general one-to-one assignment problems can be improved by considering multiple hypotheses before computing the final similarity measure. To that end, we propose to utilize the marginal distributions for each entity. Previously, this idea has been neglected mainly because exact marginalization is intractable due to a combinatorial number of all possible matching permutations. Here, we propose a generic approach to efficiently approximate the marginal distributions by exploiting the m-best solutions of the original problem. This approach not only improves the matching solution, but also provides more accurate ranking of the results, because of the extra information included in the marginal distribution. We validate our claim on two distinct objectives: (i) person re-identification and temporal matching modeled as an integer linear program, and (ii) feature point matching using a quadratic cost function. Our experiments confirm that marginalization indeed leads to superior performance compared to the single (nearly) optimal solution, yielding state-of-the-art results in both applications on standard benchmarks.

25 January 2014 in Neurocomputing
Verified
Journal Article
Closed access
ZZZhen Zhang
Zhen Zhang
YZYanning Zhang
Yanning Zhang