Orthogonal-Matching-Pursuit

本压缩文件包含利用LUT（查找表）进行MODIS气溶胶反演的系统、源代码及说明文档 源代码为idl的pro文件,易于学习查看 还附赠了6s大气传输模型用以生成查找表（LUT）之用 (Modis 6s.)

说明：  图的算法实现 （1）将图的信息建立文件； （2）从文件读入图的信息，建立邻接矩阵和邻接表； （3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。 (Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.)

说明：  压缩包包括完整的实例代码，可供大家研究和学习，内附说明！(Archive includes a complete example code, for all research and study, included instructions!)

对于哈夫曼编码的仿真，可以计算平均码长、熵、压缩比、编码效率(Simulation of Huffman coding)

自适应滤波器原理matlab程序(Principle of adaptive filter matlab program)

Huffman编码，使用哈弗曼树生成前缀码，把输入的字符编码并把原字符解码(Huffman code and decode)

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)

文件的解压缩。添加文件unzip.h、unzip.cpp、zip.h、zip.cpp，调用对应函数进行压缩和解压。压缩格式为zip；压缩之后的文件可以用winrar等程序打开。(File decompression. Add file unzip.h, unzip.cpp, zip.h, zip.cpp, call the corresponding function for compression and decompression. Compression format is zip the file after compression can be opened by winrar.)

基于tinyjpeg的jpeg解压缩程序，可解码jpeg数据为YUV分量数据(Based Solutions tinyjpeg jpeg compression program, you can decode jpeg data to YUV component data)

读图转灰度3 bit量化，模拟游程编码解码过程(Gray Level 3 Bit Quantization for Run-length Coding and Decoding)