Non-Convex P-Norm Projection for Robust Sparsity
Abstract
In this paper, we investigate the properties of L p norm (p Ittiswithin 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 L p norm projection on the non-negative simplex. We compare with L 1 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 these techniques across different vision applications.
Cite
Text
Das Gupta and Kumar. "Non-Convex P-Norm Projection for Robust Sparsity." International Conference on Computer Vision, 2013. doi:10.1109/ICCV.2013.201Markdown
[Das Gupta and Kumar. "Non-Convex P-Norm Projection for Robust Sparsity." International Conference on Computer Vision, 2013.](https://mlanthology.org/iccv/2013/gupta2013iccv-nonconvex/) doi:10.1109/ICCV.2013.201BibTeX
@inproceedings{gupta2013iccv-nonconvex,
title = {{Non-Convex P-Norm Projection for Robust Sparsity}},
author = {Das Gupta, Mithun and Kumar, Sanjeev},
booktitle = {International Conference on Computer Vision},
year = {2013},
doi = {10.1109/ICCV.2013.201},
url = {https://mlanthology.org/iccv/2013/gupta2013iccv-nonconvex/}
}