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

9th International Conference on Intelligent Computing and Signal processing, ICSP 2024

作者： Wang, Xuewei Yuan, Shuang Yang, Lidong Niu, Dawei Inner Mongolia University of Science and Technology School of Digtial and Intelligence Industry Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing Inner Mongolia China

ISBN: (纸本)9798350376548

Cervical cytologic screening is clinically important for the prevention and diagnosis of cervical cancer. Aiming at the many challenges in the detection of abnormal cervical cells, including the difficult detection of small targets of abnormal cervical cells, complex backgrounds, and uneven cell morphology, a detection algorithm for abnormal cervical cells based on improved YOLOv7 was proposed. The algorithm utilizes Deformable Convolutional Networks v2 (DCNv2) that adaptively de-tunes the scale and receptive field size to more effectively cope with the complexity and diversity of cervical cell images. The experimental results show that the improved YOLOv7 algorithm mAP achieves 57.26%, up to 73.88% accuracy, and 46.90% recall on the cervical abnormal cell dataset. Compared with the benchmark model, they increased by 4.07%, 3.39%, and 5.69%, respectively. © 2024 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Dynamic Frame Interpolation in Wavelet Domain

引用

IEEE Transactions on image processing 2023年 32卷 5296-5309页

作者： Kong, Lingtong Jiang, Boyuan Luo, Donghao Chu, Wenqing Tai, Ying Wang, Chengjie Yang, Jie Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Department of Automation Shanghai200240 China Tencent Youtu Laboratory Shanghai200233 China Nanjing University School of Intelligence Science and Technology Suzhou215163 China

Video frame interpolation is an important low-level vision task, which can increase frame rate for more fluent visual experience. Existing methods have achieved great success by employing advanced motion models and synthesis networks. However, the spatial redundancy when synthesizing the target frame has not been fully explored, that can result in lots of inefficient computation. On the other hand, the computation compression degree in frame interpolation is highly dependent on both texture distribution and scene motion, which demands to understand the spatial-temporal information of each input frame pair for a better compression degree selection. In this work, we propose a novel two-stage frame interpolation framework termed WaveletVFI to address above problems. It first estimates intermediate optical flow with a lightweight motion perception network, and then a wavelet synthesis network uses flow aligned context features to predict multi-scale wavelet coefficients with sparse convolution for efficient target frame reconstruction, where the sparse valid masks that control computation in each scale are determined by a crucial threshold ratio. Instead of setting a fixed value like previous methods, we find that embedding a classifier in the motion perception network to learn a dynamic threshold for each sample can achieve more computation reduction with almost no loss of accuracy. On the common high resolution and animation frame interpolation benchmarks, proposed WaveletVFI can reduce computation up to 40% while maintaining similar accuracy, making it perform more efficiently against other state-of-the-arts. © 1992-2012 IEEE.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Research on the Detection of Abnormal Cervical Cells Based on Improved YOLOv7

Research on the Detection of Abnormal Cervical Cells Based o...

引用

6th International Conference on Intelligent Computing and Signal processing (ICSP)

作者： Xuewei Wang Shuang Yuan Lidong Yang Dawei Niu Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing Inner Mongolia University of Science and Technology School of Digtial and Intelligence Industry Inner Mongolia China

ISBN: (数字)9798350376548

ISBN: (纸本)9798350376555

关键词： Accuracy Sensitivity Shape Prevention and mitigation Signal processing algorithms Signal processing Feature extraction Convolutional neural networks Detection algorithms Cervical cancer

来源：评论

学校读者我要写书评

暂无评论

Generating Cartoon images from Face Photos with Cycle-Consistent Adversarial Networks

引用

Computers, Materials & Continua 2021年第11期69卷 2733-2747页

作者： Tao Zhang Zhanjie Zhang Wenjing Jia Xiangjian He Jie Yang School of Artificial Intelligence and Computer Science Jiangnan UniversityWuxi214000China Key Laboratory of Artificial Intelligence Jiangsu214000China The Global Big Data Technologies Centre University of Technology SydneyUltimoNSW2007Australia The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong UniversityShanghai201100China

The generative adversarial network(GAN)is first proposed in 2014,and this kind of network model is machine learning systems that can learn to measure a given distribution of data,one of the most important applications is style *** transfer is a class of vision and graphics problems where the goal is to learn the mapping between an input image and an output ***-GAN is a classic GAN model,which has a wide range of scenarios in style *** its unsupervised learning characteristics,the mapping is easy to be learned between an input image and an output ***,it is difficult for CYCLE-GAN to converge and generate high-quality *** order to solve this problem,spectral normalization is introduced into each convolutional kernel of the *** convolutional kernel reaches Lipschitz stability constraint with adding spectral normalization and the value of the convolutional kernel is limited to[0,1],which promotes the training process of the proposed ***,we use pretrained model(VGG16)to control the loss of image content in the position of l1 *** avoid overfitting,l1 regularization term and l2 regularization term are both used in the object loss *** terms of Frechet Inception Distance(FID)score evaluation,our proposed model achieves outstanding performance and preserves more discriminative *** results show that the proposed model converges faster and achieves better FID scores than the state of the art.

关键词： Generative adversarial network spectral normalization Lipschitz stability constraint VGG16 l1 regularization term l2 regularization term Frechet inception distance

来源：评论

学校读者我要写书评

暂无评论

Learning Analysis of Kernel Ridgeless Regression with Asymmetric Kernel Learning

arXiv

引用

arXiv 2024年

作者： He, Fan He, Mingzhen Shi, Lei Huang, Xiaolin Suykens, Johan A.K. STADIUS Center for Dynamical Systems Signal Processing and Data Analytics KU Leuven Leuven Belgium MOE Key Laboratory of System Control and Information Processing Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Shanghai Key Laboratory for Contemporary Applied Mathematics School of Mathematical Sciences Fudan University Shanghai200433 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China MOE Key Laboratory of System Control and Information Processing Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai200240 China

Ridgeless regression has garnered attention among researchers, particularly in light of the "Benign Overfitting" phenomenon, where models interpolating noisy samples demonstrate robust generalization. However, kernel ridgeless regression does not always perform well due to the lack of flexibility. This paper enhances kernel ridgeless regression with Locally-Adaptive-Bandwidths (LAB) RBF kernels, incorporating kernel learning techniques to improve performance in both experiments and theory. For the first time, we demonstrate that functions learned from LAB RBF kernels belong to an integral space of Reproducible Kernel Hilbert Spaces (RKHSs). Despite the absence of explicit regularization in the proposed model, its optimization is equivalent to solving an 0-regularized problem in the integral space of RKHSs, elucidating the origin of its generalization ability. Taking an approximation analysis viewpoint, we introduce an lq-norm analysis technique (with 0 © 2024, CC BY.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Hybrid Data-Free Knowledge Distillation 39

Hybrid Data-Free Knowledge Distillation

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Tang, Jialiang Chen, Shuo Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Jiangsu Key Laboratory of Image and Video Understanding for Social Security China Center for Advanced Intelligence Project RIKEN Japan Department of Automation Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

ISBN: (纸本)157735897X

Data-free knowledge distillation aims to learn a compact student network from a pre-trained large teacher network without using the original training data of the teacher network. Existing collection-based and generation-based methods train student networks by collecting massive real examples and generating synthetic examples, respectively. However, they inevitably become weak in practical scenarios due to the difficulties in gathering or emulating sufficient real-world data. To solve this problem, we propose a novel method called Hybrid Data-Free Distillation (HiDFD), which leverages only a small amount of collected data as well as generates sufficient examples for training student networks. Our HiDFD comprises two primary modules, i.e., the teacher-guided generation and student distillation. The teacher-guided generation module guides a Generative Adversarial Network (GAN) by the teacher network to produce high-quality synthetic examples from very few real-world collected examples. Specifically, we design a feature integration mechanism to prevent the GAN from overfitting and facilitate the reliable representation learning from the teacher network. Meanwhile, we drive a category frequency smoothing technique via the teacher network to balance the generative training of each category. In the student distillation module, we explore a data inflation strategy to properly utilize a blend of real and synthetic data to train the student network via a classifier-sharing-based feature alignment technique. Intensive experiments across multiple benchmarks demonstrate that our HiDFD can achieve state-of-the-art performance using 120 times less collected data than existing methods. Copyright © 2025, Association for the Advancement of Artificia intelligence (***). All rights reserved.

关键词： Personnel training

来源：评论

学校读者我要写书评

暂无评论

Hybrid Data-Free Knowledge Distillation

arXiv

引用

arXiv 2024年

Data-free knowledge distillation aims to learn a compact student network from a pre-trained large teacher network without using the original training data of the teacher network. Existing collection-based and generation-based methods train student networks by collecting massive real examples and generating synthetic examples, respectively. However, they inevitably become weak in practical scenarios due to the difficulties in gathering or emulating sufficient real-world data. To solve this problem, we propose a novel method called Hybrid Data-Free Distillation (HiDFD), which leverages only a small amount of collected data as well as generates sufficient examples for training student networks. Our HiDFD comprises two primary modules, i.e., the teacher-guided generation and student distillation. The teacher-guided generation module guides a Generative Adversarial Network (GAN) by the teacher network to produce high-quality synthetic examples from very few real-world collected examples. Specifically, we design a feature integration mechanism to prevent the GAN from overfitting and facilitate the reliable representation learning from the teacher network. Meanwhile, we drive a category frequency smoothing technique via the teacher network to balance the generative training of each category. In the student distillation module, we explore a data inflation strategy to properly utilize a blend of real and synthetic data to train the student network via a classifier-sharing-based feature alignment technique. Intensive experiments across multiple benchmarks demonstrate that our HiDFD can achieve state-of-the-art performance using 120 times less collected data than existing methods. Code is available at https://***/tangjialiang97/HiDFD. Copyright © 2024, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Mushroom Classification Based on Deep Residual Network

Mushroom Classification Based on Deep Residual Network

引用

Pattern recognition and Machine Learning (PRML), IEEE International Conference on

作者： Ju Feng Xufeng Ling Yubo Wang Jie Yang School of Artificial Intelligence Shanghai Normal University Tianhua College Shanghai China Shanghai Acoustics Laboratory Chinese Academy of Sciences Shanghai China Institute of Image Processing and Pattern Recognition and Institute of Medical Robotics Shanghai Jiaotong University Shanghai China

Due to the similarity in mushroom features and the difficulty in distinguishing between poisonous and nonpoisonous varieties, mushrooms pose a threat to human health. To address the challenge of mushroom classification and identification, this paper proposes a mushroom classification method based on residual networks. Firstly, a network architecture with multiple residual blocks is designed, and it is trained using an image dataset. Then, a transfer learning strategy is employed to initialize the network parameters from a pre-trained model, followed by fine-tuning to adapt to the mushroom classification task. Finally, multiple testing experiments are conducted to evaluate the effectiveness of the proposed method. The experimental results demonstrate excellent performance of the proposed method in mushroom classification tasks. Compared to traditional feature extraction methods, it can better capture the details and texture features of mushrooms, thereby improving classification accuracy. In conclusion, the mushroom classification method based on residual networks exhibits high accuracy and generalization capability. This method has potential applications in the field of mushroom classification, aiding in the better identification and differentiation of poisonous mushrooms, thereby protecting human health.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling Inter-Intra Heterogeneity for Graph Federated Learning

arXiv

引用

arXiv 2024年

作者： Yu, Wentao Chen, Shuo Tong, Yongxin Gu, Tianlong Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Center for Advanced Intelligence Project RIKEN Japan State Key Laboratory of Complex & Critical Software Environment Beihang University China Jinan University China Department of Automation Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

Heterogeneity is a fundamental and challenging issue in federated learning, especially for the graph data due to the complex relationships among the graph nodes. To deal with the heterogeneity, lots of existing methods perform the weighted federation based on their calculated similarities between pairwise clients (i.e., subgraphs). However, their inter-subgraph similarities estimated with the outputs of local models are less reliable, because the final outputs of local models may not comprehensively represent the real distribution of subgraph data. In addition, they ignore the critical intra-heterogeneity which usually exists within each subgraph itself. To address these issues, we propose a novel Federated learning method by integrally modeling the Inter-Intra Heterogeneity (FedIIH). For the inter-subgraph relationship, we propose a novel hierarchical variational model to infer the whole distribution of subgraph data in a multi-level form, so that we can accurately characterize the inter-subgraph similarities with the global perspective. For the intra-heterogeneity, we disentangle the subgraph into multiple latent factors and partition the model parameters into multiple parts, where each part corresponds to a single latent factor. Our FedIIH not only properly computes the distribution similarities between subgraphs, but also learns disentangled representations that are robust to irrelevant factors within subgraphs, so that it successfully considers the inter- and intra- heterogeneity simultaneously. Extensive experiments on six homophilic and five heterophilic graph datasets in both non-overlapping and overlapping settings demonstrate the effectiveness of our method when compared with nine state-of-the-art methods. Specifically, FedIIH averagely outperforms the second-best method by a large margin of 5.79% on all heterophilic datasets. Code is available at https://***/blgpb/FedIIH. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Modeling Inter-Intra Heterogeneity for Graph Federated Learning 39

Modeling Inter-Intra Heterogeneity for Graph Federated Learn...

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Yu, Wentao Chen, Shuo Tong, Yongxin Gu, Tianlong Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Center for Advanced Intelligence Project RIKEN Japan State Key Laboratory of Complex & Critical Software Environment Beihang University China Engineering Research Center of Trustworthy AI Ministry of Education Jinan University China Department of Automation Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

ISBN: (纸本)157735897X

Heterogeneity is a fundamental and challenging issue in federated learning, especially for the graph data due to the complex relationships among the graph nodes. To deal with the heterogeneity, lots of existing methods perform the weighted federation based on their calculated similarities between pairwise clients (i.e., subgraphs). However, their inter-subgraph similarities estimated with the outputs of local models are less reliable, because the final outputs of local models may not comprehensively represent the real distribution of subgraph data. In addition, they ignore the critical intra-heterogeneity which usually exists within each subgraph itself. To address these issues, we propose a novel Federated learning method by integrally modeling the Inter-Intra Heterogeneity (FedIIH). For the inter-subgraph relationship, we propose a novel hierarchical variational model to infer the whole distribution of subgraph data in a multi-level form, so that we can accurately characterize the inter-subgraph similarities with the global perspective. For the intra-heterogeneity, we disentangle the subgraph into multiple latent factors and partition the model parameters into multiple parts, where each part corresponds to a single latent factor. Our FedIIH not only properly computes the distribution similarities between subgraphs, but also learns disentangled representations that are robust to irrelevant factors within subgraphs, so that it successfully considers the inter- and intra- heterogeneity simultaneously. Extensive experiments on six homophilic and five heterophilic graph datasets in both non-overlapping and overlapping settings demonstrate the effectiveness of our method when compared with nine state-of-the-art methods. Specifically, FedIIH averagely outperforms the second-best method by a large margin of 5.79% on all heterophilic datasets. Copyright © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：