Filters








102,344 Hits in 5.4 sec

Convex Optimization for Parallel Energy Minimization [article]

K. S. Sesh Kumar, Alvaro Barbero, Stefanie Jegelka, Francis Bach (LIENS,INRIA Paris - Rocquencourt)
2015 arXiv   pre-print
The resulting min-cut algorithm (and code) is conceptually very simple, and solves a sequence of TV denoising problems.  ...  On small problems the iterative convex methods match the combinatorial max-flow algorithms, while on larger problems they offer other flexibility and important gains: (a) their memory footprint is small  ...  The convex algorithms admit stochastic variants too [15] . However, the decompositions used in the experiments here (Figure 1 ) only use a decomposition into 2-4 functions.  ... 
arXiv:1503.01563v1 fatcat:ge6qk5hvefcfpmk6jjvhka2m7a

A Simple Deterministic Algorithm for Edge Connectivity [article]

Thatchaphol Saranurak
2020 arXiv   pre-print
We show a deterministic algorithm for computing edge connectivity of a simple graph with m edges in m^1+o(1) time.  ...  Although the fastest deterministic algorithm by Henzinger, Rao, and Wang [SODA'17] has a faster running time of O(mlog^2mloglog m), we believe that our algorithm is conceptually simpler.  ...  Also, thanks to Sayan Bhattacharya, Maximilian Probst Gutenberg, Jason Li, Danupon Nanongkai, and Di Wang for helpful comments on the write-up.  ... 
arXiv:2008.08575v1 fatcat:qvm6xks3rbhvvi4nmecjn77ioa

Video Carving [article]

Billy Chen, Pradeep Sen
2008 Eurographics State of the Art Reports  
The problem of finding these sheets is formulated as a min-cut problem, whose solution can be mapped to a sheet.We show results by creating short, viewable summaries of long video sequences.  ...  This leads to an algorithm whereby sheets are incrementally carved from the video cube to shorten the length of a video.  ...  Implementation To compute the min-cut algorithm on our graph, we use Boykov and Kolmogorov's maxflow code [BK04] .  ... 
doi:10.2312/egs.20081022 fatcat:r2uuau2x4ncbpesrkkpowfhhee

A simple min-cut algorithm

Mechthild Stoer, Frank Wagner
1997 Journal of the ACM  
It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known.  ...  We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect.  ...  The famous Max-Flow-Min-Cut-Theorem by Ford and Fulkerson [1956] showed the duality of the maximum flow and the so-called minimum s-t-cut.  ... 
doi:10.1145/263867.263872 fatcat:nficy3uazfabhovau3mpv73nbm

A simple min cut algorithm [chapter]

Mechthild Stoer, Frank Wagner
1994 Lecture Notes in Computer Science  
It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known.  ...  We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect.  ...  The famous Max-Flow-Min-Cut-Theorem by Ford and Fulkerson [1956] showed the duality of the maximum flow and the so-called minimum s-t-cut.  ... 
doi:10.1007/bfb0049404 fatcat:i2p3gw23ojedzi5c5x65c66duy

Fast Resource Allocation for Network-Coded Traffic - A Coded-Feedback Approach

C.-C. Wang, X. Lin
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
The existing primal solution in the literature requires a separate graph-theoretic algorithm to find the min-cut of each session, whose complexity grows quadratically with the total number of nodes.  ...  In this paper, we develop a fast resource allocation algorithm that takes advantage of intra-session network coding.  ...  Correctness & Complexity Proposition 1: Let P (success) denote the probability that the output of our new min-cut algorithm is a minimum cut separating s and d.  ... 
doi:10.1109/infcom.2009.5062235 dblp:conf/infocom/WangL09a fatcat:nxxemzz2xfhjjmozcpbqkj4naq

Video Shot Boundary Detection Algorithm [chapter]

Kyong-Cheol Ko, Young Min Cheon, Gye-Young Kim, Hyung –Il Choi, Seong-Yoon Shin, Yang-Won Rhee
2006 Lecture Notes in Computer Science  
We present a newly developed algorithm for automatically segmenting videos into basic shot units. A basic shot unit can be understood as an unbroken sequence of frames taken from one camera.  ...  The proposed algorithms are tested on the various video types and experimental results show that the proposed algorithm are effective and reliably detects shot boundaries.  ...  Both the real shot cut and the abrupt cut could cause a great change in frame difference because of the special situations such as flashlight events, sudden lightening variances, and fast camera motion  ... 
doi:10.1007/11949619_35 fatcat:xdbkigpu5zcivcygzrtmuj2dfe

A Fast Continuous Max-Flow Approach to Non-convex Multi-labeling Problems [chapter]

Egil Bae, Jing Yuan, Xue-Cheng Tai, Yuri Boykov
2014 Lecture Notes in Computer Science  
We will propose a continuous analogue of Ishikawa's graph construction [33] by formulating continuous max-flow and min-cut models over a specially designed domain.  ...  These max-flow and min-cut models are equivalent under a primal-dual perspective. They can be seen as exact convex relaxations of the original problem and can be used to compute global solutions.  ...  Recently, [5, 61] investigated the equivalent dual model of the convex relaxation formulation studied in [63, 44] and derived a simple and fast algorithm in the entropy maximization style.  ... 
doi:10.1007/978-3-642-54774-4_7 fatcat:7zu5m2byvfhbnieyrqdnrk7myi

Fast BTG-Forest-Based Hierarchical Sub-sentential Alignment [article]

Hao Wang, Yves Lepage
2017 arXiv   pre-print
Based on a fast unsupervised initialization of parameters using variational IBM models, we synchronously parse parallel sentences top-down and align hierarchically under the constraint of BTG.  ...  In this paper, we propose a novel BTG-forest-based alignment method.  ...  Li et al. (2012) present a simple beam search algorithm for searching the Viterbi BTG alignments.  ... 
arXiv:1711.07265v1 fatcat:wnao5ntu6vhs3b5uumsrsv4jpm

By-example synthesis of architectural textures

Sylvain Lefebvre, Samuel Hornus, Anass Lasram
2010 ACM Transactions on Graphics  
This simple transformation leads to visible seams around the cuts when using hardware filtering. In fact texels on each side of a cut are not contiguous in the source image.  ...  They deal with Dijkstra's algorithm (Section 2, page 1), the integration of a histogram computation into Dijkstra's algorithm's inner loop (Section 3, page 3) and the fast construction of the graph G (  ...  Fast construction of the graph G We examine the following task: Given a set of cuts C, compute F(c) = Front(Succ(C, c)) for each cut c ∈ C as fast as possible.  ... 
doi:10.1145/1778765.1778821 fatcat:xgil4dqyn5gutam5reefbtec5e

By-example synthesis of architectural textures

Sylvain Lefebvre, Samuel Hornus, Anass Lasram
2010 ACM Transactions on Graphics  
This simple transformation leads to visible seams around the cuts when using hardware filtering. In fact texels on each side of a cut are not contiguous in the source image.  ...  They deal with Dijkstra's algorithm (Section 2, page 1), the integration of a histogram computation into Dijkstra's algorithm's inner loop (Section 3, page 3) and the fast construction of the graph G (  ...  Fast construction of the graph G We examine the following task: Given a set of cuts C, compute F(c) = Front(Succ(C, c)) for each cut c ∈ C as fast as possible.  ... 
doi:10.1145/1833351.1778821 fatcat:7vgvfp3t45e5dcsrzxr4ajfb6q

By-example synthesis of architectural textures

Sylvain Lefebvre, Samuel Hornus, Anass Lasram
2010 ACM SIGGRAPH 2010 papers on - SIGGRAPH '10  
This simple transformation leads to visible seams around the cuts when using hardware filtering. In fact texels on each side of a cut are not contiguous in the source image.  ...  They deal with Dijkstra's algorithm (Section 2, page 1), the integration of a histogram computation into Dijkstra's algorithm's inner loop (Section 3, page 3) and the fast construction of the graph G (  ...  Fast construction of the graph G We examine the following task: Given a set of cuts C, compute F(c) = Front(Succ(C, c)) for each cut c ∈ C as fast as possible.  ... 
doi:10.1145/1833349.1778821 fatcat:h5s456pmercw5f7meoecthdl6y

Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set [chapter]

Petr Kolman, Tomasz Waleń
2007 Lecture Notes in Computer Science  
Crucial ingredients of our algorithm are the suffix tree data structure and a linear time algorithm for a special case of a disjoint set union problem.  ...  ratio, and by a factor of Θ(k) in the running time.  ...  Conclusion We presented Θ(k)-approximation algorithms for signed and unsigned k-MCSP and k-SBR, running in time O(n).  ... 
doi:10.1007/11970125_22 fatcat:jz5y7aw4jjhzbnqq5z6np7nyny

Simple and Scalable Constrained Clustering: a Generalized Spectral Method

Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng
2016 International Conference on Artificial Intelligence and Statistics  
In practice this translates to a very fast implementation that consistently outperforms existing spectral approaches both in speed and quality.  ...  We present a simple spectral approach to the well-studied constrained clustering problem.  ...  It is easy to verify that vol(S)vol( S)/vol(V ) = cut K (S, S). We have min S⊆V cut G D (S, S) vol(S)vol( S)/vol(V ) = min S⊆V cut G D (S, S) cut K (S, S) .  ... 
dblp:conf/aistats/CucuringuKCMP16 fatcat:6r65ueestzchrpkecmbg25ejjm

CT Image Segmentation based on Clustering and Graph-Cuts

Chen Yu-ke, Wu Xiao-ming, Cai Ken, Ou Shan-xin
2011 Procedia Engineering  
, finally minimizes the energy function by the method of max-flow/min-cut theorem and picks up region of interest.  ...  In order to complete the auto-segmentation of cardiac dual-source CT image and extract the structure of heart accurately, this paper proposes a hybrid segmentation method based on k clustering and Graph-Cuts  ...  Using the min-cut algorithm to segment the DSCT image can get a good result; the calculation is simple, and also it is fast and has a good robust.  ... 
doi:10.1016/j.proeng.2011.08.960 fatcat:75ojtlgvtjcm7e5dod55shup4e
« Previous Showing results 1 — 15 out of 102,344 results