An improved watermarking method based on double random phase encoding technique

An improved watermarking method, based on the double random phase encoding technique and the cascaded-phases iterative algorithm and random-phase-shift algorithm, is proposed. This method can significantly reduce the needs of watermarking information storage for different multimedia products, and provide a reasonable criterion of determining the authenticity of a product for the copyright owner. This method can also be applied to track the source of copies. The effectiveness of this method was verified through numerical simulations.     

稀疏阈值的超分辨率图像重建

为了解决基于字典学习的超分辨重构算法耗时过长的问题,提出了基于稀疏阈值模型的图像超分辨率重建方法。首先,将联合字典理论与图像块稀疏阈值方法相结合,训练得到高、低分辨率过完备图像字典对。接着,通过稀疏阈值OMP算法对图像特征块进行稀疏表示。然后,通过高分辨率字典重构出初始的超分辨图像。最后,通过改进迭代反投影算法对初始的超分辨图像进行全局优化,从而进一步提高图像重构质量。实验结果表明,超分辨图像重构平均峰值信噪比(PSNR)为30.1 d B,平均结构自相似度(SSIM)为0.937 9,平均计算时间为10.2 s。有效提高了超分辨重构的速度,改善了重构高分辨图像的质量。     

基于改进的多轴差分吸收光谱层析技术的烟羽浓度峰重建

建立了被动多轴差分吸收光谱层析系统,实现烟羽气体的时空浓度分布测量,分别采用传统的同步迭代重建算法(SIRT)和改进的SIRT对测量数据进行了重建分析,克服了一些实际测试中不能获 取大量投影数据或投影分布不均匀、存在噪声的问题,精确地重建出大气痕量气体的二维空间分布．在不同的模型及评价指标下,通过数值模拟对两种重建算法的效果进行比较,改变改进的SIRT算法中的松弛因子,在5500次的迭代过程中,指标d从0.435降到了0.044,指标r从0.376降到了0.044,改进的SIRT算法具有更好的重建效果．外场重建试验中成功重建了大气痕量气体的二维空间．     

多维矢量矩阵变换域的运动矢量估计

为了实现对视频中运动目标的运动矢量估计,建立了多维矢量矩阵变换域运动估计系统,在变换域对运动视频中运动目标形成的多维能量集中平面进行研究。首先,介绍了多维矢量矩阵理论、变换理论以及运动目标在变换域形成能量集中平面的理论推导;然后,采用平面拟合的方法,求取运动矢量的大小;最后,分析对比了几种方法的效果和迭代速度。实验结果表明:多维矢量矩阵变换域的运动平面拟合方法估计的运动矢量精度达到10^-2 pixel,提供了一种变换域运动矢量估计的高精度方法。     

Fast parallel algorithm for three-dimensional distance-driven model in iterative computed tomography reconstruction

The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model(DDM) is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU(graphic processing unit) platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction.     

Cross-Module Enoylreduction in the Azalomycin F Polyketide Synthase

The colinearity of canonical modular polyketide synthases, which creates a direct link between multienzyme structure and the chemical structure of the biosynthetic end-product, has become a cornerstone of knowledge-based genome mining. Herein, we report genetic and enzymatic evidence for the remarkable role of an enoylreductase in the polyketide synthase for azalomycin F biosynthesis. This internal enoylreductase domain, previously identified as acting only in the second of two chain extension cycles on an initial iterative module, is shown to also catalyze enoylreduction in trans within the next module. The mechanism for this rare deviation from colinearity appears to involve direct cross-modular interaction of the reductase with the longer acyl chain, rather than back transfer of the substrate into the iterative module, suggesting an additional and surprising plasticity in natural PKS assembly-line catalysis.     

Iterative Suzuki‐Miyaura Cross‐coupling/Bromo‐desilylation Reaction Sequences for the Assembly of Chemically Well‐defined,Acyclic Oligopyrrole/Benzenoid Hybrids Embodying Mixed Modes of Connectivity

Syntheses of a range of chemically well‐defined oligopyrrole/benzenoid hybrids are described using tandem Suzuki‐Miyaura cross‐coupling/bromo‐desilyation reaction sequences for linking borylated pyrroles, halogenated pyrroles and/or dibromobenzenes to one another. By such means, including iterative variants, a range of all α‐linked, all β‐linked oligopyrroles as well as certain combinations thereof have been assembled, some of them for the first time. The conductivities of iodine‐treated thin films formed from certain such systems have been determined.     

MODELLING OF WAVE PROPAGATION IN THE NEARSHORE REGION USING THE MILD SLOPE EQUATION WITH GMRES-BASED ITERATIVE SOLVERS

The mild slope equation in its linear and non-linear forms is used for the modelling of nearshore wave propagation. The finite difference method is used to descretize the governing elliptic equations and the resulting system of equations is solved using GMRES-based iterative method. The original GMRES solution technique of Saad and Schultz is not directly applicable to the present case owing to the complex coefficient matrix. The simpler GMRES algorithm of Walker and Zhou is used as the core solver, making the upper Hessenberg factorization unneccessary when solving the least squares problem. Several preconditioning-based acceleration strategies are tested and the results show that the GMRES-based iteration scheme performs very well and leads to monotonic convergence for all the test-cases considered.     

基于迭代小波变换的光谱信号本底扣除方法研究

本底会对光谱分析结果产生很大的干扰作用,为获取特征峰的有效信息,必须首先去除本底。该文提出了一种基于小波变换的本底扣除算法,通过对光谱及后续光谱迭代进行小波变换,利用逼近系数估计本底,直到本底收敛。提出了判断多次估计的本底最大误差是否足够小的收敛准则。利用该算法去除本底后,即可进行特征峰信息的提取。分别利用仿真光谱和实验能量色散X射线荧光光谱对算法进行了验证,并与传统小波变换和多项式拟合法进行了对比。结果表明,该算法能够更准确扣除光谱本底,对其他光谱的本底扣除也具有借鉴意义。     

一类非线性矩阵方程对称解的双迭代算法

利用逆矩阵的Neumann级数形式,将在Schur插值问题中遇到的含未知矩阵二次项之逆的非线性矩阵方程转化为高次多项式矩阵方程,然后采用牛顿算法求高次多项式矩阵方程的对称解,并采用修正共轭梯度法求由牛顿算法每一步迭代计算导出的线性矩阵方程的对称解或者对称最小二乘解,建立求非线性矩阵方程的对称解的双迭代算法.双迭代算法仅要求非线性矩阵方程有对称解,不要求它的对称解唯一,也不对它的系数矩阵做附加限定.数值算例表明,双迭代算法是有效的.