数字图像处理的开发环境下的应用…

高级图象处理软件，实现功能包括对DIB图像进行维纳滤波复原操作、模糊操作、随机噪声、高通滤波、低通滤波等-Advanced image processing software, the realization of the DIB features include image restoration Wiener filtering operation, fuzzy operations, random noise, high-pass filter, low-pass filtering

实现了对usb摄像头进行图像采集的功能，-achieve the right usb cameras for image acquisition function,

openCV在visual studio2005下的canny检测-openCV in visual studio2005 under the canny detection

使用vc编写的一个光流原程序 使用了hs算法 没有解压密码-vc prepared by the use of an optical flow original procedures used hs not extract password algorithm

该程序可实现图像的基本运算，比如图像的放大、缩小、旋转、图像增强、图像的特效显示等。-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.

改进的水平集方法，采用C_V模型进化。为多相位-improve the level set method, C_V evolutionary model. For the multi-phase

mia-2.0.0-beta1a-guid 好像是医学图像的 有pdf-mia-2.0.0-beta1a-guid seems to be of medical images pdf

ncut分割算法matlab代码,实现图像分割较好的方法-matlab code ncut segmentation algorithm to achieve better image segmentation methods

The approximate nearest neighbor search code is contained in this zip file. You can use the data contained in to see how the program works.

摘要：拐点是数字图像中的一个重要信息载体 提出一种新的拐点检测算法 该算法并非寻找连续空间中曲率的离散近似计算方法，而是源于离散曲线的外观特征，推导出离散曲线上拐点处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