Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction

This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structures in over-segmented electron microscopy images. We formulate the problem of co-clustering as a quadratic semi-assignment problem and investigate convex relaxations using semidefinite and linear programming. We further introduce a linear programming method with manageable number of constraints and present an approach for learning the cost function. Our method increases computational efficiency by orders of magnitude while maintaining accuracy, automatically finds the optimal number of clusters, and empirically tends to produce binary assignment solutions. We illustrate our approach in simulations and in experiments with real EM data.

• Type: Conference
• Year: 2010
• Where: CVPR
• Authors: Shiv Vitaladevuni, Ronen Basri
• Keywords: Computer Vision, CVPR 2010, Linear Programming, Linear Programming Method, Quadratic Semi-assignment Problem