Cache-efficient graph cuts on structured grids

@article{Jamriska2012CacheefficientGC,
  title={Cache-efficient graph cuts on structured grids},
  author={Ondrej Jamriska and Daniel S{\'y}kora and Alexander Sorkine-Hornung},
  journal={2012 IEEE Conference on Computer Vision and Pattern Recognition},
  year={2012},
  pages={3673-3680}
}
Finding minimal cuts on graphs with a grid-like structure has become a core task for solving many computer vision and graphics related problems. However, computation speed and memory consumption oftentimes limit the effective use in applications requiring high resolution grids or interactive response. In particular, memory bandwidth represents one of the major bottlenecks even in today's most efficient implementations. We propose a compact data structure with cache-efficient memory layout for… CONTINUE READING

Citations

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

References

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

Competitive analysis of minimum-cut maximum flow algorithms in vision problems

  • B. Fishbain, D. S. Hochbaum, S. Mueller
  • The Computing Research Repository,
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…