z-logo
open-access-imgOpen Access
Multi‐stage ranking approach for fast person re‐identification
Author(s) -
Fumera Bahram Lavi Giorgio,
Roli Fabio
Publication year - 2018
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/iet-cvi.2017.0240
Subject(s) - ranking (information retrieval) , computer science , benchmark (surveying) , identification (biology) , artificial intelligence , sorting , similarity (geometry) , machine learning , task (project management) , data mining , quality (philosophy) , pattern recognition (psychology) , ranking svm , image (mathematics) , algorithm , engineering , biology , philosophy , botany , geodesy , systems engineering , epistemology , geography
One of the goals of person re‐identification systems is to support video‐surveillance operators and forensic investigators to find an individual of interest in videos acquired by a network of non‐overlapping cameras. This is attained by sorting images of previously observed individuals for decreasing values of their similarity with a given probe individual. Existing appearance descriptors, together with their similarity measures, are mostly aimed at improving ranking quality. The authors address instead the issue of processing time, which is also relevant in practical applications involving interaction with human operators. They show how a trade‐off between processing time and ranking quality, for any given descriptor , can be achieved through a multi‐stage ranking approach inspired by multi‐stage classification approaches, which they adapt to the re‐identification ranking task. The authors analytically model the processing time of multi‐stage system and discuss the corresponding accuracy, and derive from these results practical design guidelines. They then empirically evaluate their approach on three benchmark data sets and four state‐of‐the‐art descriptors.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here