O(log n) bimodality analysis

Abstract The bimodality of a population P can be measured by dividing its range into two intervals so as to maximize the Fisher distance between the resulting two subpopulations P 1 and P 2 . If P is a mixture of two (approximately) Gaussian subpopulations, then P 1 and P 2 are good approximations to the original Gaussians, if their Fisher distance is great enough. Moreover, good approximations to P 1 and P 2 can be obtained by dividing P into small parts; finding the maximum-distance (MD) subdivision of each part; combining small groups of these subdivisions into (approximate) MD subdivisions of larger parts; and so on. This divide-and-conquer approach yields an approximate MD subdivision of P in O (log n ) computational steps using O ( n ) processors, where n is the size of P .

[1]  N. Otsu A threshold selection method from gray level histograms , 1979 .

[2]  Azriel Rosenfeld Pyramid algorithms for perceptual organization , 1986 .

[3]  Joseph O'Rourke,et al.  Dynamic Quantization: Two Adaptive Data Structures for Multidimensional Spaces , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Lawrence O'Gorman,et al.  The Converging Squares Algorithm: An Efficient Method for Locating Peaks in Multidimensions , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Stanley M. Dunn,et al.  Bimean clustering , 1983, Pattern Recognit. Lett..

[6]  Larry S. Davis,et al.  On Computing Histograms of Images in Log n Time Using Fat Pyramids. , 1987 .

[7]  Azriel Rosenfeld,et al.  Albedo estimation for scene segmentation , 1983, Pattern Recognit. Lett..

[8]  Steven L. Tanimoto,et al.  Bright-spot detection in pyramids , 1988, Comput. Vis. Graph. Image Process..

[9]  Arthur C. Sanderson,et al.  Some Extensions of the Converging Squares Algorithm for Image Feature Analysis , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.