CentroidNet:轻量快速的乳腺癌Ki67细胞核中心点检测模型
摘 要
目的 Ki67分数是乳腺癌预后评估的重要指标,计算该分数的关键步骤是检测阴性与阳性癌细胞核。人工检测面临疲劳与主观差异的问题。卷积神经网络有望实现高质量、自动化的细胞核检测,然而需要病理专家为其标注细胞核。为了减轻标注的工作量,不少研究者提出以中心点标注训练卷积神经网络。然而这些方法采用过于复杂的卷积神经网络和后处理流程,未能充分提高易用性和效率、发挥卷积神经网络的质量。对此,提出CentroidNet模型,旨在提高中心点检测的质量、效率和易用性。方法 CentroidNet模型在图像上放置均匀排布的锚点,为每个锚点预测一个候选点,一部分候选点通过基于阈值的筛选策略成为预测点。本文提出最近锚点匹配策略用于生成训练标签,既保证了端到端推理,又规避了其他一对一标签匹配算法所具有的标签抖动问题。本文建议锚点间距应尽可能接近训练集答案点间最短距离的第一百分位数,并指出这样的锚点间距能够在前景标签数、坐标回归难度与效率之间取得良好的平衡。本文在设计卷积神经网络的结构时,没有采纳广为使用的U-Net或特征金字塔(feature pyramid network,FPN)中的多级上采样与旁路连接,反而提高了质量和效率。结果 本文在BCData数据集上评估CentroidNet模型的质量与效率。BCData是目前规模最大的、公开的乳腺癌Ki67癌细胞核中心点检测数据集。在质量方面,CentroidNet取得的综合F1分数为0.879 1,媲美当前的最高质量。在效率方面,CentroidNet的推理速度为12.96 ms/幅、显存占用为138.8 MB/幅,达到了当前最高的效率,远低于若干主流或最新的模型。结论 CentroidNet具有高质量、高效率和高易用性;与现有同类模型相比,进一步提高了乳腺癌Ki67细胞核中心点检测的可行性。
关键词
CentroidNet:a light-weight,fast nuclei centroid detection model for breast Ki67 scoring
Wen Ke1, Jin Xu1, An Hong1, He Jie2, Wang Jue2(1.School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China;2.Department of Pathology, The First Affiliated Hospital of University of Science and Technology of China, Hefei 230031, China) Abstract
Objective Breast cancer-prognostic Ki67 score can be as a key indicator for the proliferation rate of malignant (invasive)cells. Negative and positive nuclei detection is an essential part of Ki67 scoring. An automated algorithm for nuclei detection can alleviate the negative impact of intra/inter-observer variation and labor-intensive nuclei counting. In recent years,deep learning methods have been developing intensively in relevant to recognition tasks on pathology images in terms of their learning potentials. Deep learning-based model can learn features derived from the raw data and relieve labor-intensive annotation of training images for pathologists. To alleviate the labor cost of annotation,our research is focused on modeling Ki67 nuclei detection as the centroid detection problem. The existing centroid detection models are commonly used to convert the centroid annotation into a probability map with the same size as the input image,the centroid detection problem is thus converted to a semantic segmentation-like problem. However,a semantic segmentation model has restricted by huge computation cost due to its huge amount of convolutional layers-related decoder. Nevertheless,due to the non-deep-learning post processing on the output heatmap,the whole detection process is complicated and inefficient, and the quality of a deep learning model is required to be developed further. Our CentroidNet model is facilitated to optimize nucleus centroid detection. Method The CentroidNet consists of a fully convolutional centroid detector initiated by ResNeXt,along with the detector’s training and inference methods. The CentroidNet can place evenly spaced anchor points on the input image. Actually,the anchor points are the places where the center of the detector’s receptive field is sited on. Each anchor point-interconnected detector can predict the classification probabilities and the offset to the anchor point,which is called a candidate point as a whole. In this way,the anchor points are the niches of the candidate points. A candidate point has the highest probability and is higher than 0. 9. It is treated as predicted point. To assign labels for anchor/candidate points,we implement the“nearest anchor”strategy. This strategy can assign any annotated point to its nearest anchor point literally. Those anchor points are not assigned via any background label-assigned annotated point, whereas those classified label is“background”and label-coordinated is the anchor’s coordinate. This strategy is mutualbenefited between annotated points and anchor/candidate points. The label jittering problem can be avoided,which is often seen in current one-to-one assignment strategies. The anchors-between spacing is concerned about more. We recommend that the anchor spacing approximate the First Percentile of the minimal distance between each annotated point in the training set to its neighboring annotated points. Such spacing can balance the ratio of foreground labels,regressioncoordinated,and optimal efficiency. The CentroidNet’s detector can avoid the commonly adopted paradigm of U-Net or feature pyramid network(FPN),which involves shortcut connections and multiple upsampling layers. This lightweight detector can improve quality and efficiency. Result We evaluate the quality and efficiency of CentroidNet model on BCData,the largest publicly available dataset for centroid detection of Ki67 carcinoma nuclei in breast cancer. For quality analysis,the CentroidNet can achieve an averaged F1 score of 0. 879 1 compared to the SOTA(state of the art)score. For efficiency evaluation,the CentroidNet can achieve SOTA with an inference speed of 12. 96 ms/image and a GPU memory footprint of 138. 8 MB/image. Conclusion The CentroidNet is featured of light-weight,efficient and ease of use. It has the potentials for centroid detection of Ki67 carcinoma nuclei in breast cancer.
Keywords
|