New algorithms for convex cost tension problem with application to computer vision
Authors:
- Vladimir KolmogorovVKVladimir Kolmogorov
- Akiyoshi ShiouraASAkiyoshi Shioura
- 1 November 2009
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 6 (4) , 378-393
Abstract
No abstract availableKeywords
Funding Information
- Engineering and Physical Sciences Research Council
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 19 references indexed in Scilit:
- Seamless image stitching by minimizing false edgesIEEE Transactions on Image Processing, 2006
- A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow ProblemAlgorithmica, 2004
- On Steepest Descent Algorithms for Discrete Convex FunctionsSIAM Journal on Optimization, 2004
- Exact optimization for markov random fields with convex priorsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- Solving the Convex Cost Integer Dual Network Flow ProblemManagement Science, 2003
- Fast approximate energy minimization via graph cutsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- An efficient algorithm for image segmentation, Markov random fields and related problemsJournal of the ACM, 2001
- Network flow optimization for restoration of imagesJournal of Applied Mathematics, 2000
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with ApplicationsSIAM Journal on Computing, 1997
- A primal‐dual algorithm for the capacitated Hitchcock problemNaval Research Logistics Quarterly, 1957