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

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Implementation of Membrane Algorithms on GPU

An Implementation of Membrane Algorithms on GPU

引用

The Second Asian Conference on Membrane computing(ACMC2013)

作者： Xingyi Zhang Dong Qin Zhuanlian Ding Jin Tang Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University

Membrane algorithms are a new class of heuristic algorithms, which attempt to incorporate some components of membrane computing models (also called P systems) for designing efficient optimization algorithms, such as the structure of P systems, the way of communication between cells, etc. Membrane algorithms are a kind of parallel methods, where many operations can be performed in parallel. Although the importance of the parallelism of such algorithms is recognized, membrane algorithms were often implemented on the serial computing device Central processing Unit (CPU), which makes the algorithms cannot work in a more efficient way. In this work, we consider the implementation of membrane algorithms on the parallel computing device Graphics processing Unit (GPU). Under such implementation, all cells of membrane algorithms can work simultaneously. Experiment results on two classical intractable problems, point set matching problem and TSP, show that GPU implementation of membrane algorithms is much more efficient than CPU implementation in terms of runtime, especially for solving the problems with a high complexity.

关键词： Membrane computing Membrane algorithm Parallel computing device GPU

来源：评论

学校读者我要写书评

暂无评论

The structure of the sparse basis function in compressive sensing for fast analysis of wide-angle monostatic scattering problems

The structure of the sparse basis function in compressive se...

引用

2012 International Conference on Microwave and Millimeter Wave Technology, ICMMT 2012

作者： Du, Hong-Mei Chen, Ming-Sheng Wu, Xian-Liang Key Lab. of Intelligent Computing and Signal Processing Anhui University Ministry of Education Hefei 230029 China Department of Physics and Electronic Engineering Hefei Normal University Hefei 230601 China University of Science and Technology of China Hefei 230026 China

ISBN: (纸本)9781467321839

In the theory of compressive sensing, the selection of the basis functions directly affects the sparse transformation, observation number and reconstruction accuracy. In this paper, we introduce the structure of three sparse basic functions, which are used to analyze the electromagnetic scattering problems over a wide incident angle by the method of moment and compressive sensing. According to the characteristics of the induced current of wide angle, the best basic function is selected. Compared with the DCT, the accuracy of the reconstruction for different shape object are improved and the observation number reduces about 50%. © 2012 IEEE.

关键词： Method of moments

来源：评论

学校读者我要写书评

暂无评论

Compressive Sensing for Wide-Angle Analysis

Compressive Sensing for Wide-Angle Analysis

引用

第九届国际天线、电波传播及电磁理论学术研讨会(ISAPE2010)

作者： Hong-Mei Du Yi-Cai Mei Si-Long Lu Ming-Sheng Chen Xian-Liang Wu Key Lab of Intelligent Computing & Signal Processing Anhui University Ministry of Education Hefei Department of Physics and Electronic Engineering Hefei Normal University Hefei 230601 China Schoo Key Lab of Intelligent Computing & Signal Processing Anhui University Ministry of Education Hefei

A new incident source with different angles was constructed for dealing with wide-angle scattering problems. Considering the impendence matrix in method of moments (MOM） is independent from incident angles, the equivalent relationship between induced current and the measured CS-current was build, while the CS-current can be computed directly under the new incident source. Finally, we can reconstruct the induce current by utilizing the theory of compressive sensing (CS). Compared with traditional MOM, the computational complexity can be greatly reduced.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Structural holes study of ICML collaborative network

引用

Journal of Computational Information Systems 2014年第24期10卷 10715-10722页

作者： Duan, Weiwei Qian, Fulan Shi, Lei Zhang, Yanping School of Computer Science and Technology Anhui University Hefei China Key Lab of Intelligent Computing and Signal Processing Anhui University Hefei China

Collaboration among authors is a pervasive phenomenon currently. Mining useful information from cooperation is a significant study to unravel relationships underneath these papers and predict potential collaborations or future popular academic topics. This paper demonstrates the change of Structural Holes in the whole network and for some individual authors from 2009 to 2012 in ICML. This paper is going to study the biggest subset in 2009, which separates into several smaller subsets with less structural holes in 2010 and 2011, while the number of structural holes in 2012 increases. The graphs of the whole networks from 2009 to 2012 drawn by Ucinet are going to demonstrate the changes of structural holes from 2009 to 2012 and expl the reason why there are more structural holes in 2012 compared to 2010 and 2011. The reason is that the ainnumber of authors in 2012 increases about 50 percent compared to 2011, which results in that authors need to find new collaborations and leaders may become intermediaries to connect new authors and existing authors occupying structural holes. And some authors whose papers are published on ICML continuously from 2009 to 2012 are going to be analysed to indicate the changes of their position in the network. Some authors are increasingly constrained in certain groups, while some other authors become bridges connecting different groups and some other authors changes are correspond to the changes of the whole network. They are constrained in certain subset with less structural holes in 2010 and 2011 but, due to large number of authors joining in ICML, more likely to occupy more structural holes.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spatial clustering

Adaptively feature matching via joint transformational-spati...

引用

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

来源：评论

学校读者我要写书评

暂无评论

Accelerated Plasma Simulations using the FDTD Method and the CUDA Architecture

Accelerated Plasma Simulations using the FDTD Method and the...

引用

2013 International Symposium on Antennas and Propagation(2013天线与传播国际会议)

作者： Wei Meng Yufa Sun Key Lab or Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei P.R.China

This letter presents the graphic processor unit (GPU)implementation of the finite-difference time-domain (FDTD)method for the solution of the two-dimensional electromagnetic fields inside dispersive *** improved Z-transform-based finite-difference time-domain (ZTFDTD) method was presented for simulating the interaction of electromagnetic wave with unmagnetized *** using the newly introduced Compute Unified Device Architecture (CUDA) technology, we illustrate the efficacy of GPU in accelerating the FDTD computations by achieving significant speedups with great ease and at no extra hardware *** effect of the GPU-CPU memory transfers on the speedup will be also studied.

关键词： GPU FDTD Z-transform CUDA

来源：评论

学校读者我要写书评

暂无评论

FastICA based single-channel radar signal separation algorithm

FastICA based single-channel radar signal separation algorit...

引用

IET International Radar Conference (IRC 2023)

作者： Xinyu Wang Jin Zhao Xianliang Wu Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei People's Republic of China

ISBN: (数字)9781837240982

Aiming at the traditional blind source separation for the received single-channel mixed radar signal makes it difficult to accurately recover the source signal, a single-channel radar signal comprehensive separation method based on the combination of the FastICA algorithm and the variational modal decomposition (VMD) algorithm is proposed. The method utilizes VMD to first perform modal separation of single-channel mixed Linear Frequency Modulation (LFM) signal, then selects the modal component signal with the largest correlation coefficient with the mixed signal and expands it with single-channel mixed LFM signal into a virtual multi-channel mixed signal, and finally inputs it into FastICA algorithm to obtain the source signal. The simulation experiment results show that the comprehensive separation algorithm can accurately separate the LFM signal, overcoming the limitation that the FastICA algorithm cannot directly separate the single-channel mixed radar signal.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fusion of Polarization Image Using Bidimensional Empirical Mode Decomposition

Fusion of Polarization Image Using Bidimensional Empirical M...

引用

International Conference on Computer Science and Mechanical Automation

作者： Dexiang Zhang Zihong Chen Jiaxing Li Jingjing Zhang Key Lab. of Intelligent Computing and Signal Processing Anhui University The School of Electrical Engineering and Automation Anhui University

ISBN: (纸本)9781467391672

Empirical mode decomposition (EMD) provides a powerful tool for adaptive multiscale analysis of nonstationary signals. Bidimensional empirical mode decomposition (BEMD) techniques decompose an image into several bidimensional intrinsic mode functions (BIMFs) and a bidimensional residue (BR). Firstly, several polarization images can be decomposed into several BIMFs with multi-scales using BEMD. For the BIMF coefficients, the teager energy-based method is used. For the each BIMF coefficients, the area-based teager energy larger value of information measurement is used to select the better coefficients for fusion. At last the fused image can be obtained by utilizing inverse transform for fused image. Experimental results show that the proposed algorithm gives more satisfactory results than the traditional image fusion algorithms in preserving the edges and texture information.

关键词： Bidimensional empirical mode decomposition Image decomposition Polarization image Image fusion

来源：评论

学校读者我要写书评

暂无评论

Separable reversible data hiding based on MSB prediction for encrypted 3D mesh models?

arXiv

引用

arXiv 2019年

作者： Xu, Na Yin, Zhaoxia Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei

Reversible data hiding in encrypted domain (RDH-ED) has received tremendous attention from the research community because data can be embedded into cover media without exposing it to the third party data hider and the cover media can be losslessly recovered after the extraction of the embedded data. Although, in recent years, exten- sive studies have been carried out about images based RDH-ED, little attention is paid to RDH-ED in 3D mesh models due to its complex data structure and irregular geometry. We propose a separable RDH-ED method for 3D mesh models based on MSB (most significant bit) predic- tion. Firstly, we divide all the vertices of the mesh into the "embedded" set and "reference" set according to topological information between ver- tices, and calculate the MSB prediction errors for the vertices of the "em- bedded" set. Then, bit-stream encryption is used to encrypt the mesh. Finally, data is embedded by replacing the MSB of the encrypted vertex coordinates of the "embedded" set by the additional data bits. Recipient with data hiding key can correctly extract the additional data from the marked encrypted mesh. Recipient with encryption key can recover the mesh perfectly by using MSB prediction. Experimental results show that the proposed method has higher embedding capacity and higher quality of the recovered meshes compared to the existing RDH-ED method for 3D meshes based on symmetric encryption. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：