Over the past few years, developing a broad, universal, and general-purpose computer vision system has become a hot topic. A powerful universal system would be capable of solving diverse vision tasks simultaneously without being restricted to a specific problem or a specific data domain, which is of great importance in practical real-world computer vision applications. This study pushes the direction forward by concentrating on the million-scale multi-domain universal object detection problem. The problem is not trivial due to its complicated nature in terms of cross-dataset category label duplication, label conflicts, and the hierarchical taxonomy handling. Moreover, what is the resource-efficient way to utilize emerging large pre-trained vision models for million-scale cross-dataset object detection remains an open challenge. This paper tries to address these challenges by introducing our practices in label handling, hierarchy-aware loss design and resource-efficient model training with a pre-trained large model. Our method is ranked second in the object detection track of Robust Vision Challenge 2022 (RVC 2022). We hope our detailed study would serve as an alternative practice paradigm for similar problems in the community. The code is available at https://github.com/linfeng93/Large-UniDet.

Photo-realistic style transfer aims at migrating the artistic style from an exemplar style image to a content image, producing a result image without spatial distortions or unrealistic artifacts. Impressive results have been achieved by recent deep models. However, deep neural network based methods are too expensive to run in real-time. Meanwhile, bilateral grid based methods are much faster but still contain artifacts like overexposure. In this work, we propose the \textbf{Adaptive ColorMLP (AdaCM)}, an effective and efficient framework for universal photo-realistic style transfer. First, we find the complex non-linear color mapping between input and target domain can be efficiently modeled by a small multi-layer perceptron (ColorMLP) model. Then, in \textbf{AdaCM}, we adopt a CNN encoder to adaptively predict all parameters for the ColorMLP conditioned on each input content and style image pair. Experimental results demonstrate that AdaCM can generate vivid and high-quality stylization results. Meanwhile, our AdaCM is ultrafast and can process a 4K resolution image in 6ms on one V100 GPU.

The problem of covariate-shift generalization has attracted intensive research attention. Previous stable learning algorithms employ sample reweighting schemes to decorrelate the covariates when there is no explicit domain information about training data. However, with finite samples, it is difficult to achieve the desirable weights that ensure perfect independence to get rid of the unstable variables. Besides, decorrelating within stable variables may bring about high variance of learned models because of the over-reduced effective sample size. A tremendous sample size is required for these algorithms to work. In this paper, with theoretical justification, we propose SVI (Sparse Variable Independence) for the covariate-shift generalization problem. We introduce sparsity constraint to compensate for the imperfectness of sample reweighting under the finite-sample setting in previous methods. Furthermore, we organically combine independence-based sample reweighting and sparsity-based variable selection in an iterative way to avoid decorrelating within stable variables, increasing the effective sample size to alleviate variance inflation. Experiments on both synthetic and real-world datasets demonstrate the improvement of covariate-shift generalization performance brought by SVI.

Localizing anatomical landmarks are important tasks in medical image analysis. However, the landmarks to be localized often lack prominent visual features. Their locations are elusive and easily confused with the background, and thus precise localization highly depends on the context formed by their surrounding areas. In addition, the required precision is usually higher than segmentation and object detection tasks. Therefore, localization has its unique challenges different from segmentation or detection. In this paper, we propose a zoom-in attentive network (ZIAN) for anatomical landmark localization in ocular images. First, a coarse-to-fine, or "zoom-in" strategy is utilized to learn the contextualized features in different scales. Then, an attentive fusion module is adopted to aggregate multi-scale features, which consists of 1) a co-attention network with a multiple regions-of-interest (ROIs) scheme that learns complementary features from the multiple ROIs, 2) an attention-based fusion module which integrates the multi-ROIs features and non-ROI features. We evaluated ZIAN on two open challenge tasks, i.e., the fovea localization in fundus images and scleral spur localization in AS-OCT images. Experiments show that ZIAN achieves promising performances and outperforms state-of-the-art localization methods. The source code and trained models of ZIAN are available at https://github.com/leixiaofeng-astar/OMIA9-ZIAN.

本文介绍了Kings Arena的荣誉，Kings Arena是基于国王荣誉的强化学习（RL）环境，这是世界上最受欢迎的游戏之一。与以前大多数工作中研究的其他环境相比，我们的人对竞争性强化学习提出了新的概括挑战。与对手竞争的一个代理商是一个多代理的问题；它需要概括能力，因为它具有控制和不同的对手竞争的不同目标。我们描述了国王域名荣誉的观察，动作和奖励规范，并提供了一个基于python的开源界面，以与游戏引擎进行通信。我们为纪念国王竞技场的二十个目标英雄提供了各种任务，并为具有可行的计算资源的基于RL的方法提供了初始基线结果。最后，我们展示了国王竞技场的荣誉和对挑战的可能补救措施所面临的概括挑战。所有软件（包括环境级）均可在https://github.com/tencent-ailab/hok_env上公开获得。该文档可在https://aiarena.tencent.com/hok/doc/上获得。

为了在盲图超级分辨率（SR）上取得有希望的结果，一些尝试利用低分辨率（LR）图像来预测内核并改善SR性能。但是，由于不可用的现实世界模糊内核，这些监督的内核预测（SKP）方法是不切实际的。尽管提出了一些无监督的降解预测（UDP）方法来绕过此问题，但\ textIt {contercestency}之间的降解嵌入和SR功能之间仍然具有挑战性。通过探索降解嵌入与SR功能之间的相关性，我们观察到共同学习内容和降解感知功能是最佳的。基于此观察结果，提出了一个名为CDSR的内容和退化的SR网络。具体而言，CDSR包含三个新建立的模块：（1）将基于重量的编码器（LPE）应用于共同提取内容和降解功能； （2）采用基于域查询的基于注意力的模块（DQA）来适应不一致； （3）基于密码的空格压缩模块（CSC），可以抑制冗余信息。对几个基准测试的广泛实验表明，即使与最先进的SKP方法相比，提议的CDSR的表现都优于现有的UDP模型，并在PSNR和SSIM上实现竞争性能。

在各种设备上部署深度学习模型已成为一个重要的话题。硬件专业化的浪潮为多维张量计算带来了一套多样化的加速度原始图。这些新的加速原始基原料以及新兴的机器学习模型带来了巨大的工程挑战。在本文中，我们提出了Tensorir，这是一种编译器抽象，用于通过这些张量计算原始素优化程序。Tensorir概括了现有机器学习编译器中使用的循环巢表示，以将张量计算作为一流的公民。最后，我们在抽象之上构建了一个端到端框架，以自动优化给定的张量计算原始图的深度学习模型。实验结果表明，Tensorir编译会自动使用给定硬件后端的张量计算原始图，并提供与跨平台的最新手工精制系统竞争性能的性能。

为了更好地利用搜索日志和建模用户的行为模式，提出了许多点击模型来提取用户的隐式交互反馈。大多数传统点击模型都是基于概率图形模型（PGM）框架，该框架需要手动设计的依赖项，并且可能会过度简化用户行为。最近，提出了基于神经网络的方法来通过增强表达能力并允许灵活的依赖性来提高用户行为的预测准确性。但是，他们仍然遭受数据稀疏性和冷启动问题的困扰。在本文中，我们提出了一个新颖的图形增强点击模型（GraphCM），用于Web搜索。首先，我们将每个查询或文档视为顶点，并分别针对查询和文档提出新颖的均匀图构造方法，以完全利用会议内和会议间信息，以解决稀疏性和冷启动问题。其次，在考试假设之后，我们分别对吸引力估计量和检查预测值进行了建模，以输出吸引力得分和检查概率，在该分数中，应用图形神经网络和邻居相互作用技术用于提取在预构建的同质图中编码的辅助信息。最后，我们将组合功能应用于将考试概率和吸引力得分整合到点击预测中。在三个现实世界会话数据集上进行的广泛实验表明，GraphCM不仅胜过了最先进的模型，而且还可以在解决数据稀疏性和冷启动问题方面取得卓越的性能。

为了根据用户的隐式交互反馈提供点击模拟或相关性估计，在近年来，单击模型进行了很多研究。大多数点击模型都集中在用户行为上，指向单个列表。但是，随着用户界面设计（UI）设计的开发，结果页面上显示的项目的布局往往是多块（即多列表）样式而不是单个列表，这需要不同的假设来建模用户行为模型更精确地。存在桌面上下文中多块页面的单击模型，但是由于不同的互动方式，结果类型，尤其是多块演示样式，因此无法直接应用于移动方案。特别是，多块移动页面通常可以分解为基本垂直块和水平块的交织，从而导致典型的F形式。为了减轻桌面和移动上下文之间的多块页面上的差距，我们进行了用户吸引人的学习研究，并确定用户的顺序浏览，block skip和F-Shape页面上的比较模式。这些发现导致了新型的F形点击模型（FSCM）的设计，该模型是多块移动页面的一般解决方案。首先，我们为每个页面构建一个有向的无环图（DAG），每个项目都被视为顶点，每个边缘表示用户可能的检查流。其次，我们建议分别对用户的顺序（顺序浏览，块跳过）和非序列（比较）行为提出DAG结构的GRU和比较模块。最后，我们将GRU状态和比较模式结合在一起，以执行用户点击预测。与基线模型相比，大型现实世界数据集上的实验验证了FSCM对用户行为预测的有效性。

变压器最近展示了改进视觉跟踪算法的明显潜力。尽管如此，基于变压器的跟踪器主要使用变压器熔断并增强由卷积神经网络（CNNS）产生的功能。相比之下，在本文中，我们提出了一个完全基于注意力的变压器跟踪算法，Swin-Cranstormer Tracker（SwintRack）。 SwintRack使用变压器进行特征提取和特征融合，允许目标对象和搜索区域之间的完全交互进行跟踪。为了进一步提高性能，我们调查了全面的不同策略，用于特征融合，位置编码和培训损失。所有这些努力都使SwintRack成为一个简单但坚实的基线。在我们的彻底实验中，SwintRack在leasot上设置了一个新的记录，在4.6 \％的情况下超过4.6 \％，同时仍然以45 fps运行。此外，它达到了最先进的表演，0.483 Suc，0.832 Suc和0.694 Ao，其他具有挑战性的leasot _ {ext} $，trackingnet和got-10k。我们的实施和培训型号可在HTTPS://github.com/litinglin/swintrack获得。