1. What are the contributions mentioned in the paper "High precision automated detection of labeled nuclei in gigapixel resolution image data of mouse brain" ?
In this paper, the authors describe an unsupervised, iterative algorithm, which provides a high performance for a specific problem of detecting Green Fluorescent Protein labeled nuclei in 2D scans of mouse brains.. The authors demonstrate their results on mouse brain dataset of Gigabyte resolution and compare it with manual annotation of the brains.. Quantitative comparative analysis, using manually annotated ground truth, reveals that their approach performs better on mouse brain scans than general purpose machine learning ( including deep CNN ) methods.
read more
2. What is the case of the other models that fail?
The cases where the other models fail are the complex case of strong overlap of cells, where their method gave the best result with a overall precision of 0.972 and recall of 0.961.
read more
3. What is the process used to fill the cell areas?
Phase-II sub-process fills the cell areas (detected centers with edges) detected in Phase-I with the background color on FGR to obtain a residual map (RFM).
read more
4. What is the process used to fill the areas of the RFM?
Significant areas of the RFM are then iteratively filled using Hough Transforms on convex arc segments that were identified on the outer boundary edges of the objects in the RFM.
read more


![Fig. 2: Applications of Support Vector Machines (SVM) and Faster R-CNN for the detection of GFP tagged nuclei on a mouse brain section; For clarity purposes, (a) cropped sample of the high resolution image is shown from brain section in figure 1(a); Manually annotated ground truth of cell centers for the sample shown in (a) (marked in magenta dots); Results of cell center detection using: (c) SVM [16] (Gaussian kernel) & (d) Faster R-CNN [50] on (a). Figure best viewed in color. Compared with the ground truth, the true positives are shown in blue, the false alarms in red and the false negatives in white crosses (consistently followed henceforth).](/figures/fig-2-applications-of-support-vector-machines-svm-and-faster-1ui030lm.png)
![Fig. 8: Results of application of Phase II process on the example section used in figures 3(d), 7 containing strong overlap of GFP nuclei; (a) Centers detected by Phase-I of processing on FGR, as given in figure 7(a); (b) RFM (Residual foreground map) obtained after first iteration, from (a); (c) IBC in green and OBC in blue with the missed cells marked on the binarized RFM in (b). Contours are obtained from (b) using Canny’s [10] edge detection algorithm; and (d) cell centers detected by fitting circles using Hough Transform only on convex OBCs (figure best viewed in color).](/figures/fig-8-results-of-application-of-phase-ii-process-on-the-18n5kio5.png)

