Automated threshold detection using a pyramid data structure

An approach to detect the thresholds automatically in a noisy histogram is discussed. The histogram is considered as a 1D image. Then, a histogram pyramid is built for smoothing the noisy histogram and eliminating the small noise peaks and valleys. The threshold is first found at the higher level of the histogram pyramid and then mapped back to the successive levels. The results show that the thresholds obtained are close to the optimal solution in terms of the statistical point of view and are of reasonable values in some complicated and noisy histograms