Abstract
Graph-partition based algorithms are widely used for image segmentation. We propose an improved graph-partition segmentation method based on a key notion from complex network analysis: partition modularity. In particular, we show how optimizing the modularity measure can automatically determine the number of segments as well as their respective structure—greatly reducing the level of human intervention in the image segmentation process. We furthermore develop an efficient spectral approach that allows for a fast segmentation procedure. The proposed method is simple, efficient, and provides a practical tool for analyzing real-world images.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Forsyth, D., Ponce, J.: Computer Vision: A Modern Approach. Prentice-Hall (2003)
Shapiro, L.G., Stockman, G.C.: Computer Vision. Prentice-Hall (2001)
Grady, L.: Random walks for image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence 28(11), 1768–1783 (2006)
Shi, J.B., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Witkin, A.P.: Scale-space filtering. In: Proceedings of the 8th International Joint Conference on Artificial Intelligence, pp. 1019–1022 (1983)
Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence 15(11), 1101–1113 (1993)
Zahn, C.T.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Computer 20(1), 68–86 (1971)
Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Physical Review EÂ 69, 026113 (2004)
Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Physical Review EÂ 74 (2006)
Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)
Newman, M.: Networks: An Introduction. Oxford University Press (2010)
Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)
Agarwal, G., Kempe, D.: Modularity-maxmizing graph communities via mathematical programming. European Physical Journal BÂ 66 (2008)
Guimerá, R., Amaral, L.: Cartography of complex networks: modules and universal roles. Journal of Statistical Mechanics (2005)
Li, W.: Revealing network communities with a nonlinear programming method. Information Sciences 229, 18–28 (2013)
Newman, M.: Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103(23), 8577–8582 (2006)
Reiter, C.: Easy algorithms for finding eigenvalues. Mathematics Magazine 63(3), 173–178 (1990)
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)
Li, W., Schuurmans, D.: Modular community detection in networks. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 1366–1371 (2011)
Xu, L., Li, W., Schuurmans, D.: Fast normalized cut with linear constraints. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 2866–2873 (2009)
Malik, J., Belongie, S.J., Leung, T., Shi, J.B.: Contour and texture analysis for image segmentation. International Journal of Computer Vision 43(1), 7–27 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, W. (2013). Modularity Segmentation. In: Lee, M., Hirose, A., Hou, ZG., Kil, R.M. (eds) Neural Information Processing. ICONIP 2013. Lecture Notes in Computer Science, vol 8227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42042-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-42042-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-42041-2
Online ISBN: 978-3-642-42042-9
eBook Packages: Computer ScienceComputer Science (R0)