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

International Conference on Computer Supported Cooperative Work in Design

作者： Ziqiang Li Wenqian Ruan Yu Kang School of Computer Science Xiangtan University Xiangtan Hunan China Ministry Education Key Laboratory of Intelligent Computing & Information Processing Xiangtan University Xiangtan Hunan China

ISBN: (纸本)9781728165981

Existing heuristic evolutionary approaches are effective to solve the multi-module satellite packing problem. But for them, payload allocation and packing optimization are achieved in two different stages. And for their heuristics there are faults of weaker generality and less candidate location. So, a biased random key heuristic genetic approach is proposed for the collaborative payload allocation and packing for multi-module satellite (MSRKHGA). The firstly, by coding and decoding the random key individual and using GA operator, the organic combination of the payload allocation and packing optimization is achieved. Secondly, by region-positioning it can avoid the time-consuming overlapping calculation between individuals and dynamically generate more candidate regions for payloads to be packed. Numerical experiments show that all index of the proposed MSRKHGA approach are superior obviously to those of existing approaches.

关键词： Satellites Heuristic algorithms Genetics Encoding Decoding Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

Pose-adaptive hierarchical attention network for facial expression recognition

arXiv

引用

arXiv 2019年

作者： Liu, Yuanyuan Peng, Jiyao Zeng, Jiabei Shan, Shiguang School of Geography and Information Engineering China University of Geosciences Wuhan430074 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Intelligent Information Processing Center for Excellence in Brain Science and Intelligence Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

Multi-view facial expression recognition (FER) is a challenging task because the appearance of an expression varies in poses. To alleviate the influences of poses, recent methods either perform pose normalization or learn separate FER classifiers for each pose. However, these methods usually have two stages and rely on good performance of pose estimators. Different from existing methods, we propose a pose-adaptive hierarchical attention network (PhaNet) that can jointly recognize the facial expressions and poses in unconstrained environment. Specifically, PhaNet discovers the most relevant regions to the facial expression by an attention mechanism in hierarchical scales, and the most informative scales are then selected to learn the poseinvariant and expression-discriminative representations. PhaNet is end-to-end trainable by minimizing the hierarchical attention losses, the FER loss and pose loss with dynamically learned loss weights. We validate the effectiveness of the proposed PhaNet on three multi-view datasets (BU-3DFE, Multi-pie, and KDEF) and two in-the-wild FER datasets (AffectNet and SFEW). Extensive experiments demonstrate that our framework outperforms the state-of-the-arts under both within-dataset and cross-dataset settings, achieving the average accuracies of 84.92%, 93.53%, 88.5%, 54.82% and 31.25% respectively. Copyright © 2019, The Authors. All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

An efficient MRF embedded level set method for image segmentation

引用

IEEE Transactions on Image processing 2015年第1期24卷 9-21页

作者： Yang, Xi Gao, Xinbo Tao, Dacheng Li, Xuelong Li, Jie State Key Laboratory of Integrated Services Networks School of Electronic Engineering Xidian University Xi'an710071 China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia State Key Laboratory of Transient Optics and Photonics Xi'An Institute of Optics and Precision Mechanics Chinese Academy of Sciences Xi'an710119 China Video and Image Processing System Laboratory School of Electronic Engineering Xidian University Xi'an710071 China

This paper presents a fast and robust level set method for image segmentation. To enhance the robustness against noise, we embed a Markov random field (MRF) energy function to the conventional level set energy function. This MRF energy function builds the correlation of a pixel with its neighbors and encourages them to fall into the same region. To obtain a fast implementation of the MRF embedded level set model, we explore algebraic multigrid (AMG) and sparse field method (SFM) to increase the time step and decrease the computation domain, respectively. Both AMG and SFM can be conducted in a parallel fashion, which facilitates the processing of our method for big image databases. By comparing the proposed fast and robust level set method with the standard level set method and its popular variants on noisy synthetic images, synthetic aperture radar (SAR) images, medical images, and natural images, we comprehensively demonstrate the new method is robust against various kinds of noises. In particular, the new level set method can segment an image of size 500 x 500 within 3 s on MATLAB R2010b installed in a computer with 3.30-GHz CPU and 4-GB memory. © 2014 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Generalizing quotient space theory from structural viewpoint

Generalizing quotient space theory from structural viewpoint

引用

IEEE International Conference on Granular computing (GRC)

作者： W.L. Chen J.X. Cheng Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University of Science and Technology Hefei Anhui China

Quotient space theory of problem solving, a formal model of granular computing, is generalized in the sense that topological structure is replaced by Cech's closure space. Some basic issues of granular computing, such as the representation of real world at different levels of granularity, property preserving and the construction of granular world, are discussed in detail. It turns out that most of conclusions of the classical quotient space theory keep being valid, so intension and applicable fields are enriched and enlarged respectively.

关键词： Problem-solving Topology Signal processing Set theory Humans Artificial intelligence Processor scheduling Path planning Lattices intelligent structures

来源：评论

学校读者我要写书评

暂无评论

Detection of Photoplethysmography Manipulation in Video Forgery 31

Detection of Photoplethysmography Manipulation in Video Forg...

引用

31st European Signal processing Conference, EUSIPCO 2023

作者： Lin, Yuzhen Li, Bin Maiorana, Emanuele Campisi, Patrizio Guangdong Key Lab of Intelligent Information Processing Shenzhen Key Lab of Media Security Shenzhen University Shenzhen China State Key Laboratory of Radio Frequency Heterogeneous Integration Shenzhen University Shenzhen China Dept. of Industrial Electronic and Mechanical Engineering Roma Tre University Rome Italy

ISBN: (纸本)9789464593600

Recent studies have shown that physiological signals related to blood pressure and heart rate can be estimated in a contactless modality from facial videos using remote photoplethysmography (rPPG). This has paved the way to the development of techniques that can acquire and manipulate the rPPG signals recoverable from facial videos without affecting their visual appearance. The goal of this paper is to analyze the detectability of this new kind of forgery, here referred to as rPPG deepfake videos. Specifically, we propose a two-stream method based on the analysis of rPPG deepfake videos at both spatial and temporal levels. The experimental results obtained from tests performed on samples taken from two distinct databases demonstrate that our method performs better than popular deep learning methods in the rPPG deepfake detection task. © 2023 European Signal processing Conference, EUSIPCO. All rights reserved.

关键词： Photoplethysmography

来源：评论

学校读者我要写书评

暂无评论

Towards Robust Semantic Segmentation against Patch-based Attack via Attention Refinement

arXiv

引用

arXiv 2024年

作者： Yuan, Zheng Zhang, Jie Wang, Yude Shan, Shiguang Chen, Xilin Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

The attention mechanism has been proven effective on various visual tasks in recent years. In the semantic segmentation task, the attention mechanism is applied in various methods, including the case of both Convolution Neural Networks (CNN) and Vision Transformer (ViT) as backbones. However, we observe that the attention mechanism is vulnerable to patch-based adversarial attacks. Through the analysis of the effective receptive field, we attribute it to the fact that the wide receptive field brought by global attention may lead to the spread of the adversarial patch. To address this issue, in this paper, we propose a Robust Attention Mechanism (RAM) to improve the robustness of the semantic segmentation model, which can notably relieve the vulnerability against patch-based attacks. Compared to the vallina attention mechanism, RAM introduces two novel modules called Max Attention Suppression and Random Attention Dropout, both of which aim to refine the attention matrix and limit the influence of a single adversarial patch on the semantic segmentation results of other positions. Extensive experiments demonstrate the effectiveness of our RAM to improve the robustness of semantic segmentation models against various patch-based attack methods under different attack settings. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Novel Transformed Nested Array with Enhanced DOFs Based on Sum-Difference Coarray

A Novel Transformed Nested Array with Enhanced DOFs Based on...

引用

IEEE International Conference on Electronic information and Communication Technology (ICEICT)

作者： Wei Xin Yingsong Li Harbin Engineering University China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

Sum-difference driven coarray (SDCA) was paid great attention in array-signal-processing (ASP). By considering SDCA, the degrees of freedom (DOFs) for sparse arrays can be further improved. Here, a new transformed nested-array (TNA) is constructed, which reduces the element redundancy via rearranging the density of sub-arrays of the constructed new TNA. Compared to former TNAs, the constructed TNA gets higher DOFs and maximization signals, numerical simulation are given for getting its superior behaviors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generating Manipulation Sequences using Reinforcement Learning and Behavior Trees for Peg-In-Hole Task

Generating Manipulation Sequences using Reinforcement Learni...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Xu, Jiahua Lin, Yunhan Zhou, Haotian Min, Huasong Wuhan University of Science and Technology College of Computer Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430065 China Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology Wuhan430081 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Reinforcement Learning (RL), a method of learning skills through trial-and-error, has been successfully used in many robotics applications in recent years. We combine manipulation primitives (MPs), behavior trees (BTs), and reinforcement learning to propose an algorithm for peg-in-hole tasks, which speeds up the convergence of the RL model and enhance the adaptability of the dynamic environment. Manipulation primitives are used as actions for RL, which can reduce the gap between control instruction and robotic actions and speed up the convergence of the RL model. Behavior trees are used as robot behavior control, which makes robots can actively adapt to the changes in the environment. In experiments, RL-BT, from the combination of RL and BT, is designed for the peg-in-hole task in the Gazebo simulation environment by using UR5 as the actuator. The experiments are conducted on a simple peg and a complex multi-hole peg by three aspects, which include convergence speed verification experiment, adaptability of dynamic environment experiment, and algorithm robustness experiment. The experiment result proves that our RL-BT can speed up the convergence and adapt to the changes in the environment. © 2022 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Optimized Statistical Model for Complex Chemical Processes Monitoring

Optimized Statistical Model for Complex Chemical Processes M...

引用

Data Driven Control and Learning Systems (DDCLS)

作者： Jian Zhang Xiaohe Qu Zhiwei Lei Haifeng Zhang Kai Zhong Datang East China Electric Power Test and Research Institute Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei Anhui China

The traditional kernel principal components analysis (KPCA) and linear discriminant analysis (LDA) have been verified to be two effective approaches for fault detection and diagnosis in recent years. Nevertheless, the conventional method and corresponding improved ones still exposed their deficiencies in some ways. Facing this dilemma, this paper presents a combination of optimized KPCA and modified LDA (OKPCA-MLDA), in which the OKPCA avoids the loss of original features after centralizing data in the eigenspace by adjusting covariance matrix's eigenvalue and transforming the distribution of variables thus providing representative and abundant principal components for the classifier. In addition, the MLDA maximizes a brand new objective function in feature space which achieves better classification performance than the conventional LDA, then utilizing diagnostic thresholds and similarity coefficients to identify the fault types. Based on the combined model, not only the fault detection and diagnosis can be realized simultaneously but also the accuracy of detection and diagnosis can be guaranteed. Furthermore, the simulation experiments on Tennessee Eastman (TE) benchmark process clearly illustrated the superiority of our proposed strategy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sparse Representation Optimization of Gaussian Mixed Feature of Image Based on Convolution Neural Network

Research Square

引用

Research Square 2021年

作者： Ye, Yuguang Quanzhou Normal University Fujian Quanzhou362000 China Fujian Provincial Key Laboratory of Data Intensive Computing Fujian Quanzhou362000 China Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Fujian Quanzhou362000 China

With the rapid development of intelligent algorithm and image processing technology, the limitations of traditional image processing methods are more and more obvious. Based on this, this paper studies a new pattern of sparse representation optimization of image Gaussian mixture feature based on convolution neural network, and designs a sparse representation system model of vehicle detection image based on convolution neural network. The vehicle image data is collected from many aspects, and the convolution neural network is used for comprehensive analysis and evaluation. The model can extract the feature information of the vehicle detection image better by making the scheme of the real-time vehicle detection image and according to the image features and convolution neural network algorithm. The results show that the Gaussian mixture feature sparse representation optimization model based on convolution neural network has the advantages of high feasibility, high data accuracy and high response speed, which can enhance the processing efficiency of vehicle detection image and improve the utilization of local environmental information in the image. © 2021, CC BY.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：