otsu3

Simply calculus for exhaust gases, altitude coast phase time, diameters for a required parachutes from a rocket.

Matlab codes for descriptors

some distribution james lasage toolbox

主要利用粒子滤波进行人体跟踪,能很好地进行人体跟踪(The main use of the particle filter for human body tracking, can be used for human body tracking)

运动目标的检测是视频处理过程中后续跟踪技术的基础,其检测结果的好坏直接关系到能否跟踪到运动目标及跟踪准确度问题。运动目标的检测就是从机器视觉系统获取的序列图像中把前景,运动,目标分割提取出来的过程。本文描述了机器视觉中运动目标检测的主要方法?介绍了其中背景减除法的几种典型算法的原理、特点、背景差分法的基本流程?主要包括四个步骤为,预处理、背景建模、目标检测、后处理。然后在matlab环境下运用背景减除算法完成了视频中运动目标的检测,并对检测结果图像进一步处理.(Moving target detection is a follow up video processing technology based on the test results is directly related to the ability to track moving targets and tracking accuracy. Moving target detection prospects, movement, object segmentation extracted from the sequence of images acquired by the machine vision system. This paper describes the main method of moving target detection machine vision ? introduced the principle of which several typical algorithms for background subtraction method, the basic flow characteristics, background difference method ? mainly includes four steps, preprocessing, background modeling target detection, post-processing. Use background subtraction algorithm in Matlab environment complete video moving target detection, and detection results of images for further processing.)

说明：  对气象数据进行MK检验分析，包括突变检验和趋势检验(MK Test and Analysis of Meteorological Data)

基于matlab编程的EMD分解(转载)(the EMD of MATLAB)

微粒子算法matlab代码:很南找到一个资料，和大家分享(Microparticle algorithm matlab code: I am the South to find a data, and share)

Floyd算法,对研究通信网性能分析很有帮助(Floyd algorithm, the study of communication network performance analysis very helpful)

利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 (Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.)