Research Article
Online Discrete Anchor Graph Hashing for Mobile Person Re-Identification
Algorithm 2
Online optimization algorithm based on GPI.
| (i) | Input: | | (ii) | Output: | | (1) | Compute truncated similarity matrix ; | | (2) | Compute according to (11); | | (3) | Compute according to (12); | | (4) | Compute according to (13); | | (5) | Initial an orthogonal matrix ; | | (6) | for iter < max_iter do | | (7) | Compute ; | | (8) | Update according to (14); | | (9) | Compute; | | (10) | Perform the compact SVD ; | | (11) | Compute ; | | (12) | end for | | (13) | Update; | | (14) | Add new hashing codes by |
|
