图像处理程序源代码，关于图像的沃尔斯变换处理。

HomoFilt.m 同态滤波器 ExGrey.m 灰度拉伸 Split.m 图象分割 ReadPic.m 读Pic图-HomoFilt.m homomorphic filter ExGrey.m tensile Split.m gray image segmentation ReadPic.m Fig Reading Pic

这个程序的功能实现了，将一幅彩色图像先变为灰度图像，然后在统计它的直方图，接着给变换后的图像输入目标，做剪影，最终把剪影后的结果输出-Function realization of this program, and will be a color image into a grayscale image first, and then its histogram statistics, and then after the image input to the transformation goals, to do silhouette, the final result after the output of the silhouette

分水岭算法代码，以及说明。用标记-分水岭算法对图像进行分割-Watershed segmentation algorithm

图像处理程序 离散余弦变换 处理256灰度级图像-ImageProcessing DCT

图像的二值化转变，将灰度图像转变成二值图像-Image binarization transformation, the gray-scale image into binary image

利用数字水印技术能够对数字作品实现有效的版权保护。目前的数字水印技术大多都是针对多媒体数据。但是在地理信怠系统中除了橱格数据外, 还存在大的矢童数据。目前的数字水印算法仅仅能满足橱格数据, 无法满足在矢童数据中嵌入水印的需求。本丈在分析数据特汽的基础上, 在矢童数据的频城提出了一套行之有效的数字水印算法。-The use of digital watermarking technology for digital works to achieve an effective copyright protection. At present, most of the digital watermarking technology are targeted at multimedia data. However, in the geographical letter except idle system cabinet grid data, there are still a big child vector data. At present, only the digital watermarking algorithm can satisfy the cupboard grid data, unable to meet the child in the vector data embedded watermark needs. Zhangting data in the analysis of this special steam on the basis of the data in the frequency of vector Tong City proposed a set of proven digital watermarking algorithm.

用它里面的类可以产生类似于JAVA应用中的水纹、火焰以及熔浆效果。-use it inside the class can produce Java applications similar to the watermarked, flame and melts effect.

计算几何c语言实现 第二版 的源代码。对于计算机图形学的学习有一定的益处。-computational geometry c language second edition of the source code. For the study computer graphics have certain benefits.

Image Watershed Segmentation图像边缘提取-Image Watershed Segmentation Image Edge Detection

几何变换的VC++程序源码，希望对大家有所帮助，也希望尽快成为会员，谢谢！-Geometric Transform VC++ Program source code, and they hope to be helpful to everyone, and hope to become a member as soon as possible, thank you!