Efficient Graph Cuts for Multi-region Segmentation
(2012) In Master’s Theses in Mathematical Sciences FMA820 20122Mathematics (Faculty of Engineering)
- Abstract
- Many problems in computer vision can be formulated as optimization problems that can be solved using minimum cuts in flow networks. However, these applications can be demanding, with the memory bandwidth being the main bottleneck on the performance. This thesis introduces an efficient solver that reduces the memory requirements while improving the speed. The code is freely available on-line.
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/student-papers/record/3233492
- author
- Rykfors, Martin LU
- supervisor
- organization
- course
- FMA820 20122
- year
- 2012
- type
- H2 - Master's Degree (Two Years)
- subject
- publication/series
- Master’s Theses in Mathematical Sciences
- report number
- LUTFMA-3237-2012
- ISSN
- 1404-6342
- other publication id
- 2012:E43
- language
- English
- id
- 3233492
- date added to LUP
- 2013-04-25 17:21:49
- date last changed
- 2013-04-25 17:21:49
@misc{3233492, abstract = {{Many problems in computer vision can be formulated as optimization problems that can be solved using minimum cuts in flow networks. However, these applications can be demanding, with the memory bandwidth being the main bottleneck on the performance. This thesis introduces an efficient solver that reduces the memory requirements while improving the speed. The code is freely available on-line.}}, author = {{Rykfors, Martin}}, issn = {{1404-6342}}, language = {{eng}}, note = {{Student Paper}}, series = {{Master’s Theses in Mathematical Sciences}}, title = {{Efficient Graph Cuts for Multi-region Segmentation}}, year = {{2012}}, }