Page Views on Nuit Blanche since July 2010







Please join/comment on the Google+ Community (1530), the CompressiveSensing subreddit (849), the Facebook page (46 likes), the LinkedIn Compressive Sensing group (3301) or the Advanced Matrix Factorization Group (1048)

Saturday, August 27, 2011

Tennis Players are Sparse !


While taking EE364b: Convex Optimization II with Stephen BoydIvan Papusha decided to do the following project:

... explores several large-scale methods for solving the Robust PCA problem via Principal Component Pursuit (PCP), a convex optimization problem, and demonstrates its use in background extraction tasks in video and point-cloud LIDAR data.

The idea is to perform background subtraction on a video stream. The PCP problem admits natural decomposition into Alternating Direction Method of Multipliers (ADMM, the course notes on ADMM are here) form. Here is the result: ‘‘Fast Automatic Background Extraction via Robust PCA’’. The poster is here. The matlab implementation is here.

Thanks Ivan  for sharing.

Liked this entry ? subscribe to the Nuit Blanche feed, there's more where that came from

2 comments:

Ronan said...

3 years later, the Matlab code is here (the link in the post is now broken) :
http://www.cds.caltech.edu/~ipapusha/code/pcp_admm.m

Igor said...

thanks Ronan !

Cheers,

Igoe.

Printfriendly