Feature weighted mahalanobis distance: Improved robustness for gaussian classifiers

Matthias Wölfel, Hazim Kemal Ekenel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Gaussian classifiers are strongly dependent on their underlying distance method, namely the Mahalanobis distance. Even though widely used, in the presence of noise this distance measure loses dramatically in performance, due to equal summation of the squared distances over all features. The features with large distance can mask all the other features so that the classification considers only these features, neglecting the information provided by the other features. To overcome this drawback we propose to weight the different features in the Mahalanobis distance according to their distances after the variance normalization. The idea behind this is to give less weight to noisy features and high weight to noise free features which are more reliable. Thereafter, we replace the traditional distance measure in a Gaussian classifier with the proposed. In a series of experiments we show the improved noise robustness of Gaussian classifiers by the proposed modifications in contrast to the traditional approach.

Original languageEnglish (US)
Title of host publication13th European Signal Processing Conference, EUSIPCO 2005
Pages2018-2021
Number of pages4
StatePublished - 2005
Event13th European Signal Processing Conference, EUSIPCO 2005 - Antalya, Turkey
Duration: Sep 4 2005Sep 8 2005

Publication series

Name13th European Signal Processing Conference, EUSIPCO 2005

Other

Other13th European Signal Processing Conference, EUSIPCO 2005
Country/TerritoryTurkey
CityAntalya
Period9/4/059/8/05

ASJC Scopus subject areas

  • Signal Processing

Fingerprint

Dive into the research topics of 'Feature weighted mahalanobis distance: Improved robustness for gaussian classifiers'. Together they form a unique fingerprint.

Cite this