lyaprosen

ini merupakan STC code dimana dia mengkodekan melalui STC

Hog try I try to implement hog descriptor

u can calculate DCT clc inp = imread( Im1.jpg ) inp1 = imread( Im2.jpg ) A = double(inp(:,:,1)) B = double(inp1(:,:,1)) A1=double(blkproc(A,[8 8], dct2 )) B1=double(blkproc(B,[8 8], dct2 )) [r,c] = size(A1) r1 = [] for i=1:r for j=1:c if A1(i,j) > B1(i,j) r1(i,j)=A1(i,j) else r1(i,j)=B1(i,j) end end end r1= double(r1(:,:,1)) C=blkproc(r1,[8 8], idct2 ) round(C) C1=idct2(r1) figure imshow(uint8(C)) figure imshow(uint8(C1)) imwrite(uint8(C), dct8x8min.jpg )

激光谐振腔中激光模式的仿真，包括不同腔型(Simulation of the laser mode in the laser cavity, including the type of cavity)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

多种图像边缘检测与分割处理,基于matlab实现。(A variety of image edge detection and segmentation processing, based on the realization of matlab.)

simulation capacity without CSI transmitter

Sample Communication System

循环自相关函数工具箱，还带有自己编写的代码，ex1-7．(Circulating auto-correlation function of the toolbox, but also prepared with its own code, ex1-7.)

kMedoids 聚类算法 matlab实现(kMedoids achieve clustering algorithm matlab)