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

An image encryption scheme based on three-dimensional Brownian motion and chaotic system

Chinese Physics B 2017年第2期26卷 99-113页

作者： Xiu-Li Chai Zhi-Hua Gan Ke Yuan l Yang Lu Yi-Ran Chen School of Computer and Information Engineering Institute of Image Processing and Pattern Recognition Henan University Kaifeng 475004 China Department of Electrical and Computer Engineering University of Pittsburgh Pittsburgh PA 15261 USA School of Software Henan University Kaifeng 475004 China Research Dep＇ ~tment Henan University Kaifeng 475004 China

At present, many chaos-based image encryption algorithms have proved to be unsafe, few encryption schemes permute the plain images as three-dimensional（3D） bit matrices, and thus bits cannot move to any position, the movement range of bits are limited, and based on them, in this paper we present a novel image encryption algorithm based on 3D Brownian motion and chaotic systems. The architecture of confusion and diffusion is adopted. Firstly, the plain image is converted into a 3D bit matrix and split into sub blocks. Secondly, block confusion based on 3D Brownian motion（BCB3DBM）is proposed to permute the position of the bits within the sub blocks, and the direction of particle movement is generated by logistic-tent system（LTS）. Furthermore, block confusion based on position sequence group（BCBPSG） is introduced, a four-order memristive chaotic system is utilized to give random chaotic sequences, and the chaotic sequences are sorted and a position sequence group is chosen based on the plain image, then the sub blocks are confused. The proposed confusion strategy can change the positions of the bits and modify their weights, and effectively improve the statistical performance of the algorithm. Finally, a pixel level confusion is employed to enhance the encryption effect. The initial values and parameters of chaotic systems are produced by the SHA 256 hash function of the plain image. Simulation results and security analyses illustrate that our algorithm has excellent encryption performance in terms of security and speed.

关键词： image encryption logistic-tent system（LTS） memristive chaotic system three-dimensional（3D） Brownian motion

来源：评论

学校读者我要写书评

暂无评论

SIMULTANEOUS ACCURATE DETECTION OF PULMONARY NODULES AND FALSE POSITIVE REDUCTION USING 3D CNNS

SIMULTANEOUS ACCURATE DETECTION OF PULMONARY NODULES AND FAL...

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Yulei Qin Hao Zheng Yue-Min Zhu Jie Yang Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University 800 Dongchuan RD. Minhang District Shanghai China University Lyon INSA Lyon CNRS Inserm CREATIS UMR 5220 U1206 F-69621 France

ISBN: (纸本)9781538646595

Accurate detection of nodules in CT images is vital for lung cancer diagnosis, which greatly influences the patient's chance for survival. Motivated by successful application of convolutional neural networks (CNNs) on natural images, we propose a computer-aided diagnosis (CAD) system for simultaneous accurate pulmonary nodule detection and false positive reduction. To generate nodule candidates, we build a full 3D CNN model that employs 3D U-Net architecture as the backbone of a region proposal network (RPN). We adopt multi-task residual learning and online hard negative example mining strategy to accelerate the training process and improve the accuracy of nodule detection. Then, a 3D DenseNet-based model is presented to reduce false positive nodules. The densely connected structure reuses nodules' features and boosts feature propagation. Experimental results on LUNA16 datasets demonstrate the superior effectiveness of our approach over state-of-the-art methods.

关键词： Pulmonary nodule detection computer-aided diagnosis false positive reduction Diagnosis, Computer-Assisted nodules nodule nodules Root nodules False False-positives Concurrency

来源：评论

学校读者我要写书评

暂无评论

Fault Detection and Isolation of Sensor in Markov Jump Systems based on Space Geometry Method 35

Fault Detection and Isolation of Sensor in Markov Jump Syste...

引用

第35届中国控制会议

作者： HOU Yandong QIAO Dianfeng CHENG Qianshuai HUANG Ruirui Institute of Image Processing and Pattern Recognition Henan University

ISBN: (纸本)9781509009107

This paper investigates sensor fault problems in Markov jump systems with uncertain *** the measurement equation,the sensor faults can be translated into the state ***,a cluster of residual generators is designed by employing the space geometric *** corresponding filter parameters are obtained based on the space geometric approach,then using H optimization technique reduce the effects of disturbance inputs on the residuals,at the same time,the residual generator is designed so that the residual signals and sensor faults satisfy one to one correspondence,which can be used to detect and isolate the sensor faults in Markov jump systems with *** results demonstrate the efficiency of the proposed method.

关键词： Unobservability subspace fault detection and isolation(FDI) Markov jump systems space geometric approach H_∞ optimization technique

来源：评论

学校读者我要写书评

暂无评论

PILAE: A non-gradient descent learning scheme for deep feedforward neural networks

arXiv

引用

arXiv 2018年

作者： Guo, Ping Wang, Ke Zhou, XiuLing The Image Processing & Pattern Recognition Lab. School of Systems Science Beijing Normal University Beijing100875 China The School of Information Engineering Zhengzhou University Zhengzhou450001 China The Department of Technology and Industry Development Beijing City University Beijing100083 China

In this work, a non-gradient descent learning (NGDL) scheme was proposed for deep feedforward neural networks (DNN). It is known that an autoencoder can be used as the building blocks of the multi-layer perceptron (MLP) DNN, the MLP is taken as an example to illustrate the proposed scheme of pseudoinverse learning algorithm for autoencoder (PILAE) in this paper. The PILAE with low rank approximation is a NGDL algorithm, and the encoder weight matrix is set to be the low rank approximation of the pseudoinverse of the input matrix, while the decoder weight matrix is calculated by the pseudoinverse learning algorithm. It is worth to note that only very few network structure hyper-parameters need to be tuned compared with classical gradient descent learning algorithm. Hence, the proposed algorithm could be regarded as a quasi-automated training algorithm which could be utilized in automated machine learning field. The experimental results show that the proposed learning scheme for DNN could achieve better performance on considering the tradeoff between training efficiency and classification accuracy. Copyright © 2018, The Authors. All rights reserved.

关键词： Feedforward neural networks

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional Spectral image Calibration Based on Feed-forward Neural Network

Two-dimensional Spectral Image Calibration Based on Feed-for...

引用

International Joint Conference on Neural Networks

作者： Mingze Li Hasitieer Haerken Ping Guo Fuqing Duan Qian Yin Xin Zheng Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing 100875 China

ISBN: (纸本)9781509061839

In this paper, we present a novel method on image calibration, utilizing Total Least Square (TLS) method and Feed-forward Neural Network, to solve the aberration problem of LAMOST two-dimensional astronomical spectral images. In our method, training sample set is generated with domain knowledge, from which a number of discrete points are are extracted from spectral images with fiber tracing method, and output vectors are formed by the corresponding calibrated points, obtained by utilizing the TLS method. The Feed-forward Neural Network is trained to obtain the transformation matrix, casting about for the matching relationship between the input and output sets. We also perform comparative experiments on fiber tracing and spectrum extraction results between calibrated spectral images and uncalibrated spectral images, the results show an advantage of higher accuracy and precision by our proposed method.

关键词： Nonlinear distortion Calibration Neural networks Training Optical distortion Imaging

来源：评论

学校读者我要写书评

暂无评论

Cubature Kalman probability hypothesis density filter based on multi-sensor consistency fusion

引用

High Technology Letters 2016年第4期22卷 376-384页

作者：胡振涛 Hu Yumei Guo Zhen Wu Yewei Institute of Image Processing and Pattern Recognition Henan University College of Automation Northwestern Polytechnical University

The GM-PHD framework as recursion realization of PHD filter is extensively applied to multitarget tracking system. A new idea of improving the estimation precision of time-varying multi-target in non-linear system is proposed due to the advantage of computation efficiency in this paper. First,a novel cubature Kalman probability hypothesis density filter is designed for single sensor measurement system under the Gaussian mixture framework. Second,the consistency fusion strategy for multi-sensor measurement is proposed through constructing consistency matrix. Furthermore,to take the advantage of consistency fusion strategy,fused measurement is introduced in the update step of cubature Kalman probability hypothesis density filter to replace the single-sensor measurement. Then a cubature Kalman probability hypothesis density filter based on multi-sensor consistency fusion is proposed. Capabilily of the proposed algorithm is illustrated through simulation scenario of multi-sensor multi-target tracking.

关键词： multi-target tracking probability hypothesis density(PHD) cubature Kalman filter consistency fusion

来源：评论

学校读者我要写书评

暂无评论

Fast signal recovery from saturated measurements by linear loss and nonconvex penalties

arXiv

引用

arXiv 2018年

作者： He, Fan Huang, Xiaolin Liu, Yipeng Yan, Ming Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University The MOE Key Laboratory of System Control and Information Processing Shanghai200240 China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu611731 China The Department of Computational Mathematics Science and Engineering Michigan State University MI United States

Sign information is the key to overcoming the inevitable saturation error in compressive sensing systems, which causes information loss and results in bias. For sparse signal recovery from saturation, we propose to use a linear loss to improve the effectiveness from existing methods that utilize hard constraints/hinge loss for sign consistency. Due to the use of linear loss, an analytical solution in the update progress is obtained, and some nonconvex penalties are applicable, e.g., the minimax concave penalty, the 0 norm, and the sorted 1 norm. Theoretical analysis reveals that the estimation error can still be bounded. Generally, with linear loss and nonconvex penalties, the recovery performance is significantly improved, and the computational time is largely saved, which is verified by the numerical experiments. Copyright © 2018, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Indefinite kernel logistic regression

arXiv

引用

arXiv 2017年

作者： Liu, Fanghui Huang, Xiaolin Yang, Jie Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China

Traditionally, kernel learning methods requires positive definitiveness on the kernel, which is too strict and excludes many sophisticated similarities, that are indefinite, in multimedia area. To utilize those indefinite kernels, indefinite learning methods are of great interests. This paper aims at the extension of the logistic regression from positive semi-definite kernels to indefinite kernels. The model, called indefinite kernel logistic regression (IKLR), keeps consistency to the regular KLR in formulation but it essentially becomes non-convex. Thanks to the positive decomposition of an indefinite matrix, IKLR can be transformed into a difference of two convex models, which follows the use of concave-convex procedure. Moreover, we employ an inexact solving scheme to speed up the sub-problem and develop a concave-inexact-convex procedure (CCICP) algorithm with theoretical convergence analysis. Systematical experiments on multi-modal datasets demonstrate the superiority of the proposed IKLR method over kernel logistic regression with positive definite kernels and other state-of-the-art indefinite learning based algorithms. Copyright © 2017, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive nonparametric kernels

arXiv

引用

arXiv 2018年

作者： Liu, Fanghui Huang, Xiaolin Gong, Chen Yang, Jie Li, Li Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Automation Tsinghua University

Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussian kernel and sigmoid kernel, or their combinations are often not sufficiently flexible to fit the data. In this paper, we present a Data-Adaptive Nonparametric Kernel (DANK) learning framework in a data-driven manner. To be specific, in model formulation, we impose an adaptive matrix on the kernel/Gram matrix in an entry-wise strategy. Since we do not specify the formulation of the adaptive matrix, each entry in the adaptive matrix can be directly and flexibly learned from the data. Therefore, the solution space of the learned kernel is largely expanded, which makes our DANK model flexible to capture the data with different local statistical properties. Specifically, the proposed kernel learning framework can be seamlessly embedded to support vector machines (SVM) and support vector regression (SVR), which has the capability of enlarging the margin between classes and reducing the model generalization error. Theoretically, we demonstrate that the objective function of our DANK model embedded in SVM/SVR is gradient-Lipschitz continuous. Thereby, the training process for kernel and parameter learning in SVM/SVR can be efficiently optimized in a unified framework. Further, to address the scalability issue in nonparametric kernel learning framework, we decompose the entire optimization problem in DANK into several smaller easy-to-solve problems, so that our DANK model can be efficiently approximated by this partition. The effectiveness of this approximation is demonstrated by both empirical studies and theoretical guarantees. Experimentally, the proposed DANK model embedded in SVM/SVR achieves encouraging performance on various classification and regression benchmark datasets when compared with other representative kernel learning based algorithms. Copyrig

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature learning for endomicroscopy image retrieval 20th

Unsupervised feature learning for endomicroscopy image retri...

引用

20th International Conference on Medical image Computing and Computer-Assisted Intervention, MICCAI 2017

作者： Gu, Yun Vyas, Khushi Yang, Jie Yang, Guang-Zhong School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Hamlyn Centre for Robotic Surgery Imperial College London London United Kingdom

ISBN: (纸本)9783319661780

Learning the visual representation for medical images is a critical task in computer-aided diagnosis. In this paper, we propose Unsupervised Multimodal Graph Mining (UMGM) to learn the discriminative features for probe-based confocal laser endomicroscopy (pCLE) mosaics of breast tissue. We build a multiscale multimodal graph based on both pCLE mosaics and histology images. The positive pairs are mined via cycle consistency and the negative pairs are extracted based on geodetic distance. Given the positive and negative pairs, the latent feature space is discovered by reconstructing the similarity between pCLE and histology images. Experiments on a database with 700 pCLE mosaics demonstrate that the proposed method outperforms previous works on pCLE feature learning. Specially, the top-1 accuracy in an eight-class retrieval task is 0.659 which leads to 10% improvement compared with the state-of-the-art method. © Springer International Publishing AG 2017.

关键词： Histology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：