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

6th International Conference on Multimedia and image processing, ICMIP 2021

作者： Li, Xiang Luo, Haibo Key Laboratory of Opt-Electronic Information Processing Chinese Academy of Sciences Shenyang110016 China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Image Understanding and Computer Vision Shenyang Liaoning110016 China

ISBN: (纸本)9781450389167

SSD is one of heuristic one-stage target detection approaches. Although it has got impressive results in general target detection, it still struggles in small-size object detection and precise location. In this paper, we proposed an improved SSD which forces on the small-size target detection. We include a shallow and high resolution feature into the hierarchical detection feature which are used for prediction. Then, we fuse the detection features (including the shallow and high resolution one) as a feature pyramid through some convolution layers and unsample operations to pass information from deep features to the shallow ones, aiming to enrich the semantic information of the shallow features. To make the network easier to converge, we add a L2 normalization to the bottom detection feature of the feature pyramid to make a norm balance between each pyramid feature. The experimental results on the VEDAI dataset show that the proposed method has obtained impressive progress than the original SSD for the small targets detection. © 2021 ACM.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Quantity-Simulation-Analysis Method based Novel RSA Timing Attack Algorithm for Single-Chip Microcomputer Platform

Quantity-Simulation-Analysis Method based Novel RSA Timing A...

引用

IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Cong Li Qiang Han Tao Zhang Bingbing Lei Yu He School of Computer Science and Engineering North Minzu University Yinchuan Ningxia China The Key Laboratory of Images & Graphics Intelligent Processing of State Ethnic Affairs Commission North Minzu University (IGIPLab) Yinchuan Ningxia China School of Computer Science and Engineering Macau University of Science and Technology Macao SAR China

There are limitations in storage and computational capacity on the single-chip microcomputer platform under the secure edge computing paradigm. A higher success rate is possible via collecting sensitive information on the time side channel by multivariate statistical analysis to crack the RSA private key when attackers decrypt ciphertexts. We proposed a quantity-simulation-analysis (QSA) method to construct Markov model for RSA timing attack tasks, which firstly quantizes the decrypt process to obtain the time-consuming characteristics, then simulates the machine instruction cycles through parallel computing to analyze Markov model with more precise state transition matrix. On this basis, a novel timing attack algorithm with fuzzy clustering state transition probability matrix of the higher order Markov model on different step sizes is proposed, compared with some algorithms from other literatures taking an exhaustive search attack algorithm as a benchmark. Experimental results show that the algorithm achieves better results in terms of success rate.

关键词： Analytical models Correlation Computational modeling Hidden Markov models Clustering algorithms Markov processes Microcomputers

来源：评论

学校读者我要写书评

暂无评论

KinD-LCE: Curve Estimation and Retinex Fusion on Low-Light image

arXiv

引用

arXiv 2022年

作者： Lei, Xiaochun Mai, Weiliang Xie, Junlin Liu, He Jiang, Zetao Gong, Zhaoting Lu, Chang Lu, Linjun School of Computer Science and Information Security Guilin University of Electronic Technology Jinji Road Guangxi Guilin541004 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Jinji Road Guangxi Guilin541004 China

Low-light images often suffer from noise and color distortion. Object detection, semantic segmentation, instance segmentation, and other tasks are challenging when working with low-light images because of image noise and chromatic aberration. We also found that the conventional Retinex theory loses information in adjusting the image for low-light tasks. In response to the aforementioned problem, this paper proposes an algorithm for low illumination enhancement. The proposed method, KinD-LCE, uses a light curve estimation module to enhance the illumination map in the Retinex decomposed image, improving the overall image brightness. An illumination map and reflection map fusion module were also proposed to restore the image details and reduce detail loss. Additionally, a TV(total variation) loss function was applied to eliminate noise. Our method was trained on the GladNet dataset, known for its diverse collection of low-light images, tested against the Low-Light dataset, and evaluated using the ExDark dataset for downstream tasks, demonstrating competitive performance with a PSNR of 19.7216 and SSIM of 0.8213. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Named Entity Recognition Based on Anchor Span for Manufacturing Text Knowledge Extraction

SSRN

引用

SSRN 2024年

作者： Li, Yahui Sun, Qi Zhou, Chunjie Liu, Lu Tian, Yu-Chu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Hubei Wuhan430074 China School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan430074 China School of Computer Science Queensland University of Technology BrisbaneQLD4001 Australia

intelligent industrial manufacturing heavily relies on structured knowledge. Named Entity Recognition (NER), an essential technique for extracting structured knowledge from text, has garnered significant research interest. However, current NER approaches face difficulties in handling multiple levels of entity nesting in knowledge extraction, especially within the manufacturing context. To address this issue, we present an Anchor Span-based NER (ASNER) approach for accurately and efficiently extracting manufacturing text knowledge. This method combines token and span classification. Initially, the head and tail features of the entity are extracted, with the corresponding anchor span of potential entities generated based on a boundary match neural network to localize the entities. Subsequently, token spatial contextual features are extracted using biaffine attention and convolutional neural networks, and classification categories are assigned to the anchor span-filtered entity features. Experimental studies demonstrate the effectiveness of the proposed ASNER approach. © 2024, The Authors. All rights reserved.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

SCSQ-MDD: A Detection Approach for Multi-Style Strokes of Chinese Characters

SSRN

引用

SSRN 2023年

作者： Zhou, Tian Xie, Wu Zhang, Huimin Fan, Yong Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin China School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China Guangxi Key Lab of Multi-Source Information Mining and Security Guangxi Normal University Guilin541004 China School of Mechanical and Electrical Engineering Guilin University of Electronic Science and Technology Guilin China

In the Chinese character writing task of the robotic arms, the stroke category and position information should be extracted by object detection. The detection algorithms based on predefined anchor frames have difficulty in resolving the differences among many different styles of Chinese character strokes. While the deformable detection transformer (deformable DETR) algorithms without predefined anchor frames result in some invalid sampling points having no contribution to the feature update of the current reference point due to the random sampling of sampling points in the deformable attention module. These processes cause the effectiveness of correlation calculations between reference points in Chinese strokes and their surrounding sampled points is limited. So that the speed of vector learning stroke features in the detection head is reduced. In view of this problem, a new detection method of multi-style strokes of Chinese characters via SCSQ-MDD (Simple Conditional Spatial Query Mask Deformable DETR) is proposed in this paper. Firstly, a mask prediction layer is jointly determined using the shallow feature map of the Chinese character image and the query vector of the transformer encoder, which is used to filter the points with actual contribution and resample the points without contribution, so that the randomness of correlation calculation among reference points is solved. Secondly, by separating the content query and spatial query of the transformer deocder, the content embedding and spatial embedding can be separately focused on when cross-attention computations are performed. Thus the dependence of the prediction task on the content embedding is relaxed and the training process is simplified. Finally, the detection model without predefined anchor frames based on deformable DETR called SCSQ-MDD is constructed using the mask mechanism and the simple conditional spatial query mechanism, and trained and validated on a multi-style Chinese character stroke dataset

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Prediction of Drug-Disease Associations Based on Long Short-Term Memory Network and Gaussian Interaction Profile Kernel 15th

Prediction of Drug-Disease Associations Based on Long Short-...

引用

15th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2020

作者： Jiang, Han-Jing Wang, Yan-Bin Huang, Yabing Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China College of Computer Science and Technology Zhejiang University Hangzhou315000 China Department of Pathology Renmin Hospital of Wuhan University Wuhan430060 China

ISBN: (纸本)9789811613531

Drug-disease association depicts the accessibility landscape of the association at the molecular level, thereby revealing the intermolecular reaction in the process of drug reposition. However, the scarcity of drug-disease association data often complicates the drug reposition. In this work, we present a method for predicting drug-disease association, which is called drug-disease association prediction via Gaussian interaction profile kernel and long short-term memory network (G-LSTM). G-LSTM combines a recurrent network framework with a Gaussian interaction profile kernel to learn underlying features that accurately characterize drug-disease-association data. We have verified G-LSTM models on the two benchmark datasets Fdataset and Cdataset, respectively. The experimental results show that the predictive performance was significantly improved, with AUC of 0.9527 and 0.9705, respectively. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

A Single-Cell Clustering Algorithm Based on Structure Pertur...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Meineng Wang Luping Zhang Yu-An Huang Yangyuan Li Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Mining and Technology Xuzhou China School of Mathematics and Computer Science Yichun University Yichun China School of Information Engineering East China University of Technology Nanchang China School of Computer Science Northwestern Polytechnical University Xi’an China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets.

关键词： Sequential analysis Perturbation methods Clustering methods RNA Noise Clustering algorithms Sparse matrices Gene expression Unsupervised learning Periodic structures

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Methods for Ship Classification: From Visible to Infrared images

Deep Learning Methods for Ship Classification: From Visible ...

引用

Robotics, intelligent Control and Artificial Intelligence (RICAI), International Conference on

作者： Tianci Liu Hengjia Qin Zhuo Zhan Yunpeng Liu Chinese Academy of Sciences Shenyang Institute of Automation Shenyang China Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Shenyang China University of Chinese Academy of Sciences Beijing China Key Laboratory of Opto-Electronic Information Processing Chinese Academy of Sciences Shenyang China Key Laboratory of Image Understanding and Computer Vision Shenyang Liaoning Province China The Third Military Representative Office of the Air Force Equipment Department in Shenyang Region Shenyang Liaoning Province China

Deep learning methods have achieved excellent performances on visual tasks of target recognition and classification. The rapid development of autonomous seafaring vessels comes up with the requirement to recognize other maritime ships day and night. However, the recognition of ships based on the deep neural networks may not always access the results as expectation when the ships are under the nighttime environment. To this issue, we consider the ship recognition task under the deep learning framework with paired visible images and infrared images. In this article, we propose an end-to-end convolutional network based on visible images and infrared images of the autonomous seafaring vessels. To demonstrate the effectiveness of our model, we choose the V AIS dataset to test the performance of classifying the maritime ships. Experimental results show that the proposed network outperforms the state-of-the-art methods based on the V AIS database.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Spatial-Frequency Discriminability for Revealing Adversarial Perturbations

arXiv

引用

arXiv 2023年

作者： Wang, Chao Qi, Shuren Huang, Zhiqiu Zhang, Yushu Lan, Rushi Cao, Xiaochun Fan, Feng-Lei The College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China The Department of Mathematics The Chinese University of Hong Kong Hong Kong The Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin541004 China The School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University Shenzhen518107 China

The vulnerability of deep neural networks to adversarial perturbations has been widely perceived in the computer vision community. From a security perspective, it poses a critical risk for modern vision systems, e.g., the popular Deep Learning as a Service (DLaaS) frameworks. For protecting deep models while not modifying them, current algorithms typically detect adversarial patterns through discriminative decomposition for natural and adversarial data. However, these decompositions are either biased towards frequency resolution or spatial resolution, thus failing to capture adversarial patterns comprehensively. Also, when the detector relies on few fixed features, it is practical for an adversary to fool the model while evading the detector (i.e., defense-aware attack). Motivated by such facts, we propose a discriminative detector relying on a spatial-frequency Krawtchouk decomposition. It expands the above works from two aspects: 1) the introduced Krawtchouk basis provides better spatial-frequency discriminability, capturing the differences between natural and adversarial data comprehensively in both spatial and frequency distributions, w.r.t. the common trigonometric or wavelet basis;2) the extensive features formed by the Krawtchouk decomposition allows for adaptive feature selection and secrecy mechanism, significantly increasing the difficulty of the defense-aware attack, w.r.t. the detector with few fixed features. Theoretical and numerical analyses demonstrate the uniqueness and usefulness of our detector, exhibiting competitive scores on several deep models and image sets against a variety of adversarial attacks. Copyright © 2023, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：