Back to Search Start Over

SVDD-based pattern denoising.

Authors :
Park J
Kang D
Kim J
Kwok JT
Tsang IW
Source :
Neural computation [Neural Comput] 2007 Jul; Vol. 19 (7), pp. 1919-38.
Publication Year :
2007

Abstract

The support vector data description (SVDD) is one of the best-known one-class support vector learning methods, in which one tries the strategy of using balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. The major concern of this letter is to extend the main idea of SVDD to pattern denoising. Combining the geodesic projection to the spherical decision boundary resulting from the SVDD, together with solving the preimage problem, we propose a new method for pattern denoising. We first solve SVDD for the training data and then for each noisy test pattern, obtain its denoised feature by moving its feature vector along the geodesic on the manifold to the nearest decision boundary of the SVDD ball. Finally we find the location of the denoised pattern by obtaining the pre-image of the denoised feature. The applicability of the proposed method is illustrated by a number of toy and real-world data sets.

Details

Language :
English
ISSN :
0899-7667
Volume :
19
Issue :
7
Database :
MEDLINE
Journal :
Neural computation
Publication Type :
Academic Journal
Accession number :
17521284
Full Text :
https://doi.org/10.1162/neco.2007.19.7.1919