Australian Centre for Visual Technologies Blog

Factorisation at CVPR
June 7, 2010, 5:50 pm
Filed under: news, publications, research

Our paper Efficient Computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L1 Norm was accepted to CVPR’10 as an oral presentation.  The paper presents a method for calculating a low rank factorisation of a matrix with missing elements on the basis of the L1 norm. Our approach is a generalisation of the Wiberg algorithm for achieving the same result using the L2 norm, which has recently been shown to be highly effective. A key step in the generalisation to the L1 case is to calculate the derivative of the solution to a linear programming problem, which allows the Jacobian of the over-arching minimisation problem to be calculated directly. Results for the new method show a significant performance advantage over competing approaches.

The pdf is available here.

Leave a Comment so far
Leave a comment

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: