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

International Conference on pattern recognition

作者： Chen Cao Shifeng Chen Changqing Zou Jianzhuang Liu Shenzhen Key Laboratory for Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Department of Information Engineering Chinese University of Hong Kong China

ISBN: (纸本)9781467322164

Semi-supervised learning (SSL) relies on a few labeled samples to explore data's intrinsic structure through pairwise smooth transduction. The performance of SSL mainly depends on two folds: (1) the accuracy of labeled queries, (2) the integrity of manifolds in data distribution. Both of these qualities would be poor in real applications as data often consist of several irrelevant clusters and discrete noise. In this paper we propose a novel framework to simultaneously remove discrete noise and locate the high-density clusters. Experiments demonstrate that our algorithm is quite effective to solve several problems such as non-feedback image re-ranking and image co-segmentation.

关键词： Noise Noise measurement Clustering algorithms Databases Vectors Manifolds Semisupervised learning

来源：评论

学校读者我要写书评

暂无评论

FGCLR: An Effective Graph Contrastive Learning For Recommendation

Journal of Network Intelligence

引用

Journal of Network Intelligence 2024年第1期9卷 289-299页

作者： Wang, Hua-Wei Guo, Yi-Jing Weng, Wei Wu, Liu-Xi Yan, Zhong-Qi Key Laboratory of Intelligent Manufacturing and Industrial Internet Technology Fujian Province University Xiamen University Tan Kah Kee College Zhangzhou 363105 China College of Computer and Information Engineering Xiamen University of Technology Fujian Key Laboratory of Pattern Recognition and Image Understanding Xiamen361024 China Xiamen University Tan Kah Kee College Zhangzhou 363105 China College of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China

Graph contrastive learning(GCL) has become a prevalent technique for graph-based recommendation. Most GCL-based methods perform stochastic augmentation on the user-item interaction graph which may change the intrinsic semantics completely and easily biased by the noise perturbation. At the same time, they adopt the traditional components of graph neural network that may not be indispensable for the collaborative filtering. We argue that these methods ignore the the inherent semantic nature and the much more sparsity data of recommendation. In this paper, we propose an eFfective Graph Contrastive Learning model for Recommendation named FGCLR. In FGCLR, graph contrastive augmentation utilizes principal component analysis(PCA) to distill global collaborative feature, and graph neural network is refined to improve its ability to fit collaborative filtering task. Empirical results on several real-world datasets show that FGCLR archives superior recommendation performance compared to state-of-the-art algorithms. © 2024, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Digging into uncertainty in self-supervised multi-view stereo

arXiv

引用

arXiv 2021年

作者： Xu, Hongbin Zhou, Zhipeng Wang, Yali Kang, Wenxiong Sun, Baigui Li, Hao Qiao, Yu ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences South China University of Technology Shanghai AI Laboratory Alibaba Group Pazhou Laboratory

Self-supervised Multi-view stereo (MVS) with a pretext task of image reconstruction has achieved significant progress recently. However, previous methods are built upon intuitions, lacking comprehensive explanations about the effectiveness of the pretext task in self-supervised MVS. To this end, we propose to estimate epistemic uncertainty in self-supervised MVS, accounting for what the model ignores. Specially, the limitations can be categorized into two types: ambiguious supervision in foreground and invalid supervision in background. To address these issues, we propose a novel Uncertainty reduction Multi-view Stereo (UMVS) framework for self-supervised learning. To alleviate ambiguous supervision in foreground, we involve extra correspondence prior with a flow-depth consistency loss. The dense 2D correspondence of optical flows is used to regularize the 3D stereo correspondence in MVS. To handle the invalid supervision in background, we use Monte-Carlo Dropout to acquire the uncertainty map and further filter the unreliable supervision signals on invalid regions. Extensive experiments on DTU and Tank&Temples benchmark show that our U-MVS framework achieves the best performance among unsupervised MVS methods, with competitive performance with its supervised opponents. © 2021, CC BY.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Learning to predict context-adaptive convolution for semantic segmentation

arXiv

引用

arXiv 2020年

作者： Liu, Jianbo He, Junjun Ren, Jimmy S. Qiao, Yu Li, Hongsheng CUHK-SenseTime Joint Laboratory Chinese University of Hong Kong Shenzhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences SenseTime Research

Long-range contextual information is essential for achieving high-performance semantic segmentation. Previous feature re-weighting methods [34] demonstrate that using global context for re-weighting feature channels can effectively improve the accuracy of semantic segmentation. However, the globally-sharing feature re-weighting vector might not be optimal for regions of different classes in the input image. In this paper, we propose a Context-adaptive Convolution Network (CaC-Net) to predict a spatially-varying feature weighting vector for each spatial location of the semantic feature maps. In CaC-Net, a set of context-adaptive convolution kernels are predicted from the global contextual information in a parameter-efficient manner. When used for convolution with the semantic feature maps, the predicted convolutional kernels can generate the spatially-varying feature weighting factors capturing both global and local contextual information. Comprehensive experimental results show that our CaC-Net achieves superior segmentation performance on three public datasets, PASCAL Context, PASCAL VOC 2012 and ADE20K. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Learning dynamical human-joint affinity for 3D pose estimation in videos

arXiv

引用

arXiv 2021年

作者： Zhang, Junhao Wang, Yali Zhou, Zhipeng Luan, Tianyu Wang, Zhe Qiao, Yu ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences University of California Irvine United States Shanghai AI Laboratory Shanghai China

Graph Convolution Network (GCN) has been successfully used for 3D human pose estimation in videos. However, it is often built on the fixed human-joint affinity, according to human skeleton. This may reduce adaptation capacity of GCN to tackle complex spatio-temporal pose variations in videos. To alleviate this problem, we propose a novel Dynamical Graph Network (DG-Net), which can dynamically identify human-joint affinity, and estimate 3D pose by adaptively learning spatial/temporal joint relations from videos. Different from traditional graph convolution, we introduce Dynamical Spatial/Temporal Graph convolution (DSG/DTG) to discover spatial/temporal human-joint affinity for each video exemplar, depending on spatial distance/temporal movement similarity between human joints in this video. Hence, they can effectively understand which joints are spatially closer and/or have consistent motion, for reducing depth ambiguity and/or motion uncertainty when lifting 2D pose to 3D pose. We conduct extensive experiments on three popular benchmarks, e.g., Human3.6M, HumanEva-I, and MPI-INF-3DHP, where DG-Net outperforms a number of recent SOTA approaches with fewer input frames and model size. Copyright © 2021, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

DegAE: A New Pretraining Paradigm for Low-Level vision

DegAE: A New Pretraining Paradigm for Low-Level Vision

引用

Conference on computer vision and pattern recognition (CVPR)

作者： Yihao Liu Jingwen He Jinjin Gu Xiangtao Kong Yu Qiao Chao Dong Shanghai Artificial Intelligence Laboratory ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences University of Chinese Academy of Sciences The University of Sydney

Self-supervised pretraining has achieved remarkable success in high-level vision, but its application in low-level vision remains ambiguous and not well-established. What is the primitive intention of pretraining? What is the core problem of pretraining in low-level vision? In this paper, we aim to answer these essential questions and establish a new pretraining scheme for low-level vision. Specifically, we examine previous pretraining methods in both high-level and low-level vision, and categorize current low-level vision tasks into two groups based on the difficulty of data acqui-sition: low-cost and high-cost tasks. Existing literature has mainly focused on pretraining for low-cost tasks, where the observed performance improvement is often limited. However, we argue that pretraining is more significant for high-cost tasks, where data acquisition is more challenging. To learn a general low-level vision representation that can improve the performance of various tasks, we propose a new pretraining paradigm called degradation autoencoder (De-gAE). DegAE follows the philosophy of designing pretext task for self-supervised pretraining and is elaborately tai-lored to low-level vision. With DegAE pretraining, SwinIR achieves a 6.88dB performance gain on image dehaze task, while Uformer obtains 3.22dB and 0.54dB improvement on dehaze and derain tasks, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Local Global Transformer for Point Clouds Analysis

SSRN

引用

SSRN 2023年

作者： Li, Dilong Zheng, Shenghong Chen, Ziyi Li, Xiang Wang, Lanying Du, Jixiang College of Computer Science and Technology Fujian Key Laboratory of Big Data Intelligence and Security Xiamen Key Laboratory of Computer Vision and Pattern Recognition Xiamen Key Laboratory of Data Security and Blockchain Technology Huaqiao University FJ Xiamen361021 China School of Economics and Finance Huaqiao University FJ Quanzhou362021 China Department of Geography and Environmental Management University of Waterloo WaterlooONN2L 3G1 Canada

Transformer networks have demonstrated remarkable performance in point cloud analysis. However, achieving a balance between local regional context and global long-range context learning remains a significant challenge. In this paper, we propose a Hierarchical Local Global Transformer Network (LGTNet), designed to capture local and global contexts in a hierarchical manner. Specifically, we employ serial local and global Transformers to learn the inner-group and cross-group self-attention, respectively. Besides, we propose a geometric moment-based position encoding for local Transformer, enabling the embedding of comprehensive local geometric relationship. Additionally, we also introduce a global feature pooling module that extracts the global features from each encoder layers. Extensive experimental results demonstrate that LGTNet achieves state-of-the-art performance on ShapeNetPart and ScanObjectNN datasets. This approach effectively enhances the understanding of point cloud scenes, thereby facilitating the use of point cloud data in remote sensing applications. © 2023, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Compressed sensing ensemble classifier for human detection

Compressed sensing ensemble classifier for human detection

引用

4th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2013

作者： Zhang, Baochang Liu, Juan Gao, Yongsheng Liu, Jianzhuang Science and Technology on Aircraft Control Laboratory School of Automation Science and Electrical Engineering BeiHang University Beijing 100191 China School of Engineering Griffith University Australia Shenzhen Key Lab for Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Department of Information Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9783642420566

This paper proposes a novel Compressed Sensing Ensemble Classifier (CSEC) for human detection. The proposed CSEC employs the compressed sensing technique to get a more sparse model with a more reasonable selection of base classifiers. The major contributions of this paper are: 1) a novel principled framework for ensemble classifier design based on compressed sensing;2) a new concept of considering both the simplicity of ensemble classifier and irrelevance of base classifiers towards optimal classifier design;and 3) a quadratic function for CSEC optimization which includes a new optimizable positive semi-definite relevance matrix to simultaneously select appropriate base classifiers with minimized relevance. Experimental results on INRIA and SDL databases show that the performance of CSEC is better than two most popular classifiers SVM and AdaBoost, as well as a most recent method CLML. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Journal of Network Intelligence

引用

Journal of Network Intelligence 2022年第4期7卷 848-861页

作者： Weng, Wei Li, Tong Liao, Jian-Chao Guo, Feng Chen, Fen Wei, Bo-Wen College of Computer and Information Engineering Xiamen University of Technology Fujian Key Laboratory of Pattern Recognition and Image Understanding Xiamen361024 China College of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China Fujian Newland Auto-ID Tech. Co. Ltd Fuzhou350015 China Xiamen Fuyun Information Tech. Co. Ltd Xiamen361008 China

Graph clustering is a fundamental method for studying complex networks. Some existing approaches focus on the graph data without attributed information. However, graph data in the real world generally have attribute information, which can better describe complex networks. Recently, deep learning-based methods are widely used for attributed graph clustering. DAEGC is a goal-directed method, which utilizes graph attention encoders for latent information learning and performs competitively in attributed graph clustering. To better aggregate the structure and node attribute information in DAEGC, we employ a lightweight attention mechanism to capture the relationship between nodes and their neighbors, learn hidden representations, and use a self-training module to train the model for optimal results. Extensive experiments show that our proposed method improves DAEGC and achieves superior performance compared with state-of-the-art algorithms in attributed graph clustering. © 2022, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Generate Like Experts: Multi-Stage Font Generation by Incorporating Font Transfer Process into Diffusion Models

Generate Like Experts: Multi-Stage Font Generation by Incorp...

引用

Conference on computer vision and pattern recognition (CVPR)

作者： Bin Fu Fanghua Yu Anran Liu Zixuan Wang Jie Wen Junjun He Yu Qiao ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences The University of Hong Kong Harbin Institute of Technology Shenzhen Shanghai Artificial Intelligence Laboratory

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Few-shot font generation (FFG) produces stylized font images with a limited number of reference samples, which can significantly reduce labor costs in manual font designs. Most existing FFG methods follow the style-content dis-entanglement paradigm and employ the Generative Adver-sarial Network (GAN) to generate target fonts by combining the decoupled content and style representations. The complicated structure and detailed style are simultaneously generated in those methods, which may be the sub-optimal solutions for FFG task. Inspired by most manual font design processes of expert designers, in this paper, we model font generation as a multi-stage generative process. Specifically, as the injected noise and the data distribution in diffusion models can be well-separated into different sub-spaces, we are able to incorporate the font transfer process into these models. Based on this observation, we generalize diffusion methods to modelfont generative process by separating the reverse diffusion process into three stages with different functions: The structure construction stage first generates the structure information for the target character based on the source image, and the font transfer stage subsequently transforms the source font to the target font. Finally, the font refinement stage enhances the appearances and local details of the target font images. Based on the above multi-stage generative process, we construct our font generation framework. named MSD-Font, with a dual-network approach to generate font images. The superior performance demonstrates the effectiveness of our model. The code is available at: https://***/fubinfbIMSD-Font.

关键词： Costs Noise Diffusion processes Transforms Manuals Diffusion models Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：