斯科特

region growing for image segmentation, code by Dkroon

SIFT特征点检测算法是一种有效的图像特征检测法，对旋转、尺度，光照变化都具有一定的鲁棒性。-SIFT feature detection algorithm is an effective method of image features, rotate, scale, the light changes robustness。

目前所能找到的速度最快的Jpeg2000压缩和解压缩软件原码，解压缩速度是著名的jasper的58倍-can now find the fastest Jpeg2000 compression software source, extract the speed of the famous 58 times jasper

视频反交错方面的最经典代码，是目前处理后图象质量最高的一种算法。 the classic code for video deinterlace -Video de-interlacing the most classical codes, is the highest image quality after the treatment of an algorithm. the classic code for video deinterlace

各种图像格式转换

人的脸部跟踪，自动分析锁定人的脸部区域，VC++ 实现。-Face Detecting

When x is a matrix, a wavelet transform is performed on all rows of x. ％ - To create filters + shifts: see makeWTfilter.m and mirrorshifts.m ％ - The forward transform is in FWT_BIO.m-When x is a matrix, a wavelet transform is performed on all rows of x.- To create filters+ Shifts: see makeWTfilter.m and mirrorshifts.m- The forward transform is in FWT_BIO.m

基于图像直方图均衡化的公式来编程。像素一共分为256个灰度阶，每个灰度阶用数组的一个相应nk[？]来储存它的个数，然后计算tk[？]。-Based on image histogram equalization formula programming. Pixel is divided into a total of 256 gray-scale bands, each of the gray band with a corresponding array nk [? ] To store the number of it, and then calculating tk [? ].

source code of Harris corner detection -source code of Harris corner detection

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