文件列表:

private (0, 2008-06-13)
sources (0, 2008-06-03)
sources\DNC_algorithms (0, 2008-06-13)
sources\DNC_algorithms\dnc_v2_globalvars.h (5290, 2008-06-04)
sources\DNC_algorithms\dnc_v2_TVPara.cpp (3576, 2008-06-13)
sources\DNC_algorithms\dnc_v2_TV_L2_core.h (1465, 2008-06-04)
sources\shared (0, 2008-06-04)
sources\shared\Common_DNC_MT.h (14625, 2008-06-13)
sources\shared\Common_DNC_MT_types.h (2444, 2008-06-02)
compile_display.m (264, 2008-06-04)
compile_no_display.m (277, 2008-06-04)
TV4_2_beta.m (546, 2008-06-04)
TV16_2_beta.m (2296, 2008-06-04)
Graph_cut.m (3530, 2008-06-13)

################################################################### # # # PGC - Preflow-Push based Graph-Cut C Code for MATLAB # # Version 2.32 # # http://www.caam.rice.edu/~optimization/L1/pgc # # # # Wotao Yin (wotao.yin@rice.edu) # # 2008 # # # ################################################################### 1. Introduction This is a C code with a MATLAB interface that uses Goldberg-Tarjan's Preflow-Push algorithm to solve the following binary graph-cut problem: Given a graph (N,A) where N is the set of nodes and A is the set of arcs, find the binary function u defined on N that minimize sum_{(i,j) in A} w_ij([u_i-u_j]+) + sum_{i in N} f_i(u_i) where w_ij>=0 is the capacity of arc (i,j), ([u_i-u_j]+) = 1 if and only if u_i=1 and u_j=0, and f_i is any function defined on {0,1}. 2. Comparison with MAXFLOW by Y. Boykov and V. Kolmogorov The underlying algorithm is significantly different from the one used in MAXFLOW by Y. Boykov and V. Kolmogorov (URL: http://www.cs.adastral.ucl.ac.uk/~vnk/software.html). This code (PGC) is generally faster than MAXFLOW on graphs in which max flows take longer paths. Such graphs include, but not limited to (i) the graphs for total variation in which a node is connected to more than 8 other nodes; (ii) 3D or high-dimensional graphs; (iii) the graphs in which terminal arcs (those connect from the source or to the sink) have larger capacities than non-terminal arcs. On other graphs, PGC is expected to be slower. 3. Compatibility Platforms: Unix, Windows, Mac C Compilers: GNU C++, Visual C++, and many others MATLAB: 6.5 or higher 4. Installation Step 1: setup your mex compiler: run "mex -setup" in MATLAB Step 2: compile the C code: run compile_display.m in MATLAB Step 3: test run: call "Graph-cut" without any input/output argument 5. Usage: see the comments in Graph_cut.m 6. Example: see the comments in Graph_cut.m 7. License & disclaimer. Copyright 2008 Wotao Yin (wotao.yin@gmail.com) This software can be used for non-commercial research purposes only. 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.

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：