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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On-line fingerprint verification

On-line fingerprint verification

引用

13th International Conference on pattern recognition, ICPR 1996

作者： Jain, Anil Hong, Lin Pattern Recognition and Image Processing Laboratory Department of Computer Science Michigan State University East Lansing MI 48824 United States

ISBN: (纸本)081867282X

We describe the design and implementation of an online fingerprint verification system which operates in two stages: (i) minutia extraction and (ii) minutia matching. An improved minutia extraction algorithm that is much faster and more accurate than our earlier algorithm has been implemented. For minutia matching, an alignment-based elastic matching algorithm has been developed. This algorithm is capable of finding the correspondences between input minutiae and the stored template without resorting to exhaustive search and has the ability to adaptively compensate for the nonlinear deformations and inexact pose transformations between finger prints. The system has been tested on two sets of finger print images captured with inkless scanners. The verification accuracy is found to be over 99% with a 15% reject rate. Typically, a complete fingerprint verification procedure takes, on an average, about 8 seconds on a SPARC 20 workstation. It meets the response time requirements of on-line verification with high accuracy. © 1996 IEEE.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Generalized quantum genetic algorithm of multidimensional space

Generalized quantum genetic algorithm of multidimensional sp...

引用

2014 International Conference on Logistics Engineering, Management and Computer Science, LEMCS 2014

作者： Zhang, Xiaofeng Miao, Wei Sui, Guifang Yang, Guowei Key Laboratory of JiangXi Procince for Image Processing and Pattern Recognition Information Engineering of NanChang HangKong University NanChang JiangXi330063 China

ISBN: (纸本)9789462520103

Quantum coding plays an important role in quantum genetic algorithm and affects the optimizing efficiency of algorithm, However, there are some defects in existing quantum genetic algorithm: the quantum coding scheme reduces the stability of the algorithm, making the algorithm easily occurs premature convergence and falls into local extremums. Therefore, coding scheme of multi gene chain is extended in a four dimensional space and multidimensional space based on an improved algorithm. Through simulation experiments of function extremum, combine double and triplestranded coding scheme, in accordance with the characteristics of qubits and the normalization condition. Through the experiment, study the effect of multiple genes encoding scheme chain on the performance of the algorithm. The results show that the optimal results of the algorithm can be better and the precision of solution can be higher by increasing the genetic chain. It is an effective strategy to improve the performance of algorithm. © 2014. The authors - Published by Atlantis Press.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

A general framework for machine vision: Hierarchical token grouping

A general framework for machine vision: Hierarchical token g...

引用

1994 International Symposium on Speech, image processing and Neural Networks, ISSIPNN 1994

作者： Huang, Qian Pattern Recognition and Image Processing Laboratory Department of Computer Science Michigan State University East LansingMI48824 United States

ISBN: (纸本)078031865X

While the view of constructive and hierarchical vision prevails, the issues of cooperation and competition among individual modules become crucial. These issues are directly related to one of the most important aspects in computer vision research: integration. A major source of difficulty in developing a consistent and systematic integration formalism is the heterogeneity existing in modules, in information, and in knowledge. The author exploits, using the central theme of grouping, the homogeneous characteristics in vision problem solving and proposes a general framework, called hierarchical token grouping, that facilitates vision problem solving by providing a consistent and systematic environment for integrating modules, cues, and knowledge, all in a globally coherent mechanism. © 1994 IEEE.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A New Method of Shredded Paper image Stitching and Restoration 3

A New Method of Shredded Paper Image Stitching and Restorati...

引用

3rd International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration, ICIICII 2017

作者： Pan, Zixiao Wang, Mei School of Automation Wuhan University of Technology Wuhan China Laboratory of Image Processing and Pattern Recognition Yantai Vocational College Yan China

ISBN: (纸本)9781538624340

For the image restoration problem of shredded paper broken by shredder with the same marginal feature, a new method based on spatial feature classification is proposed in this paper. Because no obvious marginal feature for rule shredder paper can be used to split, the feature similarity classification processing can greatly reduce the solution scale and improve the algorithm efficiency. The horizontal projection position of shredded paper image can be used to distinguish the same line for the shredded paper with words. Then the marginal moment invariants distance are defined by the left and right part spatial correlation information. The original order of adjacent shredded paper in the same line can be ensured by the minimum marginal distance. Similarly ordering up and down can be completed by the minimum marginal distance among up-down part stitching images. For the image stitching and restoration of large-scale rule shredded paper, the actual experimental result shows the good stability, efficiency and strong robustness. © 2017 IEEE.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Generative Adversarial Networks Based on MLP 14

Generative Adversarial Networks Based on MLP

引用

14th International Conference on Digital image processing, ICDIP 2022

作者： Ding, Hui Chen, Weifeng Li, Bo He, Zhifen School of Mathematics and Information Science Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition Nanchang Hangkong University Nanchang China

ISBN: (纸本)9781510657564

Inspired by the state-of-the-art performance of MLP-Mixer on image classification task, multilayer perceptron (MLP) model attracts a number of researcher's attention again. Although various MLP architectures have been proposed, most of them focus on image classification domain. In this paper, we extend MLP to the task of image generation based on generative adversarial network (GAN). The pure MLP model is not friendly to small dataset because it is a data-hungry architecture. Thus, we leverage a hybrid model to solve the problem which uses MLP blocks as generator and CNN blocks as discriminator. Experimental results demonstrate that our model outperforms the pure CNN network on CIFAR-10 dataset in view of two different evaluation metrics. Besides, we apply eight widely popular MLP structures to our generator to validate which one achieves the most excellent performance in image generation task. © 2022 SPIE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Recognizing elongated objects using invariant surface features and matched filters 2

Recognizing elongated objects using invariant surface featur...

引用

Mathematical Methods in Medical Imaging II 1993

作者： Huang, Qian Stockman, George C. Pattern Recognition and Image Processing Laboratory Department of Computer Science Michigan State University East LansingMI48824 United States

Many biological objects are elongated. This research addresses the issue of recognizing elongated objects from both 2D intensity images and 3D volumes. A mathematical model, called tube model, is developed for this class of objects and is effectively utilized in two stages of recognition. The explicit relationships between geometrical surface features and the object model parameters are quantitatively exploited to automatically locate seeds for recognition. Invariant surface features are used to constrain or hypothesize the objects of interest. The verification of a hypothesis is performed by correlating a matched filter, dynamically generated based on the hypothesis, with the sensor data. The tubes identified in such a local recognition process serve as the seeds from which the global recognition process is initiated. Each seed is swept along the trajectory where the best-fit is found. A smooth sweep is controlled by a set of adaptive constraints computed dynamically from an on-line sweeping history. We apply the proposed method to real world data from different application domains. Experimental results are presented and discussed. © 1993 SPIE. All rights reserved.

关键词： Matched filters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：