去污

好东东哦，希望大家来下载，是 我们本科毕业设计论文成果，基于dct域的数字水印技术

首先生成如下形式的图片：图中的白条为7象素宽，210象素高，白条间的宽度为17象素。 应用多种滤波器进行处理：算术均值，几何均值，谐波均值，逆谐波均值，中值滤波，中点滤波，最大值、最小值滤波等。注意，需改变模板大小。详细比较上述的结果，并分析原因。 (First generation following form images: figure IOUs 7 pixels wide, 210 pixels high, the width is 17 pixels between IOUs. Using a variety of filters for processing: the arithmetic mean, geometric mean, harmonic mean, inverse harmonic mean, median filtering, filtering midpoint, maximum, minimum filtering. Note that the need to change the template size. A detailed comparison of these results and analyze the reasons.)

灰度或彩色多模态医学图像的融合，利用加权平均融合算法，程序具体很好的通用性，并且提供几种图像融合客观评价指标，还给出3组宝贵的已配准医学图像(Color gray or fusion multimodal medical images, using a weighted average fusion algorithm, program specific good versatility and provide an objective uation of several image fusion, the three groups are also given valuable medical image registration has been)

图像孔洞/裂缝的填充算法。根据图像的同态性，采用最邻近插值的思想。(Image holes/cracks in the fill algorithm. According to the image of the same state, using the nearest interpolation ideas.)

将原图与一幅模板图像进行计算相关 以图像显示相关函数(The original image and a template image to calculate correlation functions related to image display)

This code implements two variations of the paper "High accuracy optic flow using a theory for warping" presented at ECCV 2004 by Dr. Thomas Brox.

blur face in video ie hide face

说明：  Arnold 变换与 Gray 码变换相融合的双置乱算法程序，包括了加密和解密程序(The program of double scrambling algorithm combining Arnold transform and gray code transform, including encryption and decryption program)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)

marburg.c 用Burg算法求AR模型的参数。 mar1psd.c 由AR模型参数得到功率谱。 maryuwa.c 用Levinson算法求解Yule-Walker方程以得到 阶AR模型的参数 。 (marburg.c using Burg algorithm for AR model parameters. mar1psd.c by the AR model parameters obtained power spectrum. Levinson algorithm maryuwa.c with Yule-Walker equation in order to get rank AR model parameters.)