登录
首页 » matlab » watermarking

watermarking

于 2014-10-08 发布 文件大小:10KB
0 182
下载积分: 1 下载次数: 3

代码说明:

  本代码主要用于数字水印技术中的空间域中的最低有效位算法,用于数字产品中的版权保护问题。(This code is mainly used for the least significant bit algorithm for digital watermarking technology in the spatial domain for digital products copyright protection issues.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • waveridge_search
    用模最大值法提取小波脊,该例中又两条小波脊,所以是多脊提取。同时又施加惩罚函数,控制lamda的值,可以得到较为平滑的小波脊。( using maximum modulus extract wavelet ridge, the case has two wavelet ridge, it is a multi-ridge extraction. At the same time to impose the penalty function to control the value of lamda,the extracted ridge can be relatively smooth .)
    2020-11-15 20:59:42下载
    积分:1
  • CANNY
    CANNY EDGE DETECT SOURSE CODE
    2010-11-29 22:29:07下载
    积分:1
  • genzong
    目标跟踪 只要讲得是目标跟踪算法,没什么了(trace taget)
    2011-05-26 15:38:13下载
    积分:1
  • rader_homework
    雷达线性调频信号的产生,及其通过滤波器加窗后的一些变换(Radar chirp signal generation and its windowing through the filter after transformation)
    2013-01-21 21:13:09下载
    积分:1
  • Adaptive-Filtering-Primer-with-MATLAB---Poularika
    This is a very good book on Matlab for Adaptive Filtering.
    2012-11-16 13:31:10下载
    积分:1
  • code-all
    Computer Systems: A Programmer s Perspective Randal E. Bryant and David R. O Hallaron This directory contains the code examples in the CS:APP text. The code shown in the text is included automatically from the files in this directory, without any hand intervention.
    2010-08-13 17:34:50下载
    积分:1
  • LMS
    MATLAB的LMS算法仿真程序,包括主程序和LMS功能函数实现以及仿真结果图(LMS algorithm simulation program of MATLA)
    2020-06-19 12:40:01下载
    积分:1
  • MIMOjishuxiangjie
    MIMO技术详细技术 比较经典的讲解,比较经典(MIMO technology to explain detailed technical more classic)
    2010-12-10 21:31:24下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • NI-DAQ-CARD
    Maltlab DAQ example code
    2013-04-18 15:04:45下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载