1 Introduction
Pixelwise segmentation of objects (e.g., [26, 10, 24, 29]) and instance segmentation (e.g., [2, 11]
) are core research topics in computer vision. Recent methods use Deep Neural Networks to estimate segmentation masks. Since the number of instances is not known apriori, researchers either resort to object proposals first for detection
[21] and later for segmentation [11], or enumerate instances with a Recurrent Neural Network
[23]. Both solutions require training of large models and complex training pipelines. In many applications, especially in the medical field, one is not interested in segmenting every instance of an object, but rather finding the distribution of object sizes in the image. Detecting object sizes in images is useful for a broad range of applications as it can be associated with physical properties like mass, area, etc. We target challenging tasks for which all objects have extremely similar appearance, and in which instance segmentation is challenging. Our first application is the prediction of size distributions of fly larvae colonies for organic waste decomposition [5, 9]. Our second application aims at estimating tumor growth directly from medical images.Typically, such tasks would be approached via explicit, pixelaccurate instance segmentation with a method like Mask RCNN [11]
. These methods can be used to predict the size of each individual object using the estimated mask. However, performance (for size estimation) decreases in case of overlapping objects and partial occlusions because only visible pixels can be classified and thus enter into the size estimation task. Furthermore, it is well known that instance segmentation methods cannot cope with large object overlap, mainly due to the NonMaximum Suppression step, missing many objects in the process. For those tasks, the size of instance segmentation models is disproportionate with respect to the complexity of the problem. In this paper, we advocate to learn and predict a statistical summary of object sizes and counts directly in the form of histograms. We show that our approach significantly reduces the parameter overhead needed for explicit, pixelaccurate instance segmentation, while being more accurate. Our
contribution is threefold:
We propose a novel deep learning architecture (HistoNet), which counts and predicts the size distribution of objects directly from an input image, showing superior results with respect to stateoftheart instance based segmentation methods while having 85% less parameters.

We present a new data set^{1}^{1}1https://github.com/kishansharma3012/FlyLarvaeDataset of pixelwise instance labeled fly larvae and the challenge of predicting size histograms for these small similarlylooking objects.

We further evaluate performance of HistoNet on a public cancer cell data set and demonstrate that it achieves good results for this different image modality and application domain.
2 Related Work
Counting and density estimation. Counting objects in images has been a focal point in computer vision research for several years. Various approaches of the predeep learning era designed bottomup image processing workflows to count objects segmented with edge detectors [25]. A downside of these approaches is their large number of hyperparameters that has to be set for each new data set. Countingbyregression methods [3, 15, 19], on the other hand, avoid directly solving the hard object detection problem but instead directly learn a mapping from the input image to the number of objects. An elegant method to estimate total object counts in images is density estimation. Lempitsky et al. [18] densely computed ScaleInvariant Feature Transform (SIFT) features for the input images and predicted density maps via regression. Fiaschi et al. [6] improved density mapping by using a regression forest. Recent works turn to Deep Learning [22] for joint semantic segmentation and density estimation, to identify and count particular tree species of subpixel size at very large scale from satellite images. Xie et. al [27] proposed a fully convolutional regression network to output a cell density map across the image to predict the total count. Similarly, [28]
used a structured regression convolutional neural network approach to detect cells. A very powerful architecture customtailored for object counting, CountCeption was introduced by Cohen et. al
[4]. It processes the image in a fully convolutional manner and predicts redundant counting instead of density mapping in order to average over errors. Its main insight is that predicting the existence or absence of an object within a receptive field is an easier task than predicting density maps. The latter is harder because in addition to predicting an object’s existence, it has to estimate how far the object is from the center of the receptive field. Due to its very redundant convolutions per image location, this architecture gives good results while being efficient to train. For many applications, object counting is not enough, as the size distribution of the objects in the scene is key to determine, e.g., malignant cell evolution. We propose an architecture that not only counts objects but also predicts their size distribution without explicit instance segmentation.Instance segmentation. An alternative way to predict total object count is to perform explicit object detection or instance segmentation, known as countingbydetection. The last few years have seen considerable progress in object detectors [7, 21], as well as instance segmentation methods based on Deep Neural Networks [11]. An advantage of these approaches is that they also provide object size as a byproduct. This can be approximated by the area of the bounding box enclosing the objects or better estimated if one extracts instance masks for all objects. To the best of our knowledge, this strategy is the most accurate and robust today to predict object count and size, thus we use it as the baseline for this work. A clear downside of the size and countingbydetection strategy is that we solve a much harder problem, that of instance segmentation, in order to predict total counts and object size distributions. This means using large models and complex training schemes to obtain pixelaccurate instance delineation, even though this information is not needed as output. Additionally, overlapping instances and occluded objects often lead to errors. Here, we propose to directly learn to predict size distributions without explicit instance segmentation or object detection, with higher accuracy and a leaner architecture having 85% less parameters compared to Mask RCNN [11].
3 HistoNet
Our method directly predicts global data statistics given an image, namely, total object count in cluttered scenes and object size distribution via histogram prediction. More formally, given an input image , our aim is to predict a redundant count map and size histogram . Towards this end, we present a datadriven model, HistoNet. Its architecture is shown in Fig. 1, while a notation summary for the following equations is given in Table 1.
Symbol  Description 

I  Input Image 
Predicted Count Map  
Target Count Map  
Predicted Histogram  
Target Histogram  
Probability Distribution of Histogram H  
Pixel Wise Count Map Loss  
weighted L1 Histogram Loss  
Weights assigned for  
KLDiv Histogram Loss 
Network Architecture.
As shown in Fig. 1, HistoNet consists of two branches, one for predicting the object count and the other for histogram prediction, which estimates the size distribution of object instances. HistoNet takes an image of size as input and predicts a redundant count map of size in a fully convolutional manner (lower branch). Note that neither upsampling nor deconvolutions are computed for predicting a map at a larger size than the input image. As in [4], HistoNet
zeropads the input image in its first layer and we build a size distribution predictor network on top of it. Two green boxes in Fig.
1 at the same level in the lower branch of the network represent the application of two kernels on the same input and concatenation of their outputs to handle variations in object size. For size histogram prediction, the upper branch uses ResNet50 [12] modules on top of the first layer of the lower branch. Instead of a standard fully connected layer, we add two convolutional layers with kernels of size and . These convolutional layers are followed by two fully connected layers interspersed with dropout layers. Our final output is a histogram of object sizes .Loss function.
To train our multitask prediction network, we impose losses on count prediction as well as on histogram distribution prediction. The count loss is L1 as in [4]:
(1) 
where is the predicted count map, is target count map and is L1 norm.
We formulate a KLDivergence loss and a weighted L1 loss for size histogram prediction. The KLDivergence loss measures the degree of dissimilarity between the predicted and ground truth distributions.
(2) 
Where and are the probability distributions of target and predicted size histogram. To capture the scale of the histogram, we found L1loss to perform best. Moreover, a weighted L1loss, where weights
are assigned according to the normalized center values of the respective bins, further improves results. Our intuition is that larger objects should incur higher penalty than smaller ones if missed. For calculating weights, we (i) compute the bin centers, (ii) sum over the bin center vector, and (iii) divide with the total sum such that the overall sum across all bins is one
(3) 
where is predicted histogram and is target histogram. Our object sizeweighted L1loss in combination with the KLDivergence loss are eventually mutually reinforcing to capture shape and scale of the histogram. We jointly train our network on this multitask loss and minimize for count map and histogram prediction:
(4) 
We empirically found that giving equal weight to KLloss and weighted L1loss gives best results.
3.1 Deep supervision
Directly learning finegrained 8 or 16 bin histograms can be tricky for the network. In order to help the network focus the learning on the hard cases near the bin boundaries, we propose to gradually increase histogram resolution towards the deeper layers. That is, we first learn a 2bin and 4bin histogram and later allow the network to increase the resolution to 8 and 16 bins without incurring any additional labelling cost. Towards this end, we use Deeply Supervised Nets (DSN) [17], shown to be helpful in calibrating the model at intermediate stages by enforcing direct and early supervision for both the hidden layers and the output layer. We show the Deep Supervision modules on the upper branch as trapezoids in Fig. 1. These have an effect on the early hidden layers and serve as an additional constraint to gradually force the network to split size bins into smaller intervals. Our deep supervision signal at early and middle stage of the histogram branch enforces first a split of sizes into two bins and the following one into four bins. Therefore, in addition to count map and size histogram, we predict 2bin, 4bin histograms and , respectively. To implement deep supervision, we add a stack of two convolutions and two fully connected layers to predict the 2bin histogram early in the histogram branch. The same stack is added at a later layer for the 4bin histogram. Our full model architecture with deep supervision at intermediate stages of the histogram branch is shown in Fig. 1.
For training the deeply supervised version of HistoNet we define side output losses along side our main objective function. We add KLdivergence and weighted L1 loss for 2bin and 4bin histogram predictions:
(5) 
4 Experiments
We evaluate performance of our method on three different data sets. HistoNet performance is compared to stateoftheart on our new FlyLarvae data set, which contains a high density of similarly looking objects. In addition, we present experiments on a synthetic ellipse data set where we can adjust density and object size distributions arbitrarily, in order to show the robustness of our method and its ability to predict diverse histogram shapes. Finally, we run experiments with a medical image data set to verify applicability to a very different image modality and for the specific purpose of estimating the tumor cellularity score.
We use the Adam optimizer [14] for training our models and a batch size of four images. Our network weights are initialized using Xavier initialization [8]
, and we apply classic data augmentation such as image vertical and horizontal rotation, noise addition, contrast variation and train our networks for 100 epochs.
Fly Larvae data set. We create a new dataset of soldier fly larvae, which are bred in massive quantities for sustainable, environmentally friendly organic waste decomposition [5, 9]. Fly larvae images were collected using a Sony Cyber shot DSC WX350 camera with image size . The camera is installed on a professional repro tripod to guarantee a fixed distance from camera to object for all image acquisitions. Very large numbers of larvae mingled with a lot of larvae feed lead to high object overlap and occlusions. All larvae instances are labeled pixelwise and we will make th FlyLarvae dataset publicly available upon publication of this paper.
For experiments, we sample patches of size pixels from the original images. A summary of the FlyLarvae data set is given in Tab. 2 while an example image and the corresponding instance, pixelwise label is shown in Fig. 2.
Synthetic Ellipse Dataset. As evident from Fig. 7
, the size distribution of our larvae data set follows a Gaussian distribution. In order to check whether our method really predicts different size distributions (or simply learns the Gaussian by heart), we created a synthetic data set of thin ellipses with strongly varying size distributions. We also greatly vary shape, size, and orientation of ellipses as well as the amount of overlap and occlusion. A summary of this synthetic ellipse data set is shown in Tab.
2 and an example image with its corresponding targets in Fig. 3.FlyLarvae  Synthetic Ellipse  

No. Objects  10844  135318 
Size  120.2 28.1  94.5 63.2 
Count  80.4 40.7  44.8 20.8 
Breast Cancer Cell Dataset. In order to validate applicability of HistoNet to a different image modality and image content, we are using the breast cancer cell data set [1] that was originally recorded for the BreastPathQ Challenge. It consists of 2579 image patches, and each patch is assigned a tumor cellularity score by one expert pathologist. The malignant cellularity score depends on malignant cell count and size, a task which can be tackled with the proposed HistoNet. The BreastPathQ Challenge dataset also contains a portion of images with annotated lymphocytes, malignant epithelial and normal epithelial cell nuclei. We add pixelaccurate labels to many of these images to prepare it for validating HistoNet. Three example images of this data set are shown in Fig 4.
4.1 Evaluation Measures
To evaluate object instance counts and size histogram prediction performance, we use several quantitative measures described in the following. For counting, we use the Mean Absolute Count Error (MAE
), which takes the absolute difference between predicted and target count. To quantify histogram prediction performance, we compute the Kullback–Leibler divergence
[16] (kld), the Bhattacharyya distance [13] (bhatt), the distance [20], intersection (isec):(6) 
and histogram correlation (corr):
(7) 
where and represent the mean of and histograms, respectively.
Parameter number ()  

Mask RCNN [11]  237.1 
HistoNet  30.2 
HistoNet DSN  36.5 
Method  MAE  kld  isec  corr  bhatt  

Average model 8  28.97  0.10  4.42  0.66  13.24  0.90  0.17 
Mask RCNN 8  7.84  0.64  4.31  0.72  16.37  0.77  0.25 
HistoNet 8  2.38  0.25  2.72  0.81  6.57  0.91  0.16 
HistoNetDSN 8  2.06  0.23  2.51  0.83  5.74  0.93  0.15 
Average model 16  28.97  0.17  2.46  0.64  17.12  0.84  0.22 
Mask RCNN 16  7.84  0.95  2.62  0.69  22.73  0.69  0.32 
HistoNet 16  2.28  0.26  1.74  0.76  10.03  0.86  0.21 
HistoNetDSN 16  1.99  0.25  1.70  0.77  9.8  0.86  0.21 
Method  MAE  kld  isec  corr  bhatt  

Average model 8  15.74  0.58  3.52  0.46  21.2  0.26  0.43 
Mask RCNN 8  4.02  0.50  1.67  0.75  6.01  0.75  0.22 
HistoNet 8  1.64  0.17  1.22  0.73  3.81  0.82  0.17 
HistoNetDSN 8  1.2  0.13  1.17  0.78  3.36  0.83  0.16 
Average model 16  15.74  0.70  1.89  0.43  24.03  0.27  0.48 
Mask RCNN 16  4.02  1.12  1.13  0.67  10.81  0.64  0.32 
HistoNet 16  1.45  0.47  0.87  0.68  7.19  0.71  0.27 
HistoNetDSN 16  1.09  0.24  0.85  0.69  6.70  0.74  0.25 
4.2 Quantitative Results on biological data
We evaluate HistoNet for predicting 8bin histograms and more finegrained 16bin histograms of object sizes. We benchmark HistoNet against Mask RCNN [11] as a baseline. Recall that Mask RCNN predicts pixelaccurate instance labels instead of directly outputting an object size distribution. We thus explicitly do instance segmentation and compute sizes by summing over instance pixels. We compare performance of explicit instance segmentation [11], our HistoNet and HistoNet DSN architectures on FlyLarvae (Tab. 4) and the synthetic ellipse data set (Tab. 5).
FlyLarvae Dataset. For the FlyLarvae data set, our approach reduces the distance for histogram prediction by more than 50% compared to the Mask RCNN baseline. In addition, significantly improved Kullback–Leibler divergence (kld) and weighted L1 difference between histograms () indicate that our method captures scale and shape of the histograms much better than Mask RCNN. As shown in Fig. 5, 6 our approach predicts histograms which are close to the ground truth size histograms. Mask RCNN over and underpredicts the masks of objects, and thus their size. Fig. 8 shows the histogram prediction provided by the deep supervision in the form of 2bin and 4bin histogram demonstrating that HistoNet DSN further improves over HistoNet method.
Method  Prediction Probability 

CountCeption  0.56 
HistoNet[fc 128, fc 128]  0.69 
HistoNet[fc 18, fc 18]  0.76 
HistoNet[fc 32, fc 32]  0.79 
HistoNet[fc 64, fc 64]  0.83 
Synthetic Ellipse Dataset. Since the FlyLarvae
dataset approximately follows gaussian distribution, one could assume that a model that predicts the average shape of the training set would be able to solve the task. In order to show that this is not the case, we create a synthetic ellipse dataset which covers a much higher variance of size distributions, density, and object overlaps. As depicted in the Table
5, similar trends are observed on synthetic ellipse data set fordistance and correlation between histograms. Our method is able to handle high variance in object sizes and thus showing robustness on synthetic ellipse data set. We clearly show that even if the histogram is skewed,
HistoNet is able to correctly predict its shape. We generalize to the number of objects, their size and well as their distribution of sizes. Note, that our method uses 85% less parameter as compared to MaskRCNN as shown in Tab. 3.Average model. To further test whether our model is just learning the average distribution shape of the training set, we compare to a baseline Average Model that does exactly that: it computes the average object count and size histogram of the training data and uses that as predictions for the test set. Since the FlyLarvae dataset approximately follows a Gaussian distribution, Average Model is able to capture the probability distribution of the histogram, as shown by the low kld in Tab. 4. Nonetheless, Average Model performs very poorly on all other measures, demonstrating that our HistoNet model can go beyond averaging training data distribution and count. HistoNet correctly predicts the shape and scale of the histograms. As expected, Tab. 5 shows that Average Model fails to capture the underlying distribution and scale of the synthetic ellipse dataset histogram, which has a much larger variance in object sizes and a large variety of object size histograms.
4.3 Quantitative Results on medical data
The Breast Cancer Cell Dataset depicts the cellularity score of a patch, which directly depends on the area of malignant cells. For this task, we first train our HistoNet model to predict the count map and size distribution histogram of malignant cells. Using the countmap and histogram prediction, we finetune our model to predict the cellularity score. The whole network is endtoend trainable, but due to lack of pixelwise labeled data, we use a multipart training schedule to train this network.

Stage 1: Using the additional dataset in BreastPathQ challenge, for which nuclei information is provided, we created our target redundant count map. So, we trained only the lower branch of HistoNet to predict the redundant count map.

Stage 2: We manually pixelwise labeled some images from the additional dataset, to train the upper branch of HistoNet, to learn to predict 8bin size histogram. On this small dataset, we train the whole HistoNet.

Stage 3: We use the main dataset, which has images labeled with their cellularity score, to train the remaining part of this architecture. During this training, we fix the weights learned from stage2 for HistoNet.
We compare our method with a CountCeptionbased cellularity score prediction model. To evaluate our method for cellularity score prediction, we follow the challenge rules, and use the prediction probability measure. This is calculated for each method for each reference standard (pathologist 1 and pathologist 2), then averaged to determine a final overall prediction probability value.
Our method significantly improves the cellularity score prediction over the CountCeptionbased method. This indicates that merely information about the malignant cell count is not sufficient to predict the cellularity score with good accuracy. Estimating the size distribution histogram significantly helps and improves prediction accuracy. Among the variants of HistoNet we found using two fully connected layers of size 64 to predict cellularity score performs best as shown in Tab. 6.
Ablation Study. We finally perform an ablation study to evaluate how the performance of the method changes with the amount of training data. Because of the scarcity of labeled data in biomedical applications, it is important to design methods that are lightweight and can be trained without resorting to a large number of labeled examples. As we show in Fig. 11, as the amount of training data is reduced, MaskRCNN results for kld and MAE error increase, while our approach requires less training data to achieve better results.
5 Conclusion
We have presented HistoNet, a new deep learning approach that predicts object size distributions and total counts in cluttered scenes directly from an input image. Experimental evaluation on a new FlyLarvae data set and a medical data set show superior performance compared to explicit object instance segmentation methods and datadriven methods that predict only object counts. We verify with synthetic images of strongly varying object densities and object overlap that our method can predict a diverse set of size histogram shapes. We show that directly learning and predicting object size distributions, without a detour via explicit, pixelaccurate instance segmentation, significantly improves performance. In addition, we save 85% of model parameters, which leads to a much leaner architecture that can be trained with fewer annotations. We believe that the value of direct histogram prediction goes beyond our specific use cases. In future work, we will investigate its potential to significantly speed up stateoftheart object detectors by modelling spatial priors on anchor box distributions, which is mostly done in a greedy fashion nowadays.
Acknowledgement:
The BreastPathQ Challenge data used in this research was acquired from Sunnybrook Health Sciences Centre with funding from the Canadian Cancer Society and was made available for the BreastPathQ challenge, sponsored by the SPIE, NCI/NIH, AAPM, Sunnybrook Research Institute.
References
 [1] Automatic cellularity assessment from posttreated breast surgical specimens. Cytometry. Part A, 91(11):1078–1087, 2017.

[2]
M. Bai and R. Urtasun.
Deep Watershed Transform for Instance Segmentation.
In
IEEE Conference on Computer Vision and Pattern Recognition
, pages 5221–5229, 2017.  [3] S. Cho and T. Chow. A neuralbased crowd estimation by hybrid global learning algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 29(4):535–541, 1999.
 [4] J. P. Cohen, H. Z. Lo, and Y. Bengio. Countception: Counting by fully convolutional redundant counting. ICCV Workshops, abs/1703.08710, 2017.
 [5] S. Diener, N. Solano, F. Gutiérrez, C. Zurbrügg, and K. Tockner. Biological treatment of municipal organic waste using black soldier fly larvae. Waste and Biomass Valorization, 2(4):357–363, 2011.
 [6] L. Fiaschi, U. Koethe, R. Nair, and F. A. Hamprecht. Learning to count with regression forest and structured labels. In Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012), pages 2685–2688, Nov 2012.
 [7] R. B. Girshick, J. Donahue, T. Darrell, and J. Malik. Rich feature hierarchies for accurate object detection and semantic segmentation. CoRR, abs/1311.2524, 2013.

[8]
X. Glorot and Y. Bengio.
Understanding the difficulty of training deep feedforward neural
networks.
In Y. W. Teh and M. Titterington, editors,
Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics
, volume 9 ofProceedings of Machine Learning Research
, pages 249–256, 2010.  [9] M. Gold, J. Tomberlin, S. D. S., C. Zurbrügg, and A. Mathys. Decomposition of biowaste macronutrients, microbes, and chemicals in black soldier fly larval treatment: A review. Waste and Biomass Valorization, 82:302–318, 2018.
 [10] S. Gould, J. Rodgers, D. Cohen, G. Elidan, and D. Koller. Multiclass segmentation with relative location prior. International Journal of Computer Vision, 80(3):300–316, 2008.
 [11] K. He, G. Gkioxari, P. Dollár, and R. Girshick. Mask RCNN. In IEEE International Conference on Computer Vision, pages 2980–2988, 2017.
 [12] K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learning for image recognition. CoRR, abs/1512.03385, 2015.
 [13] T. Kailath. The divergence and bhattacharyya distance measures in signal selection. IEEE Transactions on Communication Technology, 15(1):52–60, 1967.
 [14] D. Kingma and J. Ba. Adam: A Method for Stochastic Optimization. In Proceedings of the 3rd International Conference on Learning Representations, 2014.
 [15] D. Kong, D. Gray, and H. Tao. A viewpoint invariant approach for crowd counting. In 18th International Conference on Pattern Recognition, volume 3, pages 1187–1190, 2006.
 [16] S. Kullback and R. Leibler. On information and sufficiency. Annals of Mathematical Statistics, 22(1):79–86, 1951.
 [17] C. Lee, S. Xie, P. W. Gallagher, Z. Zhang, and Z. Tu. Deeplysupervised nets. In Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2015, San Diego, California, USA, May 912, 2015, 2015.
 [18] V. Lempitsky and A. Zisserman. Learning to count objects in images. In J. D. Lafferty, C. K. I. Williams, J. ShaweTaylor, R. S. Zemel, and A. Culotta, editors, Advances in Neural Information Processing Systems 23, pages 1324–1332. Curran Associates, Inc., 2010.
 [19] A. Marana, S. Velastin, L. da F. Costa, and R. Lotufo. Estimation of crowd density using image processing. pages 11/1 – 11/8, 04 1997.
 [20] F. Nielsen and R. Nock. On the chi square and higherorder chi distances for approximating fdivergences. IEEE Signal Processing Letters, 21(1):10–13, 2014.
 [21] S. Ren, K. He, R. B. Girshick, and J. Sun. Faster RCNN: towards realtime object detection with region proposal networks. CoRR, abs/1506.01497, 2015.
 [22] A. Rodriguez and J. Wegner. Counting the uncountable: deep semantic density estimation from Space. In German Conference on Pattern Recognition, LNCS 11269, pages 351–362, 2018.
 [23] B. RomeraParedes and P. H. S. Torr. Recurrent instance segmentation. In ECCV, pages 312–329. Springer, 2016.
 [24] O. Ronneberger, P. Fischer, and T. Brox. Unet: Convolutional networks for biomedical image segmentation. In Medical Image Computing and ComputerAssisted Intervention – MICCAI, Lecture Notes in Computer Science, volume 9351, pages 234–241. Springer International Publishing, 2015.
 [25] M. Sezgin and B. Sankur. Survey over image thresholding techniques and quantitative performance evaluation. Journal of Electronic Imaging, 13(1):146 – 165 – 20, 2004.
 [26] J. Shotton, J. Winn, C. Rother, and A. Criminisi. TextonBoost: Joint Appearance, Shape and Context Modeling for Multiclass Object Recognition and Segmentation. In European Conference on Computer Vision, pages 1–15, 2006.
 [27] W. Xie, J. A. Noble, and A. Zisserman. Microscopy cell counting with fully convolutional regression networks. In MICCAI 1st Workshop on Deep Learning in Medical Image Analysis, 2015.
 [28] Y. Xie, F. Xing, X. Kong, H. Su, and L. Yang. Beyond classification: Structured regression for robust cell detection using convolutional neural network. In N. Navab, J. Hornegger, W. M. Wells, and A. F. Frangi, editors, Medical Image Computing and ComputerAssisted Intervention – MICCAI 2015, pages 358–365, Cham, 2015. Springer International Publishing.
 [29] H. Zhao, J. Shi, X. Qi, X. Wang, and J. Jia. Pyramid scene parsing network. In IEEE Conference on Computer Vision and Pattern Recognition, pages 2881–2890, 2017.
Comments
There are no comments yet.