Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/108742
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAckermann, H.-
dc.contributor.authorScheuermann, B.-
dc.contributor.authorChin, T.-
dc.contributor.authorRosenhahn, B.-
dc.contributor.editorTai, X.-C.-
dc.contributor.editorBae, E.-
dc.contributor.editorChan, T.-
dc.contributor.editorLysaker, M.-
dc.date.issued2015-
dc.identifier.citationLecture Notes in Artificial Intelligence, 2015 / Tai, X.-C., Bae, E., Chan, T., Lysaker, M. (ed./s), vol.8932, pp.450-463-
dc.identifier.isbn9783319146119-
dc.identifier.issn0302-9743-
dc.identifier.issn1611-3349-
dc.identifier.urihttp://hdl.handle.net/2440/108742-
dc.description.abstractSpectral 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.-
dc.description.statementofresponsibilityHanno Ackermann, Björn Scheuermann, Tat-Jun Chin, and Bodo Rosenhahn-
dc.language.isoen-
dc.publisherSpringer-Verlag Berlin-
dc.relation.ispartofseriesLecture Notes in Computer Science, LNCS, vol 8932-
dc.rights© Springer International Publishing Switzerland 2015-
dc.titleRandomly walking can get you lost: Graph segmentation with unknown edge weights-
dc.typeConference paper-
dc.contributor.conference10th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR 2015) (13 Jan 2015 - 16 Jan 2015 : Hong Kong, China)-
dc.identifier.doi10.1007/978-3-319-14612-6_33-
pubs.publication-statusPublished-
Appears in Collections:Aurora harvest 3
Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_108742.pdf
  Restricted Access
Restricted Access4.92 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.