共查询到20条相似文献,搜索用时 125 毫秒
1.
2.
3.
基于当前流行的视频压缩技术,提出了一种变换域嵌入算法,并通过仿真实验检验了该算法的有效性。该算法以视频图像离散余弦变换(DCT)矩阵的矢量嵌入为基础,以DCT子块为信息嵌入基本载体,将信息隐藏与频域变换相结合,简化了压缩过程的运算量,同时也提高了隐藏的鲁棒性和透明性。 相似文献
4.
全数字全息术在图像信息隐藏中的应用 总被引:1,自引:0,他引:1
提出了全数字全息术在计算机图像信息隐藏中的应用。待隐藏的秘密信息以及公开的承载信息均为灰度级静止图像。首先对待隐藏的计算机信息图进行全息变换,即通过计算全息图的制作步骤制作出全息图的图像文件,然后再进行Arnold对称性变换。在此基础上,将秘密图像嵌入到承载图像的DCT域的中频系数中。全数字全息术的引入进一步增强了隐藏图像的透明性,通过控制制作全息图时的参数可起到加密的作用,相当于增加了一把秘密钥匙,具有较高的保密性和稳健性。 相似文献
5.
基于数字全息与小波变换的图像数字水印技术 总被引:2,自引:0,他引:2
提出一种以数字全息和小波变换为基础的数字水印技术,实现在原始图像中嵌入数字全息水印。首先通过傅里叶变换方法将待隐藏的图像制成数字全息水印图,接着将数字全息水印图和原始图像都分为四个子块,并对原始图像子块进行小波分解,最后将数字全息图像子块嵌入到原始图像相应子块较大的小波系数中。实验仿真结果证明了该水印技术对图像剪切和图像有损压缩有较好的稳定性。 相似文献
6.
鉴于径向基函数(RBF)神经网络模型在非线性预测方面的优良性能, 提出了利用该预测模型对混沌时间序列相空间重构的两个关键参数——延迟时间和嵌入维数进行联合估计的方法, 并以客观的评价指标为依据给出其最优估计值. 以Lorenz系统为例进行数值分析, 得到RBF单步及多步预测模型中嵌入维数和延迟时间的最佳参数估计值, 并在原模型中对估计值进行校验. 结果表明, 该方法可以有效地估计出嵌入维数和延迟时间, 从而显著提高预测精度. 相似文献
7.
针对闪光照相图像受模糊及噪声影响的问题,提出了一种基于约束优化的闪光照相图像重建算法。该算法建立基于平行束投影的正向成像矩阵,并通过嵌入模糊矩阵表达成像过程中的模糊因素,采用最速下降法求解重建问题。在算法中设计了预优矩阵以提高迭代重建速度,利用客体密度值非负、密度分布分段光滑并含有阶跃性边界的先验知识,设计和采用了非负约束、光滑约束及广义变分边界约束条件。对仿真FTO客体图像及实际闪光照相图像的重建结果表明,基于约束优化的重建算法具有良好的边界保持能力及噪声抑制能力,可以有效提高图像重建质量。 相似文献
8.
9.
10.
利用小波变换频谱特性和图像奇异值分解特征,提出了一种结合人眼对比感知特性的图像水印算法。并通过结合人眼视觉特性,将置乱的水印以一定的强度嵌入到图像的奇异值矩阵中,采用其逆过程提取水印,通过仿真进行了验证。对其实施了压缩、剪切、高斯噪声和中值滤波攻击测试,与前人提出的8种水印算法的抗攻击性能进行对比分析。结果表明,在质量因子为20%的较强压缩攻击下,提取水印的NC值仍能达到0.8359,含水印图的PSNR和SSIM达到25.0908dB和0.8451,且比8种水印算法具有更好的鲁棒性。综合表明,提出的算法有效地解决了水印嵌入过程中鲁棒性、视觉透明性与水印嵌入量之间的平衡问题。 相似文献
11.
多光谱/全色影像融合可以得到高空间分辨率的多光谱影像,在影像解译和分类等方面具有十分重要的意义。提出一种基于梯度一致性约束的遥感影像融合方法。该方法在最大后验概率框架下,通过梯度一致性约束建立理想高空间分辨率多光谱影像和全色影像之间的关系,并结合多光谱影像观测模型和Huber-Markov影像先验,构建融合目标函数,最后采用梯度下降法求解得到融合影像。本文方法在目标函数中引入了梯度一致性约束,克服了现有的同类方法受限于波段数量的缺陷,同时在求解中自适应确定每个波段的迭代步长,充分顾及了各波段的光谱特性,从而既确保了融合影像的光谱信息保真度,也提高了融合影像的空间信息融入度。通过IKONOS和WorldView-2影像对该方法进行了验证,并和GS,AIHS和AMBF等融合方法从定性和定量两方面进行了比较分析。实验结果表明,相比于其他方法,该方法可以在更好保持光谱信息的同时增强影像的空间分辨率,具有更广泛的适用范围和更佳的融合效果。 相似文献
12.
We establish the accuracy of the spectrum that is estimated with an inexpensive fluorescence spectral microscope utilizing a small set of spectral filters [Soriano et al, Opt. Exp. 10, 1458–1464 (2002)]. The spectrum at an arbitrary image location of the fluorescent sample is estimated as a linear superposition of basis spectra that are derived by singular value decomposition (SVD) or principal component analysis (PCA) from a spectral library of fluorescence spectra. Estimation performance is analyzed as a function of library statistics, filter selection and sequencing, minimum negativity constraint and signal to noise ratio (SNR) of fluorescence image. We consider image SNR degradations that arise from weakening of image intensity, additive Gaussian noise, intensity-dependent Poisson noise and quantization errors. The recovery of specific spectral features like spectral resolution, general similarity and peak alignments, is assessed using Linfoot’s criteria of fidelity, structural content, and correlation. We found that estimation with SVD basis spectra is more robust against image noise than that with PCA basis spectra. However for high SNR images, accurate estimation is achieved more quickly with PCA basis spectra and with better response to the application of minimum negativity constraint. 相似文献
13.
利用全量子理论和数值计算方法研究了多模相干态光场与单个二能级原子通过任意N_j度简并N~∑光子共振相互作用系统中量子保真度的时间演化特性,给出了三模场与原子相互作用过程中光场和原子保真度的数值计算结果,详细讨论了初始平均光子数、原子分布角、原子偶极相位角、光场激发角以及原子简并度等对量子保真度的影响.数值计算结果表明:以上诸多因素对量子保真度影响的结果均导致其发生振荡性变化.光场和原子保真度随着初始光场增强而急剧减小,说明初始光强敏感地影响着保真度的大小;量子保真度的变化快慢程度强烈地依赖于原子简并度及场一原子的耦合系数;原子分布角、光场激发角不同程度地对量子保真度的大小和频率有所影响;而原子偶极相位角的变化对场和原子的量子保真度几乎没有影响.根据这些特性,通过某些条件的约束可以适当控制保真度变化的快慢及其大小. 相似文献
14.
We show that the Farhi-Gutmann analog quantum search is a singular algorithm in the following sense: when the original driving Hamiltonian is
perturbed slightly such that it is made of projections to the starting state and to the target state with different energies, the maximum fidelity (transition probability) between the
searching state and the target state is strictly less than 1 over the entire evolution period, and the first time to achieve this maximum fidelity is of order √(N)/√(1+cN), whose
behavior depends crucially on whether c=0 or not (here N is
the total number of items, and the original Farhi-Gutmann case
corresponds to c=0). Moreover, when c≠ 0 and N tends to infinity, the maximum fidelity tends to zero, and the first time to achieve the maximum fidelity tends to a positive constant! The
condition for guaranteeing the algorithm's efficiency is determined explicitly. 相似文献
15.
We consider a general image sensing framework that includes many quantum sensing problems by an appropriate choice of image set, prior probabilities, and cost function. For any such problem, in the presence of loss and a signal energy constraint, we show that a pure input state of light with the signal modes in a mixture of number states minimizes the cost among all ancilla-assisted parallel strategies. Lossy binary phase discrimination with a peak photon number constraint and general lossless image sensing are considered as examples. 相似文献
16.
Infrared and visible image fusion has been an important and popular topic in imaging science. Dual-band image fusion aims to extract both target regions in infrared image and abundant detail information in visible image into fused result, preserving even enhancing the information that inherits from source images. In our study, we propose an optimization-based fusion method by combining global entropy and gradient constrained regularization. We design a cost function by taking the advantages of global maximum entropy as the first term, together with gradient constraint as the regularized term. In this cost function, global maximum entropy could make the fused result inherit as more information as possible from sources. And using gradient constraint, the fused result would have clear details and edges with noise suppression. The fusion is achieved based on the minimization of the cost function by adding weight value matrix. Experimental results indicate that the proposed method performs well and has obvious superiorities over other typical algorithms in both subjective visual performance and objective criteria. 相似文献
17.
基于光学菲涅耳全息图和相位密码板,结合离散余弦变换,设计了一种新的正实值编码的“盲数字水印”计算方法.相位密码板是多个点光源的菲涅耳衍射光场的相角之和,原始水印图像在其菲涅耳衍射域中与通过相位密码板的参考光作相干叠加,形成菲涅耳全息图;之后将其嵌入到原始宿主图像的离散余弦变换中,同时将此叠加水印信息的原像素值用其邻近的原像素均值来替换;通过作逆离散余弦变换,获得了已嵌入水印信息的正实数值的目标图像;通过对载有水印信息的目标图像作逆运算,从中提取了原始水印图像.数值计算结果表明:该水印计算法对JPEG有损压缩、剪切、噪音污染和重采样等攻击,具有很强的鲁棒性.由于本算法属“盲数字水印”技术,以及水印信息的灵活嵌入和多重密钥(衍射距离、多个点光源位置等)的随意选择,从而使该算法具有很高的安全性和实用价值. 相似文献
18.
Experiments of multi-photon entanglement have been performed by several groups. Obviously, an increase on the photon number for fidelity estimation and quantum state tomography causes a dramatic increase in the elements of the positive operator valued measures (POVMs), which results in a great consumption of time in measurements. In practice, we wish to obtain a good estimation of fidelity and quantum states through as few measurements as possible for multi-photon entanglement. Phaselift provides such a chance to estimate fidelity for entangling states based on less data. In this paper, we would like to show how the Phaselift works for six qubits in comparison to the data given by Pan’s group, i.e., we use a fraction of the data as input to estimate the rest of the data through the obtained density matrix, and thus goes beyond the simple fidelity analysis. The fidelity bound is also provided for general Schrödinger Cat state. Based on the fidelity bound, we propose an optimal measurement approach which could both reduce the copies and keep the fidelity bound gap small. The results demonstrate that the Phaselift can help decrease the measured elements of POVMs for six qubits. Our conclusion is based on the prior knowledge that a pure state is the target state prepared by experiments. 相似文献
19.