differential-operation

bmp文件的读取,2,8,16,24bit自适配(bmp file read,2、8、16、24bit adjust)

基于Visual C++的图像边缘检测工程，以Canny为例(Visual C++-based image edge detection works to Canny Case)

图形图像正交变换，离散余弦变换，VC++实现。(Graphic image orthogonal transform, discrete cosine transform, VC++ to achieve.)

Moravec算子，实现对数字图像处理中的点特征提取，可用于图像拼接，特征提取，三维点生成(Moravec operator, the realization of digital image processing in point feature extraction, can be used for image stitching, feature extraction, 3D point generation)

SAR成像算法的分析； SAR成傢算法简要介绍 ；Chirp-scaling算法 ； 分布式小卫星SAR解方位多普勒模糊的点目标仿真； 分布式小卫星SAR成像的仿真参数 ； 点目标成像仿真及结果 (SAR imaging algorithm analysis SAR algorithm married briefly Chirp-scaling algorithm distributed small satellite SAR azimuth Doppler ambiguity solution point target simulation distributed small satellite SAR imaging simulation parameters Point Target Imaging Simulation and results)

一种新的彩色图像去噪与增强模型(A new color image denoising and enhancement model)

图像变形处理程序，VC2013+opencv实现，利用三种差之方法扭曲变形( Image deformation processing program, VC2013+ opencv realized the difference between using three methods distorted)

检测视频中的运动目标以及阴影，并消除阴影，基于opencv，将RGB颜色空间根据一定的转换关系转换到HSV空间，最后消除阴影， 可以在vc6.0和vs2008上正常运行(Shadow detection algorithm based on HSV color space)

在分析聚束合成孔径雷j盘(SAR)方位向时频关系的基础上，提出了一种新的全孔径分辨率SAR成像算法。 根据SAR在条带与聚束模式下回波信号之间的差别，利用现有成熟的条带SAR成像算法实现先对聚束SAR各方位向子 孔径成像，而后再将各方位子孔径带宽合成为全孔径带宽，以形成具有全孔径分辨率的SAR图像，极大降低了系统PRF 的要求。(In the analysis of spotlight synthetic aperture radar dish j (SAR) azimuth based on the time-frequency relationship, a new full-aperture resolution SAR imaging algorithm. According to SAR in strip and spotlight mode, the difference between the echo signal, the use of existing mature band SAR imaging algorithm first bit of the spotlight SAR the parties to the sub-aperture imaging, and then place then all the bandwidth synthetic aperture the bandwidth for the full aperture to form a full aperture resolution SAR images, greatly reducing the system PRF requirements.)

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