Advertisement

An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization

  • Dorit S. Hochbaum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6667)

Abstract

One of the classical optimization models for image segmentation is the well known Markov Random Fields (MRF) model. MRF formulates many total variation and other optimization criteria used in image segmentation. In spite of the presence of MRF in the literature, the dominant perception has been that the model is not effective for image segmentation. We show here that the reason for the non-effectiveness is not due to the power of the model. Rather it is due to the lack of access to the optimal solution. Instead of solving optimally, heuristics have been engaged. Those heuristic methods cannot guarantee the quality of the solution nor the running time of the algorithm.

We describe here an implementation of a very efficient polynomial time algorithm, which is provably fastest possible, delivering the optimal solution to the MRF problem, Hochbaum (2001). It is demonstrated here that many continuous models, common in image segmentation, have a discrete analogs to various special cases of MRF. As such they are solved optimally and efficiently, rather than with the use of continuous techniques such as PDE methods that can only guarantee convergence to a local minimum.

The MRF algorithm is enhanced here demonstrating that the set of labels can be any discrete set. Other enhancements include dynamic features that permit adjustments to the input parameters and solves optimally for these changes with minimal computation time. Modifications in the set of labels (colors), for instance, are executed instantaneously. Several theoretical results on the properties of the algorithm are proved here and are demonstrated for examples in the context of medical and biological imaging.

Keywords

Image Segmentation Markov Random Fields Color Assignment Grid Graph Total Variation Regularization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 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)CrossRefzbMATHGoogle Scholar
  3. 3.
    Blake, A., Zisserman, A.: Visual reconstruction. MIT Press, Cambridge (1987)Google Scholar
  4. 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)Google Scholar
  5. 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)Google Scholar
  6. 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)Google Scholar
  7. 7.
    Chan, T.F., Esedoglu, S.: Aspects of total variation regularized l1 function approximation. SIAM J. on Applied Math. 65(5), 1817–1837 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Chandran, B.G., Hochbaum, D.S.: Pseudoflow solver (accessed, January 2007), http://riot.ieor.berkeley.edu/riot/Applications/Pseudoflow/maxflow.html
  9. 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)CrossRefGoogle Scholar
  10. 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)Google Scholar
  11. 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)CrossRefGoogle Scholar
  12. 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)CrossRefzbMATHGoogle Scholar
  13. 13.
    Hochbaum D. S., Orlin J. B.: Pseudoflow algorithm in O(mnlogn 2/m) time, UC Berkeley (manuscript) (submitted, 2007)Google Scholar
  14. 14.
    Hochbaum, D.S.: The Pseudoflow algorithm: A new algorithm for the maximum flow problem. Operations Research 4, 992–1009 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Hochbaum, D.S.: An efficient algorithm for image segmentation, Markov random fields and related problems. Journal of the ACM 4, 686–701 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Ishikawa, H., Geiger, D.: Segmentation by grouping junctions. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 1998, pp. 125–131 (1998)Google Scholar
  17. 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)Google Scholar
  18. 18.
    Malik, J., Belongie, S., Leung, T., Shi, J.: Contour and texture analysis for image segmentation. Int. J. Comp. Vision 43, 7–27 (2001)CrossRefzbMATHGoogle Scholar
  19. 19.
    Osher, S.J., Fedkiw, R.: Level Set Methods and Dynamic Implicit Surfaces. Springer, New York (2003)CrossRefzbMATHGoogle Scholar
  20. 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)CrossRefGoogle Scholar
  21. 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)Google Scholar
  22. 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)CrossRefGoogle Scholar
  23. 23.
    Rudin, L.I., Osher, S.J., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60, 259–268 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  24. 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)Google Scholar
  25. 25.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)CrossRefGoogle Scholar
  26. 26.
    Sharon, E., Galun, M., Sharon, D., Basri, R., Brandt, A.: Hierarchy and adaptivity in segmenting visual scenes. Nature 442, 810–813 (2006)CrossRefGoogle Scholar
  27. 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)CrossRefGoogle Scholar
  28. 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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Dorit S. Hochbaum
    • 1
  1. 1.Department of Industrial Engineering and Operations ResearchUniversity of CaliforniaBerkeleyUSA

Personalised recommendations