Re-identification of Humans in Crowds using Personal, Social and Environmental Constraints

12/07/2016
by   Shayan Modiri Assari, et al.
0

This paper addresses the problem of human re-identification across non-overlapping cameras in crowds.Re-identification in crowded scenes is a challenging problem due to large number of people and frequent occlusions, coupled with changes in their appearance due to different properties and exposure of cameras. To solve this problem, we model multiple Personal, Social and Environmental (PSE) constraints on human motion across cameras. The personal constraints include appearance and preferred speed of each individual assumed to be similar across the non-overlapping cameras. The social influences (constraints) are quadratic in nature, i.e. occur between pairs of individuals, and modeled through grouping and collision avoidance. Finally, the environmental constraints capture the transition probabilities between gates (entrances / exits) in different cameras, defined as multi-modal distributions of transition time and destination between all pairs of gates. We incorporate these constraints into an energy minimization framework for solving human re-identification. Assigning 1-1 correspondence while modeling PSE constraints is NP-hard. We present a stochastic local search algorithm to restrict the search space of hypotheses, and obtain 1-1 solution in the presence of linear and quadratic PSE constraints. Moreover, we present an alternate optimization using Frank-Wolfe algorithm that solves the convex approximation of the objective function with linear relaxation on binary variables, and yields an order of magnitude speed up over stochastic local search with minor drop in performance. We evaluate our approach using Cumulative Matching Curves as well 1-1 assignment on several thousand frames of Grand Central, PRID and DukeMTMC datasets, and obtain significantly better results compared to existing re-identification methods.

READ FULL TEXT

page 2

page 4

page 6

page 9

page 12

page 13

page 14

research
05/10/2020

Implementation of iterative local search (ILS) for the quadratic assignment problem

The quadratic assignment problem (QAP) is one of the hardest NP-hard pro...
research
04/10/2021

Unveiling personnel movement in a larger indoor area with a non-overlapping multi-camera system

Surveillance cameras are widely applied for indoor occupancy measurement...
research
04/29/2013

A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem

Generalized traveling salesman problem (GTSP) is an extension of classic...
research
10/29/2020

Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering

Centrality measures characterize important nodes in networks. Efficientl...
research
10/07/2009

Sonet Network Design Problems

This paper presents a new method and a constraint-based objective functi...
research
06/08/2022

Direct Triangulation with Spherical Projection for Omnidirectional Cameras

In this paper, it is proposed to solve the problem of triangulation for ...
research
02/23/2021

Structural Similarity of Boundary Conditions and an Efficient Local Search Algorithm for Goal Conflict Identification

In goal-oriented requirements engineering, goal conflict identification ...

Please sign up or login with your details

Forgot password? Click here to reset