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

Polynomial stacked-attention network for nationality classification

Frontiers of Computer Science 2022年第4期16卷 215-217页

作者： Kunyan Li Jie Zhang Shiguang Shan Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing100190China University of Chinese Academy of Sciences Beijing100049China

1Introduction In recent years,nationality and region inference has atracted more and_more *** anthropological researches indicate that human faces are influenced by genes,and other external factors,e.g-,geographical environment[1].This relevance provides possible solutions for geographical area inference by ***,it remains a challenging task due to the tiny differences on faces for various countries,which is even hard for human beings to tell.

关键词： Polynomial s. network

来源：评论

学校读者我要写书评

暂无评论

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A High Efficiency Wireless Charging Antenna with Embedded Magnetic Core of Segmented Two-turns Loop 7

A High Efficiency Wireless Charging Antenna with Embedded Ma...

引用

2017 7th IEEE International Symposium on Microwave, Antenna, Propagation, and EMC Technologies

作者： Yong Song Kaihong Song Xianliang Wu Zhixiang Huang Xiaojing Kuang Yanyan Zhu Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Electronic Information Engineering Hefei Normal University

ISBN: (纸本)9781509059300;9781509059294

In this paper, a high-efficiency transceiver antenna with embedded high magnetic permeability core of segmented two-turns loop is presented. It can be applied in the implanted device of monitoring human body neural with a wireless charging and bi-directional data transmission. The whole structure of transmitting and receiving antenna is basically similar;the difference is that receiving antenna is composed of double-sided ring and an embedded magnetic core at central position, transmitting antenna can be realized by dividing ring and welding fixed-value capacitor at corresponding position. The efficiency of wireless energy transfer has been improved and the specific absorption rate value has been reducing by simulation optimization. Compared with conventional loop antenna, our transmission efficiency has been exceed doubled and average SAR reduced by approximately 52%, when the distance of wireless transmission is 5 mm. Finally, we fabricate a conventional loop antenna, a segmented loop antenna with embedded magnetic core and a kind of mixed liquid that have the same dielectric parameters with skin at 402 MHz. Experiences show that actual results of transmission efficiency are in good agreement with the simulation results.

关键词： Implantable Wireless charging Segment Magnetic core Bi-directional data transmission

来源：评论

学校读者我要写书评

暂无评论

A Portrait Segmentation Algorithm Combining MobileNeXt and Attention Mechanism 24

A Portrait Segmentation Algorithm Combining MobileNeXt and A...

引用

2024 International Conference on computing, Machine Learning and Data Science, CMLDS 2024

作者： Cheng, Yan Huang, Zou Wang, Guixi Lai, Jianming Xiong, Yuqi School of Software Jiangxi Normal University Jiangxi Provincial Key Laboratory of Intelligent Information Processing and Affective Computing China School of Digital Industry Jiangxi Normal University Jiangxi Provincial Key Laboratory of Intelligent Information Processing and Affective Computing China

ISBN: (纸本)9798400716393

Existing portrait segmentation methods are easily affected by the background. To address this challenge, we propose a simple convolution-based portrait segmentation algorithm to solve the problems of complex background, low accuracy and poor efficiency in real environments. Combined with multi-scale convolution, we design a multi-scale sandglass module structure (MultiScale-Sandglass-CA, MSC), which expands the depth and width of the network without increasing the number of parameters, and enhances the feature learning ability of the model for complex backgrounds;and the MSC module is used for feature extraction, and the introduction of coordinate attention mechanism not only improves the learning ability of the portrait features, but also enhances the network's ability to learn the key information. The introduction of the coordinate attention mechanism not only improves the learning ability of the portrait features, but also enhances the focusing of the network on the key information;at the same time, the introduction of the hybrid loss function, which helps to obtain clear portrait edges. Experiments are conducted on Matting and EG1800 public datasets, and the results show that the algorithm can significantly improve the mean intersection and merger ratio (mIoU) and pixel accuracy (Acc), etc. The mIoU can reach up to 97%, and the pixel accuracy can reach up to 10%. Among them, the mIoU index can reach 97.91% (Matting) and 94.72% (EG1800). Compared with the mIoU predicted by PortraitNet, it is 1.29% and 1.19% higher, respectively. In addition, experiments are conducted for the MSC structure proposed in this paper, which proves the superiority of the model in this paper. © 2024 ACM.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Edge computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

Computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

2-D shape completion with shape priors

引用

Chinese Science Bulletin 2013年第27期58卷 3430-3436页

作者： GUO Ge JIANG TingTing WANG YiZhou GAO Wen Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences National Engineering Laboratory for Video Technology Key Laboratory of Machine Perception School of EECS Peking University

We propose new techniques for 2-D shape/contour completion, which is one of the important research topics related to shape analysis and computer vision, e.g. the detection of incomplete objects due to occlusion and noises. The purpose of shape completion is to find the optimal curve segments that fill the missing contour parts, so as to acquire the best estimation of the original complete object shapes. Unlike the previous work using local smoothness or minimum curvature priors, we solve the problem under a Bayesian formulation taking advantage of global shape prior knowledge. With the priors, our methods are expert in recovering significant shape structures and dealing with large occlusion cases. There are two different priors adopted in this paper: (i) A generic prior model that prefers minimal global shape transformation (including non-rigid deformation and affine transformation with respect to a reference object shape) of the recovered complete shape; and (ii) a class-specific shape prior model learned from training examples of an object category, which prefers the reconstructed shape to follow the learned shape variation models of the category. Efficient contour completion algorithms are suggested corresponding to the two types of priors. Our experimental results demonstrate the advantage of the proposed shape completion approaches compared to the existing techniques, especially for objects with complex structure under severe occlusion.

关键词：形状结构计算机视觉贝叶斯公式电子相关最佳估计最小曲率先验知识仿射变换

来源：评论

学校读者我要写书评

暂无评论

Optimizing radial basis function neural network based on rough sets and affinity propagation clustering algorithm

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2012年第2期13卷 131-138页

作者： Xin-zheng XU Shi-fei DING Zhong-zhi SHI Hong ZHU School of Computer Science and Technology China University of Mining and TechnologyXuzhou 221116China Key Laboratory of Intelligent information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China

A novel method based on rough sets (RS) and the affinity propagation (AP) clustering algorithm is developed to optimize a radial basis function neural network (RBFNN). First, attribute reduction (AR) based on RS theory, as a preprocessor of RBFNN, is presented to eliminate noise and redundant attributes of datasets while determining the number of neurons in the input layer of RBFNN. Second, an AP clustering algorithm is proposed to search for the centers and their widths without a priori knowledge about the number of clusters. These parameters are transferred to the RBF units of RBFNN as the centers and widths of the RBF function. Then the weights connecting the hidden layer and output layer are evaluated and adjusted using the least square method (LSM) according to the output of the RBF units and desired output. Experimental results show that the proposed method has a more powerful generalization capability than conventional methods for an RBFNN.

关键词： Radial basis function neural network （RBFNN） Rough sets Affinity propagation Clustering

来源：评论

学校读者我要写书评

暂无评论

SSD Real-Time Illegal Parking Detection Based on Contextual information Transmission

引用

Computers, Materials & Continua 2020年第1期62卷 293-307页

作者： Huanrong Tang Aoming Peng Dongming Zhang Tianming Liu Jianquan Ouyang Key Laboratory of Intelligent Computing and Information Processing Ministry of EducationCollege of Information EngineeringXiangtan UniversityXiangtan411105China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing100029China Department of Computer Science the University of GeorgiaAthensGeorgiaUSA

With the improvement of the national economic level,the number of vehicles is still increasing year by *** to the statistics of National Bureau of Statics,the number is approximately up to 327 million in China by the end of 2018,which makes urban traffic pressure continues to rise so that the negative impact of urban traffic order is *** parking-the common problem in the field of transportation security is urgent to be solved and traditional methods to address it are mainly based on ground loop and manual supervision,which may miss detection and cost much *** to the rapidly developing deep learning sweeping the world in recent years,object detection methods relying on background segmentation cannot meet the requirements of complex and various scenes on speed and ***,an improved Single Shot MultiBox Detector(SSD)based on deep learning is proposed in our study,we introduce attention mechanism by spatial transformer module which gives neural networks the ability to actively spatially transform feature maps and add contextual information transmission in specified ***,we found out the best connection layer in the detection model by repeated experiments especially for small objects and increased the precision by 1.5%than the baseline SSD without extra training ***,we designed an illegal parking vehicle detection method by the improved SSD,reaching a high precision up to 97.3%and achieving a speed of 40FPS,superior to most of vehicle detection methods,will make contributions to relieving the negative impact of illegal parking.

关键词： Contextual information transmission illegal parking detection spatial attention mechanism deep learning

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Framework for Secure Storage and Sharing of Resumes

引用

Computers, Materials & Continua 2022年第9期72卷 5395-5413页

作者： Huanrong Tang Changlin Hu Tianming Liu Jianquan Ouyang Key Laboratory of Intelligent Computing and Information Processing Ministry of EducationComputer Science College of Xiangtan UniversityXiangtanHunan ProvinceChina Department of Computer Science The University of GeorgiaAthensGeorgiaUSA

In response to problems in the centralized storage of personal resumes on third-party recruitment platforms,such as inadequate privacy protection,inability of individuals to accurately authorize downloads,and inability to determine who downloaded the resume and when,this study proposes a blockchain-based framework for secure storage and sharing of *** can employ an authorized access mechanism to protect their privacy *** proposed framework uses smart contracts,interplanetary file system,symmetric encryption,and digital signatures to protect,verify,and share *** keys are split and stored in multiple depositories through secret-sharing technology to improve the security of these *** key escrow incentives are implemented using smart contracts to automatically verify the correctness of keys and encourage the active participation of honest key escrow *** framework combines blockchain and searchable symmetric encryption technology to realize multikeyword search using inverted indexing and Bloom filters and verify search results on the *** search service fees are charged through *** after the search results are verified can the search service provider obtain the search fee,thus ensuring fair and efficient search for encrypted *** framework is decentralized,secure,and tamper-evident,and achieves controlled sharing while protecting personal privacy and information security.

关键词： Resume blockchain interplanetary file system secret sharing searchable encryption

来源：评论

学校读者我要写书评

暂无评论

A computational model for feature binding

引用

Science China(Life Sciences) 2008年第5期51卷 470-478页

作者： SHI ZhiWei1,2, SHI ZhongZhi1, LIU Xi1,2 & SHI ZhiPing1 1 key laboratory of intelligent information processing, Institute of computing Technology, Chinese Academy of Sciences, Beijing 100190, China 2 Graduate University of Chinese Academy of Sciences, Beijing 100049, China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100049 China

The "Binding Problem" is an important problem across many disciplines, including psychology, neuroscience, computational modeling, and even philosophy. In this work, we proposed a novel computational model, Bayesian Linking Field Model, for feature binding in visual perception, by combining the idea of noisy neuron model, Bayesian method, Linking Field network and competitive mechanism. Simulation Experiments demonstrated that our model perfectly fulfilled the task of feature binding in visual perception and provided us some enlightening idea for future research.

关键词： Binding Problem computational model Bayesian Linking Field Model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：