Kernel Bandwidth Estimation in Methods based on Probability Density Function Modelling

Adrian G. Bors, Nikolaos Nasios

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

Abstract

In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel junction at each data location. The smoothness of the functional approximation and the modelling ability are controlled by the kernel bandwidth. In this paper we propose a Bayesian estimation method for finding the kernel bandwidth. The distribution corresponding to the bandwidth is estimated from distributions characterizing the second order statistics estimates calculated from local neighbourhoods. The proposed bandwidth estimation method is applied in three different kernel density estimation based approaches: scale space, mean shift and quantum clustering. The third method is a novel pattern recognition approach using the principles of quantum mechanics.

Original languageEnglish
Title of host publication19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6
Place of PublicationNEW YORK
PublisherIEEE
Pages3354-3357
Number of pages4
ISBN (Print)978-1-4244-2174-9
DOIs
Publication statusPublished - 2008
Event19th International Conference on Pattern Recognition (ICPR 2008) - Tampa
Duration: 8 Dec 200811 Dec 2008

Conference

Conference19th International Conference on Pattern Recognition (ICPR 2008)
CityTampa
Period8/12/0811/12/08

Keywords

  • SELECTION

Cite this