Rank minimization or nuclear-norm minimization: are we solving the right problem?
Low rank method or rank-minimization has received considerable attention from recent computer vision community. Due to the inherent computational complexity of rank problems, the non-convex rank function is often relaxed to its convex relaxation, i.e. the nuclear norm. Thanks to recent progress made in the filed of compressive sensing (CS), vision researchers who are practicing CS are fully aware, and conscious, of the convex relaxation gap, as well as under which condition (e.g. Restricted...[Show more]
|Collections||ANU Research Publications|
|Source:||2014 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2014|
|Dai and Li Rank minimization or nuclear-norm 2014.pdf||388.71 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.