缺血性中风病变细分挑战（Isles 2022）为研究人员提供了一个平台，可以将其解决方案与3D MRI的缺血性中风区域进行比较。在这项工作中，我们描述了我们对2022分段任务的解决方案。我们将所有图像重新样本为一个共同的分辨率，使用两种输入MRI模式（DWI和ADC），并使用MONAI的Train Segresnet语义分割网络。最终提交是15个模型的合奏（来自3倍交叉验证的3次运行）。我们的解决方案（NVAUTO团队名称）在骰子度量标准（0.824）和总排名第2（基于合并的度量排名）方面获得了最高位置。

头颈肿瘤分割挑战（Hecktor）2022为研究人员提供了一个平台，可以将其解决方案与3D CT和PET图像的肿瘤和淋巴结分割。在这项工作中，我们描述了针对Hecktor 2022分割任务的解决方案。我们将所有图像重新样本为共同的分辨率，在头颈部和颈部区域周围的作物，并从Monai训练Segresnet语义分割网络。我们使用5倍的交叉验证来选择最佳模型检查点。最终提交是3次运行中的15个型号的合奏。我们的解决方案（NVAUTO团队名称）以0.78802的汇总骰子得分在Hecktor22挑战排行榜上获得第一名。

颅内出血分割挑战（实例2022）为研究人员提供了一个平台，以将其解决方案与3D CTS的出血中风区域进行分割。在这项工作中，我们将解决方案描述为实例2022。我们使用2D分割网络，来自Monai的Segresnet，在不重采样的情况下操作切片。最终提交是18个模型的合奏。我们的解决方案（NVAUTO团队名称）在骰子度量标准（0.721）和总排名2方面获得了最高位置。

从MRI和X射线等医学图像中自动检测的自动异常可显着减少人类在疾病诊断方面的努力。由于建模异常的复杂性以及领域专家（例如放射科医生）的高度手动注释成本，因此当前医学成像文献中的典型技术仅着重于从健康对象中得出诊断模型，假设该模型将检测到图像，来自患者作为异常值。但是，在许多实际情况下，与健康和患病患者混合在一起的未注释的数据集很丰富。因此，本文提出了一个研究问题，即如何通过（1）（1）（1）（2）（2）文献中使用的一组健康图像来改善无监督的异常检测。为了回答这个问题，我们提出了一种新型的单向图像到图像翻译方法的Healthygan，该方法学会了将图像从混合数据集中转换为仅健康图像。作为一方面的Healthygan，Healthygan放宽了现有未配对的图像到图像翻译方法的循环一致性的要求，这对于混合的未注释数据是无法实现的。一旦学习了翻译，我们通过减去其翻译输出来为任何给定图像生成差异图。差异图中显着响应的区域对应于潜在异常（如果有）。我们的Healthygan在两个公开可用的数据集上优于传统的最先进方法：Covid-19和NIH Chestx-Ray14，以及从Mayo Clinic收集的一个机构数据集。该实施可在https://github.com/mahfuzmohammad/healthygan上公开获得。

深度神经网络的可解释性方法主要集中于类得分相对于原始或扰动输入的敏感性，通常使用实际或修改的梯度测量。某些方法还使用模型不足的方法来理解每个预测背后的基本原理。在本文中，我们争论并证明了模型参数空间相对于输入的局部几何形状也可以有益于改善事后解释。为了实现这一目标，我们引入了一种称为“几何引导的集成梯度”的可解释性方法，该方法沿线性路径的梯度计算以传统上用于集成梯度方法中的方式构建。但是，我们的方法没有集成梯度信息，而是从输入的多个缩放版本中探索了模型的动态行为，并捕获了每个输入的最佳归因。我们通过广泛的实验证明，所提出的方法在主观和定量评估中的表现优于香草和综合梯度。我们还提出了“模型扰动”理智检查，以补充传统使用的“模型随机化”测试。

由于物体形状和图案（例如器官或肿瘤）的高可变性，3D医学图像的语义分割是一个具有挑战性的任务。鉴于最近在医学图像分割中深入学习的成功，已经引入了神经结构搜索（NAS）以查找高性能3D分段网络架构。但是，由于3D数据的大量计算要求和架构搜索的离散优化性质，之前的NAS方法需要很长的搜索时间或必要的连续放松，并且通常导致次优网络架构。虽然单次NAS可能会解决这些缺点，但其在分段域中的应用尚未在膨胀的多尺度多路径搜索空间中进行很好地研究。为了为医学图像分割启用一次性NAS，我们的方法名为Hypersegnas，介绍了通过结合建筑拓扑信息来帮助超级培训培训。在培训超级网络培训并在架构搜索期间引入开销时，可以删除这种超空头。我们表明，与以前的最先进的（SOTA）分割网络相比，Hypersegnas产生更好的表现和更直观的架构;此外，它可以在不同的计算限制下快速准确地找到良好的体系结构候选者。我们的方法是在医疗细分Decovaton（MSD）挑战的公共数据集上评估，并实现了SOTA表演。

多模式脑肿瘤分割挑战（BRALS）2021的另一年提供了较大的数据集，以促进脑肿瘤分割方法的合作和研究，这对于疾病分析和治疗规划是必要的。 BRATS 2021的大型数据集大小和现代GPU的出现为学习基于深度学习的方法提供了更好的机会，以学习来自数据的肿瘤表示。在这项工作中，我们维护了一个基于编码器解码器的分段网络，但专注于网络培训过程的修改，从而最大限度地减少扰动下的冗余。鉴于培训的网络，我们进一步介绍了基于置信的组合技术，以进一步提高性能。我们评估了Brats 2021验证板上的方法，并分别为增强肿瘤核心，肿瘤核心和全肿瘤的0.8600,0.8868和0.9265平均骰子。我们的团队（NVAUTO）提交是在ET和TC分数方面的最高表演，并且在WT分数方面的十大表演团队内。

Pneumonia, a respiratory infection brought on by bacteria or viruses, affects a large number of people, especially in developing and impoverished countries where high levels of pollution, unclean living conditions, and overcrowding are frequently observed, along with insufficient medical infrastructure. Pleural effusion, a condition in which fluids fill the lung and complicate breathing, is brought on by pneumonia. Early detection of pneumonia is essential for ensuring curative care and boosting survival rates. The approach most usually used to diagnose pneumonia is chest X-ray imaging. The purpose of this work is to develop a method for the automatic diagnosis of bacterial and viral pneumonia in digital x-ray pictures. This article first presents the authors' technique, and then gives a comprehensive report on recent developments in the field of reliable diagnosis of pneumonia. In this study, here tuned a state-of-the-art deep convolutional neural network to classify plant diseases based on images and tested its performance. Deep learning architecture is compared empirically. VGG19, ResNet with 152v2, Resnext101, Seresnet152, Mobilenettv2, and DenseNet with 201 layers are among the architectures tested. Experiment data consists of two groups, sick and healthy X-ray pictures. To take appropriate action against plant diseases as soon as possible, rapid disease identification models are preferred. DenseNet201 has shown no overfitting or performance degradation in our experiments, and its accuracy tends to increase as the number of epochs increases. Further, DenseNet201 achieves state-of-the-art performance with a significantly a smaller number of parameters and within a reasonable computing time. This architecture outperforms the competition in terms of testing accuracy, scoring 95%. Each architecture was trained using Keras, using Theano as the backend.

Pruning refers to the elimination of trivial weights from neural networks. The sub-networks within an overparameterized model produced after pruning are often called Lottery tickets. This research aims to generate winning lottery tickets from a set of lottery tickets that can achieve similar accuracy to the original unpruned network. We introduce a novel winning ticket called Cyclic Overlapping Lottery Ticket (COLT) by data splitting and cyclic retraining of the pruned network from scratch. We apply a cyclic pruning algorithm that keeps only the overlapping weights of different pruned models trained on different data segments. Our results demonstrate that COLT can achieve similar accuracies (obtained by the unpruned model) while maintaining high sparsities. We show that the accuracy of COLT is on par with the winning tickets of Lottery Ticket Hypothesis (LTH) and, at times, is better. Moreover, COLTs can be generated using fewer iterations than tickets generated by the popular Iterative Magnitude Pruning (IMP) method. In addition, we also notice COLTs generated on large datasets can be transferred to small ones without compromising performance, demonstrating its generalizing capability. We conduct all our experiments on Cifar-10, Cifar-100 & TinyImageNet datasets and report superior performance than the state-of-the-art methods.

The task of locating and classifying different types of vehicles has become a vital element in numerous applications of automation and intelligent systems ranging from traffic surveillance to vehicle identification and many more. In recent times, Deep Learning models have been dominating the field of vehicle detection. Yet, Bangladeshi vehicle detection has remained a relatively unexplored area. One of the main goals of vehicle detection is its real-time application, where `You Only Look Once' (YOLO) models have proven to be the most effective architecture. In this work, intending to find the best-suited YOLO architecture for fast and accurate vehicle detection from traffic images in Bangladesh, we have conducted a performance analysis of different variants of the YOLO-based architectures such as YOLOV3, YOLOV5s, and YOLOV5x. The models were trained on a dataset containing 7390 images belonging to 21 types of vehicles comprising samples from the DhakaAI dataset, the Poribohon-BD dataset, and our self-collected images. After thorough quantitative and qualitative analysis, we found the YOLOV5x variant to be the best-suited model, performing better than YOLOv3 and YOLOv5s models respectively by 7 & 4 percent in mAP, and 12 & 8.5 percent in terms of Accuracy.