Please use this identifier to cite or link to this item:
|Title:||Representative Selection with Structured Sparsity||Authors:||Wang, Hongxing
|Issue Date:||2016||Source:||Wang, H., Kawahara, Y., Weng, C., & Yuan, J. (2017). Representative Selection with Structured Sparsity. Pattern Recognition, 63, 268-278.||Series/Report no.:||Pattern Recognition||Abstract:||We propose a novel formulation to find representatives in data samples via learning with structured sparsity. To find representatives with both diversity and representativeness, we formulate the problem as a structurally-regularized learning where the objective function consists of a reconstruction error and three structured regularizers: (1) group sparsity regularizer, (2) diversity regularizer, and (3) locality-sensitivity regularizer. For the optimization of the objective, we propose an accelerated proximal gradient algorithm, combined with the proximal-Dykstra method and the calculation of parametric maximum flows. Experiments on image and video data validate the effectiveness of our method in finding exemplars with diversity and representativeness and demonstrate its robustness to outliers.||URI:||https://hdl.handle.net/10356/82103
|ISSN:||0031-3203||DOI:||10.1016/j.patcog.2016.10.014||Rights:||© 2016 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Pattern Recognition, Elsevier. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/j.patcog.2016.10.014].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Journal Articles|
Files in This Item:
|Representative Selection with Structured Sparsity.pdf||1.42 MB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.