The University of Southampton
University of Southampton Institutional Repository

Mutual features for pattern classification

Claussen, Heiko (2009) Mutual features for pattern classification University of Southampton, School of Electronics and Computer Science, Doctoral Thesis , 114pp.

Record type: Thesis (Doctoral)

Abstract

The mean of a data set is one trivial representation of data from one class. This thesis discusses mutual interdependence analysis (MIA) that is successfully used to extract more involved representations, or “mutual features”, accounting for samples in the class. MIA aims to extract a common or mutual signature that is invariant to changes in the inputs. For example, a mutual feature is a speaker signature under varying channel conditions or a face signature under varying illumination conditions. By definition, the mutual feature is a linear combination of class examples that is equally correlated with all training samples in the class. An equivalent view is to find a direction to project the dataset such that projection lengths are maximally correlated. The MIA optimization criterion is presented from the perspectives of canonical correlation analysis and Bayesian estimation. This allows to state and solve the criterion for mutual features concisely and to infer other properties of its closed form, unique solution under various statistical assumptions. Moreover, a generalized MIA solution (GMIA) is defined that enables utilization of a priori knowledge. MIA and GMIA work well even if the mutual signature accounts only for a small part of the energy in the inputs. Real world problems do not exactly fit the signal model of an equally correlated common signature. Therefore, the behavior of MIA is analyzed in situations where its model does not exactly fit. For these situations it is shown that GMIA continues to extract meaningful information. Furthermore, the GMIA result is compared to ubiquitous signal processing methods. It is shown that GMIA extends these current tools visualizing previously hidden information. The utility of both MIA and GMIA is demonstrated on two standard pattern recognition problems: text–independent speaker verification and illumination–independent face recognition. For example, GMIA achieves an equal error rate (EER) of 4.0% in the text–independent speaker verification application on the full NTIMIT database of 630 speakers. On the other hand, for illumination–independent face recognition, MIA achieves an identification error rate of 7.4% in exhausive leave–one–out tests on the Yale database. Overall, MIA and GMIA are found to achieve competitive pattern classification performance to other modern algorithms.

PDF MUTUAL_FEATURES_FOR_PATTERN_CLASSIFICATION_HEIKO_CLAUSSEN_JULY_2009.pdf - Other
Download (7MB)

More information

Published date: June 2009
Organisations: University of Southampton

Identifiers

Local EPrints ID: 66591
URI: http://eprints.soton.ac.uk/id/eprint/66591
PURE UUID: 6b9d3cd3-0176-4cde-9746-98964bdc09ad

Catalogue record

Date deposited: 01 Jul 2009
Last modified: 19 Jul 2017 00:23

Export record

Contributors

Author: Heiko Claussen
Thesis advisor: Robert Damper

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×