从单张图片中去除相机抖动造成的模糊的matlab程序，算法见Removing Camera Shake from a Single Image...

图像格式转换的C源码，将rgb格式转变成yuv格式-Image of the C source code format conversion to rgb format into yuv format

图像频率域滤波程序，课程设计作业，获优秀，完全自主开发，包含搞通滤波、低通滤波、带通滤波以及方向滤波。含ＧＵＩ-image frequency domain filtering procedures, curriculum design work, outstanding, fully self-development, including engaging pass filtering, low-pass filtering, band-pass filtering and filtering direction.- GUI

摄像机图像序列的全景图拼接，希望能有些用处-Camera panorama image stitching sequence, hoping to be useful

图像处理源代码， 一个比较全面的图像处理与分析软件源程序，包括通用图像处理算法 -Image processing source code, a more comprehensive image processing and analysis of software source code, including the generic image processing algorithm

在计算机视觉中首先一步是计算每个摄像机的参数(外参和内参)，这是重建物体所必须的，这一个过程称为摄像机定标(camera calibration)。这是我自己写的一个简单的采用3维模板(模板是由黑白相间的格子组成，格子大小30cm×30cm，模板必须是三维，否则矩阵奇异)定标的程序，交互性比较好，每个角点通过鼠标点击自动获取。-Computer Vision in the first step is to calculate the parameters of each camera (outside the Senate and internal), which is necessary for the reconstruction of objects, which a process known as camera calibration (camera calibration). This is what I wrote it myself using a simple 3-dimensional template (template is composed of black-and-white lattice, lattice size of 30cm ?30cm, the template must be three-dimensional, or matrix singular) calibration procedures, better interactivity, each Corner automatic access through mouse clicks.

采用Visual c++ 进行图像处理，已经经过检测，非常实用，本源码主要是高斯平滑-for image processing, have been tested, the very practical, The main source of Gaussian smoothing

判断点是否在多边形中，输入要求有组成多边形的点和要判断是否在多边形中的点，速度快！-To determine whether the polygon points, enter the required polygon composed of points and to determine whether the points in the polygon, fast!

used to rearrange the code of point from 1 D to 2Dimension

一款非常全面的图象处理软件，包含颜色处理，图象处理以及算法！程序已经调试过，可以用。-A very comprehensive image processing software, including color processing, image processing and algorithm! Procedures have been debug, and can be used.

霍夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成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