An Acceleration of a Graph Cut Segmentation with FPGA

Bibliographic Information

Other Title
  • FPGAを用いたグラフカットセグメンテーションの高速化(画像処理(1))

Search this article

Description

In this paper, we propose an FPGA implementation of the max-flow problem for the image segmentation by the graph cuts. The graph cuts is an effective method for the image segmentation, and can be solved efficiently as the max-flow problem. In our implementation, the push-relabel method and the gap relabeling are used in order to achieve high performance on FPGA. The performance gain compared with a software library on CPU is about 3-5.

Journal

Keywords

Details 詳細情報について

  • CRID
    1570291227926702592
  • NII Article ID
    110009569561
  • NII Book ID
    AN10013061
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top