0


图像分析的加权子结构挖掘

Weighted Substructure Mining for Image Analysis
课程网址: http://videolectures.net/mlg07_nowozin_wsm/  
主讲教师: Sebastian Nowozin
开课单位: 马克斯普朗克研究所
开课时间: 2007-09-05
课程语种: 英语
中文简介:
在与图像分类的网络相关的应用程序中,它是希望得到一个可解释的分类规则高精确度。使用词袋表示和线性支持向量机,可以部分实现目标,但线性分类器的准确性并不高获得的功能对用户没有信息。我们建议组合项集挖掘和大边距分类器从所有视觉单词的幂集中选择要素。我们的结果分类规则更容易浏览和更简单要理解,因为每个功能都有更丰富的信息。作为下一步,每个图像都表示为图形节点对应于局部图像特征和边缘编码特征之间的几何关系。结合图挖掘和提升,我们可以获得基于分类规则在包含更多信息的子图功能上设置功能。我们在网络检索中评估我们的算法排名任务,目标是拒绝一组中的异常值为关键字查询返回的图像。此外,它被评估关于具有挑战性的监督分类任务VOC2005数据集。我们的方法产生了极好的准在无人监督的排名任务和竞争结果在监督分类任务中。
课程简介: In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and the linear support vector machine, one can partly fulfill the goal, but the accuracy of linear classifiers is not high and the obtained features are not informative for users. We propose to combine item set mining and large margin classifiers to select features from the power set of all visual words. Our resulting classification rule is easier to browse and simpler to understand, because each feature has richer information. As a next step, each image is represented as a graph where nodes correspond to local image features and edges encode geometric relations between features. Combining graph mining and boosting, we can obtain a classification rule based on subgraph features that contain more information than the set features. We evaluate our algorithm in a web-retrieval ranking task where the goal is to reject outliers from a set of images returned for a keyword query. Furthermore, it is evaluated on the supervised classification tasks with the challenging VOC2005 data set. Our approach yields excellent accuracy in the unsupervised ranking task and competitive results in the supervised classification task.
关 键 词: 图像分类; 线性支持向量机; 异常值
课程来源: 视频讲座网
最后编审: 2019-06-30:cjy
阅读次数: 14