source_code_yc0vgk

这是实现压缩感知中的匹配追踪算法。 匹配追踪算法是一种最常用的压缩感知算法。(This is the compression-aware matching pursuit algorithm. The matching pursuit algorithm is one of the most commonly used in compressed sensing algorithm.)

Introduction to Emacs LISP programming.

Code for obtaining Center of math of polygon. enjoy it.

可见光通信MIMO和OFDM系统仿真，代码里有注释。(MIMO and FODM visible light communication count counting system simulation)

optical flow for matching and differential

保证可用的，希望好评！！！HOG+SVM进行图片中行人检测，提供训练用的pos和neg样本，效果还可以（也是本网站下载代码，但是原始的作者故意改错一些地方，我已经一一修正，完全可以运行；没有SVM工具箱的，压缩包里已经提供了，安装一下即可） (HOG+SVM pedestrian detection)

powere system stability analyz

云南电网结题程序，用于计算110KV侧的电流谐波含量(Yunnan Power Grid knot procedures ，used to calculate the 110KV side of the current harmonic content)

mage compression is one of the most important step in image transmission and storage. Most of the state-of-art image compression techniques are spatial based. In this code, a histogram based image compression technique is implemented based on multi-level image thresholding. The gray scale of the image is divided into crisp group of probabilistic partition

说明：  字典树的基本功能是用来查询某个单词（前缀）在所有单词中出现次数的一种数据结构，它的插入和查询复杂度都为O(len),Len为单词（前缀）长度，但是它的空间复杂度却非常高，如果字符集是26个字母，那每个节点的度就有26个，典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)