Abstract
Spectral graph clustering is among the most popular algorithms for unsupervised segmentation. Applications include problems such as speech separation, segmenting motions or objects in video sequences and community detection in social media. It is based on the computation of a few eigenvectors of a matrix defining the connections between the graph nodes.
In many real world applications, not all edge weights can be defined. In video sequences, for instance, not all 3d-points of the observed objects are visible in all the images. Relations between graph nodes representing the 3d-points cannot be defined if these never co-occur in the same images. It is common practice to simply assign an affinity of zero to such edges.
In this article, we present a formal proof that this procedure decreases the separation between two clusters. An upper bound is derived on the second smallest eigenvalue of the Laplacian matrix. Furthermore, an algorithm to infer missing edges is proposed and results on synthetic and real image data are presented.
This is a preview of subscription content, log in via an institution to check access.
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
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE TPAMI 22, 888–905 (2000)
Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing 17, 395–416 (2007)
Maila, M., Shi, J.: A random walks view of spectral segmentation. In: AISTATS 2001 (2001)
Zhou, D., Huang, J., Schölkopf, B.: Learning with hypergraphs: Clustering, classification, and embedding. In: Advances in Neural Information Processing Systems (NIPS), pp. 1601–1608 (2006)
Agarwal, S., Branson, K., Belongie, S.: Higher order learning with graphs. In: ICML 2006, pp. 17–24. ACM, New York (2006)
Ochs, P., Brox, T.: Higher order motion models and spectral clustering. In: CVPR, pp. 614–621. IEEE Computer Society, Washington, DC (2012)
Purkait, P., Chin, T.-J., Ackermann, H., Suter, D.: Clustering with hypergraphs: The case for large hyperedges. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014, Part IV. LNCS, vol. 8692, pp. 672–687. Springer, Heidelberg (2014)
van Gennip, Y., Hunter, B., Ahn, R., Elliott, P., Luh, K., Halvorson, M., Reid, S., Valasik, M., Wo, J., Tita, G.E., Bertozzi, A.L., Brantingham, P.J.: Community detection using spectral clustering on sparse geosocial data. SIAM Journal of Applied Mathematics 73, 67–83 (2013)
Brox, T., Malik, J.: Object segmentation by long term analysis of point trajectories. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 282–295. Springer, Heidelberg (2010)
Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS, pp. 849–856 (2001)
Balakrishnan, S., Xu, M., Krishnamurthy, A., Singh, A.: Noise thresholds for spectral clustering. In: Advances in Neural Information Processing Systems (NIPS), pp. 954–962 (2011)
Chin, T.J., Yu, J., Suter, D.: Accelerated hypothesis generation for multistructure data via preference analysis. TPAMI 34, 625–638 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ackermann, H., Scheuermann, B., Chin, TJ., Rosenhahn, B. (2015). Randomly Walking Can Get You Lost: Graph Segmentation with Unknown Edge Weights. In: Tai, XC., Bae, E., Chan, T.F., Lysaker, M. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2015. Lecture Notes in Computer Science, vol 8932. Springer, Cham. https://doi.org/10.1007/978-3-319-14612-6_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-14612-6_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14611-9
Online ISBN: 978-3-319-14612-6
eBook Packages: Computer ScienceComputer Science (R0)