Abstract

To benefit from the development of compressive sensing, we cast tracking as a sparse approximation problem in a particle filter framework based on multifeatures. In this framework, the target template is composed of multiple features extracted from visible and infrared frames; in addition, occlusion, interruption, and noises are addressed through a set of trivial templates. With this model, the sparsity is achieved via a compressive sensing approach without nonnegative constraints; then the residual between sparsity representation and the compressed sensing observation is used to measure the likelihood which weights particles. After that, the target template is adaptively updated according to the Bhattacharyya coefficients. Some experimental results demonstrate that the proposed tracker appears to have better robustness compared with four different algorithms.

Full Text
Paper version not known

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 call

Disclaimer: 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.