Automatic parsing of human anatomies at instance-level from 3D computed tomography (CT) scans is a prerequisite step for many clinical applications. The presence of pathologies, broken structures or limited field-of-view (FOV) all can make anatomy parsing algorithms vulnerable. In this work, we explore how to exploit and conduct the prosperous detection-then-segmentation paradigm in 3D medical data, and propose a steerable, robust, and efficient computing framework for detection, identification, and segmentation of anatomies in CT scans. Considering complicated shapes, sizes and orientations of anatomies, without lose of generality, we present the nine degrees-of-freedom (9-DoF) pose estimation solution in full 3D space using a novel single-stage, non-hierarchical forward representation. Our whole framework is executed in a steerable manner where any anatomy of interest can be directly retrieved to further boost the inference efficiency. We have validated the proposed method on three medical imaging parsing tasks of ribs, spine, and abdominal organs. For rib parsing, CT scans have been annotated at the rib instance-level for quantitative evaluation, similarly for spine vertebrae and abdominal organs. Extensive experiments on 9-DoF box detection and rib instance segmentation demonstrate the effectiveness of our framework (with the identification rate of 97.0% and the segmentation Dice score of 90.9%) in high efficiency, compared favorably against several strong baselines (e.g., CenterNet, FCOS, and nnU-Net). For spine identification and segmentation, our method achieves a new state-of-the-art result on the public CTSpine1K dataset. Last, we report highly competitive results in multi-organ segmentation at FLARE22 competition. Our annotations, code and models will be made publicly available at: https://github.com/alibaba-damo-academy/Med_Query.

The role of mobile cameras increased dramatically over the past few years, leading to more and more research in automatic image quality enhancement and RAW photo processing. In this Mobile AI challenge, the target was to develop an efficient end-to-end AI-based image signal processing (ISP) pipeline replacing the standard mobile ISPs that can run on modern smartphone GPUs using TensorFlow Lite. The participants were provided with a large-scale Fujifilm UltraISP dataset consisting of thousands of paired photos captured with a normal mobile camera sensor and a professional 102MP medium-format FujiFilm GFX100 camera. The runtime of the resulting models was evaluated on the Snapdragon's 8 Gen 1 GPU that provides excellent acceleration results for the majority of common deep learning ops. The proposed solutions are compatible with all recent mobile GPUs, being able to process Full HD photos in less than 20-50 milliseconds while achieving high fidelity results. A detailed description of all models developed in this challenge is provided in this paper.

由于复杂的腹部内形状和腹部器官之间的复杂形状和外观变化，从不同模态的CT成像中进行的准确且健壮的腹部多器官分割是一项具有挑战性的任务。在本文中，我们提出了一个具有分层空间特征调制的概率多器官分割网络，以捕获灵活的器官语义变体，并将学习的变体注入不同的特征图尺度，以进行指导分割。更具体地说，我们通过条件变异自动编码器设计一个输入分解模块，以在低维潜在空间和模型富有器官语义变化上学习器官特异性分布，该分布在输入图像上进行条件。 -NET解码器通过空间特征转换从层次上进行分层，该特征转换能够将变化转换为空间特征映射调制并指导细尺度分割的条件仿射转换参数。提出的方法对公开可用的腹部可用数据集进行了培训，并在其他两个开放数据集上进行了评估，即100个挑战/病理测试，从腹部腹部1K完全监督的腹部器官细分基准和90例TCIA+＆BTCV数据集中进行了90例病例。使用这些数据集用于四个腹部器官，肾脏，脾脏和胰腺，肾脏分数提高了7.3％，胰腺的骰子得分提高了7.7％，而胰腺的骰子得分提高了7.3％，而胰腺的较高速度比强度快7倍，较高的7倍基线分割方法（NNUNET和COTR）。

可微分的架构搜索逐渐成为神经结构中的主流研究主题，以实现与早期NAS（基于EA的RL的）方法相比提高效率的能力。最近的可分辨率NAS还旨在进一步提高搜索效率，降低GPU记忆消耗，并解决“深度间隙”问题。然而，这些方法不再能够解决非微弱目标，更不用说多目标，例如性能，鲁棒性，效率和其他指标。我们提出了一个端到端的架构搜索框架，朝向非微弱的目标TND-NAS，具有在多目标NAs（MNA）中的不同NAS框架中的高效率的优点和兼容性的兼容性（MNA）。在可分辨率的NAS框架下，随着搜索空间的连续放松，TND-NAS具有在离散空间中优化的架构参数（$ \ alpha $），同时通过$ \ alpha $逐步缩小超缩小的搜索策略。我们的代表性实验需要两个目标（参数，准确性），例如，我们在CIFAR10上实现了一系列高性能紧凑型架构（1.09米/ 3.3％，2.4M / 2.95％，9.57M / 2.54％）和CIFAR100（2.46 M / 18.3％，5.46 / 16.73％，12.88 / 15.20％）数据集。有利地，在现实世界的情景下（资源受限，平台专用），TND-NA可以方便地达到Pareto-Optimal解决方案。

几乎所有现有的基于面部动作编码系统的数据集包括面部动作单元（AU）强度信息使用A-E级别分层地向强度值注释。然而，面部表情连续变化，并将从一个状态变为另一个状态。因此，将局部面部AU的强度值重新播出以表示整个面部表情的变化更有效，特别是在表达转移和面部动画的领域。我们将Feafa的扩展与重新标记的DISFA数据库相结合，可在HTTPS://www.iiplab.net/feafa+ /现在提供。扩展Feafa（Feafa +）包括来自Feafa和Disfa的150个视频序列，总共230,184帧，使用表达式定量工具手动注释24重新定义AU的浮点强度值。我们还列出了针对构成和自发子集的粗略数值结果，并为AU强度回归任务提供基线比较。

分布强化学习〜（RL）是一类最先进的算法，可估计总回报的全部分布，而不仅仅是其期望。尽管分销RL的表现出色，但对基于预期的RL的优势的理论理解仍然难以捉摸。在本文中，我们将分布RL的优越性归因于其正规化效果，无论其预期如何，其价值分布信息。首先，通过稳健统计数据中总误差模型的变体的杠杆作用，我们将值分布分解为其预期和其余分布部分。因此，与基于期望的RL相比，分布RL的额外好处主要解释为在神经拟合Z-材料框架中\ textit {风险敏感的熵正则化}的影响。同时，我们在最大熵RL中的分布RL的风险敏感熵正则和香草熵之间建立了一个桥梁，专门针对参与者 - 批评算法。它揭示了分布RL诱导校正后的奖励函数，从而促进了针对环境内在不确定性的风险敏感探索。最后，广泛的实验证实了分布RL的正则化作用和不同熵正则化的相互影响的作用。我们的研究铺平了一种更好地解释分布RL算法的功效，尤其是通过正则化的镜头的方法。

我们提出了Urbanscene3D，这是一个大规模的数据平台，用于研究城市场景感知和重建。 Urbanscene3D包含超过128K的高分辨率图像，其中涵盖了16个场景，包括大规模的真实城市区域和合成城市，总共有136 km^2区域。该数据集还包含具有不同观察模式的高精度激光扫描和数百个图像集，它们为设计和评估空中路径计划和3D重建算法提供了全面的基准。此外，该数据集是基于虚幻引擎和AirSim模拟器构建的数据集以及数据集中每个建筑物的手动注释的唯一实例标签，启用了各种数据的生成，例如2D/3D边界框， ，以及3D点云/网状分段等。具有物理发动机和照明系统的模拟器不仅产生各种数据，而且还使用户能够在拟议的城市环境中模拟汽车或无人机以进行未来的研究。

网络修剪是一种有效的方法，可以通过可接受的性能妥协降低网络复杂性。现有研究通过耗时的重量调谐或具有扩展宽度的网络的复杂搜索来实现神经网络的稀疏性，这极大地限制了网络修剪的应用。在本文中，我们表明，在没有权重调谐的情况下，高性能和稀疏的子网被称为“彩票奖线”，存在于具有膨胀宽度的预先训练的模型中。例如，我们获得了一个只有10％参数的彩票奖金，仍然达到了原始密度Vggnet-19的性能，而无需对CiFar-10的预先训练的重量进行任何修改。此外，我们观察到，来自许多现有修剪标准的稀疏面具与我们的彩票累积的搜索掩码具有高重叠，其中，基于幅度的修剪导致与我们的最相似的掩模。根据这种洞察力，我们使用基于幅度的修剪初始化我们的稀疏掩模，导致彩票累积搜索至少3倍降低，同时实现了可比或更好的性能。具体而言，我们的幅度基彩票奖学金在Reset-50中除去90％的重量，而在ImageNet上仅使用10个搜索时期可以轻松获得超过70％的前1个精度。我们的代码可在https://github.com/zyxxmu/lottery-jackpots获得。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.