Untitled1

图像处理中：canny算法matlab实现图像的分割(canny algorithm matlab implementation)

对二级倒立摆进行仿真，并且还添加了状态观测器后再继续观察(On the two level inverted pendulum simulation, and also added a state observer and then continue to observe)

在数字图像处理中，运用MATLAB中的函数compare可以用来计算图像压缩前后的误差和直方图(In digital image processing using MATLAB functions compare the error and histogram can be used to calculate the image before and after compression)

在有色输入下，仿射投影算法(APA)由于具有比最小均方(LMS)算法更快的收敛速度和比递归最小二乘(RLS)算法更低的复杂度而受到青睐。(The APA better improves the convergence rate compared with the LMS-type filters, especially in the case of coloured input signals.)

对OFDM系统进行自适应分配，主要对子载波，比特和功率进行分配，已达到降低发射端功率的目标。(Adaptive Allocation for OFDM systems, the main pair carrier, bit, and power distribution, has reached the goal of reducing the transmitter power.)

Frame subtraction code written by me using matlab it takes a video s first frame and subtract each frame from it. it shows output video and input video side by side

Use of switches in Simulink

说明：  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)

双基地MIMO雷达利用MUSIC算法实现目标二维方位角联合估计(Bistatic MIMO radar MUSIC algorithm to achieve the goal of a two-dimensional azimuth joint estimation)

We formulate a scheduling problem that takes into account different hardware delays experienced by the secondary users (SUs) in a centralized cognitive radio network (CRN) while switching to different frequency bands. We propose a polynomial-time suboptimal algorithm to address our formulated scheduling problem. We evaluate the impact of varying switching delay, number of frequencies, and number of SUs. Our simulation results indicate that our proposed algorithm is robust to changes in the hardware spectrum switching delay and its performance is very close to its upper bound. We also compare our proposed method with the corresponding constant switching delay-based algorithm and demonstrate that our suggestion of taking into account the different hardware delays while switching to different frequency bands is essential for scheduling in CRNs.