1

说明：  直方图调整并显示对比，直方图调整后都需要对比一下调整前与调整后的区别，并显示。此程序适合初学者学习。(Histogram and adjust the display contrast)

说明：  用matlab编写界面，实现直方图均衡化、平均滤波、梯度滤波、Laplacian滤波、Kirsch滤波、Sobel滤波、Prewitt滤波、高频提升等多种功能(Matlab prepared to use interface, the realization of histogram equalization, the average filter, Gradient filter, Laplacian filter, Kirsch filter, Sobel filter, Prewitt filter, multiple functions, such as high-frequency upgrade)

一个简单的图像处理中粗糙度和方向度的MATLAB编程实现，已经通过调试，无误可用(A simple image processing in the direction of roughness and degree of MATLAB programming, has been through debugging, accurate available)

maximally stable extremal regions matlab codes use to detect maximally stable extremal regions.

基于整数小波变换的图像可逆水印，很好用，可逆性很强，自己查找的资料(Image reversible watermarking based on integer wavelet transform is very useful. It has strong reversibility and finds information by itself.)

用六种算子(分别是gabor、拉普拉斯、priwitt、robert、sobel、wallis),对三种图象进行边缘检测比较，强烈推荐哦，是本人的毕业设计中的关键程序(The six operators (respectively gabor, Laplace, priwitt, robert, sobel, wallis), images of three edge detection comparison, strongly recommend Oh, my graduation project is a key process)

积木效果显示图像

这是一篇讲述最新的干涉图处理的关键技术的文章，非常实用！(This is an article about the latest key interferogram processing technology is very useful!)

1.DCT变换，对整个图像的直接DCT变换和分块为8*8做DCT变换，并设定阈值。 2.汉明编码（7，4），译码以及找出错误图样和纠错。并在不同的转移概率的BSC道下进行传输。(DCT:Direct DCT and IDCT,blocking. hamming coding:decoding and picking up errors.)

广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 (Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)