An efficient and effective tool for image segmentation, total variations and regularization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6667 LNCS, Issue , 2012, Pages 338-349

  Hochbaum, Dorit S ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL OPTIMIZATION; COMPUTATION TIME; CONTINUOUS MODELS; DISCRETE SETS; DYNAMIC FEATURES; EFFECTIVE TOOL; INPUT PARAMETER; LOCAL MINIMUMS; MARKOV RANDOM FIELDS MODELS; MEDICAL AND BIOLOGICAL IMAGING; OPTIMAL SOLUTIONS; OPTIMIZATION CRITERIA; PDE METHOD; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME; THEORETICAL RESULT; TOTAL VARIATION;

ALGORITHMS; COMPUTER VISION; HEURISTIC METHODS; MEDICAL IMAGING; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

IMAGE SEGMENTATION;

EID: 84855691417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24785-9_29     Document Type: Conference Paper

References (28)

1. Ahuja, R.K., Hochbaum, D.S., Orlin, J.B.: A cut-based algorithm for the convex dual of the minimum cost network flow problem. Algorithmica 39(3), 189-208 (2004)
2. Ahuja, R.K., Hochbaum, D.S., Orlin, J.B.: Solving the convex cost integer dual network flow problem. Management Science 7, 950-964 (2003)
3. Blake, A., Zisserman, A.: Visual reconstruction. MIT Press, Cambridge (1987)
4. Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In: International Conference on Computer Vision (ICCV), vol. I, pp. 105-112 (2001)
5. Boykov, Y., Veksle, O., Zabih, R.: Markov random fields with efficient approximations. In: Proc IEEE Conference CVPR, Santa Barbara, CA, pp. 648-655 (1998)
6. Boykov, Y., Veksle, O., Zabih, R.: Fast approximate energy minimization via graph cuts. In: Proc 7th IEEE International Conference on Computer Vision, pp. 377-384 (1999)
7. Chan, T.F., Esedoglu, S.: Aspects of total variation regularized l1 function approximation. SIAM J. on Applied Math. 65(5), 1817-1837 (2005)
8. Chandran, B.G., Hochbaum, D.S.: Pseudoflow solver (accessed, January 2007), http://riot.ieor.berkeley.edu/riot/Applications/Pseudoflow/maxflow.html
9. Collins, D.L., Zijdenbos, A.P., Kollokian, V., Sled, J.G., Kabani, N.J., Holmes, C.J., Evans, A.C.: Design and construction of a realistic digital brain phantom. IEEE Transactions on Medical Imaging 17(3), 463-468 (1998)
10. Cox, I.J., Rao, S.B., Zhong, Y.: Ratio regions: A technique for image segmentation. In: Proc. Int. Conf. on Pattern Recognition. B, pp. 557-564 (1996)
11. Geiger, D., Girosi, F.: Parallel and deterministic algorithms for MRFs: surface reconstruction. IEEE Transactions on Pattern Analysis and Machine Interlligence 13, 401-412 (1991)
12. Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions and the bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 6, 721-741 (1984)
13. 2/m) time, UC Berkeley (manuscript) (submitted, 2007)
14. Hochbaum, D.S.: The Pseudoflow algorithm: A new algorithm for the maximum flow problem. Operations Research 4, 992-1009 (2008)
15. Hochbaum, D.S.: An efficient algorithm for image segmentation, Markov random fields and related problems. Journal of the ACM 4, 686-701 (2001)
16. Ishikawa, H., Geiger, D.: Segmentation by grouping junctions. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 1998, pp. 125-131 (1998)
17. Li, S.Z., Chan, K.L., Wang, H.: Bayesian image restoration and segmentation by constrained optimization. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1996 (1996)
18. Malik, J., Belongie, S., Leung, T., Shi, J.: Contour and texture analysis for image segmentation. Int. J. Comp. Vision 43, 7-27 (2001)
19. Osher, S.J., Fedkiw, R.: Level Set Methods and Dynamic Implicit Surfaces. Springer, New York (2003)
20. Pham, D.L., Xu, C., Prince, J.L.: A survey of current methods in medical image segmentation. Annual Review of Biomedical Engineering 2, 315-337 (2000)
21. Pock, T., Chambolle, A., Cremers, D., Bischof, H.: A convex relaxation approach for computing minimal partitions. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2009, pp. 810-817 (2009)
22. Pretorius, P.H., King, M.A., Tsui, B.M.W., LaCroix, K.J., Xia, W.: A mathematical model of motion of the heart for use in generating source and attenuation maps for simulating emission imaging. Med. Phys. 26, 2323-2332 (1999)
23. Rudin, L.I., Osher, S.J., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60, 259-268 (1992)
24. Sarkar, S., Boyer, K.L.: Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, p. 478 (1996)
25. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888-905 (2000)
26. Sharon, E., Galun, M., Sharon, D., Basri, R., Brandt, A.: Hierarchy and adaptivity in segmenting visual scenes. Nature 442, 810-813 (2006)
27. Wang, S., Siskind, J.M.: Image segmentation with ratio cut. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 25(6), 675-690 (2003)
28. Tolliver, D.A., Miller, G.L.: Graph partitioning by spectral rounding: Applications in image segmentation and clustering. In: CVPR 2006, pp. 1053-1060 (2006)