
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Dorit S. Hochbaum, "Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 5, pp. 889898, May, 2010.  
BibTex  x  
@article{ 10.1109/TPAMI.2009.80, author = {Dorit S. Hochbaum}, title = {Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {32}, number = {5}, issn = {01628828}, year = {2010}, pages = {889898}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2009.80}, 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  Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut IS  5 SN  01628828 SP889 EP898 EPD  889898 A1  Dorit S. Hochbaum, PY  2010 KW  Grouping KW  image segmentation KW  graph theoretic methods KW  partitioning. VL  32 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] R.K. Ahuja, J.B. Orlin, C. Stein, and R.E. Tarjan, "Improved Algorithms for Bipartite Network Flow," SIAM J. Computing, vol. 23, no. 5, pp. 906933, 1994.
[2] A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.
[3] Y. Boykov and M.P. Jolly, "Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in ND Images," Proc. Int'l Conf. Computer Vision, vol. I, pp. 105112, 2001.
[4] B. Chandran and D.S. Hochbaum, "A Computational Study of the Pseudoflow and PushRelabel Algorithms for the Maximum Flow Problem," Operations Research, vol. 57, pp. 358376, Mar. 2009.
[5] J. Cheeger, "A Lower Bound for the Smallest Eigenvalue of the Laplacian," Problems in Analysis, R.C. Gunning, ed., pp. 195199, Princeton Univ. Press, 1970.
[6] F.R.K. Chung, Spectral Graph Theory. Am. Math. Soc., 1997.
[7] I.J. Cox and S.B. Rao, Y. Zhong, "'Ratio Regions': A Technique for Image Segmentation," Proc. Int'l Conf. Pattern Recognition, vol. 2, pp. 557564, Aug. 1996.
[8] W.H. Cunningham, "Optimal Attack and Reinforcement of a Network," J. ACM, vol. 32, pp. 549561, 1985.
[9] G. Gallo, M.D. Grigoriadis, and R.E. Tarjan, "A Fast Parametric Maximum Flow Algorithm and Applications," SIAM J. Computing, vol. 18, no. 1, pp. 3055, 1989.
[10] A.V. Goldberg, "Finding a Maximum Density Subgraph," Technical Report UCB/CSD/84/171, Univ. of California, Berkeley, 1984.
[11] A.V. Goldberg and R.E. Tarjan, "A New Approach to the Maximum Flow Problem," J. ACM, vol. 35, pp. 921940, 1988.
[12] O. Goldschmidt and D.S. Hochbaum, "A Polynomial Algorithm for the KCut Problem," Math. Operations Research, vol. 19, no. 1, pp. 2437, 1994.
[13] L. Grady and E. Schwartz, "Isoperimetric Graph Partitioning for Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 3, pp. 469475, Mar. 2006.
[14] K.M. Hall, "An RDimensional Quadratic Placement Algorithm," Management Science, vol. 17, no. 3, pp. 219229, 1970.
[15] J. Hao and J.B. Orlin, "A Faster Algorithm for Finding the Minimum Cut in a Directed Graph," J. Algorithms, vol. 17, no. 3, pp. 424446, 1994.
[16] D.S. Hochbaum, "The Pseudoflow Algorithm: A New Algorithm for the Maximum Flow Problem," Operations Research, vol. 58, no. 4, pp. 9921009, July/Aug. 2008, extended abstract in "The Pseudoflow Algorithm and the PseudoflowBased Simplex for the Maximum Flow Problem," Proc. Int'l Conf. Integer Programming and Combinatorial Optimization, pp. 325337, June 1998.
[17] D.S. Hochbaum, "An Efficient Algorithm for Image Segmentation, Markov Random Fields and Related Problems," J. ACM, vol. 48, no. 4, pp. 686701, 2001.
[18] D.S. Hochbaum, "Solving Integer Programs over Monotone Inequalities in Three Variables: A Framework for Half Integrality and Good Approximations," European J. Operational Research, vol. 140, no. 2, pp. 291321, 2002.
[19] D.S. Hochbaum, "Dynamic Evolution of Economically Preferred Facilities," European J. Operational Research, vol. 193, pp. 649659, 2009.
[20] D.S. Hochbaum, "Replacing Spectral Techniques for the Normalized Cut Problem by Polynomial Time Algorithms," manuscript Univ. of California, Berkeley, June 2008.
[21] P. Kohli and P.H.S. Torr, "Dynamic Graph Cuts for Efficient Inference in Markov Random Fields," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 12, pp. 20792088, Dec. 2007.
[22] V. Kolmogorov, Y. Boykov, and C. Rother, "Applications of Parametric Maxflow in Computer Vision," Proc. IEEE Int'l Conf. Computer Vision, pp. 18, 2007.
[23] N. Komodakis, G. Tziritas, and N. Paragios, "Fast, Approximately Optimal Solutions for Single and Dynamic MRFs," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 18, 2007.
[24] S. Sarkar and K.L. Boyer, "Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 478483, 1996.
[25] J. Shi and J. Malik, "Normalized Cuts and Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888905, Aug. 2000.
[26] MATLAB Normalized Cuts Segmentation Code, http://www. cis.upenn.edu/jshisoftware/, 2008.
[27] E. Sharon, M. Galun, D. Sharon, R. Basri, and A. Brandt, "Hierarchy and Adaptivity in Segmenting Visual Scenes," Nature, vol. 442, pp. 810813, Aug. 2006.
[28] D.A. Tolliver and G.L. Miller, "Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 10531060, 2006.
[29] S. Wang and J.M. Siskind, "Image Segmentation with Ratio Cut," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 6, pp. 675690, June 2003.