Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/44936
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Feature extraction using sequential semidefinite programming |
Author: | Shen, C. Li, H. Brooks, M. |
Citation: | Proceedings of DICTA / pp.430-437 |
Publisher: | IEEE |
Publisher Place: | CDROM |
Issue Date: | 2007 |
ISBN: | 0769530672 9780769530673 |
Conference Name: | Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (9th : 2007 : Glenelg, Australia) |
Editor: | Bottema, M. |
Statement of Responsibility: | Shen, Chunhua, Li, Hongdong and Brooks, Michael J. |
Abstract: | Many feature extraction approaches end up with a trace quotient formulation. Since it is difficult to directly solve the trace quotient problem, conventionally the trace quotient cost is replaced by an approximation such that the generalised eigen-decomposition can be applied. In this work we directly optimise the trace quotient. It is reformulated as a quasi-linear semidefinite optimisation problem, which can be solved globally and efficiently using standard off-the-shelf semidefinite programming solvers. Also this optimisation strategy allows one to enforce additional constraints ( e.g., sparseness constraints) on the projection matrix. Based on this optimisation framework, a novel feature extraction algorithm is designed. Its advantages are demonstrated on several UCI machine learning benchmark datasets, USPS handwritten digits and ORL face data. |
Rights: | © Copyright 2008 IEEE – All Rights Reserved |
DOI: | 10.1109/DICTA.2007.4426829 |
Published version: | http://dx.doi.org/10.1109/dicta.2007.4426829 |
Appears in Collections: | Aurora harvest 6 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.