access icon free fLRR: fast low-rank representation using Frobenius-norm

Low-rank representation (LRR) intends to find the representation with lowest rank of a given data set, which can be formulated as a rank-minimisation problem. Since the rank operator is non-convex and discontinuous, most of the recent works use the nuclear norm as a convex relaxation. It is theoretically shown that, under some conditions, the Frobenius-norm-based optimisation problem has a unique solution that is also a solution of the original LRR optimisation problem. In other words, it is feasible to apply the Frobenius norm as a surrogate of the non-convex matrix rank function. This replacement will largely reduce the time costs for obtaining the lowest-rank solution. Experimental results show that the method (i.e. fast LRR (fLRR)) performs well in terms of accuracy and computation speed in image clustering and motion segmentation compared with nuclear-norm-based LRR algorithm.

Inspec keywords: image motion analysis; image segmentation; concave programming; minimisation; pattern clustering; matrix algebra

Other keywords: convex relaxation; fast low-rank representation; rank-minimisation problem; fLRR; nonconvex matrix rank function; motion segmentation; nuclear-norm-based LRR algorithm; image clustering; Frobenius-norm-based optimisation problem

Subjects: Computer vision and image processing techniques; Optimisation techniques; Optical, image and video signal processing; Optimisation techniques; Data handling techniques; Linear algebra (numerical analysis); Linear algebra (numerical analysis)

References

    1. 1)
      • 5. Tron, R., Vidal, R.: ‘A benchmark for the comparison of 3-D motion segmentation algorithms’. IEEE Conf. Computer Vision and Pattern Recognition, Minneapolis, MN, USA, June 2007.
    2. 2)
    3. 3)
      • 3. Martinez, A.M.: ‘The AR face database’, CVC Technical Report, 1998.
    4. 4)
    5. 5)
      • 6. Ng, A.Y., Jordan, M.I., Weiss, Y.: ‘On spectral clustering: analysis and an algorithm’. Advances in Neural Information Processing Systems, Vancouver, Canada, December 2002.
    6. 6)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2014.1396
Loading

Related content

content/journals/10.1049/el.2014.1396
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading