论文标题

通过深度学习的数字乳房X线照片分割胸大肌肌肉

On segmentation of pectoralis muscle in digital mammograms by means of deep learning

论文作者

Soleimani, Hossein, Michailovich, Oleg V.

论文摘要

长期以来,计算机辅助诊断(CAD)已成为乳房疾病放射治疗的不可或缺的一部分,促进了许多重要的临床应用,包括定量评估乳房密度和基于X射线乳房X线摄影的恶性肿瘤。这种应用的共同点是需要自动区分乳腺组织和邻近的解剖结构,后者主要由胸大肌(或胸肌)代表。尤其是在中外侧倾斜(MLO)视图中获得的乳房X线照片,由于其形态学和光度值相似,肌肉很容易与乳房解剖学的某些元素混淆。结果,在MLO乳房X线照片中自动检测和分割胸肌的问题仍然是一项艰巨的任务,仍然需要并不断寻找创新的方法。为了解决这个问题,本文基于数据驱动预测(深度学习)和基于图的图像处理的组合使用引入了两步分割策略。特别是,该方法采用了卷积神经网络(CNN),旨在预测不同空间分辨率水平的乳腺谱系边界的位置。随后,预测由算法的第二阶段使用,其中所需的边界被恢复为解决特殊设计图上最短路径问题的解决方案。所提出的算法已在三个不同的数据集(即MIAS,CBIS-DDSM和INBREAST)上进行了测试。比较分析的结果表明,与最先进的结果相当大,同时提供了无模型和全自动处理的可能性。

Computer-aided diagnosis (CAD) has long become an integral part of radiological management of breast disease, facilitating a number of important clinical applications, including quantitative assessment of breast density and early detection of malignancies based on X-ray mammography. Common to such applications is the need to automatically discriminate between breast tissue and adjacent anatomy, with the latter being predominantly represented by pectoralis major (or pectoral muscle). Especially in the case of mammograms acquired in the mediolateral oblique (MLO) view, the muscle is easily confusable with some elements of breast anatomy due to their morphological and photometric similarity. As a result, the problem of automatic detection and segmentation of pectoral muscle in MLO mammograms remains a challenging task, innovative approaches to which are still required and constantly searched for. To address this problem, the present paper introduces a two-step segmentation strategy based on a combined use of data-driven prediction (deep learning) and graph-based image processing. In particular, the proposed method employs a convolutional neural network (CNN) which is designed to predict the location of breast-pectoral boundary at different levels of spatial resolution. Subsequently, the predictions are used by the second stage of the algorithm, in which the desired boundary is recovered as a solution to the shortest path problem on a specially designed graph. The proposed algorithm has been tested on three different datasets (i.e., MIAS, CBIS-DDSm and InBreast) using a range of quantitative metrics. The results of comparative analysis show considerable improvement over state-of-the-art, while offering the possibility of model-free and fully automatic processing.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源