使用log

计算机图形图像学基础算法实验软件包,包含大多数基本图象处理算法程序。-computer graphics and video algorithm based on experimental learning packages, including most of the basic image processing algorithm procedures.

编辑处理图片的delphi源码，含有典型的几种图片处理编辑代码-Editing pictures delphi source, containing several typical image processing editing code

关于国内最新的信息融合技术，用于图像的处理中-Domestic-to-date information on the integration of technology for image processing

flash导航条，大家在网站设计的时候经常会遇到如何设计自己导航条的问题，一些精美的导航条实例给大家-flash navigation bar, web design in the U.S. often encounter how to design their own navigation bar, some fine examples of the navigation bar to the U.S.

对脑部ct图像的头骨形状进行区域生长算法的运算-Ct images of the brain the skull shape of region growing algorithm for computing

经典书籍-数字图像处理-冈萨雷斯-4。解决各位敲代码的烦恼！These MATLAB functions were created for the book Digital Image Processing Using MATLAB (DIPUM), by R.C. Gonzalez, R.E. Woods, and S.L. Eddins, Prentice Ha-Classic books- digital image processing- Gonzalez-4. To resolve the trouble code you knock! These MATLAB functions were created for the book Digital ImageProcessing Using MATLAB (DIPUM), by RC Gonzalez, RE Woods, andS.L. Eddins, Prentice Ha

这个是彩色图像分割方法。与RegionExtract采用的方法不同。 首先rgb转换成hsv，对h分量进行直方图分割，得到直方图的峰值和峰谷。利用得到的峰值和峰谷进行区域分割，这样会得到很多的小区域，对这些小区域进行区域合并，区域合并的终止条件是：区域一致性距离在某个固定的阀值之间，比如20或者在某个自适应阀值（该阀值自动计算）。注意：区域合并在luv空间进行。-This is a method for color image segmentation. With the different methods used RegionExtract. First rgb convert hsv, components of the h histogram segmentation, the histogram peak and peak and valley. Utilization of the peak and peak-valley regional partition, it would receive many of the small area of these small regional regional merger, regional merger termination conditions are: the regional consistency of the distance between a fixed threshold, such as 20 or in a self-adaptive threshold (the threshold automatically calculated). Note: regional merger in luv space.

分析处理图像纹理信息，针对人脸检测出纹理特征-Analyzing and processing the image texture information, for texture features face detection

Effcient Graph-Based Image Segmentation算法的源码， 已通过测试， 可以使用-the source data of the algoritham Effcient Graph-Based Image Segmentation

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