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

arXiv 2023年

作者： Dong, Jiahua Cong, Yang Sun, Gan Wang, Lixu Lyu, Lingjuan Li, Jun Konukoglu, Ender The State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China The University of Chinese Academy of Sciences Beijing100049 China The Computer Science Department Northwestern University Evanston United States The Sony AI Tokyo108-0075 Japan The School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China The Computer Vision Lab ETH Zurich Zürich8092 Switzerland

3D object recognition has successfully become an appealing research topic in the real-world. However, most existing recognition models unreasonably assume that the categories of 3D objects cannot change over time in the real-world. This unrealistic assumption may result in significant performance degradation for them to learn new classes of 3D objects consecutively, due to the catastrophic forgetting on old learned classes. Moreover, they cannot explore which 3D geometric characteristics are essential to alleviate the catastrophic forgetting on old classes of 3D objects. To tackle the above challenges, we develop a novel Incremental 3D Object Recognition Network (i.e., InOR-Net), which could recognize new classes of 3D objects continuously via overcoming the catastrophic forgetting on old classes. Specifically, a category-guided geometric reasoning is proposed to reason local geometric structures with distinctive 3D characteristics of each class by leveraging intrinsic category information. We then propose a novel critic-induced geometric attention mechanism to distinguish which 3D geometric characteristics within each class are beneficial to overcome the catastrophic forgetting on old classes of 3D objects, while preventing the negative influence of useless 3D characteristics. In addition, a dual adaptive fairness compensations strategy is designed to overcome the forgetting brought by class imbalance, by compensating biased weights and predictions of the classifier. Comparison experiments verify the state-of-the-art performance of the proposed InOR-Net model on several public point cloud datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

A Prediction Approach Based on Long Short-Term Memory Networks for Dynamic Multiobjective Optimization

SSRN

引用

SSRN 2024年

作者： Xu, Biao Rang, Gejie Li, Wenji Gong, Dunwei Fan, Zhun Yang, Shengxiang He, Jie College of Engineering Shantou University Shantou515063 China College of Automation and Electronic Engineering Qingdao University of Science and Technology Qingdao266100 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou543002 China Shenzhen institute for Advanced Study UESTC Shenzhen518110 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom Minjiang University China

Dynamic multiobjective optimization problems (DMOPs) present significant challenges to conventional evolutionary optimization methods because of the continuous changes in their Pareto-optimal sets (PSs) and fronts (PFs). Prediction-driven approaches have demonstrated potential in rapidly adapting to these changes. However, many existing methods depend on linear models to forecast the evolving PSs, which may be restrictive. To counteract this limitation, this research presents a novel dynamic multiobjective evolutionary optimization algorithm that incorporates predictions from long short-term memory (LSTM) networks. Initially, in our methodology, the PS for each problem is segmented into multiple clusters, and the centroid of each cluster is identified. These cluster centroids, representing the PSs across various environmental conditions, are then transformed into a series of time series data. The LSTM network models are subsequently trained on this time series data as input samples. Utilizing these refined models, the centroids of the evolving PSs are predicted with improved precision. Moreover, to enhance the performance of the algorithm, an innovative population-generation strategy is also introduced that guarantees a well-converged and diverse starting population. Our proposed algorithm undergoes rigorous testing using benchmark functions, and the outcomes validate its proficiency in tackling DMOPs, showing superior performance compared to existing state-of-the-art algorithms. © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Manifold-preserved GANs

arXiv

引用

arXiv 2021年

作者： Liu, Haozhe Liang, Hanbang Hou, Xianxu Wu, Haoqian Liu, Feng Shen, Linlin College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

Generative Adversarial Networks (GANs) have been widely adopted in various fields. However, existing GANs generally are not able to preserve the manifold of data space, mainly due to the simple representation of discriminator for the real/generated data. To address such open challenges, this paper proposes Manifold-preserved GANs (MaF-GANs), which generalize Wasserstein GANs into high-dimensional form. Specifically, to improve the representation of data, the discriminator in MaF-GANs is designed to map data into a high-dimensional manifold. Furthermore, to stabilize the training of MaF-GANs, an operation with precise and universal solution for any K-Lipschitz continuity, called Topological Consistency is proposed. The effectiveness of the proposed method is justified by both theoretical analysis and empirical results. When adopting DCGAN as the backbone on CelebA (256×256), the proposed method achieved 12.43 FID, which outperforms the state-of-the-art model like Realness GAN (23.51 FID) by a large margin. Code will be made publicly available. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Fingerprint Presentation Attack Detection by Channel-wise Feature Denoising

arXiv

引用

arXiv 2021年

作者： Liu, Feng Kong, Zhe Liu, Haozhe Zhang, Wentian Shen, Linlin The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

Due to the diversity of attack materials, fingerprint recognition systems (AFRSs) are vulnerable to malicious attacks. It is thus important to propose effective fingerprint presentation attack detection (PAD) methods for the safety and reliability of AFRSs. However, current PAD methods often exhibit poor robustness under new attack types settings. This paper thus proposes a novel channel-wise feature denoising fingerprint PAD (CFD-PAD) method by handling the redundant noise information ignored in previous studies. The proposed method learns important features of fingerprint images by weighing the importance of each channel and identifying discriminative channels and "noise" channels. Then, the propagation of "noise" channels is suppressed in the feature map to reduce interference. Specifically, a PA-Adaptation loss is designed to constrain the feature distribution to make the feature distribution of live fingerprints more aggregate and that of spoof fingerprints more disperse. Experimental results evaluated on the LivDet 2017 dataset showed that the proposed CFD-PAD can achieve 2.53% average classification error (ACE) and a 93.83% true detection rate when the false detection rate equals 1.0% (TDR@FDR=1%). Also, the proposed method markedly outperforms the best single-model-based methods in terms of ACE (2.53% vs. 4.56%) and TDR@FDR=1%(93.83% vs. 73.32%), which demonstrates its effectiveness. Although we have achieved a comparable result with the state-of-the-art multiple-model-based methods, there still is an increase in TDR@FDR=1% from 91.19% to 93.83%. In addition, the proposed model is simpler, lighter and more efficient and has achieved a 74.76% reduction in computation time compared with the state-of-the-art multiple-model-based method. The source code is available at https://***/kongzhecn/cfdpad. Copyright © 2021, The Authors. All rights reserved.

关键词： Palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

Bioinspired Musculoskeletal Model-based Soft Wrist Exoskeleton for Stroke Rehabilitation

引用

Journal of Bionic Engineering 2020年第6期17卷 1163-1174页

作者： Ning Li Tie Yang Yang Yang Peng Yu Xiujuan Xue Xingang Zhao Guoli Song Imad HElhajj Wenxue Wang Ning Xi Lianqing Liu State Key Laboratory of Robotics Shenyang Institute of AutomationChinese Academy of SciencesShenyang 110016China Institutes for Robotics and Itelligent Manufacturing Chinese Academy of SciencesShenyang 110169China University of Chinese Academy of Sciences Bejing 100049China Rehabilitation Center for the Disabled Shenyang 110015China Vision and Robotics Lab Department of Electrical and Computer EngineeringAmerican University of BeirutBeirut 11072020Lebanon Emerging Technologies Instinute Department of Industrial&Manufacturing Systems EngineeringUniversity of Hong KongPokfulamHong Kong 999077China

Exoskeleton robots have demonstrated the potential to rehabilitate stroke ***,poor human-machine physiological coupling causes unexpected damage to human of muscles and ***,inferior humanoid kinematics control would restrict human natural *** to deal with these problems results in bottlenecks and hinders its *** this paper,the simplified muscle model and muscle-liked kinematics model were proposed,based on which a soft wrist exoskeleton was established to realize natural human ***,we simplified the redundant muscular system related to the wrist joint from ten muscles to four,so as to realize the human-robot physiological ***,according to the above human-like musculoskeletal model,the humanoid distributed kinematics control was established to achieve the two DOFs coupling kinematics of the *** results show that the wearer of an exoskeleton could reduce muscle activation and joint force by 43.3%and 35.6%,***,the humanoid motion trajectories similarity of the robot reached 91.5%.Stroke patients could recover 90.3%of natural motion ability to satisfy for most daily *** work provides a fundamental understanding on human-machine physiological coupling and humanoid kinematics control of the exoskeleton robots for reducing the post-stroke complications.

关键词： stroke rehabilitation simplified muscle model soft wrist exoskeleton robot bionic kinematics model

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Methods for Ship Classification: From Visible to Infrared Images

Deep Learning Methods for Ship Classification: From Visible ...

引用

robotics, Intelligent Control and Artificial Intelligence (RICAI), International Conference on

作者： Tianci Liu Hengjia Qin Zhuo Zhan Yunpeng Liu Chinese Academy of Sciences Shenyang Institute of Automation Shenyang China Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Shenyang China University of Chinese Academy of Sciences Beijing China Key Laboratory of Opto-Electronic Information Processing Chinese Academy of Sciences Shenyang China Key Laboratory of Image Understanding and Computer Vision Shenyang Liaoning Province China The Third Military Representative Office of the Air Force Equipment Department in Shenyang Region Shenyang Liaoning Province China

Deep learning methods have achieved excellent performances on visual tasks of target recognition and classification. The rapid development of autonomous seafaring vessels comes up with the requirement to recognize other maritime ships day and night. However, the recognition of ships based on the deep neural networks may not always access the results as expectation when the ships are under the nighttime environment. To this issue, we consider the ship recognition task under the deep learning framework with paired visible images and infrared images. In this article, we propose an end-to-end convolutional network based on visible images and infrared images of the autonomous seafaring vessels. To demonstrate the effectiveness of our model, we choose the V AIS dataset to test the performance of classifying the maritime ships. Experimental results show that the proposed network outperforms the state-of-the-art methods based on the V AIS database.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PIPAL: A Large-Scale Image Quality Assessment Dataset for Perceptual Image Restoration 16th

PIPAL: A Large-Scale Image Quality Assessment Dataset for Pe...

引用

16th European Conference on computer vision, ECCV 2020

作者： Jinjin, Gu Haoming, Cai Haoyu, Chen Xiaoxing, Ye Ren, Jimmy S. Chao, Dong The School of Data Science The Chinese University of Hong Kong Shenzhen China ShenZhen Key Lab of Computer Vision and Pattern Recognition SIAT-SenseTime Joint Lab Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China SenseTime Research Science Park Hong Kong SIAT Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9783030586201

Image quality assessment (IQA) is the key factor for the fast development of image restoration (IR) algorithms. The most recent IR methods based on Generative Adversarial Networks (GANs) have achieved significant improvement in visual performance, but also presented great challenges for quantitative evaluation. Notably, we observe an increasing inconsistency between perceptual quality and the evaluation results. Then we raise two questions: (1) Can existing IQA methods objectively evaluate recent IR algorithms? (2) When focus on beating current benchmarks, are we getting better IR algorithms? To answer these questions and promote the development of IQA methods, we contribute a large-scale IQA dataset, called Perceptual Image Processing Algorithms (PIPAL) dataset. Especially, this dataset includes the results of GAN-based methods, which are missing in previous datasets. We collect more than 1.13 million human judgments to assign subjective scores for PIPAL images using the more reliable "Elo system". Based on PIPAL, we present new benchmarks for both IQA and super-resolution methods. Our results indicate that existing IQA methods cannot fairly evaluate GAN-based IR algorithms. While using appropriate evaluation methods is important, IQA methods should also be updated along with the development of IR algorithms. At last, we improve the performance of IQA networks on GAN-based distortions by introducing anti-aliasing pooling. Experiments show the effectiveness of the proposed method. © 2020, Springer Nature Switzerland AG.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Maximal η-clique maintenance over uncertain graph streams

引用

Information Sciences 2025年 717卷

作者： Ma, Ziyi Wang, Liqing Yang, Jianye Zhou, Xu Li, Kenli Gao, Cuiyun School of Artificial Intelligence Hebei University of Technology Tianjin300401 China Chinacoal Beijing Coal Mining Machinery Co. Ltd. Beijing102400 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou543002 China Department of New Networks PengCheng Laboratory Shenzhen518055 China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou510006 China College of Computer Science and Electronic Engineering Hunan University Changsha410082 China Shenzhen518055 China

Maximal clique enumeration is a critical task for analyzing graph data and has a wide range of applications, such as community detection, protein complex identification, and group recommendation. Although many efficient algorithms have been proposed, most of them are designed for static or deterministic graphs. However, in many real-life applications, graphs are often highly dynamic and nondeterministic. In this paper, we study the problem of maximal η-clique maintenance (shorted as MCM) over uncertain graph streams. Given an uncertain graph G and a probability threshold η, MCM reports all incremental η-cliques in G for each update edge of G. To the best of our knowledge, we are the first to systematically study this problem. We first develop a local pivot-based enumeration technique that utilizes the pivot priority of candidates to achieve effective pruning during the maximal η-clique enumeration procedure. Based on the technique, we propose a competitive baseline approach LPMCM, which finds newly generated maximal η-cliques and internal maximal η-cliques. Although LPMCM avoids repeated enumeration of the same maximal η-cliques, it still requires expensive costs in terms of η-clique maximality determination. To further enhance maintenance efficiency, we introduce an approach HLPMCM using the hash-based maximality determination technique and an improved internal maximal η-clique enumeration technique. Extensive experiments show that HLPMCM can achieve 1.1x-19.0x speedup over the competitors and consumes slightly more memory. © 2025 Elsevier Inc.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

UniFormer: Unifying Convolution and Self-attention for Visual Recognition

arXiv

引用

arXiv 2022年

作者： Li, Kunchang Wang, Yali Zhang, Junhao Gao, Peng Song, Guanglu Liu, Yu Li, Hongsheng Qiao, Yu ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China University of Chinese Academy of Sciences Beijing100049 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China National University of Singapore Singapore Shanghai Artificial Intelligence Laboratory China SenseTime Research China The Chinese University of Hong Kong Hong Kong

It is a challenging task to learn discriminative representation from images and videos, due to large local redundancy and complex global dependency in these visual data. Convolution neural networks (CNNs) and vision transformers (ViTs) have been two dominant frameworks in the past few years. Though CNNs can efficiently decrease local redundancy by convolution within a small neighborhood, the limited receptive field makes it hard to capture global dependency. Alternatively, ViTs can effectively capture long-range dependency via self-attention, while blind similarity comparisons among all the tokens lead to high redundancy. To resolve these problems, we propose a novel Unified transFormer (UniFormer), which can seamlessly integrate the merits of convolution and self-attention in a concise transformer format. Different from the typical transformer blocks, the relation aggregators in our UniFormer block are equipped with local and global token affinity respectively in shallow and deep layers, allowing tackling both redundancy and dependency for efficient and effective representation learning. Finally, we flexibly stack our blocks into a new powerful backbone, and adopt it for various vision tasks from image to video domain, from classification to dense prediction. Without any extra training data, our UniFormer achieves 86.3 top-1 accuracy on ImageNet-1K classification task. With only ImageNet-1K pre-training, it can simply achieve state-of-the-art performance in a broad range of downstream tasks. It obtains 82.9/84.8 top-1 accuracy on Kinetics-400/600, 60.9/71.2 top-1 accuracy on Something-Something V1/V2 video classification tasks, 53.8 box AP and 46.4 mask AP on COCO object detection task, 50.8 mIoU on ADE20K semantic segmentation task, and 77.4 AP on COCO pose estimation task. Moreover, we build an efficient UniFormer with a concise hourglass design of token shrinking and recovering, which achieves 2-4× higher throughput than the recent lightweight models. Code is av

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Enables Large Depth-of-Field Images for Sub-Diffraction-Limit Scanning Superlens Microscopy

arXiv

引用

arXiv 2023年

作者： Sun, Hui Luo, Hao Wang, Feifei Chen, Qingjiu Chen, Meng Wang, Xiaoduo Yu, Haibo Zhang, Guanglie Liu, Lianqing Wang, Jianping Wu, Dapeng Li, Wen Jung Department of Mechanical Engineering City University of Hong Kong Hong Kong State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China Department of Electrical and Electronics Engineering The University of Hong Kong Hong Kong Shenzhen518000 China Department of Computer Science City University of Hong Kong Hong Kong

Scanning electron microscopy (SEM) is indispensable in diverse applications ranging from microelectronics to food processing because it provides large depth-of-field images with a resolution beyond the optical diffraction limit. However, the technology requires coating conductive films on insulator samples and a vacuum environment. We use deep learning to obtain the mapping relationship between optical super-resolution (OSR) images and SEM domain images, which enables the transformation of OSR images into SEM-like large depth-of-field images. Our custom-built scanning superlens microscopy (SSUM) system, which requires neither coating samples by conductive films nor a vacuum environment, is used to acquire the OSR images with features down to ~80 nm. The peak signal-to-noise ratio (PSNR) and structural similarity index measure values indicate that the deep learning method performs excellently in image-to-image translation, with a PSNR improvement of about 0.74 dB over the optical super-resolution images. The proposed method provides a high level of detail in the reconstructed results, indicating that it has broad applicability to chip-level defect detection, biological sample analysis, forensics, and various other fields. Copyright © 2023, The Authors. All rights reserved.

关键词： Scanning electron microscopy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：