Online Robust Subspace Tracking from Partial Information

Details Online Robust Subspace Tracking from Partial Information Online Robust Subspace Tracking from Partial Information

2011-09-18

arxiv.org/abs/1109.3827v2

Computer Science

Information Theory

28 pages, 12 figures

Scientific paper

This paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracking Algorithm), an efficient and robust online algorithm for tracking subspaces from highly incomplete information. The algorithm uses a robust $l^1$-norm cost function in order to estimate and track non-stationary subspaces when the streaming data vectors are corrupted with outliers. We apply GRASTA to the problems of robust matrix completion and real-time separation of background from foreground in video. In this second application, we show that GRASTA performs high-quality separation of moving objects from background at exceptional speeds: In one popular benchmark video example, GRASTA achieves a rate of 57 frames per second, even when run in MATLAB on a personal laptop.

Affiliated with

Also associated with

No associations

Rating

Online Robust Subspace Tracking from Partial Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Robust Subspace Tracking from Partial Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Robust Subspace Tracking from Partial Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560144