On Implementing Graph Cuts on CUDA

@inproceedings{Hussein2007OnIG,
  title={On Implementing Graph Cuts on CUDA},
  author={M. Hussein and Amitabh Varshney and Larry Davis},
  year={2007}
}
The Compute Unified Device Architecture (CUDA) has enabled graphics processors to be explicitly programmed as general-purpose shared-memory multi-core processors with a high level of parallelism. In this paper, we present our preliminary results of implementing the Graph Cuts algorithm on CUDA. Our primary focus is on implementing Graph Cuts on grid graphs, which are extensively used in imaging applications. We first explain our implementation of breadth first search (BFS) graph traversal on… CONTINUE READING
Highly Cited
This paper has 83 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 43 extracted citations

84 Citations

01020'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 84 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Similar Papers

Loading similar papers…