
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Arvind Bhusnurmath, Camillo J. Taylor, "Graph Cuts via $\ell_1$ Norm Minimization," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 10, pp. 18661871, October, 2008.  
BibTex  x  
@article{ 10.1109/TPAMI.2008.82, author = {Arvind Bhusnurmath and Camillo J. Taylor}, title = {Graph Cuts via $\ell_1$ Norm Minimization}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {30}, number = {10}, issn = {01628828}, year = {2008}, pages = {18661871}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2008.82}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Graph Cuts via $\ell_1$ Norm Minimization IS  10 SN  01628828 SP1866 EP1871 EPD  18661871 A1  Arvind Bhusnurmath, A1  Camillo J. Taylor, PY  2008 KW  Continuous optimization KW  Graphtheoretic methods VL  30 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] N. Biggs, Algebraic Graph Theory, second ed. Cambridge Math. Library, 1993.
[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. 917924, 2003.
[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. 917924, 2003.
[3] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
[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. 12221239, Nov. 2001.
[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. 12221239, Nov. 2001.
[5] Y. Boykov and V. Kolmogorov, “An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 11241137, Sept. 2004.
[5] Y. Boykov and V. Kolmogorov, “An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 11241137, Sept. 2004.
[6] Y. Boykov and M. Jolly, “Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in ND Images,” Proc. Eighth Int'l Conf. Computer Vision, pp. 105112, 2001.
[6] Y. Boykov and M. Jolly, “Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in ND Images,” Proc. Eighth Int'l Conf. Computer Vision, pp. 105112, 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.220252, 1985.
[7] P. Concus, G. Golub, and G. Meurant, “Block Preconditioning for the Conjugate Gradient Method,” SIAM J. Scientific Computing, vol. 6, no. 1, pp.220252, 1985.
[8] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2002.
[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, “GPUCuts: 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.
[9] N. Dixit, R. Keriven, and N. Paragios, “GPUCuts: 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.
[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. 17681783, Nov. 2006.
[11] L. Grady, “Random Walks for Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 17681783, 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 ComputerAssisted Intervention, pp. 773780, 2005.
[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 ComputerAssisted Intervention, pp. 773780, 2005.
[13] K. Koh, S. Kim, and S. Boyd, “An InteriorPoint Method for LargeScale l1 Regularized Logistic Regression,” J. Machine Learning Research, vol. 8, pp.15191555, July 2007.
[13] K. Koh, S. Kim, and S. Boyd, “An InteriorPoint Method for LargeScale l1 Regularized Logistic Regression,” J. Machine Learning Research, vol. 8, pp.15191555, 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. 147159, Feb. 2004.
[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. 147159, 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. 908916, 2003.
[15] J. Kruger and R. Westermann, “Linear Algebra Operators for GPU Implementation of Numerical Algorithms,” Proc. ACM SIGGRAPH '03, ACM Trans. Graphics, pp. 908916, 2003.
[16] C. Papadimitriou and K. Steiglitz, Combinatorial Optimization—Algorithms and Complexity. Prentice Hall, 1982.
[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.
[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. 309314, 2004.
[18] C. Rother, V. Kolmogorov, and A. Blake, “Grabcut—Interactive Foreground Extraction Using Iterated Graph Cuts,” Proc. ACM SIGGRAPH '04, ACM Trans. Graphics, pp. 309314, 2004.
[19] S. Sinha and M. Pollefeys, “MultiView Reconstruction Using PhotoConsistency and Exact Silhouette Constraints: A Maximum Flow Formulation,” Proc. 10th Int'l Conf. Computer Vision, pp. 349356, 2005.
[19] S. Sinha and M. Pollefeys, “MultiView Reconstruction Using PhotoConsistency and Exact Silhouette Constraints: A Maximum Flow Formulation,” Proc. 10th Int'l Conf. Computer Vision, pp. 349356, 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. 18, 2007.
[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. 18, 2007.