Name
Abstract | ||
|---|---|---|
Segmentation schemes such as hierarchical region merging or correllation clustering rely on edge weights between adjacent (super-)voxels. The quality of these edge weights directly affects the quality of the resulting segmentations. Unstructured learning methods seek to minimize the classification error on individual edges. This ignores that a few local mistakes (tiny boundary gaps) can cause catastrophic global segmentation errors. Boundary evidence learning should therefore optimize structured quality criteria such as Rand Error or Variation of Information. We present the first structured learning scheme using a structured loss function; and we introduce a new hierarchical scheme that allows to approximately solve the NP hard prediction problem even for huge volume images. The value of these contributions is demonstrated on two challenging neural circuit reconstruction problems in serial sectioning electron microscopic images with billions of voxels. Our contributions lead to a partitioning quality that improves over the current state of the art. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-40763-5_52 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Voxel,Pattern recognition,Computer science,Segmentation,Structured prediction,Variation of information,Artificial intelligence,Cluster analysis,Merge (version control),Random forest | Conference | 8150 |
Issue | ISSN | Citations |
Pt 2 | 0302-9743 | 6 |
PageRank | References | Authors |
0.51 | 17 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thorben Kroeger | 1 | 129 | 6.37 |
| Shawn Mikula | 2 | 91 | 11.51 |
| Winfried Denk | 3 | 261 | 30.04 |
| Ullrich Koethe | 4 | 249 | 22.37 |
| Fred A. Hamprecht | 5 | 962 | 76.24 |