Cache-efficient graph cuts on structured grids
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00194222" target="_blank" >RIV/68407700:21230/12:00194222 - isvavai.cz</a>
Result on the web
<a href="http://dcgi.felk.cvut.cz/home/sykorad/Jamriska12-CVPR.pdf" target="_blank" >http://dcgi.felk.cvut.cz/home/sykorad/Jamriska12-CVPR.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CVPR.2012.6248113" target="_blank" >10.1109/CVPR.2012.6248113</a>
Alternative languages
Result language
angličtina
Original language name
Cache-efficient graph cuts on structured grids
Original language description
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 the representation of graph instances that are based on regular N-D grids with topologically identical neighborhood systems. For this common class of graphs our data structure allows for 3 to 12 times higher grid resolutions and a 3- to 9-fold speedup compared toexisting approaches. Our design is agnostic to the underlying algorithm, and hence orthogonal to other optimizations such as parallel and hierarchical processing. We evaluate the performance gain on a variety of typical problems including
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on
ISBN
978-1-4673-1228-8
ISSN
1063-6919
e-ISSN
—
Number of pages
8
Pages from-to
3673-3680
Publisher name
IEEE Press
Place of publication
New York
Event location
Providence, Rhode Island
Event date
Jun 16, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000309166203106