goruntu_isleme

This code from Matlab central file

equivalent function for matlab - min function

As we know, the energy needed for sensors should be electrical. So the rst step before start to work is to convert environmental energy to electrical one. Inside the node there are dierent components for sensing the area, collecting data and processing the data. So the main dierent part of this kind of nodes, in compare of WSN nodes, is the power part. Once the stored energy reach to a certain amount, the power supply for micro controller and transceiver will start to work. They will continue to work until they have energy, as soon as the energy nish, they stops and energy storage device start to work to save energy again. The other fact should be consider about EH-WSN node is that the available energy can change in dierent nodes. So every node has its own harvesting rate.

通过虚拟阵元进行DOA估计，非归零型差分相位调制信号建模与仿真分析 ，用谱方法计算流体力学一些流动现象的整体稳定性。( Conducted through virtual array DOA estimation, NRZ type differential phase modulation signal modeling and simulation analysis, Spectral methods of computational fluid dynamics flow of some of the overall stability of the phenomenon.)

To encode an input stream into a specified space time block code.

Huffman code的matlab程序，用一幅图像作为training image得到像素的Huffman编码，然后编码另外一幅图像，求得average code length。(Huffman code of matlab program, with an image as a training image pixel Huffman coding, then coded another image obtained average code length.)

K最邻近密度估计技术是一种分类方法，不是聚类方法。 不是最优方法，实践中比较流行。 通俗但不一定易懂的规则是： 1.计算待分类数据和不同类中每一个数据的距离（欧氏或马氏）。 2.选出最小的前K数据个距离，这里用到选择排序法。 3.对比这前K个距离，找出K个数据中包含最多的是那个类的数据，即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)

分数阶微积分：oustaloup近似滤波器生成方法，和纯分数阶微分方程解法(fractional calculus: Oustaloup approximation filter generation method, and the solver of pure fractional differential equation)

说明：  理想滤波器，可以自由设置阈值，大学编程中可能会用到(Ideal filter, free to set threshold, which may be used in University Programming)

计算光子晶体的能带投影图，为波导模的确定以及光子晶体薄板提供基础(calculated photonic crystals with projection to determine the mode waveguides and photonic crystal to provide the basic sheet)