<html><head><meta http-equiv="Content-Type" content="text/html charset=iso-8859-1"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><div>Hi Elena,</div><div><br></div><div>I haven't looked at that code for a long time. As soon as we found out</div><div>it was patented, we kind of lost interest in its further development and</div><div>went a different direction for our segmentation needs. I don't have </div><div>any of those example files any more and I don't know why they aren't</div><div>in the source code (or if they ever were in the first place). </div><div><br></div><div>Although the test code itkBoykovGraphCutFilterTest.cxx, does </div><div>interface with the alpha expansion filter, the latter requires the use of</div><div>the Boykov graph min cut filter to work for each binary segmentation</div><div>step. You have the basic idea regarding the main steps. I would </div><div>encourage you to look at the code for further details. </div><div><br></div><div>Nick</div><div><br></div><br><div><div>On Feb 4, 2013, at 8:32 AM, Elena Ranguelova <<a href="mailto:elboyran@gmail.com">elboyran@gmail.com</a>> wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite">Hello,<br><br>I'm new to ITK and graph cuts, but currently very interested in both. Hence, I came across to Nick Tustison's graph cuts extension of ITK and I found he is an active member of this mailing list.<br><br>
<a href="http://www.insight-journal.org/browse/publication/306">http://www.insight-journal.org/browse/publication/306</a><br><br>The paper presented claims that there are 2 codes for testing:<br>itkGraphTest.cxx<br>itkBoykovAlphaExpansionFilterTest.cxx<br>
and 1 example:<br>BoykovGraphCutFilter,<br><br>but in reality the example doesn't exist, nor the AlphaExpansion test under that name. There is a testing source called<br>itkBoykovGraphCutFilterTest.cxx, but in fact it illustrates the Alpha Expansion filter, not the BoykovGraphCut filter.<br>
<br>I would really like to have an example of how to use the provided code for performing only Boykov Minimum graph cut filtering on an input image/volume + likelihood images, as shown on figure 7 of the paper. Also how the main steps are performed?:<br>
1. input image to graph conversion<br>2. the setup of the likelihood images as filter input<br>3. the actual minimal cut<br>4. obtaining image (segmentation) from the cut graph<br><br>Does anyone have such a code/example? Would the author (Tustison) be willing to provide such an example usage? (This remark is already mentioned in the first review by David Doria).<br>
<br>Kind regards,<br>Elena<br><br>
_____________________________________<br>Powered by <a href="http://www.kitware.com">www.kitware.com</a><br><br>Visit other Kitware open-source projects at<br><a href="http://www.kitware.com/opensource/opensource.html">http://www.kitware.com/opensource/opensource.html</a><br><br>Kitware offers ITK Training Courses, for more information visit:<br>http://www.kitware.com/products/protraining.php<br><br>Please keep messages on-topic and check the ITK FAQ at:<br>http://www.itk.org/Wiki/ITK_FAQ<br><br>Follow this link to subscribe/unsubscribe:<br>http://www.itk.org/mailman/listinfo/insight-users<br></blockquote></div><br></body></html>