图像分割中的学习问题Learning issues in image segmentation |
|
课程网址: | http://videolectures.net/lmcv04_buhmann_liis/ |
主讲教师: | Joachim M. Buhmann |
开课单位: | 苏黎世联邦理工学院 |
开课时间: | 2007-02-05 |
课程语种: | 英语 |
中文简介: | 图像分割通常被定义为将像素或图像块划分为同质组。这些组通过特征空间(例如,Gabor滤波器响应的空间)中的原型向量、特征的原型直方图或图像块之间的成对差异来表征。对于所有三种数据格式,已经提出了成本函数来测量失真,从而对分区的质量进行编码。图像分割中的学习可以定义为片段的原型描述符的推断,如代码本矢量或片段内的平均特征概率。与分类或回归相反,图像分割的经验风险通常由依赖随机变量的和组成,如归一化切割、成对聚类或具有平滑约束的k均值聚类。机器学习的核心挑战之一是发现假设MRF成本函数作为图像模型,可以从这些数据源中学习到什么样的信息。图像分割的验证程序强烈依赖于这个问题。我将在基于颜色和纹理特征的图像分析中演示学习和验证问题。 |
课程简介: | Image segmentation is often defined as a partitioning of pixels or image blocks into homogeneous groups. These groups are characterized by a prototypical vector in feature space, e.g., the space of Gabor filter responses, by a prototypical histograms of features or by pairwise dissimilarities between image blocks. For all three data formats cost functions have been proposed to measure distortion and, thereby, to encode the quality of a partition. Learning in image segmentation can be defined as the inference of prototypical descriptors of segments like codebook vectors or average feature probability within a segment. Contrary to classification or regression, the empirical risk of image segmentation is often composed of sums of dependent random variables like in Normalized Cut, Pairwise Clustering or k-means clustering with smoothness constraints. One of the core challenges for machine learning is to discover what kind of information can be learned from these data sources assuming MRF cost functions as image models. The validation procedure for image segmentations strongly depends on this issue. I will demonstrate the learning and validation issue in the context of image analysis based on color and texture features. |
关 键 词: | 图像分割; 特征空间; 成对聚类 |
课程来源: | 视频讲座网 |
数据采集: | 2022-11-29:chenjy |
最后编审: | 2022-11-29:chenjy |
阅读次数: | 25 |