Graph Cut and Image Segmentation using Mean Cut by Means of an Agglomerative Algorithm

Elaine Ayumi Chiba, Marco Antonio Garcia Carvalho, André Luís Costa

2014

Abstract

Graph partitioning, or graph cut, has been studied by several authors as a tool for image segmentation. It refers to partitioning a graph into several subgraphs such that each of them represents a meaningful object of interest in the image. In this work we propose a hierarchical agglomerative clustering algorithm driven by the cut and mean cut criteria. Some preliminary experiments were performed using the benchmark of Berkeley BSDS500 with promising results.

References

  1. Arbeláez, P., Maire, M., Fowlkes, C., and Malik, J. (2011). Contour detection and hierarchical image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(5):898-916.
  2. Costa, A. L. (2013). Normalized cut on graphs : an aglomerative algorithm for bacterial colonies image segmentation (in portuguese). Master's thesis, mentation (in portuguese). Masters thesis, School of Technology - FT, University of Campinas - UNICAMP, Brazil.
  3. Cvetkovic, D., Rowlinson, P., and Simic, S. (2010). An Introduction to the Theory of Graph Spectra. Cambridge University Press, UK.
  4. Gonzalez, R. and Woods, R. (2010). Digital Image Processing. Addison-Wesley, 3nd edition.
  5. Gower, J. C. and Ross, G. J. S. (1969). Minimum spanning trees and single linkage cluster analysis. Journal of the Royal Statistical Society. Series C (Applied Statistics), 18(1):54-64.
  6. Peng, B., Zhang, L., and Zhang, D. (2013). A survey of graph theoretical approaches to image segmentation. Pattern Recognition, 46(3):1020-1038.
  7. Shi, J. and Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1:888-905.
  8. Sibson, R. (1973). Slink: An optimally efficient algorithm for the single-link cluster method. The Computer Journal, 16(1).
  9. Wang, S. and Siskind, J. (2001). Image segmentation with minimum mean cut. Proceedings of the Eighth International Conference on Computer Vision, 1:517 - 524.
  10. Wilson, R. J. and Watkins, J. J. (1990). Graphs, an introductory approach. John Wiley & Sons.
  11. Wu, Z. and Leahy, R. (1993). An optimal graph theoretic approach to data clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(11):1101-1113.
Download


Paper Citation


in Harvard Style

Chiba E., Carvalho M. and Costa A. (2014). Graph Cut and Image Segmentation using Mean Cut by Means of an Agglomerative Algorithm . In Proceedings of the 9th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2014) ISBN 978-989-758-003-1, pages 708-712. DOI: 10.5220/0004858207080712


in Bibtex Style

@conference{visapp14,
author={Elaine Ayumi Chiba and Marco Antonio Garcia Carvalho and André Luís Costa},
title={Graph Cut and Image Segmentation using Mean Cut by Means of an Agglomerative Algorithm},
booktitle={Proceedings of the 9th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2014)},
year={2014},
pages={708-712},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004858207080712},
isbn={978-989-758-003-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2014)
TI - Graph Cut and Image Segmentation using Mean Cut by Means of an Agglomerative Algorithm
SN - 978-989-758-003-1
AU - Chiba E.
AU - Carvalho M.
AU - Costa A.
PY - 2014
SP - 708
EP - 712
DO - 10.5220/0004858207080712