OMB_DHC

一个Matlab实例，内有例题描述已经m文件(A Matlab example, there has been described m Example document)

一本用于matlab学习的讲义，有助于快速掌握matlab的使用，方便matlab算法的开发(A used in matlab study notes, help to grasp the use of matlab, convenient matlab algorithm development )

Fisher Linear Discriminant based program for face classification

本书把MATLAB 当作一种技术编程语言来教，向学生展示如何编写简洁高效，有充分 根据的程序。本书不主张把MATLAB 数以百计的函数全部介绍给大家，而是教给学生怎样 使用MATLAB 语言，以及如何使用网上在线工具去加载你所需要的函数。本书的前六章是 “编程设计介绍”的课程，专门为大一的工科学生而设计编写的。这部分内容以9 周，每周 3 个小时教学为宜。其余的章节涵盖了一些高级的主题，例如输入输出接口（input/output interfaces）和图形用户界面（GUI）。这些章节可能需要更长时间的学习，也可以作为使用MATLAB 的工科学生和有经验的工程师的参考。(The book as a technique to MATLAB programming language to teach, to show students how to write a simple and efficient, there is a sufficient basis for the program. This book does not advocate a function of all the hundreds of MATLAB to introduce to you, but to teach students how to use MATLAB language, and how to use on-line tools to load the function you need. The first six chapters of this book is " designed to introduce programming" course, designed for freshman engineering students designed to write. This part to nine weeks, three hours a week teaching appropriate. The remaining chapters cover some advanced topics, such as input and output interfaces (input/output interfaces) and graphical user interface (GUI). These chapters may take longer to learn, you can also use MATLAB as a reference for engineering students and experienced engineers.)

用Matlab实现一副图片中多个人脸的识别，另附有一片文章以帮助了解，识别效果非常好，适应性很强。(Using matlab to achieve multiple faces recognition in a picture,and attach a text to help understand, the effect is very good,strong adaptability.)

运用matlab进行ls与dft对比，从而得到二者不同(Ls using matlab for comparison with dft, resulting in two different)

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)

改进aic准则ARIMA模型，通过调整误差来寻找p和q(ARIMA model)

实现卷积编码和相应的维特比译码（卷积码编码器为（2，1，3），维特比译码针对第1、3位模二加和第1、2位模二加）(Convolutional coding and the corresponding realization of Viterbi decoding (convolutional code encoder for the (2,1,3), Viterbi decoder bit mode for the first 1,3 and 1,2 position two plus two plus model ))

skeleton prunning, extract skeleton from binary images by junction points and curve points and end points.