• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of visual communication & image representation >A fast scanning based message receiving method on four directed acyclic subgraphs
【24h】

A fast scanning based message receiving method on four directed acyclic subgraphs

机译：四个有向无环子图的基于快速扫描的消息接收方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We propose a message-receiving algorithm on a Directed Acyclic Subgraph (DAS) structure to approximate the solution of general labeling problems extremely quickly. The algorithm divides a graph into four subgraphs to get a joint distribution of all nodes, then passes messages in two fixed directions as inference on DASs. Message receiving is a modified version of message passing. When receiving messages on DAS structure, labeling results can be obtained after just four scans. The proposed algorithm was evaluated by using it to perform three labeling decision applications (binary segmentation, image denoising, and stereo matching). Compared to other highly-accurate iterative algorithms (alpha-expansion, alpha-beta swap, tree-reweighted message passing, sum-product belief propagation, max-product belief propagation, and FastPD), the proposed algorithm shows competitive accuracy but requires much less computational time. The proposed algorithm is appropriate for applications in which iterative schemes are undesirable, but which must get reliable labeling results within a limited time. (C) 2016 Elsevier Inc. All rights reserved.
机译：我们提出了一种在有向无环子图（DAS）结构上的消息接收算法，以非常快速地近似解决一般标签问题。该算法将一个图分为四个子图，以获得所有节点的联合分布，然后在两个固定方向上传递消息，作为对DAS的推断。消息接收是消息传递的修改版本。当接收有关DAS结构的消息时，只需四次扫描即可获得标记结果。该算法通过执行三个标记决策应用程序（二进制分割，图像去噪和立体匹配）进行了评估。与其他高精度迭代算法（alpha扩展，alpha beta交换，树加权消息传递，求和积置信传播，最大乘积置信传播和FastPD）相比，该算法显示出竞争性的准确性，但所需的时间要少得多计算时间。所提出的算法适用于不需要迭代方案但必须在有限时间内获得可靠标记结果的应用。 （C）2016 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号