Parametric distributional clustering for image segmentation

被引:0
作者
Hermes, L [1 ]
Zöller, T [1 ]
Buhmann, JM [1 ]
机构
[1] Univ Bonn, Inst Informat 3, D-53117 Bonn, Germany
来源
COMPUTER VISION - ECCV 2002 PT III | 2002年 / 2352卷
关键词
image segmentation; clustering; maximum likelihood; information theory;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Unsupervised Image Segmentation is one of the central issues in Computer Vision. From the viewpoint of exploratory data analysis, segmentation can be formulated as a clustering problem in which pixels or small image patches are grouped together based on local feature information. In this contribution, parametrical distributional clustering (PDC) is presented as a novel approach to image segmentation. In contrast to noise sensitive point measurements, local distributions of image features provide a statistically robust description of the local image properties. The segmentation technique is formulated as a generative model in the maximum likelihood framework. Moreover, there exists an insightful connection to the novel information theoretic concept of the Information Bottleneck (Tishby et al. [17]), which emphasizes the compromise between efficient coding of an image and preservation of characteristic information in the measured feature distributions. The search for good grouping solutions is posed as an optimization problem, which is solved by deterministic annealing techniques. In order to further increase the computational efficiency of the resulting segmentation algorithm, a multi-scale optimization scheme is developed. Finally, the performance of the novel model is demonstrated by segmentation of color images from the Corel data base.
引用
收藏
页码:577 / 591
页数:15
相关论文
共 17 条