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

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Tang, Yiming Xia, Bowen Ren, Fuji Song, Xiaocheng Li, Hongmang Wu, Wenbin Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei230601 China School of Computer and Information Hefei University of Technology Hefei230601 China

ISBN: (纸本)9789811625398

With the development of media technology, data types that cluster analysis needs to face become more and more complicated. One of the more typical problems is the clustering of multi-view data sets. Existing clustering methods are difficult to handle such data well. To remedy this deficiency, a multi-view weighted kernel fuzzy clustering method with collaborative evident and concealed views (MV-Co-KFCM) is put forward. To begin with, the hidden shared information is extracted from several different views of the data set by means of non-negative matrix factorization, then applied to this iterative process of clustering. This not only takes advantage of the difference information in distinct views, but also utilizes the consistency knowledge in distinct views. This pre-processing algorithm of extracting hidden information from multiple views (EHI-MV) is obtained. Furthermore, in order to coordinate different views during the iteration, a weight is distributed. In addition, so as to regulate the weight adaptively, shannon entropy regularization term is also introduced. Entropy can be maximized as far as possible by minimizing the objective function, thus MV-Co-KFCM algorithm is proposed. Facing 5 multi-view databases and comparing with 6 current leading algorithms, it is found that the algorithm which we put forward is more excellent as for 5 clustering validity indexes. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Coherent Snapshot Compressed Imaging with Time-Varying Composite Phase Masks

SSRN

引用

SSRN 2023年

作者： Zhang, Ru Zhang, Cheng Zhang, Liru Chen, Mingsheng Cheng, Hong Shen, Chuan Zhang, Quanbin Wei, Sui Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Anhui Province Hefei230601 China Advanced Laser Technology Laboratory of Anhui Province National University of Defense Technology Anhui Province Hefei230037 China

Snapshot compressed imaging (SCI) can encode an image sequence into a single-frame measurement and has the advantages of low requirements for physical sensors, low bandwidth/ memory requirements, and a fast acquisition speed. However, existing snapshot compressed imaging mainly focuses on incoherent imaging, such as video/hyperspectral imaging, and research on coherent imaging is rare. In this paper, snapshot compressed sensing is introduced for coherent imaging conditions, and a spatio-temporal coherent snapshot compressed imaging method with time-varying composite phase masks is proposed. Numerical experiments demonstrate the effectiveness and superiority of our proposed spatio-temporal coherent snapshot compressed imaging with time-varying composite phase masks method (CSCI-CPM) in terms of the reconstruction quality and robustness for both self-sparse and complex cases. © 2023, The Authors. All rights reserved.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

A Multiscale Dynamic Temporal Convolution Network For Continuous Dimensional Emotion Recognition

A Multiscale Dynamic Temporal Convolution Network For Contin...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Min Hu Jialu Sun Xiaohua Wang Ning An Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer Science and Information Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Video-based dimensional emotion recognition, especially long sequence modeling, is a challenging task. This paper proposes a Multiscale Dynamic Temporal Convolution Network(MDTCN) for long sequence modeling of dimensional emotion recognition. Although Temporal Convolution Network(TCN) has performed well in sequence modeling, there are still some limitations that the feature scale of each layer is single and the receptive field of the upper layer is too large to capture the short-term dependence. Therefore, Dynamic Dilated Block(DDB) is constructed to better capture the temporal dependence by using dilated convolutions of different kernel size. In order to obtain both long-term and short-term temporal features, Multiscale TCN Structure is proposed. Extensive experiments are conducted on the AFFWILD2 and SEWA Dataset and the competitive result is shown compared to state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Answer-Centric Local and Global Information Fusion for Conversational Question Generation 12

Answer-Centric Local and Global Information Fusion for Conve...

引用

12th IEEE International Conference on Big Knowledge, ICBK 2021

作者： Lei, Panpan Sun, Xiao Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer Science and Information Engineering Anhui Hefei China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei China

ISBN: (纸本)9781665438582

Conversational Question Generation (CQG) is a new concern in Question Generation (QG) study. Recently Seq2Seq neural network model has been widely used in the QG area. CQG model is also based on the Seq2Seq neural network model. We note a problem: the CQG model's input is not a single sentence, but a long text and conversation history. Seq2Seq model can't effectively process long input, the model will generate questions not related to the answer. To solve this problem, we propose an answer-centric local and global information fusion model. We extract the evidence sentence containing the answer in the passage and encode the evidence sentence and the passage information separately. On the one hand, we add answer-centered position tags in the passage to reinforce the attention of information related to the answer. On the other hand, we put the key sentence into the question type prediction model. By combining the answer position embedding to predict the question type, and then put the predicted question types in the key sentence to guide the generation of the question. Finally, we use a gate mechanism to merge key sentence information and passage information. The experimental results show that we have achieved better results. © 2021 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Efficient Finite-Difference Time-Domain Method for Solving Electromagnetic Scattering in Layered Anisotropies

Efficient Finite-Difference Time-Domain Method for Solving E...

引用

International Symposium on Antennas, Propagation and EM Theory (ISAPE)

作者： Yilin Kang Yuxian Zhang Xiaoli Feng Lixia Yang Zhixiang Huang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education and with the Information Materials and Intelligent Sensing Laboratory of Anhui Province Industry-Education-Research Institute of Advanced Materials and Technology for Integrated Circuits and with School of Electronic and Information Engineering Anhui University Hefei China

ISBN: (数字)9798350353129

ISBN: (纸本)9798350353136

In this article, we propose an efficient numerical method for layered models based on the conventional finite difference time-domain (FDTD) method. The three-dimensional (3-D) layered model is compressed into one-dimensional (1-D) calculation, which improves the problem of large space memory and long running time for 3-D modeling while ensuring the accuracy and feasibility of the algorithm. On the one hand, by employing the transformation relationship between the transverse wave vector and the field in space, the expanded Maxwell's rotation equations are simplified, so that the equation system only retains the spatial transformation in the propagation direction. This processing allows for the calculation of the propagation characteristics of layered media without requiring more computational resources. On the other hand, to ensure the universality of the algorithm, a fully tensor anisotropic medium is selected for detecting the propagation data. At the same time, we design the layered structure and conduct the consistent 3-D modeling in the simulation software COMSOL. The results showed that our proposed efficient numerical algorithm greatly reduced the loss of computing resources while ensuring accuracy.

关键词： Solid modeling Three-dimensional displays Accuracy Tensors Software algorithms Vectors Mathematical models Numerical models Time-domain analysis Finite difference methods

来源：评论

学校读者我要写书评

暂无评论

Facial Expression Recognition With Vision Transformer Using Fused Shifted Windows

引用

IEEE Transactions on affective computing 2024年

作者： Sun, Xiao Wang, Rui Chen, Shaokai Wang, Meng Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machines School of Computer Science and Information Engineering China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China University of Science and Technology of China Institute of Advanced Technology China Hefei University of Technology School of Computer Science and Information Engineering Hefei China

Facial expressions contain massive affective information. Previous methods have focused on using diverse models based on CNN or Transformer to handle the facial expression recognition(FER) task. However, most of them treat the FER task as a general image classification task and neglect the impact of regions of interest (ROIs) for the performance of FER. To verify the influence of different ROIs, in this paper, we propose a vision Transformer based on Fused Shifted windows (FSwin), called FSwin Transformer. The semantic information of the face, obtained by ROIs, guides the FSwin Transformer to focus more on the key regions. The fused shifted windows enable the model to perform global semantic interactions, allowing it to concentrate on key regions without losing the topological structural information of the entire face. Additionally, learnable parameters are introduced to learn the feature weights expressed by each ROI, helping the model dynamically adjust the attention distribution. We have conducted controlled experiments to quantitatively verify the impact of ROIs. And the experimental results show that with the increase of the number of ROIs, the accuracy of FER is significantly improved, demonstrating that the key ROIs play an important role in feature extraction. The results on Jaffe, CK+, FER2013, AffectNet have reached 99.8%, 99.0%, 74.8%, and 68.9%, respectively, which all set new state-of-the-art. Extensive cross-dataset experiments also show that the FSwin Transformer has good generalization ability, proving that our proposed model has a beneficial effect on FER tasks. © 2010-2012 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

ASM: Adaptive Sample Mining for In-The-Wild Facial Expression Recognition

arXiv

引用

arXiv 2023年

作者： Zhang, Ziyang Sun, Xiao An, Liuwei Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Heifei China Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machines Hefei University of Technology Heifei China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Heifei China

Given the similarity between facial expression categories, the presence of compound facial expressions, and the subjectivity of annotators, facial expression recognition (FER) datasets often suffer from ambiguity and noisy labels. Ambiguous expressions are challenging to differentiate from expressions with noisy labels, which hurt the robustness of FER models. Furthermore, the difficulty of recognition varies across different expression categories, rendering a uniform approach unfair for all expressions. In this paper, we introduce a novel approach called Adaptive Sample Mining (ASM) to dynamically address ambiguity and noise within each expression category. First, the Adaptive Threshold Learning module generates two thresholds, namely the clean and noisy thresholds, for each category. These thresholds are based on the mean class probabilities at each training epoch. Next, the Sample Mining module partitions the dataset into three subsets: clean, ambiguity, and noise, by comparing the sample confidence with the clean and noisy thresholds. Finally, the Tri-Regularization module employs a mutual learning strategy for the ambiguity subset to enhance discrimination ability, and an unsupervised learning strategy for the noise subset to mitigate the impact of noisy labels. Extensive experiments prove that our method can effectively mine both ambiguity and noise, and outperform SOTA methods on both synthetic noisy and original datasets. The supplement material is available at https://***/zzzzzzyang/ASM. Copyright © 2023, The Authors. All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Modeling and Clustering of Parabolic Granular Data

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3728-3742页

作者： Tang, Yiming Gao, Jianwei Pedrycz, Witold Hu, Xianghui Xi, Lei Ren, Fuji Hu, Min Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2V4 Canada Hefei University of Technology School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Southeast University School of Computer Science and Engineering Nanjing211189 China University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China

At present, there exist some problems in granular clustering methods, such as lack of nonlinear membership description and global optimization of granular data boundaries. To address these issues, in this study, revolving around the parabolic granular data, we propose an overall architecture for parabolic granular modeling and clustering. To begin with, novel coverage and specificity functions are established, and then a parabolic granular data structure is proposed. The fuzzy c-means (FCM) algorithm is used to obtain the numeric prototypes, and then particle swarm optimization (PSO) is introduced to construct the parabolic granular data from the global perspective under the guidance of principle of justifiable granularity (PJG). Combining the advantages of FCM and PSO, we propose the parabolic granular modeling and optimization (PGMO) method. Moreover, we put forward attribute weights and sample weights as well as a distance measure induced by the Gaussian kernel similarity, and then come up with the algorithm of weighted kernel fuzzy clustering for parabolic granularity (WKFC-PG). In addition, the assessment mechanism of parabolic granular clustering is discussed. In summary, we set up an overall architecture including parabolic granular modeling, clustering, and assessment. Finally, comparative experiments on artificial, UCI, and high-dimensional datasets validate that our overall architecture delivers a good improvement over previous strategies. The parameter analysis and time complexity are also given for WKFC-PG. In contrast with related granular clustering algorithms, it is observed that WKFC-PG performs better than other granular clustering algorithms and has superior stability in handling outliers, especially on high-dimensional datasets. © 2020 IEEE.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

An Automatic Method for Brain Tumors Segmentation Based on Deep Convolutional Neural Network

An Automatic Method for Brain Tumors Segmentation Based on D...

引用

2021 IEEE International Conference on Medical Imaging Physics and Engineering, ICMIPE 2021

作者： Lin, Hui Zhang, Benjian Guo, Xin Guo, Dong Jing, Jia Huiyuan, Luo Yumeng, Zhao Hu, Min Ren, Fuji School of Physics Hefei University of Technology Hefei China School of Computer and Information Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei China School of Computer and Information Hefei University of Technology Hefei China Graduate School of Advanced Technology and Science University of Tokushima Tokushima Japan

ISBN: (纸本)9781665426084

[Purpose] Accurate outline of tumor targets is critical to a high quality radiotherapy plan. Manual segmentation is of great workload and has a strong artificial subjectivity. Using deep learning method to assist automatically segmenting of tumor target is the penetration and application of artificial intelligence in medicine. [Methods] A 6-layer model of deep Convolution Neural Network (CNN) has been constructed by taking advantage of different types of layers for brain tumor segmentation. This model is a 6 layer CNN model (6-CNN) composed of three convolution layers, two pool layers and one full connection layer. To obtain enough samples for 6-CNN model training, a patch-based technology has been adopted. That is to successively extract a local area from the whole image as a patch. And the center pixel value is taken as the pixel value of the whole patch. Similarly, the label of the center pixel is also taken as the label of the whole patch. Thus the 6-CNN model transforms the brain tumor image segmentation into patch classification based on the excellent classification characteristics of deep convolution neural network. The model combines the local features of patch, the information extracted from shallow network and the global features to predict the category label of the central pixel of patch. [Results] The model is validated on BRATS 2015 dataset and results show that the segmentation accuracy can be up to Dice Similarity Coefficient (DSC) 90\%\pm 4\%. [Conclusions] An automatic deep CNN segmentation model for brain tumors has been constructed based on MRI image patches, which is expected to assist or even substitute the manual segmentation of brain tumors. © 2021 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：