心肌的准确分割和运动估计在临床领域一直很重要，这基本上有助于下游诊断。但是，现有方法不能始终保证心肌分割的形状完整性。此外，运动估计需要在不同帧上对心肌区域的点对应关系。在本文中，我们提出了一种新型的端到端深度统计形状模型，以关注具有形状完整性和边界对应关系的心肌分割。具体而言，心肌形状由固定数量的点表示，其变化是通过主成分分析（PCA）提取的。深神经网络用于预测转换参数（仿射和变形），然后将其用于将平均点云转转到图像域。此外，引入了一个可区分的渲染层，以将掩码的监督纳入框架中，以了解更准确的点云。通过这种方式，所提出的方法能够在不进行后处理的情况下始终如一地产生解剖上合理的分割掩码。此外，预测的点云还保证了顺序图像的边界对应关系，这有助于下游任务，例如心肌的运动估计。我们进行了几项实验，以证明在几个基准数据集上提出的方法的有效性。

磁共振光谱成像（MRSI）是量化体内代谢物的必不可少的工具，但是低空间分辨率限制了其临床应用。基于深度学习的超分辨率方法为改善MRSI的空间分辨率提供了有希望的结果，但是与实验获得的高分辨率图像相比，超级分辨图像通常是模糊的。已经使用生成对抗网络进行了尝试，以提高图像视觉质量。在这项工作中，我们考虑了另一种类型的生成模型，即基于流的模型，与对抗网络相比，训练更稳定和可解释。具体而言，我们提出了一个基于流动的增强器网络，以提高超分辨率MRSI的视觉质量。与以前的基于流的模型不同，我们的增强器网络包含了来自其他图像模式（MRI）的解剖信息，并使用可学习的基础分布。此外，我们施加指南丢失和数据一致性丢失，以鼓励网络在保持高忠诚度的同时以高视觉质量生成图像。从25名高级神经胶质瘤患者获得的1H-MRSI数据集上进行的实验表明，我们的增强子网络的表现优于对抗网络和基线基线方法。我们的方法还允许视觉质量调整和不确定性估计。

在血管成形术的临床程序中（即开放式堵塞冠状动脉），在X射线荧光镜检查的指导下，需要将气球和支架等装置（例如气球和支架）放置在动脉中。由于X射线剂量的局限性，所得图像通常是嘈杂的。为了检查这些设备的正确放置，平均进行了多个运动补偿帧以增强视图。因此，设备跟踪是为此目的的必要过程。即使设计为具有易于跟踪的放射性标记的血管成形术设备，但由于标记尺寸较小和血管成形术中的复杂场景，当前的方法难以提供令人满意的结果。在本文中，我们提出了一个用于单个支架跟踪的端到端深度学习框架，该框架由三个层次模块组成：基于U-NET的Landmark检测，基于重新连接的支架提案和功能提取，以及图形卷积神经网络（GCN）基于暂时聚集空间信息和外观特征的支架跟踪。实验表明，与基于点的跟踪模型相比，我们的方法在检测中的性能明显更好。此外，其快速推理速度满足临床要求。

使用单视图2D照片仅集合，无监督的高质量多视图 - 一致的图像和3D形状一直是一个长期存在的挑战。现有的3D GAN是计算密集型的，也是没有3D-一致的近似;前者限制了所生成的图像的质量和分辨率，并且后者对多视图一致性和形状质量产生不利影响。在这项工作中，我们提高了3D GAN的计算效率和图像质量，而无需依赖这些近似。为此目的，我们介绍了一种表现力的混合明确隐式网络架构，与其他设计选择一起，不仅可以实时合成高分辨率多视图一致图像，而且还产生高质量的3D几何形状。通过解耦特征生成和神经渲染，我们的框架能够利用最先进的2D CNN生成器，例如Stylega2，并继承它们的效率和表现力。在其他实验中，我们展示了与FFHQ和AFHQ猫的最先进的3D感知合成。

从非线性系统中提取预测模型是科学机器学习中的一个中心任务。一个关键问题是现代数据驱动方法与第一个原则之间的对帐。尽管机器学习技术快速进展，但将域知识嵌入到数据驱动的模型中仍然是一个挑战。在这项工作中，我们为基于观察的非线性系统提取了一个通用学习框架，用于从非线性系统中提取预测模型。我们的框架可以容易地纳入第一个原理知识，因为它自然地模拟非线性系统作为连续时间系统。这两种都改善了提取的模型的外推功率，并减少了培训所需的数据量。此外，我们的框架还具有对观察噪声的稳健和适用性的优点，不规则采样数据。我们通过学习各种系统的预测模型来展示我们方案的有效性，包括普拉登·德隆振荡器，Lorenz系统和Kuramoto-Sivashinsky方程。对于Lorenz系统，并入不同类型的域知识，以展示数据驱动系统识别中的知识强度。

As an important variant of entity alignment (EA), multi-modal entity alignment (MMEA) aims to discover identical entities across different knowledge graphs (KGs) with multiple modalities like images. However, current MMEA algorithms all adopt KG-level modality fusion strategies but ignore modality differences among individual entities, hurting the robustness to potential noise involved in modalities (e.g., unidentifiable images and relations). In this paper we present MEAformer, a multi-modal entity alignment transformer approach for meta modality hybrid, to dynamically predict the mutual correlation coefficients among modalities for instance-level feature fusion. A modal-aware hard entity replay strategy is also proposed for addressing vague entity details. Extensive experimental results show that our model not only achieves SOTA performance on multiple training scenarios including supervised, unsupervised, iterative, and low resource, but also has limited parameters, optimistic speed, and good interpretability. Our code will be available soon.

The feasibility of collecting a large amount of expert demonstrations has inspired growing research interests in learning-to-drive settings, where models learn by imitating the driving behaviour from experts. However, exclusively relying on imitation can limit agents' generalisability to novel scenarios that are outside the support of the training data. In this paper, we address this challenge by factorising the driving task, based on the intuition that modular architectures are more generalisable and more robust to changes in the environment compared to monolithic, end-to-end frameworks. Specifically, we draw inspiration from the trajectory forecasting community and reformulate the learning-to-drive task as obstacle-aware perception and grounding, distribution-aware goal prediction, and model-based planning. Firstly, we train the obstacle-aware perception module to extract salient representation of the visual context. Then, we learn a multi-modal goal distribution by performing conditional density-estimation using normalising flow. Finally, we ground candidate trajectory predictions road geometry, and plan the actions based on on vehicle dynamics. Under the CARLA simulator, we report state-of-the-art results on the CARNOVEL benchmark.

Recent development of deep neural networks (DNNs) for tabular learning has largely benefited from the capability of DNNs for automatic feature interaction. However, the heterogeneity nature of tabular features makes such features relatively independent, and developing effective methods to promote tabular feature interaction still remains an open problem. In this paper, we propose a novel Graph Estimator, which automatically estimates the relations among tabular features and builds graphs by assigning edges between related features. Such relation graphs organize independent tabular features into a kind of graph data such that interaction of nodes (tabular features) can be conducted in an orderly fashion. Based on our proposed Graph Estimator, we present a bespoke Transformer network tailored for tabular learning, called T2G-Former, which processes tabular data by performing tabular feature interaction guided by the relation graphs. A specific Cross-level Readout collects salient features predicted by the layers in T2G-Former across different levels, and attains global semantics for final prediction. Comprehensive experiments show that our T2G-Former achieves superior performance among DNNs and is competitive with non-deep Gradient Boosted Decision Tree models.

Since the recent success of Vision Transformers (ViTs), explorations toward transformer-style architectures have triggered the resurgence of modern ConvNets. In this work, we explore the representation ability of DNNs through the lens of interaction complexities. We empirically show that interaction complexity is an overlooked but essential indicator for visual recognition. Accordingly, a new family of efficient ConvNets, named MogaNet, is presented to pursue informative context mining in pure ConvNet-based models, with preferable complexity-performance trade-offs. In MogaNet, interactions across multiple complexities are facilitated and contextualized by leveraging two specially designed aggregation blocks in both spatial and channel interaction spaces. Extensive studies are conducted on ImageNet classification, COCO object detection, and ADE20K semantic segmentation tasks. The results demonstrate that our MogaNet establishes new state-of-the-art over other popular methods in mainstream scenarios and all model scales. Typically, the lightweight MogaNet-T achieves 80.0\% top-1 accuracy with only 1.44G FLOPs using a refined training setup on ImageNet-1K, surpassing ParC-Net-S by 1.4\% accuracy but saving 59\% (2.04G) FLOPs.

In knowledge graph completion (KGC), predicting triples involving emerging entities and/or relations, which are unseen when the KG embeddings are learned, has become a critical challenge. Subgraph reasoning with message passing is a promising and popular solution. Some recent methods have achieved good performance, but they (i) usually can only predict triples involving unseen entities alone, failing to address more realistic fully inductive situations with both unseen entities and unseen relations, and (ii) often conduct message passing over the entities with the relation patterns not fully utilized. In this study, we propose a new method named RMPI which uses a novel Relational Message Passing network for fully Inductive KGC. It passes messages directly between relations to make full use of the relation patterns for subgraph reasoning with new techniques on graph transformation, graph pruning, relation-aware neighborhood attention, addressing empty subgraphs, etc., and can utilize the relation semantics defined in the ontological schema of KG. Extensive evaluation on multiple benchmarks has shown the effectiveness of techniques involved in RMPI and its better performance compared with the existing methods that support fully inductive KGC. RMPI is also comparable to the state-of-the-art partially inductive KGC methods with very promising results achieved. Our codes and data are available at https://github.com/zjukg/RMPI.