Semantic Coding by Supervised Dimensionality Reduction
- 3 June 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 10 (5) , 806-818
Abstract
This paper addresses the problem of representing multimedia information under a compressed form that permits efficient classification. The semantic coding problem starts from a subspace method where dimensionality reduction is formulated as a matrix factorization problem. Data samples are jointly represented in a common subspace extracted from a redundant dictionary of basis functions. We first build on greedy pursuit algorithms for simultaneous sparse approximations to solve the dimensionality reduction problem. The method is extended into a supervised algorithm, which further encourages the class separability in the extraction of the most relevant features. The resulting supervised dimensionality reduction scheme provides an interesting tradeoff between approximation (or compression) and discriminant feature extraction (or classification). The algorithm provides a compressed signal representation that can directly be used for multimedia data mining. The application of the proposed algorithm to image recognition problems further demonstrates classification performances that are competitive with state-of-the-art solutions in handwritten digit or face recognition. Semantic coding certainly represents an interesting solution to the challenging problem of processing huge volumes of multidimensional data in modern multimedia systems, where compressed data have to be processed and analyzed with limited computational complexity.Keywords
This publication has 23 references indexed in Scilit:
- Tree-Based Pursuit: Algorithm and PropertiesIEEE Transactions on Signal Processing, 2006
- Nonnegative matrix factorization for spectral data analysisLinear Algebra and its Applications, 2006
- Low-rate and flexible image coding with redundant representationsIEEE Transactions on Image Processing, 2006
- Nonsmooth nonnegative matrix factorization (nsNMF)IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Learning spatially localized, parts-based representation2005
- Learning non-negative sparse image codes by convex programming2005
- Parameterisation of a stochastic model for human face identification2002
- Statistical Pattern Recognition2002
- Positive matrix factorization: A non‐negative factor model with optimal utilization of error estimates of data valuesEnvironmetrics, 1994
- Principal Component Analysis1986