MAXFLOW
MAXFLOW - software for computing mincut/maxflow in a graph. This software library implements the maxflow algorithm described in ”An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.” Yuri Boykov and Vladimir Kolmogorov.
Keywords for this software
References in zbMATH (referenced in 131 articles , 1 standard article )
Showing results 1 to 20 of 131.
Sorted by year (citations)
- Burrows, Liam; Guo, Weihong; Chen, Ke; Torella, Francesco: Reproducible kernel Hilbert space based global and local image segmentation (2021)
- Gangloff, Hugo; Courbot, Jean-Baptiste; Monfrini, Emmanuel; Collet, Christophe: Unsupervised image segmentation with Gaussian pairwise Markov fields (2021)
- Kiefer, Lukas; Storath, Martin; Weinmann, Andreas: Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case (2021)
- Manousakis, Eleftherios; Repoussis, Panagiotis; Zachariadis, Emmanouil; Tarantilis, Christos: Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (2021)
- Pan, Hailong; Guan, Tao; Luo, Keyang; Luo, Yawei; Yu, Junqing: A visibility-based surface reconstruction method on the GPU (2021)
- Babczyński, Tomasz; Ptak, Roman: Line segmentation of handwritten text using histograms and tensor voting (2020)
- Hanafi, Saïd; Mansini, Renata; Zanotti, Roberto: The multi-visit team orienteering problem with precedence constraints (2020)
- Hintsch, Timo; Irnich, Stefan: Exact solution of the soft-clustered vehicle-routing problem (2020)
- Lermé, Nicolas; Le Hégarat-Mascle, Sylvie; Malgouyres, François; Lachaize, Marie: Multilayer joint segmentation using MRF and graph cuts (2020)
- Falcão, Alexandre; Bragantini, Jordão: The role of optimum connectivity in image segmentation: can the algorithm learn object information during the process? (2019)
- Průša, Daniel; Werner, Tomáš: Solving LP relaxations of some NP-hard problems is as hard as solving any linear program (2019)
- Ceselli, Alberto; Damiani, Maria Luisa; Righini, Giovanni; Valorsi, Diego: Mathematical programming algorithms for spatial cloaking (2018)
- Fan, Zhou; Guan, Leying: Approximate (\ell_0)-penalized estimation of piecewise-constant signals on graphs (2018)
- Hühnerbein, Ruben; Savarino, Fabrizio; Åström, Freddie; Schnörr, Christoph: Image labeling based on graphical models using Wasserstein messages and geometric assignment (2018)
- Angelelli, E.; Gendreau, M.; Mansini, R.; Vindigni, M.: The traveling purchaser problem with time-dependent quantities (2017)
- Bae, Egil; Merkurjev, Ekaterina: Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds (2017)
- Baxter, John S. H.; Rajchl, Martin; McLeod, A. Jonathan; Yuan, Jing; Peters, Terry M.: Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings (2017)
- Borradaile, Glencora; Klein, Philip N.; Mozes, Shay; Nussbaum, Yahav; Wulff-Nilsen, Christian: Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time (2017)
- Jegelka, Stefanie; Bilmes, Jeff A.: Graph cuts with interacting edge weights: examples, approximations, and algorithms (2017)
- Kchaou, Mourad; Al Ahmadi, Saleh: Robust (H_\infty) control for nonlinear uncertain switched descriptor systems with time delay and nonlinear input: a sliding mode approach (2017)