20064817924orl_faces_112x92

数字图像处理，C语言，功能是打开一幅位图，实现几何变换。(Digital image processing, C language function is to open a bitmap, to achieve geometric transform.)

零相位带通滤波源代码,可以对信号进行滤波处理提高信噪比.(Zero-phase band-pass filtering the source code, you can filter the signal-noise ratio improve treatment.)

基于低频融合算法和小波变换编写的图像融合Matlab程序，包含了基本的小波图像分解与重构程序。(Fusion algorithm based on the low-frequency and wavelet transform image fusion prepared Matlab procedures, including the basic wavelet image decomposition and reconstruction process.)

用TV算法实现图像去噪，包含TV，PM模型等(in this MTV, the diffusion is along the edge direction of the original noisy image(maybe its smoothed version using a Gaussian filter of small scale),it can preserve edge and suppress staircase very well.)

基于TV正则化算法的图像去噪重构，包含有论文说明，及代码实例(Reconstruction based on TV regularization algorithm for image denoising，containing the paper description, and examples)

说明：  通过matlab，可以快速得到图像的特定区域的灰度值，里面也有一些解释(Through MATLAB, we can quickly get the gray value of the specific region of the image, which also has some explanations)

图像重构实现干涉条纹缺陷图的缺陷检测，能很好的滤除条纹，得到缺陷(Interference fringe image reconstruction to achieve defect detection defect map can be a very good filter stripes)

信息隐藏与数字水印实验教程_杨榆主编_国防工业出版社（书中各实验源码)(Information hiding and digital watermarking Yu Yang, editor of experimental tutorial _ _ Defense Industry Press (the book of the experimental source))

这是一种对TV模型算法的一种快速改进算法，C++实现，在Code::Blocks下编译成功(This is a TV model algorithm for a fast algorithm, C++ achieve, in the Code :: Blocks compile successfully under)

广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 (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.)