检索结果-内蒙古大学图书馆

Region-level Contrastive and Consistency learning for Semi-Supervised Semantic Segmentation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhang, Jianrong Wu, Tianyi Ding, Chuanghao Zhao, Hongwei Guo, Guodong College of Computer Science and Technology Jilin University Changchun China Institute of Deep Learning Baidu Research Beijing China National Engineering Laboratory for Deep Learning Technology and Application Beijing China College of Software Jilin University Changchun China The Institute of Deep Learning Baidu Research China

Current semi-supervised semantic segmentation methods mainly focus on designing pixel-level consistency and contrastive regularization. However, pixel-level regularization is sensitive to noise from pixels with incorrect predictions, and pixel-level contrastive regularization has memory and computational cost with O(pixel num2). To address the issues, we propose a novel region-level contrastive and consistency learning framework (RC2L) for semi-supervised semantic segmentation. Specifically, we first propose a Region Mask Contrastive (RMC) loss and a Region Feature Contrastive (RFC) loss to accomplish region-level contrastive property. Furthermore, Region Class Consistency (RCC) loss and Semantic Mask Consistency (SMC) loss are proposed for achieving region-level consistency. Based on the proposed region-level contrastive and consistency regularization, we develop a region-level contrastive and consistency learning framework (RC2L) for semi-supervised semantic segmentation, and evaluate our RC2L on two challenging benchmarks (PASCAL VOC 2012 and Cityscapes), outperforming the state-of-the-art. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantic Segmentation

A Representation Separation Perspective to Correspondences-free Unsupervised 3D Point Cloud Registration

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhang, Zhiyuan Sun, Jiadai Dai, Yuchao Zhou, Dingfu Song, Xibin He, Mingyi School of Electronics and Information Northwestern Polytechnical University Xi’an China Baidu Research and National Engineering Laboratory Deep Learning Technology and Application Beijing China

3D point cloud registration in remote sensing field has been greatly advanced by deep learning based methods, where the rigid transformation is either directly regressed from the two point clouds (correspondences-free approaches) or computed from the learned correspondences (correspondences-based approaches). Existing correspondences-free methods generally learn the holistic representation of the entire point cloud, which is fragile for partial and noisy point clouds. In this paper, we propose a correspondences-free unsupervised point cloud registration (UPCR) method from the representation separation perspective. First, we model the input point cloud as a combination of pose-invariant representation and pose-related representation. Second, the pose-related representation is used to learn the relative pose w.r.t. a "latent canonical shape" for the source and target point clouds respectively. Third, the rigid transformation is obtained from the above two learned relative poses. Our method not only filters out the disturbance in pose-invariant representation but also is robust to partial-to-partial point clouds or noise. Experiments on benchmark datasets demonstrate that our unsupervised method achieves comparable if not better performance than state-of-the-art supervised registration methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Surface measurement

Pale Transformer: A General Vision Transformer Backbone with Pale-Shaped Attention

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Sitong Wu, Tianyi Tan, Haoru Guo, Guodong Institute of Deep Learning Baidu Research Beijing China National Engineering Laboratory for Deep Learning Technology and Application Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China

Recently, Transformers have shown promising performance in various vision tasks. To reduce the quadratic computation complexity caused by the global self-attention, various methods constrain the range of attention within a local region to improve its efficiency. Consequently, their receptive fields in a single attention layer are not large enough, resulting in insufficient context modeling. To address this issue, we propose a Pale-Shaped self-Attention (PS-Attention), which performs self-attention within a pale-shaped region. Compared to the global self-attention, PS-Attention can reduce the computation and memory costs significantly. Meanwhile, it can capture richer contextual information under the similar computation complexity with previous local self-attention mechanisms. Based on the PS-Attention, we develop a general Vision Transformer backbone with a hierarchical architecture, named Pale Transformer, which achieves 83.4%, 84.3%, and 84.9% Top-1 accuracy with the model size of 22M, 48M, and 85M respectively for 224 × 224 ImageNet-1K classification, outperforming the previous Vision Transformer backbones. For downstream tasks, our Pale Transformer backbone performs better than the recent state-of-the-art CSWin Transformer by a large margin on ADE20K semantic segmentation and COCO object detection & instance segmentation. The code will be released on https://***/BRIDL/PaddleViT. © 2021, CC BY.

关键词： Instance Segmentation

Interactive grounded language acquisition and generalization in a 2D world

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Yu, Haonan Zhang, Haichao Xu, Wei Baidu Research Sunnyvale United States National Engineering Laboratory for Deep Learning Technology and Applications Beijing China

We build a virtual agent for learning language in a 2D maze-like world. The agent sees images of the surrounding environment, listens to a virtual teacher, and takes actions to receive rewards. It interactively learns the teacher's language from scratch based on two language use cases: sentence-directed navigation and question answering. It learns simultaneously the visual representations of the world, the language, and the action control. By disentangling language grounding from other computational routines and sharing a concept detection function between language grounding and prediction, the agent reliably interpolates and extrapolates to interpret sentences that contain new word combinations or new words missing from training sentences. The new words are transferred from the answers of language prediction. Such a language ability is trained and evaluated on a population of over 1.6 million distinct sentences consisting of 119 object words, 8 color words, 9 spatial-relation words, and 50 grammatical words. The proposed model significantly outperforms five comparison methods for interpreting zero-shot sentences. In addition, we demonstrate human-interpretable intermediate outputs of the model in the appendix. Copyright © 2018, The Authors. All rights reserved.

关键词： Visual languages

Enhancing person-Job fit for talent recruitment: An ability-aware neural network approach

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Qin, Chuan Zhu, Hengshu Xu, Tong Zhu, Chen Jiang, Liang Chen, Enhong Xiong, Hui Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Business Intelligence Lab Baidu Research National Engineering Laboratory of Deep Learning Technology an Application China

The wide spread use of online recruitment services has led to information explosion in the job market. As a result, the recruiters have to seek the intelligent ways for Person-Job Fit, which is the bridge for adapting the right job seekers to the right positions. Existing studies on Person-Job Fit have a focus on measuring the matching degree between the talent qualification and the job requirements mainly based on the manual inspection of human resource experts despite of the subjective, incomplete, and inefficient nature of the human judgement. To this end, in this paper, we propose a novel end-to-end Ability-aware Person-Job Fit Neural Network (APJFNN) model, which has a goal of reducing the dependence on manual labour and can provide better interpretation about the fitting results. The key idea is to exploit the rich information available at abundant historical job application data. Specifically, we propose a word-level semantic representation for both job requirements and job seekers’ experiences based on Recurrent Neural Network (RNN). Along this line, four hierarchical ability-aware attention strategies are designed to measure the different importance of job requirements for semantic representation, as well as measuring the different contribution of each job experience to a specific ability requirement. Finally, extensive experiments on a large-scale real-world data set clearly validate the effectiveness and interpretability of the APJFNN framework compared with several baselines. Copyright © 2018, The Authors. All rights reserved.

关键词： Recurrent neural networks

Gradient descent meets shift-and-invert preconditioning for eigenvector computation 18

学校读者我要写书评

暂无评论

Gradient descent meets shift-and-invert preconditioning for ...

Proceedings of the 32nd International Conference on Neural Information Processing Systems

作者： Zhiqiang Xu Big Data Lab (BDL-US) Baidu Research National Engineering Laboratory for Deep Learning Technology and Applications

Shift-and-invert preconditioning, as a classic acceleration technique for the leading eigenvector computation, has received much attention again recently, owing to fast least-squares solvers for efficiently approximating matrix inversions in power iterations. In this work, we adopt an inexact Riemannian gradient descent perspective to investigate this technique on the effect of the step-size scheme. The shift-and-inverted power method is included as a special case with adaptive step-sizes. Particularly, two other step-size settings, i.e., constant step-sizes and Barzilai-Borwein (BB) step-sizes, are examined theoretically and/or empirically. We present a novel convergence analysis for the constant step-size setting that achieves a rate at Õ(√λ1/λ1 – λp+1), where λi represents the i-th largest eigenvalue of the given real symmetric matrix and p is the multiplicity of λ1. Our experimental studies show that the proposed algorithm can be significantly faster than the shift-and-inverted power method in practice.

关键词：

Fully transformer networks for semantic image segmentation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Sitong Wu, Tianyi Lin, Fangjian Tian, Shengwei Guo, Guodong Institute of Deep Learning Baidu Research Beijing100085 China National Engineering Laboratory for Deep Learning Technology and Application Beijing100085 China Shengwei Tian are with School of Software XinJiang University Urumqi China

Transformers have shown impressive performance in various natural language processing and computer vision tasks, due to the capability of modeling long-range dependencies. Recent progress has demonstrated that combining such Transformers with CNN-based semantic image segmentation models is very promising. However, it is not well studied yet on how well a pure Transformer based approach can achieve for image segmentation. In this work, we explore a novel framework for semantic image segmentation, which is encoder-decoder based Fully Transformer Networks (FTN). Specifically, we first propose a Pyramid Group Transformer (PGT) as the encoder for progressively learning hierarchical features, meanwhile reducing the computation complexity of the standard Visual Transformer (ViT). Then, we propose a Feature Pyramid Transformer (FPT) to fuse semantic-level and spatial-level information from multiple levels of the PGT encoder for semantic image segmentation. Surprisingly, this simple baseline can achieve better results on multiple challenging semantic segmentation and face parsing benchmarks, including PASCAL Context, ADE20K, COCOStuff, and CelebAMask-HQ. The source code will be released on https://***/BR-IDL/PaddleViT. Copyright © 2021, The Authors. All rights reserved.

关键词： Semantic Segmentation

Binarized neural architecture search for efficient object recognition

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chen, Hanlin an Zhuo, Li Zhang, Baochang Zheng, Xiawu Liu, Jianzhuang Ji, Rongrong Doermann, David Guo, Guodong Beihang University Beijing China Xiamen University Fujian China Shenzhen Institutes of Advanced Technology University at Buffalo Institute of Deep Learning Baidu Research National Engineering Laboratory for Deep Learning Technology and Application Shenzhen China

Traditional neural architecture search (NAS) has a significant impact in computer vision by automatically designing network architectures for various tasks. In this paper, binarized neural architecture search (BNAS), with a search space of binarized convolutions, is introduced to produce extremely compressed models to reduce huge computational cost on embedded devices for edge computing. The BNAS calculation is more challenging than NAS due to the learning inefficiency caused by optimization requirements and the huge architecture space, and the performance loss when handling the wild data in various computing applications. To address these issues, we introduce operation space reduction and channel sampling into BNAS to significantly reduce the cost of searching. This is accomplished through a performance-based strategy that is robust to wild data, which is further used to abandon less potential operations. Furthermore, we introduce the Upper Confidence Bound (UCB) to solve 1-bit BNAS. Two optimization methods for binarized neural networks are used to validate the effectiveness of our BNAS. Extensive experiments demonstrate that the proposed BNAS achieves a comparable performance to NAS on both CIFAR and ImageNet databases. An accuracy of 96.53% vs. 97.22% is achieved on the CIFAR-10 dataset, but with a significantly compressed model, and a 40% faster search than the state-of-the-art PC-DARTS. Copyright © 2020, The Authors. All rights reserved.

关键词： Edge computing

Recurrent Bilinear Optimization for Binary Neural Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Xu, Sheng Li, Yanjing Wang, Tiancheng Ma, Teli Zhang, Baochang Gao, Peng Qiao, Yu Lü, Jinhu Guo, Guodong Beihang University Beijing China Shanghai Artificial Intelligence Laboratory Shanghai China Zhongguancun Laboratory Beijing China Institute of Deep Learning Baidu Research Beijing China National Engineering Laboratory for Deep Learning Technology and Application Beijing China

Binary Neural Networks (BNNs) show great promise for real-world embedded devices. As one of the critical steps to achieve a powerful BNN, the scale factor calculation plays an essential role in reducing the performance gap to their real-valued counterparts. However, existing BNNs neglect the intrinsic bilinear relationship of real-valued weights and scale factors, resulting in a sub-optimal model caused by an insufficient training process. To address this issue, Recurrent Bilinear Optimization is proposed to improve the learning process of BNNs (RBONNs) by associating the intrinsic bilinear variables in the back propagation process. Our work is the first attempt to optimize BNNs from the bilinear perspective. Specifically, we employ a recurrent optimization and Density-ReLU to sequentially backtrack the sparse real-valued weight filters, which will be sufficiently trained and reach their performance limits based on a controllable learning process. We obtain robust RBONNs, which show impressive performance over state-of-the-art BNNs on various models and datasets. Particularly, on the task of object detection, RBONNs have great generalization performance. Our code is open-sourced on https://***/SteveTsui/RBONN. © 2022, CC BY.

关键词： Object detection