Home | About | Journals | Submit | Contact Us | Français |

Formats

Article sections

Authors

Related links

Sci Rep. 2013; 3: 1414.

Published online 2013 April 2. doi: 10.1038/srep01414

PMCID: PMC3613804

Tingwei Quan,^{1,}^{2,}^{3} Ting Zheng,^{1,}^{2} Zhongqing Yang,^{1,}^{2} Wenxiang Ding,^{1,}^{2} Shiwei Li,^{1,}^{2} Jing Li,^{1,}^{2} Hang Zhou,^{1,}^{2} Qingming Luo,^{1,}^{2} Hui Gong,^{a,}^{1,}^{2} and Shaoqun Zeng^{b,}^{1,}^{2}

Received 2013 January 11; Accepted 2013 February 22.

Copyright © 2013, Macmillan Publishers Limited. All rights reserved

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-nd/3.0/

This article has been cited by other articles in PMC.

Drawing the map of neuronal circuits at microscopic resolution is important to explain how brain works. Recent progresses in fluorescence labeling and imaging techniques have enabled measuring the whole brain of a rodent like a mouse at submicron-resolution. Considering the huge volume of such datasets, automatic tracing and reconstruct the neuronal connections from the image stacks is essential to form the large scale circuits. However, the first step among which, automated location the soma across different brain areas remains a challenge. Here, we addressed this problem by introducing L1 minimization model. We developed a fully automated system, NeuronGlobalPositionSystem (NeuroGPS) that is robust to the broad diversity of shape, size and density of the neurons in a mouse brain. This method allows locating the neurons across different brain areas without human intervention. We believe this method would facilitate the analysis of the neuronal circuits for brain function and disease studies.

Neural circuit is the physical basis of the brain function. Drawing the map of neuronal circuits at microscopic resolution is important to explain how the brain works, which requires tracing the neurons from its branches to the cell body (soma)^{1}^{,2}^{,3}^{,4}^{,5}^{,6}. Therefore locating the soma of the neuron is a first step for boosting tracing accuracy and further quantifying the neuronal circuits^{7}^{,8}^{,9}. Meanwhile, localization of neurons has also been widely used to discover the scientific fact in other researches. For example, it has been applied in computing the positions of the neural stem-cell in the adult sub ventricular zone to analyze niche cell-cell interactions^{10}, in discovering whether the cancer stem cell are independent on the neural microenvironments or not^{11}, and in quantifying the relation between the distribution of neurons and blood vessel^{12}. Recent progresses in fluorescence labeling and imaging techniques, that have enabled measuring the whole brain connections of a rodent like a mouse at submicron-resolution^{13}^{,14}^{,15} or micron-resolution^{16}, have piled up very huge volume of data, which made manual location the neurons painful for large scale analysis such as the mouse brain.

Substantial progresses have been made in automatically locating and segmenting cells from the image stacks. Typical methods^{17}^{,18}^{,19}^{,20}^{,21}^{,22}^{,23}^{,24}^{,25}^{,26}^{,27}^{,28}^{,29} including watershed algorithm^{17}^{,18}^{,19}^{,20}^{,21}, tracking the gradient flows^{22}^{,23}, multi-scale filters^{24}^{,25}, and minimum-model^{29} etc., mainly focus on locating and segmenting cells with simple rather than complicated morphology. Recently proposed FARSIGHT software^{25} can address the neurons with specific complicated morphology^{30}. Automatic segmentation tool like V3D^{6} is widely used to track complicated neuronal fibers. However localization the neuron is typically done manually due to the broad diversity of shape and size of neurons, especially the thick dendritic truck is still challenging.

Here, to overcome the above challenges, a novel method, called as Neuronal Global Position System (NeuroGPS), was developed. Based on a new biophysical model, it applies optimization method to locate neuron by introducing L1 minimization^{31} (L1-M) with a guiding hypothesis that each neuron has only one soma, which is not densely overlapped with its neighbors. NeuroGPS locates the cell body by computing the radius of each soma, and finding the most preferred radius and its corresponding coordinates. This method efficiently eliminates the interference from the complicated neurites, especially the thick dendritic truck, on localization, and is robust to the diverse shape, size, and density of neurons. With NeuroGPS, we demonstrate automatic localization of neurons across different regions in the mouse brain without human intervention.

Using binarization and erosion operation (See **Methods**), a binarized signal *B _{L}* (the foreground and background values were set to value one and zero respectively) can be extracted from the initial image stacks. Usually,

where *f* (*o, o _{i}, r_{i}*) is the

*res* (*o*) is residual signal, *o* is the coordinates of volume pixels in *B _{L}*,

The fact that *B _{L}* contains thick dendritic trucks results in some false positive positions in these

where || || represents 2- norm squared and *V* is the coordinate sets of volume pixels in *B _{L}*.

This model (optimization problem (3)) was further characterized or modified by including the prior property of the neuronal dataset, i.e. the spatial distribution of the neuron is sparse. This is explained in details as follows. The territory of one neuron often significantly overlaps with that of another neuron with the extending neurites, however, the soma of one neuron naturally never overlaps with that of another neuron. This means the neuron is sparse when considering its position in the three dimensional space. If we set many potential soma positions for a certain dataset, most of these positions should be false, and the correlated radius should be zero. Therefore, the radius of the sphere functions has the property of sparsity. Considering this sparsity, inspired by compressive sensing^{33}, we use a signal processing technique called L1 minimization technique, which works on a similar principle for sparse signal reconstruction, to recover the non-zero radiuses of sphere functions, and thus modify the optimization problem (3) as

where λ is the tradeoff between the error in fitting parameters of sphere function to *B _{L}* and the sparseness of the radius of the sphere functions. Here, optimization problem (4) (

**O.P. (4)** can be solved using the method proposed by Candes^{34}. However, considering *B _{L}* is image stacks with large volume, we applied modification to the frame work of Candes

In L1-M model (**O.P. (4)**), besides it requires the simulated image reach a minimum error over the measured image, in the meantime, it requires the summarization of the radius of the many soma candidates also reach a minimum value. This additional constrain lead to shrinkage in these radiuses correlated to the neurites including thick trucks. To prove this, we examined the efficacy of introducing L1 minimization model to locate neurons. As shown in Fig. 1a, the signal labeled in light blue corresponds to the foreground of *B _{L}*, and the red spots are the initial candidate positions (or seeds) which lie in the soma and thick truck. Without L1-M, i.e., λ = 0 in

To evaluate NeuroGPS, we applied it to seven typical image stacks from different cortical regions. Each contains 300 × 200 × 600 volume pixels. Fig. 2a shows typical results, and Fig. 2d,e shows the statistics of the seven data sets. In Fig. 2a, as white triangle labeled, the shape of cells has a variety of patterns. Some pyramidal neurons show long and thick trucks, resulting in difficulties to describe their morphology, while some others cells show simple shape, can easily be modeled with a sphere function. In the meantime, the size of the soma also varies largely. In Fig. 2e, we calculated the radiuses of the true positive neurons of all the seven datasets and noted their values widely range from about 4.0 μm to 11.0 μm. For comparison, these datasets were substituted to the same optimization processing system but without L1-M (Fig. 2b), and to the popular neuron tracing software like FARSIGHT^{25} (Fig. 2c). Thick trucks are sometimes recognized as somas (arrows in Fig. 2b,c). This will increase the overall false positive numbers in locating neurons (Fig. 2d). Some neurons cannot be detected (circles in Fig. 2c)) by FARSIGHT for low signal intensity. Consider all the neurons in the several dataset, the overall false positive rate and true positive rate are 4% and 100% for NeuroGPS, 25% and 100% for NeuroGPS without L1-M, and 61% and 88% for FARSIGHT. According to the general way of image processing, image content around the boundary of images stacks are directly ignored, that's why some bright spots are not identified as somas (the square in Fig. 2a). These spots are not included in the ground truth, and not affect the positive rate. From the above results, we can conclude that NeuroGPS is powerful to locate neurons with broad diversity of shape and size.

We used the experimental data sets to illustrate NeuroGPS can locate neurons with highly dense spatial distribution. Typical region such as cortical (Fig. 3a) and hippocampus (Fig. 3b) regions were given as examples of two types of high-density. The clustered neurons with complicated neuritis, labeled by arrows in Fig. 3a, were successfully located using NeuroGPS. For the image stacks in Fig. 3b, the false positive rate and true positive rate are 6% and 86%. We also quantitatively estimate the spatial density of the neurons in Fig. 3b. More than 95% radius of the neuronal soma ranges from 3.0 μm to 8.0 μm (Fig. 3c), and the distance between pairs of cells, defined as the distance from the manually-determined position of one neuron to the nearest position of the other neuron, is 13.6 ± 3.8 μm (Fig. 3d). If measured the density of the true positive somas by the pair distance smaller than 1×, or 1.2× of the sum of the radiuses, respectively, about 14% or 35% of the cells touched each other. This value indicates that a part of cells experienced dense distribution.

With the above two features, NeuroGPS is able to locate neuron automatically across different brain area without any manual mediation. This point is illustrated with a large scale fluorescence images dataset which includes part of the cortical and the hippocampal area, and whose max-intensity projection is shown in Fig. 4a. The images dataset is the part of the whole coronal profile (labeled by white rectangle in Fig. 4d), and its size is 1300 × 1850 × 150 volume pixels. In spite of a variety of cell shapes, sizes and densities, including very thick and complicated dendrites, (typically shown in Fig. 4b,c or **b1,c1**), we located about 2500 neurons using NeuroGPS, and get an overall true positive rate of 88%, and a false positive rate of 8% compared with manual detected positions as the ground truth. It is noted in this demonstration that the radiuses of some thick trucks are almost 4.0 μm, equal to or bigger than the size of small neurons, as the radius of true positive neuronal somas ranges from about 3.5 μm to 10.0 μm. Without L1-M, the positions in thick trucks were easily recognized the position of neurons (arrows Fig. 4b1). This result indicates that NeuroGPS can be applied in handling large scale data sets, which is surely beneficial for further reconstructing neuronal morphology or quantifying large neuronal circuits.

Localization of neurons has the promise boosting neuronal trace and quantifying the large scale neuronal circuits. In this paper, we have proposed NeuroGPS method to locate neurons across different brain areas and have demonstrated its high robustness to the shape, size and spatial distribution of neurons. Specifically, this method eliminated the negative influence of the complicated neurites, especially from the thick dendritic truck, on localization.

Essentially, we made a new biophysical model to locate the neuron which only concerns the morphology of the neuronal soma, rather than the entire neuron. In the biophysical model, we introduced L1 minimization to maximize image sparsity, and identify the false positive positions in thick dendritic truck which is based on the biophysical/neurobiological assumption that each neuron has only one soma that does not overlap with its neighbors. This biophysical model and its successful solution play a key role in successfully locating neurons with complicated morphology.

Due to the complexity and diversity of neuronal structure in mammals like mouse, neurons across different brain have a wide variation of shape, size and spatial distribution. Therefore localization of these neurons without human interference is a challenging work. Typically, when we analyzed our data sets, the radiuses of some thick trucks are close to 4.0 μm (Fig. 1b), which are almost equals to or even bigger than the radius of some neuronal somas (Fig. 2e & Fig. 3c). Previous works^{17}^{,18}^{,19}^{,20}^{,21}^{,22}^{,23}^{,24}^{,25}^{,26}^{,27}^{,28}^{,29} have not involved this problem, and thus experience difficulties in resolving it. For example, though the classical method like FARSIGHT can overcome the challenges in locating neurons with variation of size and spatial distribution^{25}, it cannot distinguish thick trucks and some small neurons (Fig. 2d). NeuroGPS, as described earlier, can induce shrinkage in the radiuses of thick trucks by introducing L1-M and effectively identify the false positions of thick trucks (Fig. 1a, b & Fig. 2a, b). In addition, NeuroGPS possesses high robustness to the size and spatial distribution of neurons (Fig. 2e & Fig. 3a, c). These advantages of NeuroGPS make it possible to locate neurons across different brain areas.

In optimization problem (4), the parameter λ is used to control the tradeoff between the fitting error and the sparsity of radiuses of sphere function. When we choose a big value of λ to enforce this sparsity, the fitting error will increase. Conversely, the small fitting error is built on the sacrifice of the sparsity. So finding the appropriate tradeoff may be important for the localization performance. Fortunately, the algorithm of reweighted L1 minimization^{34} can automatically modify the strength of the sparsity in solving optimization problem (4) and provide strong sparsity even when a small value of λ is set, e.g. strong sparsity can be gained with a wide λ value range. This feature enables that the localization performance is robust to the tradeoff λ. In experiment, specific λ value was roughly estimated by analyzing a few images. If the localization result is right, the corresponding λ is set, and then extend to the rest volume datasets. If the result is not right, tune λ again to get better performances. In our experience, λ remains unchanged for any image stacks provided that the size of volume pixels and the radius of the soma are within a certain range.

In our experimental data sets analysis, a small amount of positions of neurons has not been detected as expected. There are some reasons for this phenomenon. Firstly, in the process of sample preparing or imaging, the shape of some neuronal soma may be seriously distorted and deviated far from its normal morphology. Secondly, information loss from neuronal somas in the binarization and erosion operation has a negative influence on seeds selection and sphere functions fitting. Depending on the feature of neuronal morphology, using the improved binarization and erosion method may improve the localization performance.

The computation time of NeuroGPS depends on the number, morphology and spatial distribution of neurons. As described earlier, we used the averaging method combined with gradient projection to speed the iteration optimization process and increase the computation efficiency of NeuroGPS. This operation is effective based on the fact the shape of neuronal soma basically meets spherical symmetry. As verified by Berglund^{36}, an object can be located by averaging method provided that its shape meets the spherical symmetry. Typically, analyzing an 600 × 200 × 75 volume pixels image stacks takes about 30 seconds in an Inter(R)Xeon(R)CPU 3.46 GHz computing platform. On the other hand, NeuroGPS performs independent optimizations on different extracted regions, so it can be easily implemented on massive parallel computing for more enhanced speed.

Although we built this NeuroGPS using fluorescent brain image stacks, it can also be applicable to other kinds of images, for example, Nissl staining neuronal images (576 × 1623 × 20 volume pixels). NeuroGPS well located these neurons with the false positive rate of 6% and true positive rate of 93% compared with manual detected positions. Interestingly, the signal intensity of neuronal soma in this example is not uniform. In this case, NeuroGPS is still effective. These results may indicate that NeuroGPS can be applied in a variety of data sets.

It should be noted that our NeuroGPS only focus on the localization of neurons, and cannot be implemented on segmentation of neurons at present. The main reason is that the complicated morphology and the dense distribution of neurons make high-accuracy segmentation of neurons become an acknowledged difficulty^{4}^{,37}^{,38}, beyond our current concerns. Nevertheless, NeuroGPS provide a tool to automatically and accurately locate neurons, which is helpful for neuronal dendritic tracing. Some newly developed neuron tracing methods^{7}^{,8}^{,9} experience difficulties in rejecting the neuronal soma interference. Future work is expected to combine NeuroGPS with automatic segmentation method and facilitating automatic neuronal circuits tracing.

The algorithm for the optimization problem (4) is described as follows:

*Step 1*. Set initial weights: *w _{i}* = 1,

*Step 2*. Solving the optimization problem

*2a*. Set the initial value (*o*_{1}* ^{t}*,

*2b*. Use the gradient projection algorithm^{35} to obtain (*r*_{1}^{t}^{
+ 1}*, r*_{2}^{t}^{
+ 1}*, … , r _{k}^{t}*

*2c*. Use the averaging method to obtain (*o*_{1}^{t}^{
+ 1}*, o*_{2}^{t}^{
+ 1}*, … , o _{k}^{t}*

For each pair of parameter (*o _{i}^{t}*,

Where *I _{i}*(

*o _{i}^{t}*

*2d.* Terminate on convergence and go to step 3, otherwise, *t* + 1→*t*, and repeat *Step*
*2b*–*2c*.

*Step 3*. Update weights:

*Step 4*. Repeat *Step*
*2*–*3* until all parameters converge.

All experiments were performed in accordance with the guidelines of the Experimental Animal Ethics Committee at Huazhong University of Science and Technology. A total of 10 Thy-1-eGFP-H or Thy1-YFP-M Transgenic fluorescence mice (2–10 weeks old) were anaesthetized, and intracardially perfused. The whole brain was brought out, fixed and embedded in GMA media, by following a similar protocol used in Li *et al.*^{13} and Gong *et al.*^{15}. A detailed description can be found there.

The whole brain was sliced and imaged using a fluorescence micro-optical sectioning tomography system. The image reconstruction used the frame work presented in Li *et al.*^{13} and Gong *et al.*^{15}. Basically, image tiles are mosaicked together to form a whole section, and in each section, image pre- processing procedures were applied to remove the inhomogeneous illumination pattern, and redundant portions.

The entire image analysis procedures of NeuroGPS includes sub-region extraction, seeds selection, localization of neurons using L1 minimization and detected positions merging, which were illustrated in the flowchart of Fig. 5. Its detailed description is as follows.

Due to a sparse distribution of neurons in the image stacks, extracting sub-regions and analyzing the extracted signals can significantly increase the computational efficiency, compared with analyzing the entire image stacks. Before sub-regions extraction, the original image stacks needed to be binarized. The binarized image stacks *B* are calculated by

Here *I*(*o*) and *C*(*o*) represent the gray-level value of volume pixel coordinate *o* in the original images and background images respectively. The image stacks *I**, calculated as *I**(o) = min(*I*(*o*), *thre*), is convoluted 20 times with the averaging template (9 × 9 × 1 pixels^{3}) and we can get the background images. Here *thre is* a roughly estimated value used to distinguish foreground from background.

Dense distribution and complicated morphology of neurons usually lead to the large connected regions in the binarized image stacks, which requires huge amount of computation resources to analyze these regions. To reduce the computational time, the large connected region was divided into several parts using the erosion operation.

*Step1.* Eroding the binarized image stacks *B*. If the sum of the value of the volume pixel and its 26-connected volume pixel is less than the erosion threshold *T*, then the value of this volume pixel is set to be 0, otherwise, it remains unchanged.

*Step2.* In eroded *B*, the connected region with volume pixels ranged in number from 100 to 20000 extracted and analyzed in the latter subsections. Then, the value of volume pixels in the extracted region is set to be 0.

*Step3.* Update *B* from *Step* 1 & 2, and repeat *Step* 1 & 2 until the number of volume pixels of any connected region in *B* is less than 100.

Note that, the erosion threshold *T* is set to be 9 in the first erosion operation and continuously increase with a step of 0.027 for subsequent erosions; the parameter, i.e. the valid number of volume pixels in the extracted region, can be determined by the smallest size of the neuron, the size of volume pixels and the largest pre-defined number of neurons in the extracted region, and automatically estimated by NeuroGPS.

For simplification during subsequent processing, the binarized and original signals with respect to the extracted sub-region were completely embedded into a cuboid region, as remarked by *B _{L}* and

For the given binarized signal *B _{L}*and the extracted seeds, by introducing L1 minimization, we design the optimization problem (4). Its optimal solutions can be obtained by using the algorithm described in Methods. According to the optimal solutions, the valid positions were identified.

In reality, it is unavoidable that using two sphere functions to approach some special neuronal somas is superior to using one sphere function. Based on this consideration, we take the valid position merging as a part of our method. If the distance between two valid positions is less than 70% of the sum of radius of these two positions, we merge these two positions to one position, otherwise, keep it unchanged. At last, the merging or unmerging positions are regarded as the recognized neuronal positions.

Here, we must point out that all the parameters involved in entire image analysis are only determined by two predefined parameters, the size of volume pixels, and the minimum radius of neuronal soma. With these two parameters, the soma locations can be automatically estimated by our NeuroGPS. In our experimental data sets, without specification, the size of volume pixels is 1.2 × 1.2 × 2.4 μm^{3} and an estimated value of the minimum radius is 3 μm for neurons without complex morphology and 3.6 μm for those with complex morphology.

The localization performance was measured using the false-positive rate, the true positive rate and the localization precision. The false-positive rate is defined as the ratio of false-positive positions to recognized positions found by the algorithm. The true positive rate is defined as the ratio of real positive positions from recognized positions to manual positions (true positions). A recognized position is defined as a true positive position providing that the distance between the recognized and true positions is less than 4.8 μm, and false-positive position otherwise.

S.Z. and H.G. conceived the project. S.Z. and T.Q. design the model, and wrote the manuscript. T.Z., S.Z. and Q.L. design the imaging system, H.G., Z.Y. and T.Z. performed sample preparation, data acquisition and image experiments, T.Q. and H.Z. developed the algorithm and software, S.L., J.L., W.D. and H.G. performed the image analysis and processing.

We thank members of Britton Chance Center for Biomedical Photonics for comments and advice. We thank Prof. Molin Ge for helpful guidance in compressive sensing, and anonymous reviewer for suggestion about L1 minimization which help to clear the concept of this paper. This work is supported by the National Nature Science Foundation of China (81127002, 61121004, and 30925013) and 985 project.

- Helmstaedter M. & Mitra P. P. Computational methods and challenges for large-scale circuit mapping. Curr. Opin. Neurobiol. 22, 162–169 (2012). [PMC free article] [PubMed]
- Lichtman J. W. & Denk W. The big and the small: challenges of imaging the brain's circuits. Science 334, 618–622 (2011). [PubMed]
- Meijering E. Neuron tracing in perspective. Cytometry A 77, 693–704 (2010). [PubMed]
- Lu J. Neuronal tracing for connectomic studies. Neuroinformatics 9, 159–166 (2011). [PubMed]
- Lee P. C., Chuang C. C., Chiang A. S. & Ching Y. T. High-throughput Computer Method for 3D Neuronal Structure Reconstruction from the Image Stack of the Drosophila Brain and Its Applications. PLoS Comput. Biol. 8, e1002658 (2012). [PMC free article] [PubMed]
- Peng H., Ruan Z., Long F., Simpson J. H. & Myers E. W. V3D enables real-time 3D visualization and quantitative analysis of large-scale biological image data sets. Nat. Biotechnol. 28, 348–353 (2010). [PMC free article] [PubMed]
- Bas E. & Erdogmus D. Principal Curves as Skeletons of Tubular Objects. Neuroinformatics 9, 181–191 (2011). [PubMed]
- Zhao T.
*et al.*Automated reconstruction of neuronal morphology based on local geometrical and global structural models. Neuroinformatics 9, 247–261 (2011). [PMC free article] [PubMed] - Wang Y., Narayanaswamy A., Tsai C. L. & Roysam B. A broadly applicable 3-D neuron tracing method based on open-curve snake. Neuroinformatics 9, 193–217 (2011). [PubMed]
- Shen Q.
*et al.*Adult SVZ stem cells lie in a vascular niche: a quantitative analysis of niche cell-cell interactions. Cell Stem Cell 3, 289–300 (2008). [PMC free article] [PubMed] - Calabrese C.
*et al.*A perivascular niche for brain tumor stem cells. Cancer Cell 11, 69–82(2007). [PubMed] - Tsai P. S.
*et al.*Correlations of neuronal and microvascular densities in murine cortex revealed by direct counting and colocalization of nuclei and vessels. J. Neurosci. 29, 14553–14570 (2009). [PubMed] - Li A.
*et al.*Micro-optical sectioning tomography to obtain a high-resolution atlas of the mouse brain. Science 330, 1404–1408 (2010). [PubMed] - Ragan T.
*et al.*Serial two-photon tomography for automated ex vivo mouse brain imaging. Nat. Methods 9, 255–258 (2012). [PMC free article] [PubMed] - Gong H.
*et al.*Continuously Tracing Brain-wide Long-distance Axonal Projections in Mice at One-micron Voxel Resolution. NeuroImage,**in press**(2013). [PubMed] - Silvestri L., Bria A., Sacconi L., Iannello G. & Pavone F. Confocal light sheet microscopy: micron-scale neuroanatomy of the entire mouse brain. Opt. Express 20, 20582–98 (2012). [PubMed]
- Long F., Peng H., Liu X., Kim S. K. & Myers E.
A 3D digital atlas of
*C. elegans*and its application to single-cell analyses. Nat. Methods 6, 667–672(2009). [PMC free article] [PubMed] - Ancin H.
*et al.*Advances in automated 3-D image analysis of cell populations imaged by confocal microscopy. Cytometry 25, 221–234 (1998). [PubMed] - Lin G.
*et al.*A hybrid 3D watershed algorithm incorporating gradient cues and object models for automatic segmentation of nuclei in confocal image stacks. Cytometry A 56, 23–36 (2003). [PubMed] - Wahlby C., Sintorn I. M., Erlandsson F., Borgefors G. & Bengtsson E. Combining intensity, edge and shape information for 2D and 3D segmentation of cell nuclei in tissue sections. J. Microsc. 215, 67–76 (2004). [PubMed]
- Chawla M. K.
*et al.*3D-catFISH: a system for automated quantitative three dimensional compartmental analyses of temporal gene transcription activity imaged by fluorescence in situ hybridization. J. Neurosc. Methods 139, 13–24 (2004). [PubMed] - Li G.
*et al.*3D cell nuclei segmentation based on gradient flow tracking. BMC Cell Boil. 8, 2064921 (2007). [PMC free article] [PubMed] - Liu T.
*et al.*An automated method for cell detection in zebrafish. Neuroinformatics 6, 5–21 (2008). [PubMed] - Bashar M. K., Komatsu K., Fujimori T. & Kobayashi T. J. Automatic Extraction of Nuclei Centroids of Mouse Embryonic Cells from Fluorescence Microscopy Images. PloS One 7, e35550 (2012). [PMC free article] [PubMed]
- Al-Kofahi Y., Lassoued W., Lee W. & Roysam B. Improved automatic detection and segmentation of cell nuclei in histopathology images. IEEE Trans. Biomed. Eng. 57, 841–852 (2010). [PubMed]
- Indhumathi C., Cai Y., Guan Y. & Opas M. An automatic segmentation algorithm for 3D cell cluster splitting using volumetric confocal images. J. Microsc. 243, 60–76 (2012). [PubMed]
- Chinta R. & Wasser M. Three-dimensional segmentation of nuclei and mitotic chromosomes for the study of cell divisions in live Drosophila embryos. Cytometry A. 81, 52–64 (2012). [PubMed]
- Qi X., Xing F., Foran D. J. & Yang L. Robust segmentation of overlapping cells in histopathology specimens using parallel seed detection and repulsive level set. IEEE Trans. Biomed. Eng. 59, 754–765 (2012). [PubMed]
- Wienert S.
*et al.*Detection and Segmentation of Cell Nuclei in Virtual Microscopy Images: A Minimum-Model Approach. Sci. Rep. 2, 00503 (2012). [PMC free article] [PubMed] - Bjornsson C. S.
*et al.*Associative image analysis: a method for automated quantification of 3D multi-parameter images of brain tissue. J. Neurosc. Methods 170, 165–178 (2008). [PMC free article] [PubMed] - Donoho D. L. & Elad, M. Optimally sparse representation in general (nonorthogonal) dictionaries via 1 minimization. Proc. Nat. Acad. Sci. USA 100, 2197–2202 (2003). [PubMed]
- Bates D. M. & Watts D. G. Nonlinear Regression and Its Applications. New York: Wiley, (1988).
- Candes E. J., Romberg J. & Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory, 52, 489–509 (2006).
- Candes E. J., Wakin M. B. & Boyd S. P. Enhancing sparsity by reweighted L1 minimization. J. Fourier Anal. Appl. 14, 877–905 (2008).
- Figueiredo M. A. T., Nowak R. D. & Wright S. J. Gradient projection for sparse reconstruction: Application to compressive sensing and other inverse problems. IEEE J. Sel. Top. Signal Process 1, 586–597 (2007).
- Berglund A. J., McMahon M. D., McClelland J. J. & Liddle J. A. Fast, bias-free algorithm for tracking single particles with variable size and shape. Opt. Express 16, 14064–14075 (2008). [PubMed]
- Choromanska A., Chang S. F. & Yuste R. Automatic reconstruction of neural morphologies with multi-scale tracking. Front. Neural Circuits 6, 00025 (2012). [PMC free article] [PubMed]
- Senft S. L. A brief history of neuronal reconstruction. Neuroinformatics 9, 119–128 (2011). [PubMed]

Articles from Scientific Reports are provided here courtesy of **Nature Publishing Group**

PubMed Central Canada is a service of the Canadian Institutes of Health Research (CIHR) working in partnership with the National Research Council's Canada Institute for Scientific and Technical Information in cooperation with the National Center for Biotechnology Information at the U.S. National Library of Medicine(NCBI/NLM). It includes content provided to the PubMed Central International archive by participating publishers. |