对于学习的Adaboost算法的初学者

一书的第三章示例1灰度线性变换、阈值变换、灰度窗口变换、拉伸、均衡,很好的一本书和算法- the third chapter of a book on linear transformation Example 1 gray, threshold transform, gray level window transform, stretch, balance and a good book and algorithms

一种使用mqtlab编写的图像滤波器程序！可以有效去除高斯噪声，欢迎交流！-Written in a kind of image filter to use mqtlab program! Can effectively remove Gaussian noise, please share!

收集的一些有关色彩图像中值滤波的文章 希望对大家有帮助-Collected some of the color filter image of the article would like to have everyone help

用VB做的一个小程序，可以抓取当前屏幕。-VB do a small program will be able to capture the current screen.

delphi图像处理 It was developed using Delphi 5 Pro, but it should work OK with D4 or even D3. It uses 24-bit bitmaps and scanline for speed. I have included the text version of the two forms, hopefully it will enable people with D3 or D4 to use this example.-delphi image processing It was developed using Delphi 5 Pro, but it should work OK with D4 or even D3. It uses 24-bit bitmaps and scanline for speed. I have included the text version of the two forms, hopefully it will enable people with D3 or D4 to use this example.

计算机图形学，翻译国外的经典教程，PDF格式-Computer graphics, translation of foreign classics tutorial, PDF format

基于环形颜色直方图的图像检索算发，比传统方法好用的多-Annular color histogram-based image retrieval count hair, easy to use than the more traditional methods

纹理及纹理映射ppt，包括二维纹理，三维纹理，几何纹理相关知识。-Texture and texture mapping ppt, including the two-dimensional texture, three-dimensional texture, geometric texture relevant knowledge.

该程序可实现图像的基本运算，比如图像的放大、缩小、旋转、图像增强、图像的特效显示等。-The program can realize the image of the basic computing, such as the image to enlarge, narrow, rotating, image enhancement, image display, such as special effects.

摘要：拐点是数字图像中的一个重要信息载体 提出一种新的拐点检测算法 该算法并非寻找连续空间中曲率的离散近似计算方法，而是源于离散曲线的外观特征，推导出离散曲线上拐点处k个点对间欧氏距离平方和局部最小这一重要性质。基于该性质，本算法首先利用Freeman链码的性质.过滤掉物体边界上明显不可能成为拐点的象素，然后在剩余的边界点中通过寻找该局部最小值定位出拐点。给出了本算法与四种著名拐点检测算法的对比实验。 -Abstract: The inflection point is a digital image of an important information carrier put forward a new turning point detection algorithm the algorithm does not look for continuous space discrete approximation of the curvature calculation method, but from the appearance of characteristics of discrete curve derived discrete curve the inflection point at k-points between the squared Euclidean distance and the local minimum of this important property. Based on the nature of the algorithm is the first to use Freeman chain code in nature. Filter out objects clearly can not become a turning point on the border pixel, and then in the remaining boundary points by finding out the turning point of the local minimum position. The algorithm is given inflection point detection algorithm with th