Micro-Doppler-analysis-of-vibrating

用霍夫曼编码，零树小波算法解码，图像处理过程(huffman encode ，ezw decode)

给予matlab的JPEG压缩程序，包含原始压缩图片，程序对灰度bmp图片进行JEPG编码，压缩成以0101形式的编码。JPEG编码先把图象色彩RBG变成亮度Y和色度Cr、Cb，它利用人的视觉对色度不敏感的特点，减少一部分色度数据，以达到压缩。 JPEG采取多种编码方式，包含有行程编码(Run Length Coding)和哈夫曼(Huffman)编码，有很高的压缩比。在编码前，先对数据进行分块，离散余弦变换（DCT）及量化，保留能量大的低频信号，丢弃高频信号以达到压缩。(Given to the JPEG compression matlab program, contains the original compressed image, the program of the grayscale bmp picture JEPG encoded, compressed into a 0101 form of encoding. RBG color coded JPEG image into a first luminance Y and chrominance Cr, Cb, which uses the human visual characteristics is not sensitive to the color, reduce the number of color data to achieve compression. Take a variety of JPEG encoding, includes length coding (Run Length Coding) and Huffman (Huffman) coding, a high compression ratio. In the code before the data block, discrete cosine transform (DCT) and quantization, to retain a large low-frequency signal energy, discarding high-frequency signals in order to achieve compression.)

包括最原始的分数阶微分方法，自适应分数阶微分法，非整数步长的方法。对学习分数阶微分的人是个很好的资料代码。(It includes the most original fractional differential method, adaptive fractional differential method, and non integer step length method. It is a good data code for people learning fractional differential.)

粒子滤波器使用示例，用于跟踪效果好，用VC++实现(example of particle filter)

Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics

大量图片的处理代码,特别是图片的批量处理，非常有利于在处理图片时使用(A large number of image processing code, especially images of batch processing, image processing is very conducive to the use of)

抠图算法 使用matlab实现 抠图算法 使用matlab实现 (Matting Matting algorithm implementation using matlab using matlab algorithm to achieve)

实现彩色图像的N*N 中值滤波器，可选择滤波系数。(To achieve the N* N color image median filter, selectable filter coefficients.)

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

利用C++实现了BMP图像的读入和显示利用C++实现了BMP图像的读入和显示利用C++实现了BMP图像的读入和显示(Use C++ achieve the BMP image to read and display BMP images using the C++ achieve to read and display BMP images using the C++ achieve to read and display)