Principal Component Analysis (PCA) is a well-established technique in image processing and pattern recognition. Incremental PCA and robust PCA are two interesting problems with numerous potential applications. However, these two issues have only been separately addressed in the previous studies. In this paper, we present a novel algorithm for incremental and robust PCA by seamlessly integrating the two issues together. The proposed algorithm has the advantages of both incremental PCA and robust PCA. Moreover, unlike most M-estimation based robust algorithms, it is computational efficient. Experimental results on dynamic background modelling are provided to show the performance of the algorithm with a comparison to the conventional batch-mode and non-robust algorithms.

Principal Component Analysis (PCA) has been of great interest in computer vision and pattern recognition. In particular, incrementally learning a PCA model, which is computationally efficient for large scale problems as well as adaptable to reflect the variable state of a dynamic system, is an attractive research topic with numerous applications such as adaptive background modelling and active object recognition. In addition, the conventional PCA, in the sense of least mean squared error minimisation, is susceptible to outlying measurements. To address these two important issues, we present a novel algorithm of incremental PCA, and then extend it to robust PCA. Compared with the previous studies on robust PCA, our algorithm is computationally more efficient. We demonstrate the performance of these algorithms with experimental results on dynamic background modelling and multi-view face modelling.

No abstract

No abstract

A multi-level attention framework for tracking and segmentation of humans and objects under complex occlusions is investigated, featuring an effective probabilistic appearance-based technique for pixel reclassification during object grouping and splitting. A novel 'spatial-depth affinity metric' is introduced in the conventional likelihood function, utilising information of both spatial locations of pixels and dynamic depth ordering of the component objects in grouping. Depth ordering estimation is achieved through a combination of top-down and bottom-up approach. Experiments on some realworld difficult scenarios of low quality and highly compressed videos demonstrate the very promising results achieved.