多年来，3D形状抽象引起了极大的兴趣。除了诸如网格和体素之类的低级表示外，研究人员还试图用基本的几何原始素来抽象的语义上抽象的复杂对象。最近的深度学习方法在很大程度上依赖于数据集，而一般性的一般性有限。此外，准确地将对象抽象为少数原始物仍然是一个挑战。在本文中，我们提出了一种新型的非参数贝叶斯统计方法来推断从点云中推断出由未知数的几何原始物组成的抽象。我们将点的生成模拟为从高斯超质锥模型（GSTM）的无限混合物采样的观测值。我们的方法将抽象作为聚类问题提出，其中：1）通过中国餐厅过程（CRP）将每个点分配给集群； 2）针对每个集群优化了原始表示形式，3）合并后制品合并以提供简洁的表示。我们在两个数据集上进行了广泛的实验。结果表明，我们的方法在准确性方面优于最先进的方法，并且可以推广到各种类型的对象。

本文提出了一种新的方法，用于较小的类人机器人自我校准其脚力传感器。该方法由两个步骤组成：1。命令机器人以不同的双支持配置沿计划的全身轨迹移动。2.通过优化在机器人运动过程中，通过最大程度地减少测量和建模压力中心（COP）和地面反作用力（GRF）之间的误差来确定传感器参数。这是针对较小的人形机器人中的脚力传感器设备的第一个提议的自主校准方法。此外，我们引入了一种高准确的手动校准方法来建立COP地面真理，该方法用于使用自校准来验证测得的COP。结果表明，自校准可以准确估计COP和GRF，而无需任何手动干预。使用NAO类人动物平台和先前呈现的力感应鞋来证明我们的方法。

重新安排任务已被确定为智能机器人操纵的关键挑战，但是很少有方法可以精确构造看不见的结构。我们为挑选重排操作提供了视觉远见模型，该模型能够有效地学习。此外，我们开发了一个多模式的动作提案模块，该模块建立在目标条件转运者网络上，这是一种最新的模仿学习方法。我们基于图像的任务计划方法，具有视觉前瞻性的转运蛋白，只能从少数数据中学习，并以零拍的方式推广到多个看不见的任务。 TVF能够提高对模拟和真实机器人实验中看不见的任务的最先进模仿学习方法的性能。特别是，在模拟实验中，看不见的任务的平均成功率从55.4％提高到78.5％，而在实际机器人实验中，只有数十次专家示范。视频和代码可在我们的项目网站上找到：https：//chirikjianlab.github.io/tvf/

在计算机愿景中已经研究了具有基本几何基元的对象。在几何原语中，超级助理性是众所周知的，其简单的隐式表达式和能力表示具有少数参数的各种形状。然而，作为第一个和最重要的步骤，从3D数据准确且强大地恢复超级助理仍然仍然具有挑战性。现有方法受到本地最佳的影响，并且对现实世界方案中的噪声和异常值敏感，导致捕获几何形状频繁失败。在本文中，我们提出了从点云中恢复超级化的第一种概率方法。我们的方法在超级式的参数表面上构建了高斯均匀的混合物模型（GUM），其明确地模拟了异常值和噪声的产生。超级恢复被制定为最大似然估计（MLE）问题。我们提出了一种算法，期望，最大化和切换（EMS）来解决这个问题，其中：（1）从后视角预测异常值; （2）SuperQuadric参数由信任区域反射算法进行优化; （3）通过在编码类似SuperQuadrics的参数之间进行全局搜索和切换，避免了本地Optima。我们表明我们的方法可以扩展到复杂对象的多叠加恢复。所提出的方法在合成和现实世界数据集的准确性，效率和鲁棒性方面优于最先进的。代码将被释放。

长期以来，PATH规划一直是机器人技术的主要研究领域之一，PRM和RRT是最有效的计划者之一。尽管通常非常有效，但这些基于抽样的计划者在“狭窄通道”的重要情况下可能会变得昂贵。本文开发了专门为狭窄通道问题制定的路径规划范例。核心是基于计划由椭圆形工会封装的刚体机器人的计划。每个环境特征都使用具有$ \ Mathcal {C}^1 $边界的严格凸面来表示几何（例如，超级方面）。这样做的主要好处是，配置空间障碍物可以以封闭形式明确地进行参数化，从而可以使用先验知识来避免采样不可行的配置。然后，通过表征针对多个椭圆形的紧密体积，可以保证涉及旋转的机器人过渡无碰撞，而无需执行传统的碰撞检测。此外，通过与随机抽样策略结合使用，可以将提出的计划框架扩展到解决较高的维度问题，在该问题中，机器人具有移动的基础和铰接的附属物。基准结果表明，所提出的框架通常优于基于采样的计划者的计算时间和成功率，在找到单身机器人和具有较高维度配置空间的狭窄走廊的路径方面。使用建议的框架进行了物理实验，在人形机器人中进一步证明，该机器人在几个混乱的环境中行走，通道狭窄。

Previous work has shown the potential of deep learning to predict renal obstruction using kidney ultrasound images. However, these image-based classifiers have been trained with the goal of single-visit inference in mind. We compare methods from video action recognition (i.e. convolutional pooling, LSTM, TSM) to adapt single-visit convolutional models to handle multiple visit inference. We demonstrate that incorporating images from a patient's past hospital visits provides only a small benefit for the prediction of obstructive hydronephrosis. Therefore, inclusion of prior ultrasounds is beneficial, but prediction based on the latest ultrasound is sufficient for patient risk stratification.

Applying deep learning concepts from image detection and graph theory has greatly advanced protein-ligand binding affinity prediction, a challenge with enormous ramifications for both drug discovery and protein engineering. We build upon these advances by designing a novel deep learning architecture consisting of a 3-dimensional convolutional neural network utilizing channel-wise attention and two graph convolutional networks utilizing attention-based aggregation of node features. HAC-Net (Hybrid Attention-Based Convolutional Neural Network) obtains state-of-the-art results on the PDBbind v.2016 core set, the most widely recognized benchmark in the field. We extensively assess the generalizability of our model using multiple train-test splits, each of which maximizes differences between either protein structures, protein sequences, or ligand extended-connectivity fingerprints. Furthermore, we perform 10-fold cross-validation with a similarity cutoff between SMILES strings of ligands in the training and test sets, and also evaluate the performance of HAC-Net on lower-quality data. We envision that this model can be extended to a broad range of supervised learning problems related to structure-based biomolecular property prediction. All of our software is available as open source at https://github.com/gregory-kyro/HAC-Net/.

In recent years several learning approaches to point goal navigation in previously unseen environments have been proposed. They vary in the representations of the environments, problem decomposition, and experimental evaluation. In this work, we compare the state-of-the-art Deep Reinforcement Learning based approaches with Partially Observable Markov Decision Process (POMDP) formulation of the point goal navigation problem. We adapt the (POMDP) sub-goal framework proposed by [1] and modify the component that estimates frontier properties by using partial semantic maps of indoor scenes built from images' semantic segmentation. In addition to the well-known completeness of the model-based approach, we demonstrate that it is robust and efficient in that it leverages informative, learned properties of the frontiers compared to an optimistic frontier-based planner. We also demonstrate its data efficiency compared to the end-to-end deep reinforcement learning approaches. We compare our results against an optimistic planner, ANS and DD-PPO on Matterport3D dataset using the Habitat Simulator. We show comparable, though slightly worse performance than the SOTA DD-PPO approach, yet with far fewer data.

It is known that neural networks have the problem of being over-confident when directly using the output label distribution to generate uncertainty measures. Existing methods mainly resolve this issue by retraining the entire model to impose the uncertainty quantification capability so that the learned model can achieve desired performance in accuracy and uncertainty prediction simultaneously. However, training the model from scratch is computationally expensive and may not be feasible in many situations. In this work, we consider a more practical post-hoc uncertainty learning setting, where a well-trained base model is given, and we focus on the uncertainty quantification task at the second stage of training. We propose a novel Bayesian meta-model to augment pre-trained models with better uncertainty quantification abilities, which is effective and computationally efficient. Our proposed method requires no additional training data and is flexible enough to quantify different uncertainties and easily adapt to different application settings, including out-of-domain data detection, misclassification detection, and trustworthy transfer learning. We demonstrate our proposed meta-model approach's flexibility and superior empirical performance on these applications over multiple representative image classification benchmarks.

Convolutional neural networks (CNNs) are currently among the most widely-used neural networks available and achieve state-of-the-art performance for many problems. While originally applied to computer vision tasks, CNNs work well with any data with a spatial relationship, besides images, and have been applied to different fields. However, recent works have highlighted how CNNs, like other deep learning models, are sensitive to noise injection which can jeopardise their performance. This paper quantifies the numerical uncertainty of the floating point arithmetic inaccuracies of the inference stage of DeepGOPlus, a CNN that predicts protein function, in order to determine its numerical stability. In addition, this paper investigates the possibility to use reduced-precision floating point formats for DeepGOPlus inference to reduce memory consumption and latency. This is achieved with Monte Carlo Arithmetic, a technique that experimentally quantifies floating point operation errors and VPREC, a tool that emulates results with customizable floating point precision formats. Focus is placed on the inference stage as it is the main deliverable of the DeepGOPlus model that will be used across environments and therefore most likely be subjected to the most amount of noise. Furthermore, studies have shown that the inference stage is the part of the model which is most disposed to being scaled down in terms of reduced precision. All in all, it has been found that the numerical uncertainty of the DeepGOPlus CNN is very low at its current numerical precision format, but the model cannot currently be reduced to a lower precision that might render it more lightweight.