-
miyao
本文提出了基于二维混沌映射的数字图像水印算法,混沌具有随机性、似噪声及对初始条件的极端敏感性等特点。将经过二维混沌映射置乱后的数字水印信号嵌入图像小波域的低频系数,实现了数字水印的隐蔽性、保密性和稳固性;利用二维混沌映射Arnold变换对水印信号进行置乱,不仅增强了水印信号保密性,同时有效提高了视觉上抵抗图像剪切攻击的能力。(In this paper, two-dimensional chaotic map based on digital image watermarking algorithm, Chaos with random noise and the likelihood of extreme sensitivity to initial conditions and so on. Two-dimensional chaotic map will be scrambling after the digital watermark embedded image signal of the low-frequency coefficients in wavelet domain, the realization of a digital watermark hidden, security and stability the use of two-dimensional chaotic map on Arnold transform scrambling watermark signal, not only enhances the confidentiality of the watermark signal at the same time improve the visual image shear resistance attacks.)
- 2009-06-28 10:11:45下载
- 积分:1
-
tuxiangzengqiang
六种图像增强的方法,线形反锐化掩膜方法,直方图均衡等。(6 kinds of image enhancement methods, linear unsharp mask method, such as histogram equalization.)
- 2008-05-18 18:26:13下载
- 积分:1
-
CVA
主要是多光谱多波段两幅图像的变化检测求得差异影像 大家可以参考参考 运行主程序(mian is used to difference of two images)
- 2015-01-14 17:35:10下载
- 积分:1
-
GRAPPA
说明: 快速磁共振成像领域的GRAPPA(generalized auto-calibrating partially parallel acquisitions)算法实现(GRAPPA realization in fast MRI)
- 2020-05-11 10:09:07下载
- 积分:1
-
SIF
说明: GOME-2数据反演叶绿素荧光算法代码,添加文件为GOME-2 level 1b级数据时,得到的Fs数组即为反演结果(Code of chlorophyll fluorescence algorithm retrieved from GOME-2 data)
- 2021-01-16 13:28:45下载
- 积分:1
-
图像分割
实现了遥感图像可以进行阈值分割和分水岭分割(Threshold segmentation, watershed segmentation)
- 2017-08-14 10:54:46下载
- 积分:1
-
recognize
路标识别的应用实例,可以快捷的检测并识别路标的种类!(Road sign recognition application example, you can quickly test and identify the types of signs!)
- 2010-09-18 15:34:56下载
- 积分:1
-
gridsegmentation
基于边缘检测的迭代分水岭分割算法源码(内附图片等)(Image Segmentation Using Iterative Watersheding
Plus Ridge Detection)
- 2009-05-25 17:36:11下载
- 积分:1
-
smooth
图像的平滑函数,对指定区域的图像,并有门限值和魔板大小限制。(the smooth of a bmp image)
- 2013-09-19 21:16:46下载
- 积分:1
-
minimum-spanning-tree
在一个具有几个顶点的连通图G中,如果存在子图G 包含G中所有顶点和一部分边,且不形成回路,则称G 为图G的生成树,代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)
- 2013-08-23 23:06:57下载
- 积分:1