figure5_25

图像处理中的图像几何校正，使用MATLAB编程(Image geometric correction in image processing, using MATLAB programming)

根据相机的指向数据，实现对亮星星表9110颗星在探测器上的模拟投影，得到序列星图(According to the data of the camera, to achieve the Bright Star Catalogue 9110 stars on the detector simulation projection to obtain sequence star map)

经典的文本水印算法，实现了别人实现不了的功能，希望大家有所用！(The classic text watermarking algorithm to achieve the functions of others fail to realize, I hope you all have a use!)

在车辆检测中，对提取的前景进行基于hsv特性去除阴影(In the vehicle detection feature to remove the shadow on hsv)

基于ENVI和IDL的以HDF形式存储的已角度配准过后的遥感图像的BRDF计算，使用的核为li_transit和ross_thick。同时还有IDL基础教程和ENVI用户手册。(ENVI and IDL in the order based on HDF have been stored in the form of point of registration after the calculation of remote sensing images of the BRDF, the use of nuclear as li_transit and ross_thick. Along with IDL and ENVI user manual Essentials.)

基于DCT的数字视频水印源程序，Matlab编写，可以直接运行(DCT-based digital video watermarking source code, Matlab can be run directly)

说明：  利用直方图均衡可以将对对比图进行调整，增强局部的对比度，特别在图像有用对比度相当接近的情况，直方图均衡可以很好的增强对比度使得图像的细节更清晰，达到图像增强的目的。(Histogram equalization can be used to adjust the contrast graph to enhance the contrast of the local image, especially in the case that the useful contrast of the image is quite close. The histogram equalization can improve the contrast degree so that the details of the image are clearer and the purpose of image enhancement is achieved.)

关于导频的算法，可以给一些新手提供一些帮助，但是不敢保证一定正确，请见谅(About pilots algorithm can give some newcomers to provide some help, but can not guarantee a certain right , please forgive me)

基于稀疏表示的卡通纹理分解程序，能完成卡通纹理的分解(The program can complete that texture based on sparse decomposition process that cartoon, cartoon texture to complete the decomposition.)

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