ppm格式的图片转换成为bmp格式图片的转换工具。

粒子滤波 该程序适合初学粒子滤波的人看 用粒子滤波跟踪了一个状态变量-Particle filter for the process of learning people will look at particle filter with a particle filter to track the state variables

BMP转JPEG程序，VB代码-BMP to JPEG procedures, VB code

ITK 是美国国家卫生院下属的国立医学图书馆投入巨资支持三家科研机构开发 医学影像分割与配准算法的研发平台，现已开发了初步版本。是医学影像算法平台的 重要组成部分。 -Itk are affiliated with the United States National Institutes of Health National Library of Medicine invest huge sums of money to support the three research institutions to develop medical image segmentation and registration algorithm R

用水平集和形态学结合的方法分割图像，主要用于对比度低的医学图像，效果较好-Using level set and morphological segmentation with the method of combining images, mainly for low-contrast medical images, better

一个基于TMS320DM642的完整工程，采集YUV的视频数据，转换成RGB信号，从VGA monitor输出，非常有借鉴意义-based TMS320DM642 a complete engineering, acquisition YUV video data, converted into RGB signal from the VGA monitor output, very Significance

此文件为关于多边形重心算法的实现 希望对大家有所帮助-this document to focus on the polygon algorithms we hope to achieve some help

利用快速傅立叶变换实现了人脸表情图像的Gabor变换的快速算法 针对不同尺度的Gabor小波特征采用不同的下采样因子来对Gabor变换特征进行第一次降维 利用一种改进的核鉴别分析方法对Gabor特征进行二次特征提取-using fast Fourier transform of Facial Expression Gabor transform the image of the fast algorithm for different foot the Gabor wavelet characteristics under different sampling factor to the Gabor transform features the first drop Shalikashvili Improved use of nuclear discriminant analysis method Gabor features second feature extraction

这是用VC便携的DCT变换，很好很实用，希望可以为你带来帮助。-This is the DCT-portable with VC, very good very practical, hoping to bring you help.

读取YUV视频图像的源程序，可以播放YUV视频。-YUV video images to read the source code, you can YUV video playback.

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