mlsanityData to 7 Oct 2026

Multiclass histogram-based thresholding using kernel density estimation and scale-space representations

arXiv 2202.04785 ↗First posted 10 Feb 2022eess.IV cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

We present a new method for multiclass thresholding of a histogram which is based on the nonparametric Kernel Density (KD) estimation, where the unknown parameters of the KD estimate are defined using the Expectation-Maximization (EM) iterations. The method compares the number of extracted minima of the KD estimate with the number of the requested clusters minus one. If these numbers match, the algorithm returns positions of the minima as the threshold values, otherwise, the method gradually decreases/increases the kernel bandwidth until the numbers match. We verify the method using synthetic histograms with known threshold values and using the histogram of real X-ray computed tomography images. After thresholding of the real histogram, we estimated the porosity of the sample and compare it with the direct experimental measurements. The comparison shows the meaningfulness of the thresholding.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 30 references that are in the map. First posted on arXiv 10 Feb 2022.

Builds on

3 of 30 references.

References · 3

  1. 2015LLNet: A Deep Autoencoder Approach to Natural Low-light Image Enhancementcited by 224
  2. 2018To Cluster, or Not to Cluster: An Analysis of Clusterability Methodscited by 17
  3. 2014A parameterless scale-space approach to find meaningful modes in histograms - Application to image and spectrum segmentationcited by 6

Built on by

Not cited yet.