首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
提出了一种基于数学形态学的数字全息图像生成方法。该方法运用数学形态学的原理和运算,能够对图像进行形态变换,生成数字图像序列,并能够制作出具有动态效果和美感的激光全息图,在激光全息防伪领域有着良好的应用前景。  相似文献   

2.
提出一种基于压缩感知理论和数字全息术的数字全息压缩成像技术。通过传统相移数字全息技术获取干涉图样,将干涉同样投影到测量矩阵上,通过计算內积直接获取全息压缩数据。这些数据经过传统通信信道传输后,利用压缩感知重构算法获得原始全息数据,然后经过菲涅尔逆变换得到原始图像。实验仿真结果证明了这种压缩全息成像方法的可行性。  相似文献   

3.
提出了一种可实现盲检测的相位密钥型傅立叶计算全息(CGH)数字水印方法,在生成数字水印傅立叶全息图的参考光中,加入经改进后的G-S迭代算法生成的二维相位密钥。理论分析和实验结果表明,由于该相位密钥的频谱分布为位置和强度不同的一系列δ函数,因而能够避免提取过程中宿主图像的频谱和水印共轭像对水印图像提取产生的干扰,从而能在保证水印质量和加密性能的条件下实现盲检测。  相似文献   

4.
基于同轴菲涅耳全息的标识印刷防伪技术   总被引:3,自引:1,他引:3  
孙刘杰  庄松林 《中国激光》2007,34(3):402-405
在研究双随机相位数据加密技术的基础上,结合数字全息技术和印刷技术的特点,提出了一种新的同轴菲涅耳全息标识防伪方法,利用双随机相位加密复数数据信息(物光信息),与参考光叠加形成同轴全息图像。理论分析了同轴菲涅耳全息方法能有效地恢复原始图像数据,并对加密的同轴菲涅耳全息图像的强抗位压缩性能进行了仿真,最后通过打印和扫描对同轴菲涅耳全息标识的防伪功能进行了验证。结果表明,该全息标识防伪方法具有强的抗位压缩能力,可以通过逆菲涅耳变换和多重解密密钥恢复原始认证信息,是一种十分有效的全息标识。该全息标识方法可通过可变数据印刷技术印制在证件等印刷品中作为个性化防伪标识。  相似文献   

5.
介绍一种使用傅里叶全息滤波器的光电图像形态学处理系统,其中关于图像结构元的扩张,侵蚀及开和闭等基本运算于傅里叶全息光学方法产生的图像与结构元的卷积结果,其迭代过程使用了计算机控制的电寻址空间光调制器,该系统具有结构简单、能反复迭代、易于根据图像设计、更换及使用计算机制全息图产生结构元等优点。  相似文献   

6.
基于多视差立体显示的数字合成全息技术研究   总被引:1,自引:1,他引:0  
合成全息图利用多视差图像实现立体显示,并可通过分区曝光实现大面积制作。介绍了数字合成全息的原理及其实验系统,针对其制作过程中的两种图像采样方式,研究了图像的分割和重组原则。通过对单元全息图合成拍摄中图像重叠投影的分析,基于非成像光学理论设计制作了能实现这一功能的透镜,并借助光学软件对其进行了仿真。最后利用所设计的透镜进行了合成全息实验,结果表明,利用所设计的重叠投影透镜和适当的图像处理方法,能合成出轮廓清晰、立体感强的全息立体图。  相似文献   

7.
为了提高数字全息再现图像的分辨率,分析了增强图像分辨率的典型方法,提出了同时采用图像内插与外推的数字全息分辨率改进方法。对采集的全息图运用图像算法进行向内插值与向外填充,在全息面和物面之间采用角谱方法进行双向衍射迭代。通过该方法可以实现全息图的内插与外推,内插过程可以增加全息图空间采样频率而外推过程扩大了全息图数值孔径。同时,讨论了内插与外推的限制因素,并将新的改进方法与单独采用外推或内插进行了比较,模拟和实验结果证明,运用该方法可以明显改善再现图像分辨质量。  相似文献   

8.
张庆生 《激光技术》2009,33(3):276-276
为了研究数字全息中孔径合成问题,采用理论分析与实验验证的方法,通过介绍合成孔径数字全息记录和再现的基本原理,指出在合成孔径数字全息系统中,准确拼接合成子全息图是系统获得高分辨率的重要因素。提出了一种基于图像灰度分布相关的算法用以解决子全息图的准确拼接以实现孔径合成,介绍了该算法的原理,分析了该算法精度并进行了相应的实验验证,得到了预期成果。结果表明,该算法能较好地解决子全息图的拼接合成问题,在合成孔径数字全息系统中具有较好的适用性。  相似文献   

9.
基于灰度相关的数字全息孔径合成方法   总被引:1,自引:1,他引:0  
为了研究数字全息中孔径合成问题,采用理论分析与实验验证的方法,通过介绍合成孔径数字全息记录和再现的基本原理,指出在合成孔径数字全息系统中,准确拼接合成子全息图是系统获得高分辨率的重要因素.提出了一种基于图像灰度分布相关的算法用以解决子全息图的准确拼接以实现孔径合成,介绍了该算法的原理,分析了该算法精度并进行了相应的实验验证,得到了预期成果.结果表明,该算法能较好地解决子全息图的拼接合成问题,在合成孔径数字全息系统中具有较好的适用性.  相似文献   

10.
薛凯  李琦  王骐 《中国激光》2012,39(s1):111005
自动聚焦技术是实现数字全息成像快速、准确再现的关键技术之一。在分析聚焦和离焦过程中小波变换高频和低频系数变化特点的基础上,提出了一种基于小波变换的聚焦判据函数。采用无噪声和被噪声污染的模拟太赫兹(THz)数字全息图,比较分析了这种聚焦判据函数和五种经典的数字全息聚焦判据函数的性能,给出了综合评价。仿真结果表明:同五种经典聚焦判据函数相比,基于小波变换的聚焦评价函数具有更好的单峰性、更高的主峰锐度和极佳的抗噪性,是一种性能优越的THz数字全息成像自动聚焦判据函数。  相似文献   

11.
This paper studies the invariance of a given punctured convolutional code to an affine class of symbol transformations known to commonly occur in digital transceiver systems. A set of conditions to test the invariance of a code to these transformations has been derived, followed by two proposed methods to compensate for an invariant transformation. The viability of these methods has been examined by doing an invariant factor decomposition on the equivalent code generator matrix (obtained from the original code generator matrix and the given transform). The knowledge of the transformation and the nature of its occurrence greatly determines which method of compensation could be used. This study has much use in not only enabling a code designer to evaluate the invariance of an affine transformation to a given code, but also on the other hand to make the appropriate choice of code generators, puncturing schemes, and bit-to-constellation symbol mapping; so as to allow a channel coding scheme to be either sensitive or invariant to a given transformation, depending upon design objectives  相似文献   

12.
Robust template matching for affine resistant image watermarks   总被引:40,自引:0,他引:40  
Digital watermarks have been proposed as a method for discouraging illicit copying and distribution of copyrighted material. This paper describes a method for the secure and robust copyright protection of digital images. We present an approach for embedding a digital watermark into an image using the Fourier transform. To this watermark is added a template in the Fourier transform domain to render the method robust against general linear transformations. We detail a new algorithm based on polar maps for the accurate and efficient recovery of the template in an image which has undergone a general affine transformation. We also present results which demonstrate the robustness of the method against some common image processing operations such as compression, rotation, scaling, and aspect ratio changes.  相似文献   

13.
This paper presents a new and effective method for estimating two-dimensional affine transformations and its application to image registration. The method is based on matching polar curves obtained from the radial projections of the image energies, defined as the squared magnitudes of their Fourier transforms. Such matching is formulated as a simple minimization problem whose optimal solution is found with the Levenberg-Marquardt algorithm. The analysis of affine transformations in the frequency domain exploits the well-known property whereby the translational displacement in this domain can be factored out and separately estimated through phase correlation after the four remaining degrees of freedom of the affine warping have been determined. Another important contribution of this paper, emphasized through one example of image mosaicking and one example of remote sensing image registration, consists in showing that affine motion can be accurately estimated by applying our algorithm to the shapes of macrofeatures extracted from the images to register. The excellent performance of the algorithm is also shown through a synthetic example of motion estimation and its comparison with another standard registration technique.  相似文献   

14.
基于时间轴上模板的动态图像数字水印处理技术   总被引:1,自引:0,他引:1       下载免费PDF全文
本文提出了一种具有几何变换撸棒性的动态图像水印技术.一个沿时间轴上的模板嵌入到动态图像序列中的每个水印最小段(Watermark Minimum Segment)内.利用预先嵌入的时间轴上模板,可以恢复受几何仿射(affine)变换攻击后的含水印动态图像帧,仿真试验结果表明本文提出的动态图像水印技术,经仿射变换攻击后仍是鲁棒的.  相似文献   

15.
Image registration (IR) aims to map one image to another of a same scene. With rapid progress in image acquisition technologies, 3D IR becomes an important problem in magnetic resonance imaging (MRI) and other applications. In the literature, however, most IR methods are for 2D images and there are only a limited number of 3D methods available. Because 3D images have much complicated structure than their 2D counterparts, 3D IR is not just a simple generalization of the 2D IR problem. In this paper, we develop a 3D IR method that can handle cases with affine geometric transformations well. By its definition, an affine transformation maps a line to a line, and it includes rotation, translation, and scaling as special cases. In practice, most geometric transformations involved in IR problems are affine transformations. Therefore, our proposed method can find many IR applications. It is shown that this method works well in various cases, including cases when the data size of a 3D image is reduced for different reasons. This latter property makes it attractive for many 3D IR applications, since 3D images are often big in data size and it is natural to reduce their size for fast computation.  相似文献   

16.
This paper is concerned with the problem of feature point registration and scene recognition from images under weak perspective transformations which are well approximated by affine transformations and under possible occlusion and/or appearance of new objects. It presents a set of local absolute affine invariants derived from the convex hull of scattered feature points (e.g., fiducial or marking points, corner points, inflection points, etc.) extracted from the image. The affine invariants are constructed from the areas of the triangles formed by connecting three vertices among a set of four consecutive vertices (quadruplets) of the convex hull, and hence do make direct use of the area invariance property associated with the affine transformation. Because they are locally constructed, they are very well suited to handle the occlusion and/or appearance of new objects. These invariants are used to establish the correspondences between the convex hull vertices of a test image with a reference image in order to undo the affine transformation between them. A point matching approach for recognition follows this. The time complexity for registering L feature points on the test image with N feature points of the reference image is of order O(NxL). The method has been tested on real indoor and outdoor images and performs well.  相似文献   

17.
抵抗仿射变换攻击的多比特图像水印   总被引:6,自引:0,他引:6  
杨文学  赵耀 《信号处理》2004,20(3):245-250
目前,大多数鲁棒图像水印所面临的最大问题就是几何攻击,而几何攻击又以仿射变换为主,攻击者只需对目标图像做轻微的几何形变就可以使嵌入其中的水印信息失效。本文在Ping Dong等人提出的基于图像归一化方法的抵抗任意仿射交换攻击的鲁棒数字水印的基础上,改进了原有的归一化方法,去掉了归一化过程中的约束条件,简化了归一化的过程。并且在此基础上提出一种新的水印嵌入方案,克服了文献[1]中水印方案水印不可见性较差的问题。实验证明,本文提出的方案对仿射变换攻击具有很好的鲁棒性,嵌入的水印容量较大且水印图像的质量较高。  相似文献   

18.
刘禹  肖世德  张睿  张若凌  张磊 《激光技术》2020,44(1):130-135
为了克服传统的基于牛顿-拉夫森迭代的数字图像相关法受迭代初值影响较大等问题, 提出了一种结合遗传算法的数字图像相关法。以待测数据点为中心, 选取邻域内的若干估值点, 通过基于遗传算法的数字图像相关法匹配出变形前后估值点对坐标; 随机选取不共线的3组或以上估值点对代入仿射变换模型, 依据仿射变换结果估计变形初值, 并作为牛顿-拉夫森迭代初值; 最后结合牛顿-拉夫森迭代法计算亚像素位移值。结果表明, 该方法的匹配时间相对传统方法平均降低37.54%, 相较于传统的数字图像相关法在搜索性能、匹配精度等方面更加可靠。该研究为数字图像相关法中迭代初值优化效果对匹配速度和精度的影响提供了参考。  相似文献   

19.
This paper describes new extensions to the previously published multivariate alteration detection (MAD) method for change detection in bi-temporal, multi- and hypervariate data such as remote sensing imagery. Much like boosting methods often applied in data mining work, the iteratively reweighted (IR) MAD method in a series of iterations places increasing focus on "difficult" observations, here observations whose change status over time is uncertain. The MAD method is based on the established technique of canonical correlation analysis: for the multivariate data acquired at two points in time and covering the same geographical region, we calculate the canonical variates and subtract them from each other. These orthogonal differences contain maximum information on joint change in all variables (spectral bands). The change detected in this fashion is invariant to separate linear (affine) transformations in the originally measured variables at the two points in time, such as 1) changes in gain and offset in the measuring device used to acquire the data, 2) data normalization or calibration schemes that are linear (affine) in the gray values of the original variables, or 3) orthogonal or other affine transformations, such as principal component (PC) or maximum autocorrelation factor (MAF) transformations. The IR-MAD method first calculates ordinary canonical and original MAD variates. In the following iterations we apply different weights to the observations, large weights being assigned to observations that show little change, i.e., for which the sum of squared, standardized MAD variates is small, and small weights being assigned to observations for which the sum is large. Like the original MAD method, the iterative extension is invariant to linear (affine) transformations of the original variables. To stabilize solutions to the (IR-)MAD problem, some form of regularization may be needed. This is especially useful for work on hyperspectral data. This paper describes ordinary two-set canonical correlation analysis, the MAD transformation, the iterative extension, and three regularization schemes. A simple case with real Landsat Thematic Mapper (TM) data at one point in time and (partly) constructed data at the other point in time that demonstrates the superiority of the iterative scheme over the original MAD method is shown. Also, examples with SPOT High Resolution Visible data from an agricultural region in Kenya, and hyperspectral airborne HyMap data from a small rural area in southeastern Germany are given. The latter case demonstrates the need for regularization.  相似文献   

20.
This paper considers the problem of registering two observations of the same object, where the observations differ due to a combined effect of an affine geometric transformation and nonuniform illumination changes. The problem of deriving new representations of the observations that are both invariant to geometric transformations and linear in the illumination model is analyzed. In this framework, we present a novel method for linear estimation of illumination changes in an affine invariant manner, thus, decoupling the original problem into two simpler ones. The computational complexity of the method is low as it requires no more than solving a linear set of equations. The prior step of illumination estimation is shown to improve the accuracy of state-of-the-art registration techniques by a factor of two.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号