MATLABinstalmentofaneasydirectory

精通matlab辅导与指南，一本学习matlab的好书，代码多，轻松学习掌握matlab。(Proficient in matlab counseling and guidance of a good book to learn matlab, code and more easily learn to master matlab.)

这是利用matlab进行数字图像处理的入门教程，非常管用。(This is the use of matlab digital image processing of how-to tutorials, very useful.)

说明：  混沌工具箱 C-C方法计算时间延迟和嵌入维数 混沌时间序列预测(Chaos Toolbox CC method to calculate time delay and embedding dimension of chaotic time series prediction)

MatLab code Genetic Algorithm for Knapsack Problem

Numerical solving specifications For grid simulation

Emperical mode decomposition

nonmaxsup——非最大值抑制 hysthresh——设定阈值区间，返回一个二值化图像 canny——边缘探测，图像边缘增强 adjgamma——调整图像的伽马值 findline——利用线性Hough变换和Canny边缘探测得到的线上各点的坐标 circlecoords——返回由圆的半径和圆心坐标决定的圆上各点像素的坐标 houghcircle——取一幅经过canny变换的图像，利用hough变换找到图像中的一个圆 findcircle——计算所得线上各点的坐标归纳出一个圆的半径和圆心，确定该圆的各点坐标 gaborconvolve——利用一维盖伯滤波器对图像进行处理 gethammingdistance ——返回两幅虹膜图像提取的特征码之间的海明距离 linecoords——返回一条线的上各点的x,y坐标值(nonmaxsup- non-maximum suppression hysthresh- set the threshold range, returns a binary image canny- edge detection, image edge enhancement adjgamma- adjust the image' s gamma value findline- linear Hough transform and Canny edge detection get the coordinates of each point circlecoords online- Returns coordinate houghcircle on the circle of the radius and center coordinates of the points decision pixels- After taking a picture canny transformation, using hough transform to find the image of a circle findcircle- the calculated coordinates of each point line summed up a circle of radius and center, to determine the coordinates of each point of the circle gaborconvolve- using a 维盖伯 filter for image processing gethammingdistance- returns two iris images extracted linecoords Hamming distance between the signature- a return line to the points on the x, y coordinate values)

建立了整车的6自由度模型，包括轮胎模型、车身模型、垂向力模型等(The 6DOF model of vehicle)

梯度下降法是一個一階最佳化算法，通常也稱為最速下降法。 要使用梯度下降法找到一個函數的局部極小值，必須向函數上當前點對應梯度（或者是近似梯度）的反方向的規定步長距離點進行疊代搜索。如果相反地向梯度正方向疊代進行搜索，則會接近函數的局部極大值點；這個過程則被稱為梯度上升法。(The gradient descent method is a first-order optimization algorithm, also commonly referred to as the steepest descent method. To find the local minimum of a function using the gradient descent method, an iterative search must be performed to the specified step distance point in the opposite direction of the gradient (or approximate gradient) of the current point on the function. If the search is reversed in the opposite direction to the positive direction of the gradient, it will approach the local maximum point of the function; this process is called the gradient ascent method.)

说明：  该程序主要是仿真单极性码和双极性码在加性高斯白噪声信道中的理论误码率和实际误码率，并做一比较(The program is mainly simulation of single polar code and bipolar code theory in additive white gaussian noise channel bit error rate and the actual error rate, and make a comparison)