The Insight Journal logo
Home

Graph Cuts, <i>Caveat Utilitor</i>, and Euler's Bridges of Konigsberg

Tustison, Nicholas, Yushkevich, Paul, Song, Zhuang, Gee, James
Publication cover image

Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/1503
New: Prefer using the following doi: https://doi.org/10.54294/ypz65j
Published in The Insight Journal - 2008 July - December.
Submitted by Nicholas J. Tustison on 2008-11-15 08:00:47.

Graph-based algorithms have enjoyed renewed interest for solving computer vision problems. These algorithms have been the subject of intense interest and research. In order to maintain the ITK library au courant, we developed a framework for graph-based methods of energy minimization in ITK which employ energy functions derived within a Markov Random Field (MRF) context. This required not only the implementation of the energy minimization methodology but also the more general requirement of introducing graph-related data structures into ITK which can be used for other graph-based algorithms pertinent to future extensions of the ITK library. Please note that some of the algorithms described in this paper may be covered by patents and, as such, it is incumbent upon the user to seek licenses before building the binaries which utilize this code. Also note that “research use” is not exempt from acquiring such licenses. The only exemption from patent restrictions is “. . . amusement, to satisfy idle curiosity, or for strictly philosophical inquiry.”