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

International Conference on Computer Science and education

作者： Wang, Hua-Bin Tao, Liang Hu, Xue-You Wang, Shi-Yi Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui 230039 China

ISBN: (纸本)9781424460052

Based on illumination normalization and progressive thresholding, this paper presents a novel algorithm for automatic localization of human eyes in still images with complex background. First of all, Retinex method is used to realize normalizing of the face image. Secondly, a determination criterion of eye location is established by the priori knowledge of geometrical facial features. Thirdly, a range of threshold values that would separate eye blocks from others in a segmented face image is estimated. With the progressive increase of the threshold by an appropriate step in that range, once two eye blocks appear from the segmented image, they will be detected by the determination criterion of eye location. Finally, the 2-D correlation coefficient is used as a symmetry similarity measure to check the factuality of the two detected eyes. The experimental results demonstrate the high efficiency of the algorithm in runtime and correct localization rate. ©2010 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A low-complexity resource allocation algorithm based on proportional fairness for multiuser OFDM systems

A low-complexity resource allocation algorithm based on prop...

引用

2008 International Conference on Wireless Communications, Networking and Mobile computing, WiCOM 2008

作者： Yanjun, Hu Li, Li Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui 230039 China

ISBN: (纸本)9781424421084

In this paper, we propose a novel resource allocation algorithm based on proportional fairness in multiuser OFDM systems. Because the utility function is always used for the optimization and achieving the tradeoff between the efficiency and fairness, the proportional fairness optimization problem can be formulated as maximizing the utility function, which is the sum of logarithmic user data rate. However, the optimal proportional fairness problem is NP-hard which requires high complexity. To reduce the complexity of power allocation, we propose a novel power allocation algorithm which achieves good tradeoff between complexity and performance. We discuss our resource allocation algorithm and report on its performance using a set of simulation experiments. © 2008 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Teaching reform and innovation of the course - Digital image processing experiments

Teaching reform and innovation of the course - Digital image...

引用

International Conference on Computer Science and education

作者： Zhao, Haifeng Tang, Jin Luo, Bin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781424460052

Digital image processing is an interdisciplinary course, which needs students have a strong background in mathematics. To help them change from passive learning to active learning, teaching reform and innovation of the course "Digital Image processing Experiments" is discussed in this paper. The combined platform of experiments includes TI DSP experimental box and three different kinds of programming languages. The six experimental projects cover the basic theories of digital image processing. The result can offer a significant reference for the teaching innovations in the other related specialties. ©2010 IEEE.

关键词： MATlab

来源：评论

学校读者我要写书评

暂无评论

Reversible Data Hiding for 3D Mesh Model Based on Block Modulus Encryption and Multi-MSB Prediction 10th

Reversible Data Hiding for 3D Mesh Model Based on Block Modu...

引用

10th International Conference of Pioneering Computer Scientists, Engineers and Educators, ICPCSEE 2024

作者： Fu, Zihao Gao, Yang 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: (纸本)9789819787456

Reversible data hiding in encrypted domain (RDH-ED) fortifies data security and privacy safeguards while upholding the original data’s integrity and accessibility. Current research on RDH-ED focuses on 2D images, while research on 3D mesh models is still immature. This paper introduces an RDH-ED method using block modulus encryption and multi-MSB prediction. Initially, the original mesh model is partitioned into non-overlapping subblocks of equal size, and then the vertices in each subblock are encrypted with the same key for additive modulus encryption, ensuring that the spatial correlation present in the original mesh subblocks remains preserved within the encrypted subblocks. Subsequently, the subblocks are disrupted one by one using the 3D Arnold Transform to enhance security. The vertices in each embeddable subblock are divided into a reference vertex and several embeddable vertices, where the multi-MSB prediction strategy is employed to allocate embedding room for each embeddable vertex. Finally, the secret information is embedded into the allocated room. Since the proposed method almost completely preserves the spatial correlation within each subblock, the achieved embedding rate surpasses that of all previous outstanding methods that rely on vacating room after encryption (VRAE). The experimental findings demonstrate that the proposed approach achieves an average embedding rate of 45.55 bits per vertex (bpv), surpassing the state-of-the-art method that achieves 25.63 bpv. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Segmentation of brain MR images based on t-mixture model

Segmentation of brain MR images based on t-mixture model

引用

3rd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2009

作者： Haifeng, Zhao Xingming, Xu Sibao, Chen Bin, Luo Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781424429028

As Magnetic Resonance Imaging (MRI) is an important technology of radiological evaluation and computeraided diagnosis, the accuracy of the MR image segmentation directly influences the validity of following processing. The paper concerns medical image segmentation based on t-mixture model because of merits of the model. By analyzing the features of MR images, the main procedure of white matter segmentation of brain MR Images based on t-mixture model is outlined follows. The parameters of t-mixture model for the image are firstly estimated. Then the posterior probabilities of the pixels of the image are computed. At last, the image is segmented according to the Bayes decision rule for minimum error. Experimental results show that t-mixture model fits for medical image segmentation. ©2009 IEEE.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

A Gradient-Guided Evolutionary Approach to Training Deep Neural Networks

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2022年第9期33卷 4861-4875页

作者： Yang, Shangshang Tian, Ye He, Cheng Zhang, Xingyi Tan, Kay Chen Jin, Yaochu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei China Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Shenzhen China Department of Computing The Hong Kong Polytechnic University Hong Kong SAR Department of Computer Science University of Surrey Guildford U.K

It has been widely recognized that the efficient training of neural networks (NNs) is crucial to classification performance. While a series of gradient-based approaches have been extensively developed, they are criticized for the ease of trapping into local optima and sensitivity to hyperparameters. Due to the high robustness and wide applicability, evolutionary algorithms (EAs) have been regarded as a promising alternative for training NNs in recent years. However, EAs suffer from the curse of dimensionality and are inefficient in training deep NNs (DNNs). By inheriting the advantages of both the gradient-based approaches and EAs, this article proposes a gradient-guided evolutionary approach to train DNNs. The proposed approach suggests a novel genetic operator to optimize the weights in the search space, where the search direction is determined by the gradient of weights. Moreover, the network sparsity is considered in the proposed approach, which highly reduces the network complexity and alleviates overfitting. Experimental results on single-layer NNs, deep-layer NNs, recurrent NNs, and convolutional NNs (CNNs) demonstrate the effectiveness of the proposed approach. In short, this work not only introduces a novel approach for training DNNs but also enhances the performance of EAs in solving large-scale optimization problems.

关键词： Artificial neural networks Training Optimization Search problems Scalab.lity Complexity theory Genetic algorithms Deep neural networks (DNNs) evolutionary algorithm (EA) genetic operator gradient descent sparsity

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised geometric mean of Kullback-Leibler divergences for subspace selection

Semi-supervised geometric mean of Kullback-Leibler divergenc...

引用

2011 8th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th International Conference on Natural Computation, ICNC'11

作者： Chen, Si-Bao Wang, Hai-Xian Zhang, Xing-Yi Luo, Bin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781612841816

Subspace selection is widely adopted in many areas of pattern recognition. A recent result, named maximizing the geometric mean of Kullback-Leibler (KL) divergences of class pairs (MGMD), is a successful method for subspace selection, which can significantly reduce the class separation problem. However, in many applications, lab.led data are very limited while unlab.led data can be easily obtained. The estimation of divergences of class pairs is unstable using inadequate lab.led data. To take advantage of unlab.led data for subspace selection, semi-supervised MGMD (SSMGMD) is proposed using graph Laplacian as normalization. Quasi-Newton method is adopted to solve the optimization problem. Experiments on synthetic data and real image data show the validity of SSMGMD. © 2011 IEEE.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Adversarial Example Generation Method Based on Probability Histogram Equalization 42

Adversarial Example Generation Method Based on Probability H...

引用

42nd Chinese Control Conference, CCC 2023

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

ISBN: (纸本)9789887581543

CNNs (Convolutional Neural Networks) have a good performance on most classification tasks, but they are vulnerable when meeting adversarial examples. Research and design of highly aggressive adversarial examples can help enhance the security and robustness of CNNs. The transferability of adversarial examples is still low in black-box settings. Therefore, an adversarial example method based on probability histogram equalization, namely HE-MI-FGSM (Histogram Equalization Momentum Iterative Fast Gradient Sign Method) is proposed. In each iteration of the adversarial example generation process, the original input image is randomly histogram equalized, and then the gradient is calculated to generate adversarial perturbations to mitigate overfitting in the adversarial example. The effectiveness of the method is verified on the ImageNet dataset. Compared with the advanced method I-FGSM (Iterative Fast Gradient Sign Method) and MI-FGSM (Momentum I-FGSM), the attack success rate in the adversarial training network increased by 27.9% and 7.7% on average, respectively. © 2023 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A uniform solution to the independent set problem through tissue P systems with cell separation

引用

Frontiers of Computer Science 2012年第4期6卷 477-488页

作者： Xingyi ZHANG Xiangxiang ZENG Bin LUO Zheng ZHANG Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230039China Department of Computer Science Xiamen UniversityXiamen 361005China Key Laboratory of Image Processing and Intelligent Control Department of Control Science and EngineeringHuazhong University of Science and TechnologyWuhan 430074China

Membrane computing is an emergent branch of natural computing, which is inspired by the structure and the functioning of living cells, as well as the organization of cells in tissues, organs, and other higher order structures. Tissue P systems are a class of the most investigated computing mod- els in the framework of membrane computing, especially in the aspect of efficiency. To generate an exponential resource in a polynomial time, cell separation is incorporated into such systems, thus obtaining so called tissue P systems with cell separation. In this work, we exploit the computational efficiency of this model and construct a uniform family of such tissue P systems for solving the independent set problem, a well-known NP-complete problem, by which an efficient so- lution can be obtained in polynomial time.

关键词： membrane computing tissue P system cell sep- aration independent set problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：