Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Co-clustering of image segments using convex optimization applied to EM neuronal reconstruction
62
Zitationen
2
Autoren
2010
Jahr
Abstract
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.
Ähnliche Arbeiten
Compressed sensing
2006 · 23.073 Zit.
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
1984 · 17.963 Zit.
Compressed sensing
2004 · 17.216 Zit.
Regularization Paths for Generalized Linear Models via Coordinate Descent
2010 · 16.943 Zit.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
2006 · 15.745 Zit.