心脏磁共振成像通常用于评估心脏解剖结构和功能。左心室血池和左心室心肌的描述对于诊断心脏疾病很重要。不幸的是，在CMR采集程序中，患者的运动可能会导致最终图像中出现的运动伪像。这种伪像降低了CMR图像的诊断质量和对程序的重做。在本文中，我们提出了一个多任务SWIN UNET变压器网络，用于在CMRXMOTION挑战中同时解决两个任务：CMR分割和运动伪像分类。我们将细分和分类作为多任务学习方法，使我们能够确定CMR的诊断质量并同时生成口罩。 CMR图像分为三个诊断质量类别，而所有具有非严重运动伪像的样本都被分割。使用5倍交叉验证训练的五个网络的合奏实现了骰子系数为0.871的分割性能，分类精度为0.595。

脊柱裂（SB）是在妊娠早期阶段出现的出生缺陷，脊髓周围的脊柱闭合不完全。对仍在怀孕子宫中的胎儿进行的对胎儿镜脊柱叶片修复的兴趣日益增加，这促使需要进行适当的训练。此类过程的学习曲线非常陡峭，需要出色的程序技能。基于计算机的虚拟现实（VR）模拟系统提供了一个安全，成本效益且可配置的培训环境，而没有道德和患者安全问题。但是，据我们所知，目前尚无用于胎儿镜SB修复程序的商业或实验VR培训模拟系统。在本文中，我们为SB-Repair的核心手动技能培训提供了新颖的VR模拟器。通过获得14位临床医生的主观反馈（面部和内容有效性），进行了初始的模拟现实主义验证研究。总体模拟现实主义平均在5分李克特量表上标记为4.07（1-非常不现实，5-非常现实）。它作为SB-REPAIR以及学习基本腹腔镜技能的有用性分别标记为4.63和4.80。这些结果表明，胎儿镜手术的VR模拟可能会导致外科训练，而不会使胎儿及其母亲处于危险之中。它还可以促进更广泛的胎儿镜手术适应，以代替更具侵入性的开放性胎儿手术。

胎儿镜检查激光​​光凝是一种广泛采用的方法，用于治疗双胞胎输血综合征（TTTS）。该过程涉及光凝病理吻合术以调节双胞胎之间的血液交换。由于观点有限，胎儿镜的可操作性差，可见性差和照明的可变性，因此该程序尤其具有挑战性。这些挑战可能导致手术时间增加和消融不完全。计算机辅助干预措施（CAI）可以通过识别场景中的关键结构并通过视频马赛克来扩展胎儿镜观景领域，从而为外科医生提供决策支持和背景意识。由于缺乏设计，开发和测试CAI算法的高质量数据，该领域的研究受到了阻碍。通过作为MICCAI2021内窥镜视觉挑战组织的胎儿镜胎盘胎盘分割和注册（FETREG2021）挑战，我们发布了第一个Largescale Multencentre TTTS数据集，用于开发广义和可靠的语义分割和视频摩擦质量algorithms。对于这一挑战，我们发布了一个2060张图像的数据集，该数据集是从18个体内TTTS胎儿镜检查程序和18个简短视频剪辑的船只，工具，胎儿和背景类别的像素通道。七个团队参与了这一挑战，他们的模型性能在一个看不见的测试数据集中评估了658个从6个胎儿镜程序和6个短剪辑的图像的图像。这项挑战为创建通用解决方案提供了用于胎儿镜面场景的理解和摩西式解决方案的机会。在本文中，我们介绍了FETREG2021挑战的发现，以及报告TTTS胎儿镜检查中CAI的详细文献综述。通过这一挑战，它的分析和多中心胎儿镜数据的发布，我们为该领域的未来研究提供了基准。

联合学习可以从多中心数据中构建共享模型，同时在本地存储培训数据以进行隐私。在本文中，我们提出了使用联合学习方法进行基于深度学习的模型的评估（称为CXR-FL），用于胸部X射线图像分析。我们研究了联合学习参数对中央模型性能的影响。此外，我们表明，与完整图像相比，如果对肺部分割的感兴趣区域进行培训，则分类模型的性能较差。但是，将分类模型的重点放在肺区域上可能会改善推理期间的病理解释性。我们还发现联合学习有助于维持模型的普遍性。预先训练的权重和代码可在（https://github.com/sanoscience/cxr-fl）上公开获得。

在对抗Covid-19的斗争中，对人们的生活产生灾难性影响的关键步骤是对患有严重COVID-19症状的诊所中出现的患者进行有效筛查。胸部射线照相是有前途的筛查方法之一。许多研究报告说，使用深度学习准确地检测到胸部X射线射线的Covid-19。对许多已发表的方法的严重局限性是对解释深度学习模型做出的决定的不足。使用可解释的人工智能方法，我们证明模型决策可能依赖于混杂因素而不是医学病理学。在分析了在胸部X射线图像上发现的潜在混杂因素后，我们提出了一种新颖的方法来最大程度地减少其负面影响。我们表明，我们所提出的方法比以前试图应对混杂因素（例如ECG铅的胸部X射线铅）的尝试更强大，这些因素通常会影响模型分类决策。除了强大之外，我们的方法还达到了与最先进的结果相当的结果。源代码和预训练的权重可在（https://github.com/tomek1911/pother）上公开获得。

Graph Neural Networks (GNNs) are a family of graph networks inspired by mechanisms existing between nodes on a graph. In recent years there has been an increased interest in GNN and their derivatives, i.e., Graph Attention Networks (GAT), Graph Convolutional Networks (GCN), and Graph Recurrent Networks (GRN). An increase in their usability in computer vision is also observed. The number of GNN applications in this field continues to expand; it includes video analysis and understanding, action and behavior recognition, computational photography, image and video synthesis from zero or few shots, and many more. This contribution aims to collect papers published about GNN-based approaches towards computer vision. They are described and summarized from three perspectives. Firstly, we investigate the architectures of Graph Neural Networks and their derivatives used in this area to provide accurate and explainable recommendations for the ensuing investigations. As for the other aspect, we also present datasets used in these works. Finally, using graph analysis, we also examine relations between GNN-based studies in computer vision and potential sources of inspiration identified outside of this field.

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

Sparse modelling or model selection with categorical data is challenging even for a moderate number of variables, because one parameter is roughly needed to encode one category or level. The Group Lasso is a well known efficient algorithm for selection continuous or categorical variables, but all estimates related to a selected factor usually differ. Therefore, a fitted model may not be sparse, which makes the model interpretation difficult. To obtain a sparse solution of the Group Lasso we propose the following two-step procedure: first, we reduce data dimensionality using the Group Lasso; then to choose the final model we use an information criterion on a small family of models prepared by clustering levels of individual factors. We investigate selection correctness of the algorithm in a sparse high-dimensional scenario. We also test our method on synthetic as well as real datasets and show that it performs better than the state of the art algorithms with respect to the prediction accuracy or model dimension.

我们提出了三种新型的修剪技术，以提高推理意识到的可区分神经结构搜索（DNAS）的成本和结果。首先，我们介绍了DNA的随机双路构建块，它可以通过内存和计算复杂性在内部隐藏尺寸上进行搜索。其次，我们在搜索过程中提出了一种在超级网的随机层中修剪块的算法。第三，我们描述了一种在搜索过程中修剪不必要的随机层的新技术。由搜索产生的优化模型称为Prunet，并在Imagenet Top-1图像分类精度的推理潜伏期中为NVIDIA V100建立了新的最先进的Pareto边界。将Prunet作为骨架还优于COCO对象检测任务的GPUNET和EFIDENENET，相对于平均平均精度（MAP）。

通过磁共振成像（MRI）评估肿瘤负担对于评估胶质母细胞瘤的治疗反应至关重要。由于疾病的高异质性和复杂性，该评估的性能很复杂，并且与高变异性相关。在这项工作中，我们解决了这个问题，并提出了一条深度学习管道，用于对胶质母细胞瘤患者进行全自动的端到端分析。我们的方法同时确定了肿瘤的子区域，包括第一步的肿瘤，周围肿瘤和手术腔，然后计算出遵循神经符号学（RANO）标准的当前响应评估的体积和双相测量。此外，我们引入了严格的手动注释过程，其随后是人类专家描绘肿瘤子区域的，并捕获其分割的信心，后来在训练深度学习模型时被使用。我们广泛的实验研究的结果超过了760次术前和504例从公共数据库获得的神经胶质瘤后患者（2021 - 2020年在19个地点获得）和临床治疗试验（47和69个地点，可用于公共数据库（在19个地点获得）（47和69个地点）术前/术后患者，2009-2011）并以彻底的定量，定性和统计分析进行了备份，表明我们的管道在手动描述时间的一部分中对术前和术后MRI进行了准确的分割（最高20比人更快。二维和体积测量与专家放射科医生非常吻合，我们表明RANO测量并不总是足以量化肿瘤负担。