Cache-efficient graph cuts on structured grids

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Cache-efficient graph cuts on structured grids

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Cache-efficient graph cuts on structured grids

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on

ISBN

978-1-4673-1228-8

ISSN

1063-6919

e-ISSN

—

Počet stran výsledku

8

Strana od-do

3673-3680

Název nakladatele

IEEE Press

Místo vydání

New York

Místo konání akce

Providence, Rhode Island

Datum konání akce

16. 6. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000309166203106