运动目标跟踪的源程序，用C++实现，包含运行所需的图像序列。...

Description: A faster implementation of binary dilation and erosion. Our functions take advantage of MATLAB s decomposition of the structuring element but they may result much faster. Try to run example.m to see the speed improvement factor, changing the parameters.

对比度拉伸，对原始图像进行对比度拉伸，从而得到拉伸后的图像-tensile contrast, the original image contrast stretching, and thus drawing the images

一个简单的把bmp 文件格式转为seg和yuv的程序-put a simple bmp file format to seg and the procedures yuv

这个是应用与摄像机标定的程序的模拟仿真。对场景中N条相等的平行线进行摄像机内参标定，看提供的约束有几个。其中涉及到数据的归一化处理以及L－M最优化。-This is the application of camera calibration and simulation procedures. Article N of the scene the same parallel line camera calibration reference, see Constraint provided there are several. Which relates to data processing as well as the normalized L-M optimized.

本程序是安全C程序首先对图像进行形态学的处理然后再提边缘二值化最后可以取出细胞的轮廓。 用程序时必须在E盘下建立此文件。 e:PICUTRETEMP2.BMP -this procedure is a safe procedure C First, the image morphology processing before being marginal value of the last two admit Cell out of the contours. Procedures to be used in the E site established under this document. E : PICUTRE TEMP2.BMP

susan角点检测算法的MATLAB程序实现-susan corner detection algorithm for implementation of the MATLAB program

显示一幅图的灰度直方图的程序zhifangtu-Figure 1 shows the histogram procedure zhifangtu

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

很实用的C#图像处理边缘检测代码，包括使用sobel/priwit等算子-Very practical C# Image processing edge detection code, including the use sobel/priwit operator, etc.

霍夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率，读出时由该符号开始一直走到最后的“1”， 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好，就是该符号的霍夫曼编码。-Huffman code specific Methods: according to their probability of emergence of the size of the queues, the two smallest sum probability, as a new probability and the probability of the remaining re-queue, and then the smallest sum of two probabilities, and then re-queue until the last turn into one. Every time when the sum will be