Agglomerative clustering on range data with a unified probabilistic merging function and termination criterion

Clustering methods, which are frequently employed for region-based segmentation, are inherently metric based. A fundamental problem with an estimation-based criterion is that as the amount of information in a region decreases, the parameter estimates become extremely unreliable and incorrect decisions are likely to be made. It is shown that clustering need not be metric based. A rigorous region merging probability function is used. It makes use of all information available in the probability densities of a statistical image model. By using this probability function as a termination criterion it is possible to produce segmentations in which all region merges are performed above some level of confidence.<<ETX>>

[1]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[2]  Steven M. LaValle,et al.  Bayesian region merging probability for parametric image models , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[3]  David B. Cooper,et al.  Bayesian Clustering for Unsupervised Estimation of Surface and Texture Models , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  James W. Modestino,et al.  A model-fitting approach to cluster validation with application to stochastic model-based image segmentation , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[5]  Jean-Michel Jolion,et al.  Robust Clustering with Applications in Computer Vision , 1991, IEEE Trans. Pattern Anal. Mach. Intell..