
13
Scalable Subspace Clustering with Application
to Motion Segmentation
Liangjing Ding
Florida State University
Adrian Barbu
Florida State University
CONTENTS
13.1 Intro ductio n . . . . . . . . .. . . . . . .. .. . . . . . .. . . .. . . . .. . . .. . . . .. .. . . . .. .. . 267
13.2 Subspace Clustering by Spectr al Clustering . . . .. . . . .. . . .. . . . . . .. 269
13.3 Scalable Subspace Clustering by Swendsen–Wang Cuts . . . .. . . .. 270
13.3.1 Posterior probability .. . . .. . . . .. .. .. . .. . . .. . . . .. . . .. . . . . . . 271
13.3.2 Overview of the Swendsen–Wang Cuts algorithm .. . . .. 271
13.3.3 Graph construction . . . .. . . .. . . . .