Probability density function estimation with the frequency polygon transform

DOI10.1016/j.ins.2014.12.014zbMath1360.62133OpenAlexW2037595452MaRDI QIDQ528669

Ezequiel López-Rubio, José Muñoz-Pérez

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.12.014

zbMATH Keywords

computer visionnonparametric estimationobject trackingmultivariate frequency polygonprobability density function estimation

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05) Machine vision and scene understanding (68T45)

Uses Software

• UCI-ml
• SIPI Image Database

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to generate random matrices from the classical compact groups
• Direct density-ratio estimation with dimensionality reduction via least-squares hetero-distributional subspace search
• A simple and relatively efficient triangulation of the n-cube
• Bin width selection in multivariate histograms by the combinatorial method
• Blind detection in symmetric non-Gaussian noise with unknown PDF using maximum entropy method with moment generating function constraints
• Averaged shifted histograms: Effective nonparametric density estimators in several dimensions
• A triangulation of the n-cube
• Bandwidth selection for kernel density estimation: a review of fully automatic selectors
• Dimensionality reduction for density ratio estimation in high-dimensional spaces
• Remarks on Some Nonparametric Estimates of a Density Function
• The Middle-Cut Triangulations of the n-Cube
• Frequency Polygons: Theory and Application
• Miscellanea. The edge frequency polygon
• Some Combinatorial Lemmas in Topology
• An automatic bandwidth selector for kernel density estimation
• The estimation of the gradient of a density function, with applications in pattern recognition
• Multidimensional binary search trees used for associative searching
• Nonlinear Filtering Using a New Proposal Distribution and the Improved Fast Gauss Transform With Tighter Performance Bounds
• Graphics processing units in acceleration of bandwidth selection for kernel density estimation
• A Simplex Method for Function Minimization
• The Fast Gauss Transform
• An invariant form for the prior probability in estimation problems
• Bandwidth selection for kernel conditional density estimation.

This page was built for publication: Probability density function estimation with the frequency polygon transform