1-(5)

LSB替换隐写软件，该软件能把ASCII码嵌入到图像中，其载体图像是24位的BMP格式图像(LSB Steganography tool which provides hide ASCII infomation within 24-bit Bitmap images)

Unix系统下，小波包变换的实现源码实例，，当然，稍作改动也可用于windows系统下。 (Unix systems, the instance of the wavelet packet transform source, of course, some minor changes can also be used in the windows system.)

这是我做的一个二维傅里叶变换的程序，可以对图像进行2DFFT变换得到频谱图，并利用2DIFFT得到原图像(I do a two-dimensional Fourier transform procedure, 2DFFT transform spectrogram image and utilize 2DIFFT original image)

说明：  这是一个在vc6.0基于OpenCV的控制台程序，本例给出一个椭圆曲线拟合的例子，程序首先发现图像的轮廓，然后用椭圆逼近它。(This is a vc6.0 console based on the OpenCV procedures, in this case gives an example of elliptic curve fitting, the program first to discover the outline of the image, and then close it with an oval.)

数字图像隐藏及提取研究分析论文、文献等。主要研究算法为LSB算法和DCT奇偶量化、DCT均值量化。(Digital Image Information Hiding and Extraction of analytical papers, literature. The main algorithm for the LSB algorithm and DCT parity quantization, DCT mean quantization.)

利用大津算法对图片进行处理，得到满意的处理效果。(The image is processed by Otsu algorithm and satisfactory results are obtained.)

图像局部放大功能。包括主要的三个消息处理函数，由鼠标拖动画出需放大区域，松开即将图像局部放大到整个客户区，能够实现层层放大。(enlarge images partial function. Including the three main message processing function, the mouse scrolling painted by the need to enlarge the regional, Loosen the forthcoming local enlarge images of the entire client area, can be achieved at every level to enlarge.)

说明：  用VC开发的图形填充算法，简单实用， 希望对你的图形开发有所帮助， 如果有什么问题，可以与我联系(development of the VC graphics filling algorithm, simple and practical, and I hope to your graphics development will help, if any, can contact me)

基于otsu的自适应阀值canny边缘检测(adaptive canny edge detection based on otsu)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)