English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Convolutional networks can learn to generate affinity graphs for image segmentation

MPS-Authors
/persons/resource/persons39222

Helmstaedter,  Moritz
Department of Biomedical Optics, Max Planck Institute for Medical Research, Max Planck Society;
Department of Cell Physiology, Max Planck Institute for Medical Research, Max Planck Society;

/persons/resource/persons118048

Briggman,  Kevin
Department of Biomedical Optics, Max Planck Institute for Medical Research, Max Planck Society;

/persons/resource/persons128986

Denk,  Winfried
Department of Biomedical Optics, Max Planck Institute for Medical Research, Max Planck Society;

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Turaga, S. C., Murray, J. F., Jain, V., Roth, F., Helmstaedter, M., Briggman, K., et al. (2010). Convolutional networks can learn to generate affinity graphs for image segmentation. Neural computation, 22(2), 511-538. doi:10.1162/neco.2009.10-08-881.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002E-80F6-3
Abstract
Many image segmentation algorithms first generate an affinity graph and then partition it. We present a machine learning approach to computing an affinity graph using a convolutional network (CN) trained using ground truth provided by human experts. The CN affinity graph can be paired with any standard partitioning algorithm and improves segmentation accuracy significantly compared to standard hand−designed affinity functions. We apply our algorithm to the challenging 3D segmentation problem of reconstructing neuronal processes from volumetric electron microscopy (EM) and show that we are able to learn a good affinity graph directly from the raw EM images. Further, we show that our affinity graph improves the segmentation accuracy of both simple and sophisticated graph partitioning algorithms. In contrast to previous work, we do not rely on prior knowledge in the form of hand−designed image features or image preprocessing. Thus, we expect our algorithm to generalize effectively to arbitrary image types