imnoise

C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等……(C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash method, augmented road algorithm, network maximum flow _ adjlink etc......)

最大熵图像复原方法，效果还好，这是最近努力的结果，不过或许需要适当的改进之后会有更好的结果，分享一下(Maximum entropy image restoration method, the effect Fortunately, this is the result of recent efforts, but may need to be appropriate to improve after the better results, share)

纹理图像分割的算法和实例，其中包括理论的讲解和 MATLAB 文件。(Algorithms and Examples of Texture Image Segmentation)

利用棋盘格对相机进行标定，加入误差判定及像素空间到实际物理空间的距离计算(The camera is calibrated by checkerboard, the error is added and the distance of pixel space to the actual physical space is calculated)

vc++图像开发的附书光盘,包括众多的实例程序,每个程序都可以是功能完备的工具软件.(visual c++ image develop source code and instances)

ncut分割算法matlab代码，实现图像分割的较好的方法(ncut segmentation algorithm Matlab code to achieve a better image segmentation methods)

最大最小距离 聚类算法，可以对一维或者二维信号进行聚类分析。尤其是两类化情况较好时。(maxmum and minimum Cluster Algorithm)

最小噪声分离变换（Minimum Noise Fraction Rotation，MNF Rotation）工具用于判定图像数据内在的维数（即波段数），分离数据中的噪声，减少随后处理中的计算需求量(Minimum Noise Fraction Rotation (MNF Rotation) tool is used to determine the intrinsic dimension (i.e. band number) of image data, separate the noise in data, and reduce the computational requirements in subsequent processing.)

基于mean-shift的动态目标跟踪算法，简单有效，另附图库(Based on mean-shift of the dynamic target tracking algorithm, simple and effective, attach library)

说明：  为了达到较好的隐藏效果，本文采用游程编码的方法在二值图像中隐藏信息。秘密信息嵌入时修改二值图像的游程长度，如果秘密信息为是0，则修改该游程长度为偶数；如果秘密信息的取值与游程长度的奇偶性相匹配，则不改变游程长度。提取时根据游程长度奇偶性提取出秘密信息。在信息隐藏时，改变游程的奇偶性时通过对下一个游程的第一个像素值进行修改，因此当下一个游程长度为1时通过改变当前有成的值实现。(In order to achieve better hiding effect, we use run length encoding method to hide information in two value images. When the secret information is embedded, the length of the travel length of the two value image is modified. If the secret information is 0, the length of the travel length is even even. If the value of the secret information is matched with the parity of the length of the run, the length of the journey is not changed. The secret information is extracted according to the parity of run length. In information hiding, changing the parity of the journey is modified by the first pixel value of the next run, so the current length is 1 by changing the current value.)