Abstract
Object Re-identification is a key technology for enabling mobile visual search, virtual reality and augmented reality, and a variety of security and surveillance applications. One key problem in re-identification is to have effective key point feature aggregation schemes that can preserve recall performance in short listing, while offering indexing and hashing efficiency. In the MPEG Compact Descriptor for Visual Search (CDVS) Standardization effort, the Scalable Compressed Fisher Vector (SCFV) was proved to be most efficient in this role. In this paper we develop a novel aggregation scheme that captures the subspaces where key points reside, and uses the Grassmannian distance metric to discriminate the aggregated information. Simulation demonstrates that the proposed scheme captures discriminative information complementary to the Fisher Vector (FV) aggregation, and can significantly improve the matching performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
