Deep learning (DL) has achieved a significant performance in computer vision problems, mainly in automatic feature extraction and representation. However, it is not easy to determine the best pooling method in a different case study. For instance, experts can implement the best types of pooling in image processing cases, which might not be optimal for various tasks. Thus, it is required to keep in line with the philosophy of DL. In dynamic neural network architecture, it is not practically possible to find a proper pooling technique for the layers. It is the primary reason why various pooling cannot be applied in the dynamic and multidimensional dataset. To deal with the limitations, it needs to construct an optimal pooling method as a better option than max pooling and average pooling. Therefore, we introduce a dynamic pooling layer called RunPool to train the convolutional neural network (CNN) architecture. RunPool pooling is proposed to regularize the neural network that replaces the deterministic pooling functions. In the final section, we test the proposed pooling layer to address classification problems with online social network (OSN) dataset.

In the screening of cervical cancer cells, accurate identification and segmentation of nucleus in cell images is a key part in the early diagnosis of cervical cancer. Overlapping, uneven staining, poor contrast, and other reasons present challenges to cervical nucleus segmentation. We propose a segmentation method for cervical nuclei based on a multi-scale fuzzy clustering algorithm, which segments cervical cell clump images at different scales. We adopt a novel interesting degree based on area prior to measure the interesting degree of the node. The application of these two methods not only solves the problem of selecting the categories number of the clustering algorithm but also greatly improves the nucleus recognition performance. The method is evaluated by the IBSI2014 and IBSI2015 public datasets. Experiments show that the proposed algorithm has greater advantages than the state-of-the-art cervical nucleus segmentation algorithms and accomplishes high accuracy nucleus segmentation results. Graphical abstract

The segmentation of cervical cell in liquid-based smear image plays an important role in cervical cancer detection. Despite of research for many years, it is still a challenge for the complexity of cell images such as poor contrast, cell irregularity, and overlapping. To solve this problem, a novel method is proposed based on Cell-GAN - a generative adversarial network. Firstly, the Cell-GAN is trained to learn a probability distribution of cell morphology by comparing the difference between the generated single-cell images and annotated single-cell images. Thus, the Cell-GAN has the ability to judge the integrity of a cell and treat other cellular information of a cell image, except for overlapping parts, as the background. Then, a complete single-cell image is generated by the trained Cell-GAN for each cell, which is located by a guide factor. The guide factor is constructed by a part of the cell to be segmented, such as the nucleus, to help Cell-GAN locate the cell and avoid generating a multi-cell image in the presence of overlapping, which means the contours of cells still cannot be distinguished. Finally, the segmentation line is defined by the contour of the generated cell, and the input image is cropped using the cell size information. The cropped image is reused for image generation until the area of generated cell varies within a small range.The proposed method is evaluated on the segmentation of single-cell images and overlapping cell images and obtained significant values of 94.3% DC, 7.9% FNR _o for single-cell images and 89.9% DC, 6.4% FNR _o for overlapping cell images respectively. The experimental results indicate that the proposed method can adaptively approach the boundary lines of cells to handle with different cases of overlapping in cervical cell images through what learned by the Cell-GAN. The proposed method outperforms most current methods in both segmentation accuracy and robustness.

In cervical cancer screening, accurate segmentation of cervical nucleus is a key part in the early diagnosis of cervical cancer. However, the cervical nucleus segmentation faces many great challenges owing to the overlapping cervical cells, uneven staining and poor contrast of cervical cytology smear images. In this paper, a tree domain structure and screening algorithm based on depth-first searching strategy are proposed to obtain candidate nucleus regions according to the annular clustering characteristics of nucleus depth information in cervical cytology images. Then, the candidate nucleus regions are finely segmented with an iterative level set algorithm based on adaptive radius morphological dilation. Experimental results are evaluated on the ISBI2015 public dataset. The performance of the proposed nucleus segmentation algorithm is higher than that of the state-of-the-art methods in terms of positive predictive value, negative predictive value, precision, recall of the cervical nucleus segmentation.