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

Suppressing Uncertainties in Degradation Estimation for Blind Super-Resolution

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Lin, Junxiong Tao, Zen Tong, Xuan Mai, Xinji Wang, Haoran Wang, Boyang Wang, Yan Zhao, Qing Yu, Jiawen Lin, Yuxuan Yan, Shaoqi Gao, Shuyong Zhang, Wenqiang Shanghai Engineering Research Center of AI & Robotics Academy for Engineering & Technology Fudan University Shanghai China East China University of Science and Technology Shanghai China Fudan University Shanghai China Engineering Research Center of AI & Robotics Ministry of Education Academy for Engineering & Technology Fudan University Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai China

The problem of blind image super-resolution aims to recover high-resolution (HR) images from low-resolution (LR) images with unknown degradation modes. Most existing methods model the image degradation process using blur kernels. However, this explicit modeling approach struggles to cover the complex and varied degradation processes encountered in the real world, such as high-order combinations of JPEG compression, blur, and noise. Implicit modeling for the degradation process can effectively overcome this issue, but a key challenge of implicit modeling is the lack of accurate ground truth labels for the degradation process to conduct supervised training. To overcome this limitations inherent in implicit modeling, we propose an Uncertainty-based degradation representation for blind Super-Resolution framework (USR). By suppressing the uncertainty of local degradation representations in images, USR facilitated self-supervised learning of degradation representations. The USR consists of two components: Adaptive Uncertainty-Aware Degradation Extraction (AUDE) and a feature extraction network composed of Variable Depth Dynamic Convolution (VDDC) blocks. To extract Uncertainty-based Degradation Representation from LR images, the AUDE utilizes the Self-supervised Uncertainty Contrast module with Uncertainty Suppression Loss to suppress the inherent model uncertainty of the Degradation Extractor. Furthermore, VDDC block integrates degradation information through dynamic convolution. Rhe VDDC also employs an Adaptive Intensity Scaling operation that adaptively adjusts the degradation representation according to the network hierarchy, thereby facilitating the effective integration of degradation information. Quantitative and qualitative experiments affirm the superiority of our approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolution

Deep Representation Learning for Electron Ionization Mass Spectra Retrieval

学校读者我要写书评

暂无评论

Deep Representation Learning for Electron Ionization Mass Sp...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Shibo Liu Xuan Zhang Anlei Jiao Shiwei Sun Longyang Dian Xuefeng Cui School of Computer Science and Technology Shandong University Qingdao China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China State Key Laboratory of Microbial Technology Shandong University Qingdao China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The task of retrieving and analyzing mass spectra is indispensable for the identification of compounds in mass spectrometry (MS). This methodology is of critical importance as it enables researchers to correlate observed spectra with established databases, thereby precisely determining the chemical composition of samples. The primary challenges to its efficacy lie in optimizing the balance between retrieval accuracy and processing speed. Empirical studies have demonstrated that by converting mass spectra into embeddings via deep learning, it is possible to achieve both high accuracy and speed in retrieval. Nevertheless, there are complex challenges associated with employing deep learning for spectral embedding, particularly within the domain of electron ionization mass spectrometry (EI-MS). In this paper, we introduce a novel representation learning technique termed EI-MS2VEC for EI-MS retrieval. Our spectrum retrieval methodology surpasses current state-of-the-art techniques such as FastEI. For the in-silico library, we attain hit rate@1 and hit rate@10 of 43.6% and 84.5%, respectively, compared to FastEI’s 36.7% and 80.4%. Moreover, our retrieval approach operates with an order of magnitude greater speed than FastEI. The source code is available on Github (https://***/xfcui/EI-MS2VEC).

关键词： Representation learning Deep learning Accuracy Databases Source coding Ionization Predictive models Mass spectroscopy Electrons Software development management

New families of non-Reed-Solomon MDS codes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Jin, Lingfei Ma, Liming Xing, Chaoping Zhou, Haiyan The Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China The State Key Laboratory of Cryptology P. O. Box 5159 Beijing100878 China The School of Mathematical Sciences University of Science and Technology of China Hefei230026 China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China School of Mathematical Sciences Nanjing Normal University Nanjing210023 China

MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of non-Reed-Solomon (non-RS) type MDS codes has emerged as an intriguing and important problem in both coding theory and finite geometry. Although some constructions of non-RS type MDS codes have been presented in the literature, the parameters of these MDS codes remain subject to strict constraints. In this paper, we introduce a general framework of constructing [n, k] MDS codes using the idea of selecting a suitable set of evaluation polynomials and a set of evaluation points such that all nonzero polynomials have at most k−1 zeros in the evaluation set. Moreover, these MDS codes can be proved to be non-Reed-Solomon by computing their Schur squares. Furthermore, several explicit constructions of non-RS MDS codes are given by converting to combinatorial problems. As a result, new families of non-RS MDS codes with much more flexible lengths can be obtained and most of them are not covered by the known results. © 2024, CC BY.

关键词： Reed-Solomon codes

How to Train Your Neural Network for Molecular Structure Generation from Mass Spectra?

学校读者我要写书评

暂无评论

How to Train Your Neural Network for Molecular Structure Gen...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Kai Zhao Yanmin Liu Longyang Dian Shiwei Sun Xuefeng Cui School of Computer Science and Technology Shandong University Qingdao China State Key Laboratory of Microbial Technology Shandong University Qingdao China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Mass spectrometry serves as a pivotal tool for the analysis of small molecules through an examination of their mass-to-charge ratios. Recent advancements in deep learning have markedly enhanced the analysis of mass spectrometric data, facilitating the prediction of novel small molecule structures without the necessity of extensive databases. Nonetheless, the paucity of annotated datasets impedes the efficacious training of molecular generation models predicated on MS 2 spectra. To mitigate this limitation, we introduce ctMSNovelist, an avant-garde method that amalgamates pre-training, fine-tuning, and co-training techniques to construct a more precise model for the generation of molecular structures from tandem mass spectrometry data. This novel approach augments both the training regimen and the predictive accuracy of the MSNovelist model, thereby surmounting the obstacle of limited data. The methodology commences with the pretraining of a Variational Autoencoder (VAE) to generate molecular fingerprints derived from SMILES strings. Subsequently, it undergoes fine-tuning to emulate noisy fingerprints originating from mass spectrometry (MS) data. Concurrently, MSNovelist is co-trained utilizing these simulated fingerprints, inclusive of the highly noisy variants produced in the early stages of VAE training. The incorporation of a substantial volume of noisy data serves to enhance model accuracy and avert overfitting. We evaluated ctMSNovelist using the GNPS dataset and attained a SMILES prediction accuracy of 48.8%, representing a 4.1% enhancement over MSNovelist. It is pertinent to note that the sole distinction between ctMSNovelist and MSNovelist in this experiment was the training process. The code and models are publicly available at https://***/xfcui/ctMSNovelist.

关键词： Training Solid modeling Accuracy Biological system modeling Fingerprint recognition Predictive models Mass spectroscopy Data models Noise measurement Overfitting

Software Module Clustering Using the Hierarchical Clustering Combination Method 7

学校读者我要写书评

暂无评论

Software Module Clustering Using the Hierarchical Clustering...

7th International Conference on Cloud Computing and Big Data Analytics, ICCCBDA 2022

作者： Xia, Hong Zhang, Yongkang Chen, Yanping Zhang, Hengshan Wang, Zhongmin Wang, Fengwei School of Computer Science and Technology Xi'An Univ. of P. and Telecom. Shaanxi Key Lab. of Network Data Analysis and Intelligent Processing Xi'an China Xi'An University of Posts and Telecommunications School of Computer Science and Technology Xi'an China ZTECorporation Shenzhen China

ISBN: (纸本)9781665487115

The scale of software applications has increased dramatically. Hierarchical clustering is a good method for modular recovery of software architecture. Because the different evaluation criteria of software types and clustering results, a single hierarchical clustering algorithm cannot integrate the number of clusters, arbitrary decision-making, recovery quality and other indicators on different evaluation standards, there is no comprehensive clustering algorithm selection method. We propose a hierarchical clustering combination algorithm and use principal component analysis to combine the results of multiple hierarchical clusters, the combined result retain the basic information of each clustering algorithm as much as possible. The experimental results show that compared with the single software hierarchical clustering method and other combined methods, the result of our method is closer to expert decomposition, and it has good performance on a variety of indicators. © 2022 IEEE.

关键词： Cloud computing Software architecture Clustering methods Software algorithms Decision making Clustering algorithms Big Data

Towards information Sharing Beetle Antennae Search Optimization 24th

学校读者我要写书评

暂无评论

Towards Information Sharing Beetle Antennae Search Optimizat...

24th International Conference on Algorithms and Architectures for Parallel processing, ICA3PP 2024

作者： Liu, Xuan Wang, Chenyan Liu, Wenjian Zhang, Lefeng Liu, Xianggan Gao, Yutong Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance of MOE Minzu University of China Beijing China Hainan International College of Minzu University of China Li’an International Education Innovation pilot Zone Hainan China City University of Macau China Natural Language Processing and Knowledge Graph Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9789819615278

The study of bioinformatics-based evolutionary computation has long been of significant interest within the scientific community. Beetle antennae search algorithm is widely used because of its lightweight, however, it lacks information sharing due to individual iteration in the algorithm. In this paper, we propose an innovative pheromone-based beetle antennae search algorithm, which evolves from a single iterative individual in BAS algorithm to multiple parallel iterative individuals and incorporates the pheromone sharing mechanism found in ant colony optimization algorithm. Applying the pheromone-based beetle antennae search algorithm to the virtual machine placement problem in cloud computing, we find that pheromone sharing mechanism allows the PB-BAS algorithm to exhibit superior optimization capabilities and effectively avoids convergence to local optimal. To verify the performance of the algorithm, we select other alternative algorithms and conduct a large number of comparative experiments under different experimental setups, the experimental results show the effectiveness and efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Ant colony optimization

HPPNET: MODELING THE HARMONIC STRUCTURE AND PITCH INVARIANCE IN PIANO TRANSCRIPTION

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wei, Weixing Li, Peilin Yu, Yi Li, Wei School of Computer Science and Technology Fudan University China Japan Shanghai Key Laboratory of Intelligent Information Processing Fudan University China

While neural network models are making significant progress in piano transcription, they are becoming more resource-consuming due to requiring larger model size and more computing power. In this paper, we attempt to apply more prior about piano to reduce model size and improve the transcription performance. The sound of a piano note contains various overtones, and the pitch of a key does not change over time. To make full use of such latent information, we propose HPPNet that using the Harmonic Dilated Convolution to capture the harmonic structures and the Frequency Grouped Recurrent Neural Network to model the pitch-invariance over time. Experimental results on the MAESTRO dataset show that our piano transcription system achieves state-of-the-art performance both in frame and note scores (frame F1 93.15%, note F1 97.18%). Moreover, the model size is much smaller than the previous state-of-the-art deep learning models. Copyright © 2022, The Authors. All rights reserved.

关键词： Music

Improving Transferability Reversible Adversarial Examples Based on Flipping Transformation 9th

学校读者我要写书评

暂无评论

Improving Transferability Reversible Adversarial Examples Ba...

9th International Conference of Pioneering computer Scientists, Engineers and Educators, ICPCSEE 2023

作者： Fang, Youqing Jia, Jingwen Yang, Yuhai Lyu, Wanli Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China

ISBN: (纸本)9789819959679

Adding subtle perturbations to an image can cause the classification model to misclassify, and such images are called adversarial examples. Adversarial examples threaten the safe use of deep neural networks, but when combined with reversible data hiding (RDH) technology, they can protect images from being correctly identified by unauthorized models and recover the image lossless under authorized models. Based on this, the reversible adversarial example (RAE) is rising. However, existing RAE technology focuses on feasibility, attack success rate and image quality, but ignores transferability and time complexity. In this paper, we optimize the data hiding structure and combine data augmentation technology, which flips the input image in probability to avoid overfitting phenomenon on the dataset. On the premise of maintaining a high success rate of white-box attacks and the image’s visual quality, the proposed method improves the transferability of reversible adversarial examples by approximately 16% and reduces the computational cost by approximately 43% compared to the state-of-the-art method. In addition, the appropriate flip probability can be selected for different application scenarios. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Deep neural networks

Watermarking Pre-trained Language Models with Backdooring

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Gu, Chenxi Huang, Chengsong Zheng, Xiaoqing Chang, Kai-Wei Hsieh, Cho-Jui School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing China Department of Computer Science University of California Los Angeles United States

Large pre-trained language models (PLMs) have proven to be a crucial component of modern natural language processing systems. PLMs typically need to be fine-tuned on task-specific downstream datasets, which makes it hard to claim the ownership of PLMs and protect the developer’s intellectual property due to the catastrophic forgetting phenomenon. We show that PLMs can be watermarked with a multi-task learning framework by embedding backdoors triggered by specific inputs defined by the owners, and those watermarks are hard to remove even though the watermarked PLMs are fine-tuned on multiple downstream tasks. In addition to using some rare words as triggers, we also show that the combination of common words can be used as backdoor triggers to avoid them being easily detected. Extensive experiments on multiple datasets demonstrate that the embedded watermarks can be robustly extracted with a high success rate and less influenced by the followup fine-tuning. Copyright © 2022, The Authors. All rights reserved.

关键词： Natural language processing systems