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

5th IEEE Advanced Information Technology, Electronic and Automation Control Conference, IAEAC 2021

作者： Qian, Pan Wu, Yeyun Zhang, Xiaofeng Nanchang Hangkong University School of Information Engineering Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition Nanchang China

Recently, deep convolutional learning has been applied to image deblurring, which greatly improves the performance of single-image blind deblurring algorithms. However, most deep image deblurring models based on convolutional neural networks do not make full use of the information of low-level spatial convolutions, so they achieve relatively poor performance. In this paper, we improved the generator of the Generative Adversarial Network (GAN) and proposed dense networks and residual networks to solve this problem in image deblurring. The network makes full use of the hierarchical features of all convolutional layers. Specifically, we extract the local features of the convolutional layer through the proposed densely connected convolutional layer. Moreover, the dense connections of the residual dense network can connect all layers from the previous state to the current state. Then using local jump connection and feature fusion, it can adaptively learn more effective features from the previous and current local features, making the trained network more extensive. After fully obtaining the dense local features, the global residual connection is used to learn the global feature information in an overall manner. Experimental comparison and verification have proved the effectiveness of our method and achieved excellent results both quantitatively and qualitatively. © 2021 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Robust CPD Approach Based on Shape Context 33

A Robust CPD Approach Based on Shape Context

引用

第三十三届中国控制会议

作者： YANG Yawen ZHANG Peng Peng QIAO Yu YANG Jie WANG Sheng Zheng The Key Laboratory of Ministry of Education for System Control and Information Processing Institute of Image Processing and Pattern RecognitionShanghai Jiao Tong University Merchant Marine College Shanghai Maritime University

ISBN: (纸本)9781479947249

Point matching is an important component of image *** years,Coherent Point Drift(CPD) method becomes a very popular point matching *** treats point matching as a probability estimation problem and speeds up the process of matching a *** this method,one set of points are thought to be sampled from a Gaussian Mixture Model(GMM),which is centered by the other set of ***,CPD is sensitive to outliers and noises,especially when the noise ratio increased or the number of outliers gets much *** deal with this problem,we introduce shape context into the step of searching for matching points and then improve the form of prior probabilities of GMM in this *** main idea of our method is that if the most points in a data set are likely to be matched to a particular centroid,this Gaussian component should be have a more influence to ***,we set prior probability of GMM with the similarity between GMM components and the data *** the computation of similarity is based on shape *** experiments on 2D and 3D images show that when noise ratio is low,our method performs as well as CPD does,but as the ratio increased,our method is more robust and satisfactory than CPD.

关键词： CPD,Shape context,Image registration,Point matching

来源：评论

学校读者我要写书评

暂无评论

Kernel based weighted group sparse representation classifier

Kernel based weighted group sparse representation classifier

引用

15th International Conference on Human-Computer Interaction, HCI International 2013

作者： Xu, Bingxin Guo, Ping Chen, C. L. Philip Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing China Faculty of Science and Technology University of Macau China

ISBN: (纸本)9783642393419

Sparse representation classification (SRC) is a new framework for classification and has been successfully applied to face recognition. However, SRC can not well classify the data when they are in the overlap feature space. In addition, SRC treats different samples equally and ignores the cooperation among samples belong to the same class. In this paper, a kernel based weighted group sparse classifier (KWGSC) is proposed. Kernel trick is not only used for mapping the original feature space into a high dimensional feature space, but also as a measure to select members of each group. The weight reflects the importance degree of training samples in different group. Substantial experiments on benchmark databases have been conducted to investigate the performance of proposed method in image classification. The experimental results demonstrate that the proposed KWGSC approach has a higher classification accuracy than that of SRC and other modified sparse representation classification. © 2013 Springer-Verlag.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Object classification via PCANet and color constancy model 4

Object classification via PCANet and color constancy model

引用

4th International Conference on Advanced Design and Manufacturing Engineering, ADME 2014

作者： Hu, De Kun Zhang, L. Zhao, Wei Dong Yan, Tao Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu University Chengdu China

ISBN: (纸本)9783038352570

In order to classify the objects in nature images, a model with color constancy and principle component analysis network (PCANet) is proposed. The new color constancy model imitates the functional properties of the HVS from the retina to the double-opponent cells in V1. PCANet can be designed and learned extremely, which comprises only the very basic data processing components: cascaded principal component analysis (PCA), binary hashing, and block-wise histograms. At last, a SVM is trained to classify the object in the image. The results of experiments demonstrate the potential of the model for object classification in wild color images. © (2014) Trans Tech Publications, Switzerland.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Blurred image recognition based on complex moment invariants

Blurred image recognition based on complex moment invariants

引用

2004 International Conference on Image processing, ICIP 2004

作者： Tianxu, Zhang Jin, Liu Institute for Pattern Recognition and Artifical Intelligence State Key Laboratory of Image Processing and Intelligent Control HuaZhong University of Science and Technology China Institute for Pattern Recognition and Artifical Intelligence HuaZhong University of Science and Technology China

ISBN: (纸本)0780385543

An important class of radiometric degradations we are faced with often in practice is image blurring. Special attention is paid to the recognition of the blurred image by moment invariant approach. Some important rules of complex moments for the blurred image are presented. Based on these rules, a useful subset of moment invariants is introduced, that are not affected by the blur, rotation, scale, and translation of the images. The experiments have shown that these invariants can be successfully used in recognition of the blurred image. ©2004 IEEE.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Fast KNN search for big data with set compression tree and best bin first 2

Fast KNN search for big data with set compression tree and b...

引用

2nd International Conference on Cloud Computing and Internet of Things, CCIOT 2016

作者： Chen, Zhenjie Yan, Jingqi Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of Ministry of Education for System Control and Information Processing China Shanghai China

ISBN: (纸本)9781467398213

This paper proposes k nearest neighbors (kNN) search based on set compression tree (SCT) and best bin first (BBF) to deal with the problem for big data. The large compression rate by set compression tree is achieved by compressing the set of descriptors jointly instead of compressing on a per-descript or basis. So set compression tree has a good performance in kNN search at a low bit rate. At the same time, the best bin first (BBF) is a very efficient algorithm to find the approximately kNN from a large number of high dimensional feature descriptors. SCT-BBF is a novel exploration and it improves search performance in three aspects: First, SCT-BBF requires less memory footprint, which is important in big data age. Second, it increases accuracy compared traditional method like KD-Tree and original SCT. SCT-BBF can be used with other data processing methods like PCA and SIFT to perform better. Third, this paper adopts finer search to increase accuracy at a slight loss of speed. And it can extend to big data easily. © 2016 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

recognition of facial expression via kernel PCA network 3

Recognition of facial expression via kernel PCA network

引用

3rd International Conference on Information Technology and Management Innovation, ICITMI 2014

作者： Hu, De Kun Ye, An Sheng Li, Li Zhang, Li Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu University Chengdu China

ISBN: (纸本)9783038352396

In this work, a kernel principle component analysis network (KPCANet) is proposed for classification of the facial expression in unconstrained images, which comprises only the very basic data processing components: cascaded kernel principal component analysis (KPCA), binary hashing, and block-wise histograms. In the proposed model, KPCA is employed to learn multistage filter banks. It is followed by simple binary hashing and block histograms for indexing and pooling. For comparison and better understanding, We have tested these basic networks extensively on many benchmark visual datasets(such as the JAFFE [13] database, the CMU AMP face expression database, a part of the Extended Cohn-Kanade (CK+) database), The results demonstrate the potential of the KPCANet serving as a simple but highly competitive baseline for facial expression recognition. © 2014 Trans Tech Publications, Switzerland.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Maintaining imbalance highly dependent medical data using dirichlet process data generation

Maintaining imbalance highly dependent medical data using di...

引用

2011 6th International Conference on Digital Information Management, ICDIM 2011

作者： Antaresti, Tieta Fanany, Mohamad Ivan Arymurthy, Aniati Murni Pattern Recognition Image Processing and Content-Based Image Retrieval Laboratory Faculty of ComputerScience Universitas Indonesia Depok 16424 Indonesia

ISBN: (纸本)9781457715389

The existence of imbalanced data between one class and another class is an important issue to be considered in a classification problem. One of the well-known data balancing technique is the artificial oversampling, which increase the size of datasets. In this research, multinomial classification was applied to classify some recorded features obtained from a single ECG (electrocardiograph) sensor. Therefore, a Dirichlet process, a dirichlet distribution of cumulative distribution function of each data partition, was needed to model the distribution of the new generated data by also considering the statistical properties of the previous data. Data balancing process had given the result of 77.21% classification accuracy (CA), and 90.9% area under ROC curve (AUC). © 2011 IEEE.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

Pulsar candidate selection using ensemble networks for FAST drift-scan survey

引用

Science China(Physics,Mechanics & Astronomy) 2019年第5期62卷 61-70页

作者： HongFeng Wang WeiWei Zhu Ping Guo Di Li SiBo Feng Qian Yin ChenChen Miao ZhenZhao Tao ZhiChen Pan Pei Wang Xin Zheng XiaoDan Deng ZhiJie Liu XiaoYao Xie XuHong Yu ShanPing You Hui Zhang FAST Collaboration Image Processing and Pattern Recognition Laboratory College of Information Science and TechnologyBeijing Normal UniversityBeijing 100875China CAS Key Laboratory of FAST Chinese Academy of SciencesBeijing 100101China School of Information Management Dezhou UniversityDezhou 253023China Image Processing and Pattern Recognition Laboratory School of Systems ScienceBeijing Normal UniversityBeijing 100875China University of Chinese Academy of Sciences Beijing 100049China Key Laboratory of Information and Computing Science Guizhou Province Guizhou Normal UniversityGuiyang 550001China School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550001China 不详

The Commensal Radio Astronomy Five-hundred-meter Aperture Spherical radio Telescope(FAST) Survey(CRAFTS) utilizes the novel drift-scan commensal survey mode of FAST and can generate billions of pulsar candidate signals. The human experts are not likely to thoroughly examine these signals, and various machine sorting methods are used to aid the classification of the FAST candidates. In this study, we propose a new ensemble classification system for pulsar candidates. This system denotes the further development of the pulsar image-based classification system(PICS), which was used in the Arecibo Telescope pulsar survey, and has been retrained and customized for the FAST drift-scan survey. In this study, we designed a residual network model comprising 15 layers to replace the convolutional neural networks(CNNs) in PICS. The results of this study demonstrate that the new model can sort >96% of real pulsars to belong the top 1% of all candidates and classify >1.6 million candidates per day using a dual-GPU and 24-core computer. This increased speed and efficiency can help to facilitate real-time or quasi-real-time processing of the pulsar-search data stream obtained from CRAFTS. In addition, we have published the labeled FAST data used in this study online, which can aid in the development of new deep learning techniques for performing pulsar searches.

关键词： pulsars neural networks data analysis

来源：评论

学校读者我要写书评

暂无评论

An efficient multiparty quantum secret sharing scheme using a single qudit

引用

Chinese Physics B 2023年第8期32卷 161-170页

作者：胡文文熊邦书周日贵 School of Information Engineering Nanchang Hangkong UniversityNanchang 330063China Key Laboratory of Image Processing and Pattern Recognition of Jiangxi Province Nanchang Hangkong UniversityNanchang 330063China College of Information Engineering Shanghai Maritime UniversityShanghai 201306China

The aim of quantum secret sharing,as one of most promising components of quantum cryptograph,is one-tomultiparty secret communication based on the principles of quantum *** this paper,an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is *** participant's shadow is encoded on a single qudit via a measuring basis encryption method,which avoids the waste of qudits caused by basis *** analysis indicates that the proposed protocol is immune to general attacks,such as the measure-resend attack,entangle-and-measure attack and Trojan horse *** to former protocols,the proposed protocol only needs to perform the single-qudit measurement operation,and can share the predetermined dits instead of random bits or dits.

关键词： quantum secret sharing high-dimensional measurement basis encrypted security analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：