Non-convex P-Norm Projection for Robust Sparsity

@article{Gupta2013NonconvexPP,
  title={Non-convex P-Norm Projection for Robust Sparsity},
  author={Mithun Das Gupta and Sanjeev Kumar},
  journal={2013 IEEE International Conference on Computer Vision},
  year={2013},
  pages={1593-1600}
}
In this paper, we investigate the properties of Lp norm (p ≤1) within a projection framework. We start with the KKT equations of the non-linear optimization problem and then use its key properties to arrive at an algorithm for Lp norm projection on the non-negative simplex. We compare with L1 projection which needs prior knowledge of the true norm, as well as hard thresholding based sparsification proposed in recent compressed sensing literature. We show performance improvements compared to… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 28 references

The method of successive projection for finding a common point of convex sets

L. M. Bregman
Soviet Math. Dokl., volume 6, pages 688–692 • 1965
View 10 Excerpts
Highly Influenced

Informative feature selection for object recognition via Sparse PCA

2011 International Conference on Computer Vision • 2011
View 2 Excerpts

Similar Papers

Loading similar papers…