Skip to content

BIC-MNI/minc_gco

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 

Repository files navigation

MINC wrapper of graphcut algorithms

This programs are simple wrapper around Multi-label graph optimization library: http://vision.csd.uwo.ca/code/ It includes source code of gco-v3.0 , and therefore can be used only for research purposes.

To use this software, YOU MUST CITE the following in any resulting publication:

[1] Efficient Approximate Energy Minimization via Graph Cuts.
    Y. Boykov, O. Veksler, R.Zabih. IEEE TPAMI, 20(12):1222-1239, Nov 2001.

[2] What Energy Functions can be Minimized via Graph Cuts?
    V. Kolmogorov, R.Zabih. IEEE TPAMI, 26(2):147-159, Feb 2004. 

[3] An Experimental Comparison of Min-Cut/Max-Flow Algorithms for 
    Energy Minimization in Vision. Y. Boykov, V. Kolmogorov. 
    IEEE TPAMI, 26(9):1124-1137, Sep 2004.

[4] Fast Approximate Energy Minimization with Label Costs. 
    A. Delong, A. Osokin, H. N. Isack, Y. Boykov. In CVPR, June 2010. 

This software can be used only for research purposes. For commercial purposes, be aware that there is a US patent on the main algorithm itself:

    R. Zabih, Y. Boykov, O. Veksler,
    "System and method for fast approximate energy minimization via graph cuts",
    United Stated Patent 6,744,923, June 1, 2004

License & disclaimer.

Copyright 2007-2010 Olga Veksler  <olga@csd.uwo.ca>
                    Andrew Delong <andrew.delong@gmail.com>

This software and its modifications can be used and distributed for 
research purposes only. Publications resulting from use of this code
must cite publications according to the rules given above. Only
Olga Veksler has the right to redistribute this code, unless expressed
permission is given otherwise. Commercial use of this code, any of 
its parts, or its modifications is not permited. The copyright notices 
must not be removed in case of any modifications. This Licence 
commences on the date it is electronically or physically delivered 
to you and continues in effect unless you fail to comply with any of 
the terms of the License and fail to cure such breach within 30 days 
of becoming aware of the breach, in which case the Licence automatically 
terminates. This Licence is governed by the laws of Canada and all 
disputes arising from or relating to this Licence must be brought 
in Toronto, Ontario.


THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

About

minc wrapper around graph-cut algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published