文件名称:Semantic-Segmentation
- 所属分类:
- 图形图像处理(光照,映射..)
- 资源属性:
- [PDF]
- 上传时间:
- 2012-12-06
- 文件大小:
- 2.1mb
- 下载次数:
- 0次
- 提 供 者:
- 费**
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
CVPR2012_oral
Weakly Supervised Structured Output Learning for Semantic Segmentation-We address the problem of weakly supervised semantic
segmentation. The training images are labeled only by the
classes they contain, not by their location in the image. On
test images instead, the method must predict a class label
for every pixel. Our goal is to enable segmentation algorithms
to use multiple visual cues in this weakly supervised
setting, analogous to what is achieved by fully supervised
methods. However, it is difficult to assess the relative usefulness
of different visual cues from weakly supervised training
data. We define a parametric family of structured models,
where each model weighs visual cues in a different way. We
propose a Maximum Expected Agreement model selection
principle that evaluates the quality of a model from the family
without looking at superpixel labels. Searching for the
best model is a hard optimization problem, which has no
analytic gradient and multiple local optima. We cast it as
a Bayesian optimization problem and propose an
Weakly Supervised Structured Output Learning for Semantic Segmentation-We address the problem of weakly supervised semantic
segmentation. The training images are labeled only by the
classes they contain, not by their location in the image. On
test images instead, the method must predict a class label
for every pixel. Our goal is to enable segmentation algorithms
to use multiple visual cues in this weakly supervised
setting, analogous to what is achieved by fully supervised
methods. However, it is difficult to assess the relative usefulness
of different visual cues from weakly supervised training
data. We define a parametric family of structured models,
where each model weighs visual cues in a different way. We
propose a Maximum Expected Agreement model selection
principle that evaluates the quality of a model from the family
without looking at superpixel labels. Searching for the
best model is a hard optimization problem, which has no
analytic gradient and multiple local optima. We cast it as
a Bayesian optimization problem and propose an
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Weakly Supervised Structured Output Learning for Semantic Segmentation .pdf