Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Joint probabilistic matching using m-best solutions
Author: Rezatofighi, S.
Milan, A.
Zhang, Z.
Shi, Q.
Dick, A.
Reid, I.
Citation: Proceedings / CVPR, IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2016, vol.2016-December, pp.136-145
Publisher: IEEE
Issue Date: 2016
Series/Report no.: IEEE Conference on Computer Vision and Pattern Recognition
ISBN: 9781467388511
ISSN: 1063-6919
Conference Name: 29th IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPR 2016) (26 Jun 2016 - 1 Jul 2016 : Las Vegas, NV)
Statement of
Seyed Hamid Rezatofighi, Anton Milani, Zhen Zhang, Qinfeng Shi, Anthony Dick, Ian Reid
Abstract: 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.
Rights: © 2016 IEEE
DOI: 10.1109/CVPR.2016.22
Grant ID:
Appears in Collections:Aurora harvest 3
Computer Science publications

Files in This Item:
File Description SizeFormat 
  Restricted Access
Restricted Access4.46 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.