这是一个C语言的程序，是用来计算图像的直方图信息的，程序中用到了OpenCV编程。希望能给你们带来好处...

包括Canny边缘检测算子、罗伯特(Roberts)边缘检测算子、索伯尔(Sobel)边缘检测算子、普瑞维特(Prewitt)边缘检测算子、克瑞斯(Krisch)边缘检测算子和高斯－拉普拉斯(LoG-Laplacian)算子等。-Includes Canny edge detection operator, Robert (Roberts) edge detection operator,索伯尔(Sobel) edge detection operator,普瑞维特(Prewitt) edge detection operator, Chris (Krisch) edge detection operator and Gauss- Laplace (LoG-Laplacian) operator and so on.

实现简单的图像处理算法-simple image processing algorithm

主要是介绍opencv的参考手册及其包括的一些其他的相关的参考手册函数，另外还有些相关典型的程序-Opencv introduction is mainly a reference manual and included a number of other related reference manual function, in addition to some procedures related to the typical

计算多边形面积的算法-polygon area calculation algorithm

object_tracking-a_survey object_tracking-a_survey object_tracking-a_survey object_tracking-a_survey-object_tracking-a_survey object_tracking-a_survey object_tracking-a_survey object_tracking-a_survey object_tracking-a_survey object_tracking-a_survey

介绍车辆运动模糊图像恢复处理的一种新方法 是一篇学术论文-Introduction vehicle motion-blurred image restoration of a new method of treatment is an academic

飞火纹理图像纹理分析合成软件，效果很好，飞火纹理图像纹理分析合成软件，效果很好-Fire fly texture synthesis image texture analysis software, well, flying fire texture synthesis image texture analysis software, the effect of good

一个不错的图像缩放程序，可以对位图实现1：2的缩放。-a good image scaling procedures, the bitmap can achieve 1:2 zoom.

aniso - Anisotropic diffusion, following the robust statistics formulation. Examples of how to run this function are included at the end of aniso.m-aniso- Anisotropic diffusion, following the robust statistics formulation. Examples of how to run this function are included at the end of aniso.m

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