inverse-normal-cumulative

做项目时写的关于相机图像采集、控制、图像处理、坐标计算、坐标显示等功能的小软件(Do item written on the camera image acquisition, control, image processing, coordinates of the calculation, the coordinates show features such as small software)

生成四副条纹图，进行四步相移，并且进行相位解包裹，并以图片形式输出结果(Generate four fringes, were four-step phase shift and phase unwrapping, and output as a picture)

This is a Scaling function definition Image cutoff ratio for H = 3

vc++ 数字图象处理 很好用我看了以后收益非浅希望大家喜欢(vc digital image processing with very good after I read greatly benefit hope you like)

该类计算图像的主分量,特征值,特征向量,并且使用主分量重构.(The main components of such calculation of the image, feature values, feature vectors, and the use of principal component reconstruction.)

这是一个基于vc++语言下读取像素点灰度值(write highhui of a photo!)

北航图像处理demo，目前集成了从色彩转换、彩色图像处理、灰度图像处理、二值图像处理、阈值分割、边缘检测、数学形态学方法、等多个组件(Northern image processing demo, now integrated from the color conversion, color image processing, gray-scale image processing, binary image processing, thresholding, edge detection, mathematical morphology, and many other components)

一个很好类子来说明类模板的使用，可以比较明了类模板的使用方法，最好进行单步调试(use of class template )

说明：  用VC实现数字减影算法，通过模板匹配，再对两幅图像相减，即用盈片中减去蒙片，从而实现突出血管区域的目的。【源码加文档说明】(Using VC to achieve digital subtraction algorithm, template matching, and then the subtraction of two images, that the film with surplus minus mask, in order to achieve the purpose of highlighting vascular region. 【Source】 plus documented)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)