基于以太网机群的海量高光谱数据处理系统平台设计

在一些大型图像处理系统中,通过构建服务器机群网络,可实现多台服务器并行处理图像数据流。针对高光谱遥感数据及处理算法特点,设计了基于以太网的服务器机群海量高光谱数据处理系统平台,平台由7台服务器和1台千兆网交换机构组成,其中选择CPU核数不低于8核的4台HP刀片服务器作为并行处理服务器,在服务器机群软件设计中,通过任务分解、算法流水化处理及网络负载均衡等方法来实现并行处理。该系统已应用在某遥感数据处理系统中,多台服务器同时写入SAN盘阵,可实现6 000 Mbps的写入能力。     

Image feature extraction by dynamic neural filtering and phase-only joint transform correlation

Neural network-based image processing algorithms present numerous advantages due to their supervised adjustable properties. Among various neural network architectures, dynamic neural networks, Hopfield and Cellular networks, have been found inherently suitable for filtering applications. Combining supervised and filtering features of dynamic neural networks, this paper presents dynamic neural filtering technique based on Hopfield neural network architecture. The filtering technique has also been implemented by using phase-only joint transform correlation (POJTC) for optical image processing applications. Filtering structure is basically similar to the Hopfield neural network structure except for the adjustable filter mask and 2D convolution operation instead of weight matrix operations. The dynamic neural filtering architecture has learnable properties by back-propagation learning algorithm. POJTC presents significant advantages to achieve the operation of summing the cross-correlation of bipolar data by phase-encoding bipolar data in parallel. The image feature extraction performance of the proposed optical system is reported for various image processing applications using a simulation program.     

一种改进的开关电流滤波器实现小波变换的方法

提出了一种小波变换的开关电流滤波器实现的新方案,基于网络函数逼近理论,采用一种函数逼近的系统算法将基本小波函数综合为有理分式和,并利用开关电流并联结构实现该基本小波函数滤波器.以高斯一阶导数函数为例,给出了逼近网络的具体构造过程和开关电流滤波器实现结构.该滤波器网络由六个以S²I存储单元为核的双二次开关电流滤波器并联而成.理论分析和仿真结果表明,新方案比原有实现方法在逼近精度、系统稳定性、电路性能方面均有明显改善. 关键词： 小波变换 开关电流 网络函数逼近 有理分式综合     

Parallel computing for fringe pattern processing: A multicore CPU approach in MATLAB environment

In the process of measurements such as optical interferometry and fringe projection, an important stage is fringe pattern analysis. Many advanced fringe analysis algorithms have been proposed including regularized phase tracking (RPT), partial differential equation based methods, wavelet transform, Wigner–Ville distribution, and windowed Fourier transform. However, most of those algorithms are computationally expensive. MATLAB^® is a general algorithm development environment with powerful image processing and other supporting toolboxes. It is also commonly used in photomechanical data analysis. With rapid development of multicore CPU technique, using multicore computer and MATLAB^® is an intuitive and simple way to speed up the algorithms for fringe pattern analysis. The paper introduces two acceleration approaches for fringe pattern processing. The first approach is task parallelism using multicore computer and MATLAB^® parallel computing toolbox. Since some algorithms are embarrassing problems, our first approach makes use of this characteristic to parallelize these algorithms. For this approach, parallelized windowed Fourier filtering (WFF) algorithm serves as an example to show how parallel computing toolbox accelerates the algorithm. Second, data parallelism using multicore computer and MATLAB^® parallel computing toolbox is proposed. A high level parallel wrapping structure is designed, which can be used for speeding up any local processing algorithms. WFF, windowed Fourier ridges (WFR), and median filter are used as examples to illustrate the speedup. At last, the results show that the parallel versions of former sequential algorithm with simple modifications achieve the speedup up to 6.6 times.     

基于Harris角点检测器的指纹细节点提取算法

提出了一种基于Harris角点检测器的指纹细节点提取算法。先将Harris角点检测器应用于增强后的指纹图像,检测出指纹的细节点和曲率变化大的点,随后进行后处理操作。在后处理操作中,根据细节点的空间分布特征,删除虚假点。使用细节点的邻域灰度信息,判定细节点的类型。利用细节点的原始方向以及得到的类型,确定细节点的精确方向。与经典的细节点提取算法相比,不需要对指纹图像进行二值化、细化,直接在灰度指纹图像当中提取细节点,大大减少了计算时间,有效地提高了效率。使用FVC2002指纹数据库测试,结果表明,该算法可靠、快速,适合实际应用。     

Improved algorithm for image encryption based on stochastic geometric moiré and its application

A technique based on optical operations on moiré patterns for image encryption and decryption is developed. In this method, an image is encrypted by a stochastic geometric moiré pattern deformed according to the image reflectance map. The decryption is performed using pixel correlation algorithm in the encrypted image and the stochastic geometrical moiré pattern. The proposed technique has a number of advantages over existing encryption techniques based on moiré gratings. No original moiré grating can be reconstructed only from the encrypted image. Stochastic moiré grating can be deformed in any direction what is an important factor of encryption security. Finally, the quality of the decrypted image is much better compared to decryption methods based on the superposition of the regular and deformed moiré gratings. The proposed technique has a great potential, because the process is performed using computational algorithms based on optical operations and optical components are avoided.     

Cryptographic Algorithm Using Newton-Raphson Method and General Bischi-Naimzadah Duopoly System

Image encryption is an excellent method for the protection of image content. Most authors used the permutation-substitution model to encrypt/decrypt the image. Chaos-based image encryption methods are used in this model to shuffle the rows/columns and change the pixel values. In parallel, authors proposed permutation using non-chaotic methods and have displayed good results in comparison to chaos-based methods. In the current article, a new image encryption algorithm is designed using combination of Newton-Raphson’s method (non-chaotic) and general Bischi-Naimzadah duopoly system as a hyperchaotic two-dimensional map. The plain image is first shuffled by using Newton-Raphson’s method. Next, a secret matrix with the same size of the plain image is created using general Bischi-Naimzadah duopoly system. Finally, the XOR between the secret matrix and the shuffled image is calculated and then the cipher image is obtained. Several security experiments are executed to measure the efficiency of the proposed algorithm, such as key space analysis, correlation coefficients analysis, histogram analysis, entropy analysis, differential attacks analysis, key sensitivity analysis, robustness analysis, chosen plaintext attack analysis, computational analysis, and NIST statistical Tests. Compared to many recent algorithms, the proposed algorithm has good security efficiency.     

Blind image deconvolution using the zero-lag slice of higher-order statistics

A novel algorithm for blind image deconvolution using the zero-lag slice (ZLS) of higher-order statistics only is presented. This method first estimates the point-spread function (PSF) using the ZLS of its third-order moment (TOM) and then uses it with one of the known classical image deconvolution methods. The proposed method has simple computations for PSF estimation because it solves a nonlinear problem by using an iterative method with fast convergence. In each iteration, one need only calculate the ZLS of the TOM and estimate the PSF using simple two-dimensional operations. Furthermore, the method presented achieves good results, since the ZLS estimate obtained from the degraded image exhibits high reliability. The good performance of the proposed algorithm is demonstrated by applying it to synthetic and real data sets.     

利用重要度评价矩阵确定复杂网络关键节点

为了对复杂网络节点重要度进行评估,针对节点删除法、节点收缩法和介数法的不足,通过定义节点效率和节点重要度评价矩阵, 提出了一种利用重要度评价矩阵来确定复杂网络关键节点的方法.该方法综合考虑了节点效率、节点度值和相邻节点的重要度贡献,用节点度值和效率值来表征其对相邻节点的重要度贡献,其优化算法的时间复杂度为O(Rn²). 实验分析表明该方法可行有效,对于大型复杂网络可以获得理想的计算能力.     

High accuracy digital image correlation powered by GPU-based parallel computing

A sub-pixel digital image correlation (DIC) method with a path-independent displacement tracking strategy has been implemented on NVIDIA compute unified device architecture (CUDA) for graphics processing unit (GPU) devices. Powered by parallel computing technology, this parallel DIC (paDIC) method, combining an inverse compositional Gauss–Newton (IC-GN) algorithm for sub-pixel registration with a fast Fourier transform-based cross correlation (FFT-CC) algorithm for integer-pixel initial guess estimation, achieves a superior computation efficiency over the DIC method purely running on CPU. In the experiments using simulated and real speckle images, the paDIC reaches a computation speed of 1.66×10⁵ POI/s (points of interest per second) and 1.13×10⁵ POI/s respectively, 57–76 times faster than its sequential counterpart, without the sacrifice of accuracy and precision. To the best of our knowledge, it is the fastest computation speed of a sub-pixel DIC method reported heretofore.     

基于去模糊空间变换RCNN的毫米波图像目标检测（英文）

提出一种包含去模糊的空间变换区域卷积神经网络的目标检测算法.首先,基于主动毫米波圆柱扫描成像原理对人体进行三维成像(频率24~30 GHz),建立毫米波图像数据集.然后,估计毫米波图像的模糊核,通过卷积去噪网络获得图像先验知识,将其集成到半二次分裂的优化方法中,以实现非盲目去模糊.最后,由定位网络、网格生成器和采样网络三部分组成空间变换网络,将它融入到特征提取网络中,在去模糊后实现目标检测.通过该非盲目去模糊算法得到的图像的峰值信噪比可达27.49 dB,目标检测算法的平均精度可达80.9%.实验结果表明,与现有的先进方法相比,该方法可以有效地提高图像质量和检测精度,为毫米波图像中隐藏危险品的目标检测提供了新的技术支持.     

Study on two-dimensional distribution of X-ray image based on improved Elman algorithm

The principle of the X-ray detector which can simultaneously perform the measurement of the exposure rate and 2D (two-dimensional) distribution is described. A commercially available CMOS image sensor has been adopted as the key part to receive X-ray without any scintillators. The correlation between the pixel value (PV) and the absorbed exposure rate of X-ray is studied using the improved Elman neural network. Comparing the optimal adjustment process of the BP (Back Propagation) neural network and the improved Elman neural network, the neural network parameters are selected based on the fitting curve and the error curve. The experiments using the practical production data show that the proposed method achieves high accurate predictions to 10⁻¹⁵, which is consistent with the anticipated value. It is proven that it is possible to detect the exposure rate using the X-ray detector with the improved Elman algorithm for its advantages of fast converges and smooth error curve.     

ARM架构下计算机图像并行化处理技术研究

为在图像处理与分析时具备良好的视觉效果,提高图像处理的速度,需要对ARM架构下计算机图像并行化处理技术进行研究。当前采用的方法是对各种变换频域图像特征提取与计算机图像集合特征的提取进行相结合,克服了当前对图像进行提取时存在图像形状描述的缺陷,提取图像特征向量维数相对较低。实验表明,通过对图像进行特征提取能很好的对图像效果进行展示,将图像的纹理特征进行详细的表述,将该方法应用到图像处理技术当中,具有良好的去噪效果及扩展性,该方法过程简单,但存在图像视觉效果较差的问题。为此,提出一种ARM架构下计算机图像并行化处理技术研究方法。该方法首先利用非局部均值去噪算法对图像进行去噪处理,然后结合图像去噪的结果利用小波变换对去噪图像进行边缘检测,最后采用非线性增强算法对图像进行增强完成对ARM架构下计算机图像并行化处理技术研究。实验结果表明,所提方法不仅提高图像处理速度,还提高图像视觉效果,具有广泛的应用价值。     

A fast image encryption method by using chaotic 3D cat maps

An image encryption method using a chaotic 3D cat map is presented in this paper. The process of the proposed algorithm contains the simultaneous operations of pixels’ locations permutation and pixels’ values substitution at every iterative step of the chaotic map, which making the forward and reverse encryption needs only one traverse of the image pixels. Moreover, a perturbation is introduced to eliminate the undesirable finite precision effect of computer in realization. The main advantages of such a secure method are the simplicity and efficiency. Both simulations and analysis show the proposed algorithm can produce a large key space and resist the common existing cipher attacks. These good cryptographic properties make it suitable for image applications.     

Simplification of Space-Variant Parallel Logic Operations Using the Temporal Method

A time-domain encoding method (temporal method) for space-variant parallel logic operations, which can execute different operations in parallel, is proposed. The temporal method is based on temporal encoding of two input patterns, temporal gating of the coded pattern, and decoding by temporal addition of the gated patterns. The first feature of the proposed method is that parallel logic operations can be performed without complex pattern transformations. The second feature is that the logical output can be directly fed to succeeding systems without specific decoding. Therefore, the logic operation system can be constructed using conventional optics and existing spatial light modulators. In order to confirm these features, an optoelectronic experimental system is constructed and space-variant parallel logic operations are performed.     

A novel color image encryption scheme using fractional-order hyperchaotic system and DNA sequence operations

In this paper, Adomian decomposition method(ADM) with high accuracy and fast convergence is introduced to solve the fractional-order piecewise-linear(PWL) hyperchaotic system. Based on the obtained hyperchaotic sequences,a novel color image encryption algorithm is proposed by employing a hybrid model of bidirectional circular permutation and DNA masking. In this scheme, the pixel positions of image are scrambled by circular permutation, and the pixel values are substituted by DNA sequence operations. In the DNA sequence operations, addition and substraction operations are performed according to traditional addition and subtraction in the binary, and two rounds of addition rules are used to encrypt the pixel values. The simulation results and security analysis show that the hyperchaotic map is suitable for image encryption, and the proposed encryption algorithm has good encryption effect and strong key sensitivity. It can resist brute-force attack, statistical attack, differential attack, known-plaintext, and chosen-plaintext attacks.     

Pulse coding off-chip learning algorithm for memristive artificial neural network

Memristive neural network has attracted tremendous attention since the memristor array can perform parallel multiply-accumulate calculation (MAC) operations and memory-computation operations as compared with digital CMOS hardware systems. However, owing to the variability of the memristor, the implementation of high-precision neural network in memristive computation units is still difficult. Existing learning algorithms for memristive artificial neural network (ANN) is unable to achieve the performance comparable to high-precision by using CMOS-based system. Here, we propose an algorithm based on off-chip learning for memristive ANN in low precision. Training the ANN in the high-precision in digital CPUs and then quantifying the weight of the network to low precision, the quantified weights are mapped to the memristor arrays based on VTEAM model through using the pulse coding weight-mapping rule. In this work, we execute the inference of trained 5-layers convolution neural network on the memristor arrays and achieve an accuracy close to the inference in the case of high precision (64-bit). Compared with other algorithms-based off-chip learning, the algorithm proposed in the present study can easily implement the mapping process and less influence of the device variability. Our result provides an effective approach to implementing the ANN on the memristive hardware platform.     

Quantum Image Encryption Algorithm Based on Quantum Image XOR Operations

A novel encryption algorithm for quantum images based on quantum image XOR operations is designed. The quantum image XOR operations are designed by using the hyper-chaotic sequences generated with the Chen’s hyper-chaotic system to control the control-NOT operation, which is used to encode gray-level information. The initial conditions of the Chen’s hyper-chaotic system are the keys, which guarantee the security of the proposed quantum image encryption algorithm. Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm has larger key space, higher key sensitivity, stronger resistance of statistical analysis and lower computational complexity than its classical counterparts.     

基于机群系统的薄膜淀积并行计算

基于集群并行系统,实现了运用蒙特卡罗方法模拟100×100×100个原子Si衬底Al薄膜淀积过程的并行计算.采用了重叠的区域分解法和异步通信的有效并行计算策略,将区域的合理划分与薄膜淀积的空间填补的拓扑几何机理结合起来,着重减少通信耗费,提高算法的并行性能,大量地缩短了薄膜淀积模拟计算时间,从而为运用计算机方法模拟薄膜淀积、完成薄膜材料淀积的预测提供了更高效的手段.     

Inference of Molecular Regulatory Systems Using Statistical Path-Consistency Algorithm

One of the key challenges in systems biology and molecular sciences is how to infer regulatory relationships between genes and proteins using high-throughout omics datasets. Although a wide range of methods have been designed to reverse engineer the regulatory networks, recent studies show that the inferred network may depend on the variable order in the dataset. In this work, we develop a new algorithm, called the statistical path-consistency algorithm (SPCA), to solve the problem of the dependence of variable order. This method generates a number of different variable orders using random samples, and then infers a network by using the path-consistent algorithm based on each variable order. We propose measures to determine the edge weights using the corresponding edge weights in the inferred networks, and choose the edges with the largest weights as the putative regulations between genes or proteins. The developed method is rigorously assessed by the six benchmark networks in DREAM challenges, the mitogen-activated protein (MAP) kinase pathway, and a cancer-specific gene regulatory network. The inferred networks are compared with those obtained by using two up-to-date inference methods. The accuracy of the inferred networks shows that the developed method is effective for discovering molecular regulatory systems.