A sequential subspace learning method and its application to dynamic texture analysis

Incremental update of subspace has new and interesting research applications in vision such as active recognition, object tracking and dynamic texture analysis. In this paper, a sequential subspace learning method is proposed for dynamic texture analysis. The learning algorithm can update adaptively dynamic texture subspace based on sequential observation data, and has higher computation efficiency and numerical stableness. Also our learning method considers the change of the texture sample mean when each new observation datum arrives, whereas existing subspace learning methods ignore the fact that the sample mean varies over time. Experimental results show the learning method for dynamic texture subspace is efficient and effective.

[1]  Michael Ashikhmin,et al.  Synthesizing natural textures , 2001, I3D '01.

[2]  Lennart Ljung,et al.  System Identification: Theory for the User , 1987 .

[3]  Matthew Brand,et al.  Incremental Singular Value Decomposition of Uncertain Data with Missing Values , 2002, ECCV.

[4]  Michael Lindenbaum,et al.  Sequential Karhunen-Loeve basis extraction and its application to images , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[5]  Richard Szeliski,et al.  Video textures , 2000, SIGGRAPH.

[6]  Martin Szummer,et al.  Temporal texture modeling , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[7]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[8]  B. S. Manjunath,et al.  An eigenspace update algorithm for image analysis , 1995, Proceedings of International Symposium on Computer Vision - ISCV.

[9]  Wang Tian Motion Texture for Dynamic Sequence Synthesis , 2003 .

[10]  Zoubin Ghahramani,et al.  A Unifying Review of Linear Gaussian Models , 1999, Neural Computation.