 Methodology article
 Open Access
 Published:
Unsupervised segmentation of noisy electron microscopy images using salient watersheds and region merging
BMC Bioinformatics volume 14, Article number: 294 (2013)
Abstract
Background
Segmenting electron microscopy (EM) images of cellular and subcellular processes in the nervous system is a key step in many bioimaging pipelines involving classification and labeling of ultrastructures. However, fully automated techniques to segment images are often susceptible to noise and heterogeneity in EM images (e.g. different histological preparations, different organisms, different brain regions, etc.). Supervised techniques to address this problem are often helpful but require large sets of training data, which are often difficult to obtain in practice, especially across many conditions.
Results
We propose a new, principled unsupervised algorithm to segment EM images using a twostep approach: edge detection via salient watersheds following by robust region merging. We performed experiments to gather EM neuroimages of two organisms (mouse and fruit fly) using different histological preparations and generated manually curated groundtruth segmentations. We compared our algorithm against several stateoftheart unsupervised segmentation algorithms and found superior performance using two standard measures of underand oversegmentation error.
Conclusions
Our algorithm is general and may be applicable to other largescale segmentation problems for bioimages.
Background
Electron microscopy (EM) images can reveal the physical structure of cellular and subcellular processes in the nervous system at a fine level of resolution. Accurately segmenting such images is a key component of many bioimage related tasks — including labeling, visualization, and classification — in structural biology and neuroscience [1].
However, fully automated methods to segment EM images are computationally challenging to develop due to both natural and synthetic noise in the images and irregularity in cellular structures. Noise can emerge due to variations in histological preparations or in the image acquisition process, or due to natural differences in the brain tissue or organisms of interest. This noise is extremely difficult to overcome experimentally and thus must be accounted for computationally. The physical shape of many structures (e.g. neural membranes) can also vary widely and do not conform to a standard template for detection [2], and intensity and contrast differences may also be equally inconsistent across samples. Highquality EM images can also be very large (millions to tens of millions of pixels), which further constrains the complexity of image processing algorithms. While it may be possible to finetune an algorithm to handle nuances within a specific EM preparation, few algorithms have been proposed that can reasonably handle images across a variety of different imaging conditions and preparations. Supervised or semisupervised techniques are often helpful [39], but they require large sets of training data, which are often difficult to obtain in practice, especially across many conditions.
An important initial step of image segmentation is grouping pixels into coherent local regions called superpixels. Running algorithms on the decomposed set of superpixels (instead of the original pixels) can aid existing supervised or semisupervised approaches for EM segmentation as well as other downstream computer vision tasks by simplifying learning and inference. Indeed, in recent years, many unsupervised algorithms have been proposed to generate superpixels and range from graphbased [1013], to gradientascentbasad [1417], to clusteringbased approaches [18] (see Achanta et al. [19] for review). These algorithms have mostly been tailored for processing natural images and are often sensitive to variations in image quality and noise that are inherent to the EM process. These algorithms also employ different constraints and parameters (e.g. different rules to enforce regularity of superpixel size and shape, different measures of superpixel homogeneity, etc.) designed according to their intended application.
In this paper, we propose a novel, principled unsupervised segmentation algorithm designed specifically to be robust to the types of variation and noise expected in EM images of brain tissue. We propose a twostep approach: First, we develop a novel watershed variant that produces a coarse oversegmentation while strongly preserving edges in the image. This is done by using Canny [20] and probabilistic boundary [21] edges to find highconfidence boundaries, which are then incorporated as constraints into the watershed algorithm. Second, we design a new region merging algorithm to reduce the number of superpixels by merging adjacent regions based on a measure of similarity derived from intensity and texture features. We formalize the merging problem as a graphtheoretic optimization function and use an efficient agglomerative greedy algorithm to find a final partition into the desired number of superpixels. We performed experiments to gather EM images of the fruit fly and mouse nervous systems using two different histological preparations. Using two standard measures of over and undersegmentation error, we show that our approach offers a significant reduction in the number of superpixels while preserving more true boundaries than existing stateoftheart algorithms (Figure 1). We also show qualitative results on several additional images. Our results suggest that unsupervised techniques can be used as a general firstpass technique to reduce image complexity without significantly sacrificing accuracy.
Methods
The salient watershed algorithm
Given an EM image to segment, the first step is to produce accurate boundarypreserving superpixels. While many algorithms exist for this purpose, the classical watershed algorithm [16] is a natural choice due to its ease of use, efficiency, and scalability. Unfortunately, the standard watershed algorithm suffers from two significant problems: oversegmentation and leakage. Oversegmentation can usually be corrected with postprocessing steps (such as region merging); however, to extract regions from EM images that correspond to precise cellular structures, fixing leakage in the initial segmentation is critical. While datasetdependent heuristics may help resolve leakage, this does not address the general problem of watershed leakage when segmenting images across different EM preparations and imaging conditions.
To tackle these issues, we propose a novel variant of the watershed algorithm called Salient Watershed. The steps of our algorithm are:

1.
Denoise the image. We use nonlocalmeans smoothing [22] to both reduce the impact of local noise when detecting boundaries and to reduce unnecessary oversegmentation. In particular, we preprocess the original input image I with a 3 × 3 pixelwide nonlocalmeans filter [22] to obtain I _{ nl } (Figure 2B).

2.
Detect highconfidence boundaries. First, we apply the Canny edge detector [20] on I _{ nl } to obtain $\nabla {I}_{\mathit{\text{nl}}}^{\mathit{\text{canny}}}$. Second, we compute the Pb detector [21] on I _{ nl } for a coarse estimate of boundary probabilities ${I}_{\mathit{\text{nl}}}^{\mathit{\text{pb}}}$, and then we compute an edge map $\nabla {I}_{\mathit{\text{nl}}}^{\mathit{\text{pb}}}$ by thresholding ${I}_{\mathit{\text{nl}}}^{\mathit{\text{pb}}}$ at a conservative threshold (1/200). Third, we combine these edges into a hybrid salient edge map via pixelwise multiplication: $\nabla {I}_{\mathit{\text{nl}}}^{\mathit{\text{salient}}}=\nabla {I}_{\mathit{\text{nl}}}^{\mathit{\text{pb}}}.\ast \nabla {I}_{\mathit{\text{nl}}}^{\mathit{\text{canny}}}$ (Figure 2C). It has been previously shown that the probabilistic Pb edge detector [21] by itself cannot adequately segment EM images without retraining on specific type of images [5]. Combining the Canny and Pb boundary detectors gives us the ability to find highlikelihood salient boundaries that retain precise edge localization without resorting to parameter tuning or retraining for different kinds of tissue samples.

3.
Elevate watershed levels where Canny and Pb coincide. Next, we compute the Euclidean distance transform on $\nabla {I}_{\mathit{\text{nl}}}^{\mathit{\text{salient}}}$ to obtain ${I}_{\mathit{\text{dist}}}^{\mathit{\text{salient}}}$ and then compute an enhanced edge map ${I}^{\mathit{\text{enhance}}}={e}^{2\ast {I}_{\mathit{\text{dist}}}^{\mathit{\text{salient}}}}$ (Figure 2D). This step elevates the watershed along the intersection of Canny and Pb lines and provides an exponential falloff as the distance to these lines increases. It also helps bridge small gaps that may exist in the boundaries.

4.
Run watershed on the enhanced image. Finally, we apply the classical watershed algorithm on I ^{enhance} to obtain the final oversegmented image ${I}_{\mathit{\text{Ws}}}^{\mathit{\text{enhance}}}$ (Figure 2E).
By incorporating the notion of edge saliency into the watershed computation, we ensure that salient boundaries are preserved. This addresses the leakage problem consistently. While this procedure adds additional computational complexity to the original watershed procedure, Salient Watershed is a more robust algorithm that can be applied to many EM datasets to produce a firstpass segmentation without tuning parameters.
This algorithm produces an initial (oversegmented) set of superpixels (regions), which are then further collapsed using an agglomerative merging algorithm, as described below.
The region merging algorithm
Region merging is often performed after superpixels are generated to collapse neighboring regions. There are three aspects to region merging: the features used to represent each region, a measure of similarity between regions in featurespace, and an objective function for merging regions. We describe each of these aspects below.
Each region is defined by a normalized intensity histogram and a set of normalized texture histograms computed using pixel values in the region. Texture is an important cue used by humans when manually segmenting and annotating EM images [23], and its use has become popular in many computer vision tasks today [24]. Varma and Zisserman [25] proposed an effective set of 38 filters (6 orientations × 3 scales × 2 oriented filters + 2 isotropic filters), but only recorded the maximum filter response across each orientation, leading to 8 total filter responses at each pixel. Each region is thus represented by a b × 9 feature matrix, where b = 32 is the number of bins in each histogram.
Most previous approaches compute the similarity between two regions in featurespace based on the Euclidean or Manhattan distances [26], by comparing means and standard deviations of feature vectors [27, 28], or using informationtheoretic measures [29]. The downside of these measures is that they treat each histogram bin independently and, as a result, two histograms that differ slightly in adjacent bins are treated as equally distant as two histograms that differ equally in farapart bins. To avoid this problem, we use the Earth Mover’s Distance (EMD) [30], which computes the minimum cost to transform one histogram to exactly match the other using transformation costs that depend on the linear distance between bins. EMD can be solved quickly using a constrained bipartite network flow routine [31]. Overall, the similarity between two adjacent regions r and r^{′} is defined as:
where the first term biases towards collapsing smaller regions; Int_{ r } is the normalized intensity histogram of region r; Text_{r,i} is the i^{th} normalized texture histogram of region r; and α is a parameter to weigh the contribution of the texture component (we set α = 1/8). We use EMD to compute the similarity between both normalized features (intensity and texture), and thus born terms lie on roughly the same scale.
The final aspect of the algorithm is the merging optimization function [26]. We define a predicate that states that every region r should be "sufficiently" different compared to each of its neighbors. Formally:
Algorithm 1 RegionMerging(I,L,NumSPs)
where N(r) are the regions adjacent to r. If this statement is true for region r, we call r an "island". We seek to find a segmentation such that holds for every region. In graphtheoretic terms, we start with the region adjacency graph G = (V,E), defined by nodes V (regions) and with edges E connecting adjacent regions. To merge two regions means to contract the edge between them; our goal is thus to find a set of edges whose contraction results in a graph satisfying for every region. We find such a set using a greedy agglomerative algorithm: we start with the regions produced by the Salient Watershed algorithm, and iteratively merge the pair of neighboring regions that are most similar. This process can stop either when the similarity between any two adjacent regions is < τ (at which point every region is guaranteed to be an island according to τ) or when the desired number of superpixels is met (as we do here). Pseudocode of the region merging algorithm is shown in Algorithm 1.
Comparing segmentations versus groundtruth
To evaluate performance, we performed experiments and collected three 1000 × 1000pixel EM images of the nervous system: 2 images were from the fruit fly ventral nerve cord fixed using a high pressure freezing (HPF) protocol, and 1 image was from the mouse cortex using a perfusion DABbased protocol (e.g. [32]). We manually segmented membranes, mitochondria, and other neuronal structures in these images (Figure 1A and 1B) and extracted groundtruth boundary matrices for each. We also collected two additional images of the mouse cortex using HPF, which we analyzed qualitatively.
To compare an algorithm’s segmentation P with the groundtruth Q, we use two standard metrics: the asymmetric partition distance (APD) and the symmetric partition distance (SPD) [33]. APD(P,Q) computes, over all regions r ∈ P, the maximum percentage of pixels in r that map onto a single groundtruth segment. SPD(P,Q) finds the maximal matching between regions in P and Q and computes the overall percentage of pixels that must be deleted from both images in order to make each pair of matched regions equivalent. APD penalizes "spillover" of segments across groundtruth boundaries, but does not penalize oversegmentation. On the other hand, SPD measures exact 11 correspondence between segmentations and does penalize oversegmentation. We report 1 SPD(P,Q) as a percentage, so in both measures higher percentages are better.
Results and discussion
We compared our algorithm against TurboPixels [17] and a MATLAB implementation of SLIC [19, 34]. TurboPixels uses geometric flows to find regions that are approximately uniform in size and shape while also preserving smooth boundary edges, and it is specifically designed to produce highquality oversegmentations. SLIC is a clustering method based on kmeans that was shown to be superior to several graphbased and gradientascentbased algorithms on segmenting mitochondria in EM images [18]. It was also recently shown in a largescale comparison to be amongst the best performing algorithms on the Berkeley segmentation dataset [19], and thus represents the current stateoftheart. We ran each algorithm on our EM images and varied the number of superpixels returned by adjusting parameters in the algorithm. For each segmentation, we computed the over and undersegmentation error (SPD and APD, respectively).
Our algorithm more strictly adheres to true boundaries compared to the other algorithms across nearly the entire range of superpixels (Figure 1DG and Figure 3A). For example, at roughly 2000 superpixels on the first fruit fly image, our algorithm has an APD of 93.72% compared to 88.98% for TurboPixels and 86.89% for SLIC. Thus, we can achieve over three orders of magnitude reduction in the number of superpixels (compared to the original image) while still preserving over 90% of the true boundaries. Some predicted boundary contours may indeed be correct but do not align exactly with the groundtruth boundaries; thus, this value actually represents a lowerbound on performance. In practice, oversegmentation is often more permissive than undersegmentation because it is relatively easy for downstream analyses to specify additional merges (e.g. via classification) but more difficult and laborintensive to reconstruct a lost boundary.
Our algorithm also outperforms the other methods in extracting true regions in their entirety (Figure 3B). The SPD penalizes oversegmentation and measures exact concordance between the groundtruth and algorithm partitions. At 1000 superpixels, our algorithm has an average SPD of almost 50% compared to 7% (TurboPixels) and 30% (SLIC). This means that half the pixels in our partition are exactly matched to groundtruth regions. Our groundtruth was constructed to consider entire membranes as single regions (as a biologist might), but there may be small substructures within membranes that persist due their markedly different features. These regions will naturally be left unmerged by each algorithm; a more finegrained groundtruth segmentation would thus increase these percentages further. TurboPixels especially suffers on the SPD measure because it generates regular and gridlike superpixels (Figure 1F); EM images, however, contain many irregularlyshaped structures that do not fit this mold.
Our algorithm and SLIC perform similarly under both metrics when the number of desired superpixels is large (Figure 3 at 10,000 superpixels), but diverge as fewer superpixels are requested. This suggests that both methods may be comparable at high numbers of superpixels, but that our region merging algorithm is more robust at preserving boundaries than the clusteringbased approach used by SLIC.
We also compared our Salient Watershed algorithm to the classical watershed algorithm [16]. On the first image, for example, the latter produced a segmentation with 43,252 regions and an APD of 94.17%. Salient Watershed produced a segmentation with 13,252 regions and an APD of 95.25%. APD can not increase with subsequent merges; the fact that our segmentation produces a higher APD with more than 3x fewer regions testifies to the strong edgepreserving property of our salient watersheds.
Next, to determine whether our superpixels may be used for classification, we took the 1000 superpixels generated by our algorithm and clustered them in featurespace using kmeans (Figure 1C). Coclustered regions were assigned the same color (we used k = 13 but found similar results for many k). Visual inspection shows that indeed many similar structures — in particular mitochondria (light green) and membranes (purple) — are similarly colored. This implies that the superpixels that comprise these regions represent homogeneous biologically structures and that they are wellseparated by intervening boundaries in feature space. This clustering represent a firstpass unsupervised labeling of EM images that can be further improved via supervised techniques [3, 5].
Finally, we demonstrate the performance of our algorithm versus SLIC and TurboPixels qualitatively on two additional images of the mouse cortex prepared using high pressure freezing (Figure 4). The previous images of the mouse cortex were obtained using DAB. Without altering any parameters, we ran each algorithm using 2,000 superpixels and visually compared the predicted boundaries. As with the previous images, our method preserves intricate membrane boundaries much better than the other techniques and produces more homogeneous regions. We also find superior performance when capturing irregularlyshaped regions, and we are better able to separate regions that are separated by a thin boundary (e.g. two membrane boundaries that lie adjacent to one another; Figure 4). Both of these types of heterogeneity are widespread in EM images and not easily captured by methods that make assumptions about edge properties or the distribution of noise in EM images [28]. This further suggests that our unsupervised approach is robust to some natural variations caused by different histological preparations in EM neuroimages.
Conclusions
Accurately segmenting electron microscopy images is an important problem for many neuroimage related tasks, but it also presents several computational challenges due to the noise and variation inherent in tissue samples and in the EM chemistry and image acquisition processes. We presented an unsupervised algorithm to generate boundarypreserving superpixels by combining a salient watershed algorithm with robust region merging. On a benchmark dataset of noisy EM images, our algorithm outperformed two stateoftheart methods using two standard measures of over and undersegmentation error. While our method has additional computational complexity, we place emphasis on accuracy and contend that downstream time spent in EM image analysis will be reduced through more accurate segmentations.
While aspects of this general pipeline for segmentation (edge detection, watershed, region merging) have been used in previous works [8, 9, 28], the specific sequence of steps as outlined in this paper is novel. This combination of components offers our unsupervised approach a level of generality and robustness that can handle many types of noise present in heterogeneous EM data. Our approach also uses few parameters and may be usable across different EM histological preparations and for other largescale bioimage segmentation problems (e.g. segmentation of cells, nuclei, or proteins within fluorescence microscopy images).
References
 1.
Peng H: Bioimage informatics: a new area of engineering biology. Bioinformatics. 2008, 24 (17): 18271836. 10.1093/bioinformatics/btn346.
 2.
Liu L, Sclaroff S: Region segmentation via deformable modelguided split and merge. Proc Intl Conf on Computer Vision (ICCV). 2001, Los Alamitos: IEEE Computer Society, I: 98104.
 3.
Andres B, Köthe U, Helmstaedter M, Denk W, Hamprecht FA: Segmentation of SBFSEM volume data of neural tissue by hierarchical classification. Proc 30th DAGM Symposium on Pattern Recognition. 2008, Berlin Heidelberg: SpringerVerlag, 142152.
 4.
Gould S, Fulton R, Koller D: Decomposing a scene into geometric and semantically consistent regions. Proc Intl Conf on Computer Vision (ICCV). 2009, Los Alamitos: IEEE Computer Society, 18.
 5.
Jain V, Bollmann B, Richardson M, Berger D, Helmstaedter M, Briggman K, Denk W, Bowden J, Mendenhall J, Abraham W, Harris K, Kasthuri N, Hayworth K, Schalek R, Tapia J, Lichtman J, Seung H: Boundary learning by optimization with topological constraints. IEEE Conf on Computer Vision and Pattern Recognition (CVPR). 2010, 24882495.
 6.
Lucchi A, Smith K, Achanta R, Lepetit V, Fua P: A fully automated approach to segmentation of irregularly shaped cellular structures in EM images. Proc Intl Conf on Medical Image Computing and Computerassisted Intervention (MICCAI). 2010, 463471.
 7.
Turaga SC, Murray JF, Jain V, Roth F, Helmstaedter M, Briggman K, Denk W, Seung HS: Convolutional networks can learn to generate affinity graphs for image segmentation. Neural Comput. 2010, 22 (2): 511538. 10.1162/neco.2009.1008881.
 8.
VazquezReina A, Gelbart M, Huang D, Lichtman J, Miller E, Pfister H: Segmentation fusion for connectomics. Proc Intl Conf on Computer Vision (ICCV), ICCV ’11. 2011, Washington: IEEE Computer Society, 177184. [http://dx.doi.org/10.1109/ICCV.2011.6126240],
 9.
Andres B, Kroeger T, Briggman KL, Denk W, Korogod N, Knott G, Koethe U, Hamprecht FA: Globally optimal closedsurface segmentation for connectomics. Proc European Conf on Computer Vision (ECCV), ECCV’12. 2012, Berlin, Heidelberg: SpringerVerlag, 778791. [http://dx.doi.org/10.1007/9783642337123_56],
 10.
Shi J, Malik J: Normalized cuts and image segmentation. IEEE T Pattern Anal Mach Intell. 2000, 22: 888905. 10.1109/34.868688.
 11.
Felzenszwalb PF, Huttenlocher DP: Image segmentation using local variation. Proc IEEE Conf on Computer Vision and Pattern Recognition (CVPR). 1998, Washington: IEEE Computer Society, 98104.
 12.
Moore AP, Prince SJD, J Warrell UM, Jones G: Superpixel lattices. Proc IEEE Conf on Computer Vision and Pattern Recognition (CVPR). 2008, Los Alamitos: IEEE Computer Society
 13.
Veksler O, Boykov Y, Mehrani P: Superpixels and supervoxels in an energy optimization framework. Proceedings of the 11th European Conference on Computer Vision: Part V, ECCV’10. 2010, Berlin, Heidelberg: SpringerVerlag, 211224.
 14.
Comaniciu D, Meer P: Mean shift: a robust approach toward feature space analysis. IEEE Trans Pattern Anal Mach Intell. 2002, 24 (5): 603619. 10.1109/34.1000236.
 15.
Vedaldi A, Soatto S: Quick shift and kernel methods for mode seeking. Proceedings of the European Conference on Computer Vision (ECCV). 2008, 705718. [http://dx.doi.org/10.1007/9783540886938_52],
 16.
Vincent L, Soille P: Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans Pattern Anal Mach Intell. 1991, 13 (6): 583598. 10.1109/34.87344.
 17.
Levinshtein A, Stere A, Kutulakos KN, Fleet DJ, Dickinson SJ, Siddiqi K: TurboPixels: fast superpixels using geometric flows. IEEE Trans Pattern Anal Mach Intell. 2009, 31 (12): 22902297.
 18.
Achanta R, Shaji A, Smith K, Lucchi A, Fua P, Süsstrunk S: SLIC Superpixels. Tech. rep., EPFL, EPFL 2010
 19.
Achanta R, Shaji A, Smith K, Lucchi A, Fua P, Süsstrunk S: SLIC Superpixels compared to stateoftheart superpixel methods. IEEE Trans Pattern Anal Mach Intell. 2012, 34 (11): 22742282. doi:10.1109/TPAMI.2012.120, ISSN:01628828
 20.
Canny J: A computational approach to edge detection. IEEE T Pattern Anal Mach Intell. 1986, 8: 679698.
 21.
Martin DR, Fowlkes CC, Malik J: Learning to detect natural image boundaries using local brightness, color, and texture cues. IEEE T Pattern Anal Mach Intell. 2004, 26: 530549. 10.1109/TPAMI.2004.1273918.
 22.
Buades A, Coll B, Morel JM: A nonlocal algorithm for image denoising. Proc IEEE Conf on Computer Vision and Pattern Recognition (CVPR). 2005, 6065.
 23.
Arbelaez P, Han BG, Typke D, Lim J, Glaeser RM, Malik J: Experimental evaluation of support vector machinebased and correla tionbased approaches to automatic particle selection. J Struct Biol. 2011, 175 (3): 319328. 10.1016/j.jsb.2011.05.017.
 24.
Leung T, Malik J: Representing and recognizing the visual appearance of materials using threedimensional textons. Int J Comput Vision. 2001, 43: 2944. 10.1023/A:1011126920638.
 25.
Varma M, Zisserman A: A statistical approach to texture classification from single images. Int J Comput Vision. 2005, 62: 6181.
 26.
Nock R, Nielsen F: Statistical region merging. IEEE T Pattern Anal Mach Intell. 2004, 26: 14521458. 10.1109/TPAMI.2004.110.
 27.
Beveridge JR, Griffith J, Kohler RR, Hanson AR, Riseman EM: Segmenting images using localized histograms and region merging. Int J Comput Vision. 1989, 2 (3): 311347. 10.1007/BF00158168.
 28.
Haris K, Efstratiadis SN, Maglaveras N, Katsaggelos AK: Hybrid image segmentation using watersheds and fast region merging. IEEE Trans Image Process. 1998, 7 (12): 16841699. 10.1109/83.730380.
 29.
Calderero F, Marques F: Region merging techniques using information theory statistical measures. IEEE Trans Image Process. 2010, 19: 15671586.
 30.
Rubner Y, Tomasi C, Guibas LJ: The earth mover’s distance as a metric for image retrieval. Int J Comput Vision. 2000, 40: 99121. 10.1023/A:1026543900054.
 31.
Pele O, Werman M: Fast and robust earth mover’s distances. Proc IEEE Intl. Conf on Computer Vision (ICCV). 2009, Los Alamitos: IEEE Computer Society, 460467.
 32.
Tremblay ME, Riad M, Majewska A: Preparation of mouse brain tissue for immunoelectron microscopy. J Vis Exp. 2010, e2021 (41):
 33.
Cardoso JS, CorteReal L: Toward a generic evaluation of image segmentation. IEEE Trans Image Process. 2005, 14 (11): 17731782.
 34.
Vedaldi A, Fulkerson B: VLFeat: An open and portable library of computer vision algorithms. 2008, [http://www.vlfeat.org/],
Acknowledgements
P.A. and E.W.M. thank the Howard Hughes Medical Institute (HHMI) for funding. E.W.M. also thanks the MPICBG for additional support. The authors also thank Richard Fetter at HHMI Janelia Farm Research Campus for help generating EM images.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
The project was conceived by PA and EWM. PA and SN designed the algorithms and wrote the software. SN generated the groundtruth data and performed the quantitative evaluations. SN, PA and EWM wrote the paper. All authors read and approved the final manuscript.
Saket Navlakha, Parvez Ahammad contributed equally to this work.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License(http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Navlakha, S., Ahammad, P. & Myers, E.W. Unsupervised segmentation of noisy electron microscopy images using salient watersheds and region merging. BMC Bioinformatics 14, 294 (2013). https://doi.org/10.1186/1471210514294
Received:
Accepted:
Published:
Keywords
 Image segmentation
 Superpixels
 Salient watershed
 Region merging
 Electron microscopy
 Unsupervised learning