1 / 10

Kernel Density Estimation - concept and applications

Kernel Density Estimation - concept and applications. Bohyung Han bhhan@cs.umd.edu. Kernel Density Estimation. Definition of KDE Characteristics Nonparametric technique Effective multi-modal data representation Consideration of noise for observed data Representation of model/state.

Anita
Télécharger la présentation

Kernel Density Estimation - concept and applications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Kernel Density Estimation -concept and applications Bohyung Han bhhan@cs.umd.edu

  2. Kernel Density Estimation • Definition of KDE • Characteristics • Nonparametric technique • Effective multi-modal data representation • Consideration of noise for observed data • Representation of model/state

  3. Example

  4. Variations • Kernel • Uniform • Gaussian • Epanechnikov • … • Bandwidth • Fixed to every data • Variable according to data pattern

  5. Issues • Bandwidth selection • Automatic data-dependent bandwidth selection • MISE (Mean Integrated Squared Error) • Error between the estimated and the true density (which is not known) • Variable bandwidth selection • Mean-shift • No good method yet

  6. Issues – cont’d

  7. Issues – cont’d • Computational cost • Slow • No closed form • A lot of exponential computations (Gaussian kernel) • Memory consumption • Must store all the data in most cases!

  8. Application – BGS (1) • Overview • PDF per pixel by KDE • Classification by global threshold • Nonparametric representation • Better than parametric representation • Very high computational cost in high dimension, especially • Huge memory requirement • Bandwidth selection issue

  9. Application – BGS (2) • Contribution • Good background modeling for multi-modal cases • False alarm reduction: using spatial information • Shadow detection

  10. Application – BGS (3) • Solution for issues • Exponential computations • Large pre-generated table • producing round-off error • No good solution for memory depletion • Variable bandwidth selection • Median absolute deviation over the sample for consecutive intensity values

More Related