On-line Learning Parts-based Representation via Incremental Orthogonal Projective Non-negative Matrix Factorization

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Authors Dong Kai Wang, Huchuan Lu
Journal/Conference Name Signal Processing
Paper Category
Paper Abstract This paper presents a novel incremental orthogonal projective non-negative matrix factorization (IOPNMF) algorithm, which is aimed to learn a parts-based subspace that reveals dynamic data streams. By assuming that the newly added samples only affect basis vectors but do not affect the coefficients of old samples, we propose an objective function for on-line learning and then present a multiplicative update rule to solve it. Compared with other non-negative matrix factorization (NMF) methods, our algorithm can guarantee to learn a linear parts-based subspace in an on-line fashion, which may facilitate some real applications. The facial analysis experiment shows that our IOPNMF method learns parts-based components successfully. In addition, we present an effective tracking method by integrating the IOPNMF method, the idea of sparse representation and the domain information of object tracking. The proposed tracker explicitly takes partial occlusion and mis-alignment into account for appearance model update and object tracking. The experimental results on some challenging image sequences demonstrate the proposed tracking algorithm performs favorably against several state-of-the-art methods. & 2012 Elsevier B.V. All rights reserved.
Date of publication 2013
Code Programming Language MATLAB

Copyright Researcher 2022