Pattern recognition by kernel Wiener filter

  • Authors:
  • Hirokazu Yoshino;Yukihiko Yamashita

  • Affiliations:
  • Tokyo Institute of Technology, Ookayama, Meguro-ku, Tokyo, Japan;Tokyo Institute of Technology, Ookayama, Meguro-ku, Tokyo, Japan

  • Venue:
  • SPPRA '08 Proceedings of the Fifth IASTED International Conference on Signal Processing, Pattern Recognition and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Wiener filter is used widely for the inverse problem. From an observed signal, it provides the best restored signal with respect to the squared error averaged over the original signal and the noise among linear operators. In this paper, we propose applying the kernel Wiener filter, which enables us to handle signals non-linearly by mapping signals to the high dimensional space with kernel trick, to the pattern recognition problem. We regard a pattern as an observed signal and provide an identical original vector for the patterns belonging to the same class. Finally we classify an unknown pattern into the class of which vector is the nearest to the restored signal in the high dimensional space of the original space. In addition, we apply linear approximation to the kernel function to enable the regularization based on the distance in the observed signal space to enhance its performance of generalization. And also we adjust the value of the kernel function in the high dimensional original signal space to improve its ability further more.