Graph cuts via ℓ1 norm minimization

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 30, Issue 10, 2008, Pages 1866-1871

  Bhusnurmath, Arvind ^a   Taylor, Camillo J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Computer vision; Convex optimization; Graph theoretic methods; Linear programming

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; IMAGE PROCESSING; IMAGE SEGMENTATION;

CONVEX OPTIMIZATION; ENERGY MINIMIZATIONS; GRAPH CUTS; GRAPH-THEORETIC METHODS; LINEAR PROGRAMMING;

GRAPH THEORY;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; IMAGE ENHANCEMENT; METHODOLOGY; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; PATTERN RECOGNITION, AUTOMATED;

EID: 50249175825     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2008.82     Document Type: Article

References (20)

1. N. Biggs, Algebraic Graph Theory, second ed. Cambridge Math. Library, 1993.
2. J. Bolz, I. Farmer, E. Grinspun, and P. Schroder, "Sparse Matrix Solvers on the GPU: Conjugate Gradients and Multigrid," Proc. ACM SIGGRAPH'03, ACM Trans. Graphics, pp. 917-924, 2003.
3. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
4. Y. Boykov, O. Veksler, and R. Zabih, "Fast Approximate Energy Minimization via Graph Cuts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
5. Y. Boykov and V. Kolmogorov, "An Experimental Comparison of Min-Cut/ MAx-Flow Algorithms for Energy Minimization in Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9. pp. 1124-1137. Sept. 2004.
6. Y. Boykov and M. Jolly, "Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images," Proc. Eighth Int'l Conf. Computer Vision, pp. 105-112, 2001.
7. P. Concus, G. Golub, and G. Meurant, "Block Preconditioning for the Conjugate Gradient Method," SIAM J. Scientific Computing, vol. 6, no. 1, pp. 220-252, 1985.
8. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2002.
9. N. Dixit, R. Keriven, and N. Paragios, "GPU-Cuts: Combinatorial Optimisation, Graphic Processing Units and Adaptive Object Extraction," Laboratoire Centre Enseignement Recherche Traitement Information Systèmes (CERTIS), Ecole Nationale des Ponts et Chaussees (ENPC), Mar. 2005.
10. G. Golub and C. Van Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1998.
11. L. Grady, "Random Walks for image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1768-1783, Nov. 2006.
12. L. Grady, T. Schiwetz, S. Aharon, and R. Westermann, "Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation," Proc. Int'l Conf. Medical Image Computing and Computer-Assisted Intervention, pp. 773-780, 2005.
13. K. Koh, S. Kim, and S. Boyd, "An Interior-Point Method for Large-Scale 11 Regularized Logistic Regression," J. Machine Learning Research vol. 8, pp. 1519-1555, July 2007.
14. V. Kolmogorov and R. Zabih, "What Energy Functions Can Be Minimized via Graph Cuts," IEEE Trans. Pattern Analysis and Machine Intelligence vol. 26, no. 2, pp. 147-159, Feb. 2004.
15. J. Kruger and R. Westermann, "Linear Algebra Operators for GPU Implementation of Numerical Algorithms," Proc. ACM SIGGRAPH '03, ACM Trans. Graphics, pp. 908-916, 2003.
16. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization - Algorithms and Complexity. Prentice Hall, 1982.
17. M. Resende and P. Pardalos, Advances in Linear and Integer Programming, Oxford Lecture Series in Math and Its Applications, 1996.
18. C. Rother, V. Kolmogorov, and A. Blake, "Grabcut - Interactive Foreground Extraction Using Iterated Graph Cuts," Proc. ACM SIGGRAPH'04, ACM Trans. Graphics, pp. 309-314, 2004.
19. S. Sinha and M. Pollefeys, "Multi-View Reconstruction Using Photo-Consistency and Exact Silhouette Constraints: A Maximum Flow Formulation," Proc. 10th Int'l Conf. Computer Vision, pp. 349-356, 2005.
20. A.K. Sinop and L. Grady, "A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker which Yields a New Algorithm," Proc. 11th Int'l Conf. Computer Vision, pp. 1-8, 2007.