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

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

来源：评论

学校读者我要写书评

暂无评论

Real-time 3D human pose estimation without skeletal a priori structures

引用

Image and vision Computing 2023年 132卷

作者： Bai, Guihu Luo, Yanmin Pan, Xueliang Wang, Jia Guo, Jing-Ming College of Computer Science and Technology Huaqiao University 668 Jimei Avenue Jimei District Fujian Xiamen361021 China Key Laboratory for Computer Vision and Pattern Recognition Huaqiao University 668 Jimei Avenue Jimei District Fujian Xiamen361021 China The Department of Electrical Engineering National Taiwan University of Science and Technology Taipei10607 Taiwan

This study is about real-time 2D-3D human pose estimation without using the a priori structure of the skeleton and with a low number of parameters for regression tasks. Current graph convolution-based 3D human pose tasks require structural knowledge of the skeleton, which limits the exploration of pose estimation for unknown structures. Inspired by tyre rotation and circular convolution, weights rotation is used to fully learn the potential connections between the human joints. We refer to this process as the weight cyclic sharing mechanism, a novel method for updating features. It does not require knowledge of the structure of the human skeleton and learns different constraints between joints with a low number of parameters. We propose an end-to-end weight circular sharing network (WCirSNet) based on the weight circular sharing mechanism. We propose a simple and efficient weighted residual block in this WCirSNet. The superiorities of the weight circular sharing mechanism and weighted residual block were verified by abundant ablation studies. Extensive evaluations on two challenging benchmark datasets (Human 3.6 M, MPI-INF-3DHP) show that the performance and generalization capabilities of our framework are superior to the results of many previously advanced methods. © 2023 Elsevier B.V.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Local Neighbor Propagation on Graphs for Robust Feature Matching

SSRN

引用

SSRN 2023年

作者： Guo, Hanlin Xiao, Guobao Su, Lumei Zhou, Jiaxing Wang, Dahan Xiamen Key Laboratory of Frontier Electric Power Equipment and Intelligent Control School of Electrical Engineering and Automation Xiamen University of Technology China Fujian Key Laboratory of Sensing and Computing for Smart Cities School of Information Science and Engineering Xiamen University China College of Computer and Control Engineering Minjiang University China Fujian Key Laboratory of Pattern Recognition and Image Understanding School of Computer and Information Engineering Xiamen University of Technology China

Establishing reliable correspondences between two sets of feature points is a critical preprocessing step in many computer vision and pattern recognition tasks. In this paper, we propose a novel robust Local Neighbor Propagation on Graphs based feature matching (LNPG) method, to obtain good correspondences for feature matching. LNPG starts from a novel neighborhood graph construction strategy. The strategy leverages the spatial consistency constraint to generate a series of neighborhood sets, and employs the residual information to preserve the local neighborhood relationships of potential inliers (i.e., true matches). Subsequently, LNPG incorporates local neighbor propagation into the graph to enhance connections between data in different neighborhoods, by using the path-based similarity measurement and the adaptive graph partition. In addition, LNPG includes a novel consistency-filtering-based clustering algorithm for robust feature matching. This clustering algorithm introduces a reliable neighborhood consistency measure function and an effective cluster merging criterion for cluster detection and cluster merging during the clustering process, respectively. Overall, LNPG not only effectively distinguishes inliers from outliers, but also reliably classifies inliers into different transformation models between pairs of images. Experiments on publicly available datasets with different types of image transformations show the superiority of our LNPG in comparison with other state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Activating More Pixels in Image Super-Resolution Transformer

Activating More Pixels in Image Super-Resolution Transformer

引用

Conference on computer vision and pattern recognition (CVPR)

作者： Xiangyu Chen Xintao Wang Jiantao Zhou Yu Qiao Chao Dong State Key Laboratory of Internet of Things for Smart City University of Macau Shenzhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shanghai Artificial Intelligence Laboratory ARC Lab Tencent PCG

Transformer-based methods have shown impressive performance in low-level vision tasks, such as image super-resolution. However, we find that these networks can only utilize a limited spatial range of input information through attribution analysis. This implies that the potential of Transformer is still not fully exploited in existing networks. In order to activate more input pixels for better reconstruction, we propose a novel Hybrid Attention Transformer (HAT). It combines both channel attention and window-based self-attention schemes, thus making use of their complementary advantages of being able to utilize global statistics and strong local fitting capability. Moreover, to better aggregate the cross-window information, we introduce an overlapping cross-attention module to enhance the interaction between neighboring window features. In the training stage, we additionally adopt a same-task pre-training strategy to exploit the potential of the model for further improvement. Extensive experiments show the effectiveness of the proposed modules, and we further scale up the model to demonstrate that the performance of this task can be greatly improved. Our overall method significantly outperforms the state-of-the-art methods by more than 1dB.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Framework for Multitarget Tracking with Mutual Occlusions

A Probabilistic Framework for Multitarget Tracking with Mutu...

引用

IEEE Conference on computer vision and pattern recognition

作者： Menglong Yang Yiguang Liu Longyin Wen Zhisheng You Stan Z. Li Key Laboratory of Fundamental Synthetic Vision Graphics and Image for National Defense School of Aeronautics and Astronautics & Computer Science Sichuan University Center for Biometrics and Security Research & National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences

ISBN: (纸本)9781479951192

Mutual occlusions among targets can cause track loss or target position deviation, because the observation likelihood of an occluded target may vanish even when we have the estimated location of the target. This paper presents a novel probability framework for multitarget tracking with mutual occlusions. The primary contribution of this work is the introduction of a vectorial occlusion variable as part of the solution. The occlusion variable describes occlusion states of the targets. This forms the basis of the proposed probability framework, with the following further contributions: 1) Likelihood: A new observation likelihood model is presented, in which the likelihood of an occluded target is computed by referring to both of the occluded and occluding targets. 2) Priori: Markov random field (MRF) is used to model the occlusion priori such that less likely "circular" or "cascading" types of occlusions have lower priori probabilities. Both the occlusion priori and the motion priori take into consideration the state of occlusion. 3) Optimization: A realtime RJMCMC-based algorithm with a new move type called "occlusion state update" ispresented. Experimental results show that the proposed framework can handle occlusions well, even including long-duration full occlusions, which may cause tracking failures in the traditional methods.

关键词： Target tracking Probabilistic logic Approximation algorithms Cameras Proposals Computational modeling

来源：评论

学校读者我要写书评

暂无评论

EfficientFCN: Holistically-guided decoding for semantic segmentation

arXiv

引用

arXiv 2020年

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

Both performance and efficiency are important to semantic segmentation. State-of-the-art semantic segmentation algorithms are mostly based on dilated Fully Convolutional Networks (dilatedFCN), which adopt dilated convolutions in the backbone networks to extract high-resolution feature maps for achieving high-performance segmentation performance. However, due to many convolution operations are conducted on the high-resolution feature maps, such dilatedFCN-based methods result in large computational complexity and memory consumption. To balance the performance and efficiency, there also exist encoder-decoder structures that gradually recover the spatial information by combining multi-level feature maps from the encoder. However, the performances of existing encoder-decoder methods are far from comparable with the dilatedFCN-based methods. In this paper, we propose the EfficientFCN, whose backbone is a common ImageNet pretrained network without any dilated convolution. A holistically-guided decoder is introduced to obtain the high-resolution semantic-rich feature maps via the multi-scale features from the encoder. The decoding task is converted to novel codebook generation and codeword assembly task, which takes advantages of the high-level and low-level features from the encoder. Such a framework achieves comparable or even better performance than state-of-the-art methods with only 1/3 of the computational cost. Extensive experiments on PASCAL Context, PASCAL VOC, ADE20K validate the effectiveness of the proposed EfficientFCN. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

OSRT: Omnidirectional Image Super-Resolution with Distortion-aware Transformer

OSRT: Omnidirectional Image Super-Resolution with Distortion...

引用

Conference on computer vision and pattern recognition (CVPR)

作者： Fanghua Yu Xintao Wang Mingdeng Cao Gen Li Ying Shan Chao Dong ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences ARC Tencent PCG The University of Tokyo Platform Technologies Tencent Online Video Shanghai Artificial Intelligence Laboratory

Omnidirectional images (ODIs) have obtained lots of research interest for immersive experiences. Although ODIs require extremely high resolution to capture details of the entire scene, the resolutions of most ODIs are insufficient. Previous methods attempt to solve this issue by image super-resolution (SR) on equirectangular projection (ERP) images. However, they omit geometric properties of ERP in the degradation process, and their models can hardly generalize to real ERP images. In this paper, we propose Fisheye downsampling, which mimics the real-world imaging process and synthesizes more realistic low-resolution samples. Then we design a distortion-aware Transformer (OSRT) to modulate ERP distortions continuously and self-adaptively. Without a cumbersome process, OSRT outperforms previous methods by about 0.2dB on PSNR. Moreover, we propose a convenient data augmentation strategy, which synthesizes pseudo ERP images from plain images. This simple strategy can alleviate the over-fitting problem of large networks and significantly boost the performance of ODISR. Extensive experiments have demonstrated the state-of-the-art performance of our OSRT.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Activating More Pixels in Image Super-Resolution Transformer

arXiv

引用

arXiv 2022年

作者： Chen, Xiangyu Wang, Xintao Zhou, Jiantao Qiao, Yu Dong, Chao State Key Laboratory of Internet of Things for Smart City University of Macau China Shenzhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China Shanghai Artificial Intelligence Laboratory China ARC Lab Tencent PCG China

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Inconsistency Distillation For Consistency:Enhancing Multi-View Clustering via Mutual Contrastive Teacher-Student Leaning

Inconsistency Distillation For Consistency:Enhancing Multi-V...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Dunqiang Liu Shu-Juan Peng Xin Liu Lei Zhu Zhen Cui Taihao Li Dept. of Comput. Sci. & Fujian Key Lab. of Big Data Intelligence and Security Huaqiao University Xiamen China Zhejiang Lab Hangzhou China Xiamen Key Lab. of Computer Vision and Pattern Recognition Huaqiao University Xiamen China Key Lab. of Computer Vision and Machine Learning (Huaqiao University) Fujian Province University Xiamen China School of Information Sci. and Eng. Shandong Normal University Jinan China School of Computer Sci. and Eng. Nanjing University of Science and Technology Nanjing China

Multi-view clustering has attracted more attention recently since many real-world data are comprised of different representations or views. Recent multi-view clustering works mainly exploit the instance consistency to obtain the shared representations across different views, and apply a single-view clustering method to perform data partitions. However, these existing methods often ignore the inconsistency of instance associations within the views, which may enlarge the intra-class diversity among the views and therefore degrade the clustering performance. To address this issue, this paper proposes an efficient mutual contrastive teacher-student leaning (MC-TSL) model to enhance the multi-view clustering, which is the first attempt to study the inconsistency distillation for consistency learning. First, the proposed MC-TSL approach exploits a view-specific encoder with two heads, an instance encoding head and a semantic distillation head, respectively, for capturing the consistent and discriminative feature representations. To be specific, the former head exploits a cross-view contrastive learning method to obtain a redundancy-free consistent representation at the instance level, while the latter head designs a mutual teacher-student learning module to capture the intra-view information at semantic level. By training these two heads in an end-to-end manner, the discriminative multi-view embeddings are efficiently obtained and refined by minimizing the weighted sum of the reconstruction loss, contrastive loss and contrast distillation loss. Extensive experiments verify the superiorities of the proposed MC-TSL framework and show its competitive clustering performances.

关键词： Training Learning systems Clustering methods Semantics Encoding Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：