duibiduzengq

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.)

PMF FFT捕获技术性能仿真，分段匹配滤波法和改进算法相比较(FFT PMF capture technology performance simulation, segmented matching filter and improved algorithm comparison)

本算法在Matlab2008b 环境下实现。包括main,san 和ssd 三个函数。 这次实现的算法并不是比较两个已经知道的点是否匹配，而是已知一个图形中的特征点，在另外一个图像中找到与其最匹配的点，匹配度用SAD 或者SSD 来度量。 main.m 是程序的入口，包括生成和读入实验数据，调用sad 函数和ssd 函数求匹配点，最后绘 制出最后的结果。sad.m 是用sad 度量方法在另一图中求解匹配点的函数实现，有3 个参数 y=sad(x,image1,image2)。其中x 是代匹配的数据，image1 是图像1 数据，image2 是图像2 数据。 从理论上分析，ssd 比sad 算法要复杂一点，经过测试，在一幅640*480 的图像中寻找10 个匹配点数据SAD 用时25.062519 秒，SSD 用时25.291432 秒。(The algorithm Matlab2008b environment to achieve. Including the main, san, and ssd three functions. The implementation of the algorithm is not the point of comparing two matches already know, but the known feature points in a graphic, an image found in the other match with the most points, matching measured with the SAD or SSD. main.m is the entry, including the generation and reading test data, call the sad ssd function evaluation functions and matching points, and finally draw the final result. sad.m measure is sad figure in another match point in the function implementation to solve, there are three parameters y = sad (x, image1, image2). Where x is the generation of matching data, image1 is the data image 1, image2 is the image 2 data. From the theoretical analysis, ssd little more complicated than the sad algorithm, tested in a 640* 480 images of 10 match points in the search for data using time 25.062519 seconds SAD, SSD with time 25.291432 seconds. )

matlab编写的图像处理正则化软件包。包含了基本的数字图像处理正则化(Matlab prepared by the image processing Regularization package. Contains a basic digital image processing Regularization)

说明：  <基于Matlab的数字图像相关法的程序实现> 数字图像相关法是对全场位移和应变进行分析的一种新的实验力学方法。图像处理是其核心之一。本文探讨了根据相关技术寻 求位移场的基本原理,并编制了基于Matlab的数字图像相关法程序。程序验证结果表明本程序处理速度快,精度高,可以满足基于相关技 术的图像处理的要求。(err)

数字图像处理有关的论文，很优秀，很有指导意义的一篇论文。(Digital image processing the papers, very good, very instructive paper.)

说明：  相当的经典啊 是基于matlab的 大家做图像匹配的都可以用的到,做三维重建方面的。(Rather is based on the classic ah matlab we do the image matching can be used for that, so three-dimensional reconstruction.)

光流法，经典的LKPR-marzat算法，适合研究光流法的学者使用，可执行，无错误 (Optical flow method, the classic LKPR-marzat algorithm, for research scholars to use optical flow method, executable, error-free)

说明：  对不同噪声强度的加噪图像，用粒子群优化算法优化结构元素，找到最优结构元素，对图像进行去噪操作，使恢复的图像达到最大峰值信噪比(Noise intensity for different images with noise, using particle swarm optimization algorithm to optimize the structure elements, find the optimal structure element, the image de-noising operation to restore the image to a peak signal to noise ratio)

本文针对目前图像特效处理的需求，主要研究几种基本的数字图像处理算法，以达到人们所期待得到的各种不同的效果。并在基于Windows系统的Visual C++6.0集成开发环境下，生成BMP位图文件并对其进行读取，使用VC编码实现这些算法。编写程序在BMP位图文件中画出各种图像，例如：三角型，圆，正弦函数图。在点运算处理中介绍了灰度化处理，算法设计原理是将输入像素点的灰度值通过算法实现改变其相应输出点的灰度值。在图像增强中，介绍了图形的平滑和图像的锐化算法，其算法的设计原理是根据一个固定小区域的几个像素灰度值设置某个像素的灰度值，通常有其固定模板。 本文具体给出了这些算法的设计思想及算法描述，并通过程序实现。最后将其效果图与原始图像进行了比较。 (In this paper, the image effects to deal with the current demand for basic research in several digital image processing algorithms in order to achieve what people expect different result. And Windows-based system, Visual C++6.0 integrated development environment to generate BMP bitmap file and read them using VC coding to implement these algorithms. Write a program to draw a variety of graphics in BMP bitmap file, example: triangle, circle, sine function diagram. Point arithmetic processing grayscale processing, algorithm design principle is the value of the input pixel gray value of the corresponding output point algorithm change. Enhancement of the image on the smooth graphics and image sharpening algorithm. The design principle of the algorithm is based on a fixed number of small regions of a pixel value of gray-scale pixel value, usually a fixed template. In this paper, given the specific design of these algorithms and the algorithm description, and program . Finally, the effect o)