Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Sharing features in multi-class boosting via group sparsity|
Van Den Hengel, A.
|Citation:||Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2012), held in Rhode Island, USA, 16-21 June 2012: pp. 2128-2135|
|Series/Report no.:||IEEE Conference on Computer Vision and Pattern Recognition|
|Conference Name:||IEEE Conference on Computer Vision and Pattern Recognition (25th : 2012 : Providence, Rhode Island)|
|Sakrapee Paisitkriangkrai, Chunhua Shen and Anton van den Hengel|
|Abstract:||We present a novel formulation of fully corrective boosting for multi-class classification problems with the awareness of sharing features. Our multi-class boosting is solved in a single optimization problem. In order to share features across different classes, we introduce the mixed-norm regularization, which promotes group sparsity, into boosting. We then derive the Lagrange dual problems which enable us to design fully corrective multi-class algorithms using the primal-dual optimization technique. We show that sharing features across classes can improve classification performance and efficiency. We empirically show that in many cases, the proposed multi-class boosting generalizes better than a range of competing multi-class boosting algorithms due to the capability of feature sharing. Experimental results on machine learning data, visual scene and object recognition demonstrate the efficiency and effectiveness of proposed algorithms and validate our theoretical findings.|
|Keywords:||boosting; multi-class classification; feature sharing; column generation; convex optimization|
|Appears in Collections:||Computer Science publications|
Files in This Item:
|hdl_69851.pdf||Accepted version||875.77 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.