首页> 外文会议>IEEE Conference on Computer Vision and Pattern Recognition >Efficient inference for fully-connected CRFs with stationarity
【24h】

Efficient inference for fully-connected CRFs with stationarity

机译:高效推动与实质性的完全连接的CRF

获取原文

摘要

The Conditional Random Field (CRF) is a popular tool for object-based image segmentation. CRFs used in practice typically have edges only between adjacent image pixels. To represent object relationship statistics beyond adjacent pixels, prior work either represents only weak spatial information using the segmented regions, or encodes only global object co-occurrences. In this paper, we propose a unified model that augments the pixel-wise CRFs to capture object spatial relationships. To this end, we use a fully connected CRF, which has an edge for each pair of pixels. The edge potentials are defined to capture the spatial information and preserve the object boundaries at the same time. Traditional inference methods, such as belief propagation and graph cuts, are impractical in such a case where billions of edges are defined. Under only one assumption that the spatial relationships among different objects only depend on their relative positions (spatially stationary), we develop an efficient inference algorithm that converges in a few seconds on a standard resolution image, where belief propagation takes more than one hour for a single iteration.
机译:条件随机字段(CRF)是基于对象的图像分割的流行工具。实践中使用的CRF通常仅在相邻图像像素之间具有边缘。要表示超出相邻像素的对象关系统计信息,请在使用分段区域表示仅代表弱空间信息,或者仅对全局对象共同进行编码。在本文中,我们提出了一个统一的模型,即增加像素 - 明智的CRF来捕获对象空间关系。为此,我们使用完全连接的CRF,其具有每对像素的边缘。边缘电位被定义为捕获空间信息并同时保留对象边界。在定义数十亿边缘的情况下,传统推理方法(例如信仰传播和图形)在这种情况下是不切实际的。在仅一个假设中,不同对象之间的空间关系仅取决于它们的相对位置(空间静止),我们开发了一种高效推理算法,该算法在标准分辨率图像上几秒钟收敛,其中信仰传播需要超过一小时单一迭代。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号