登录
首页 » matlab » panview

panview

于 2011-05-29 发布 文件大小:3KB
0 245
下载积分: 1 下载次数: 7

代码说明:

  应用sift算子进行图像匹配,效果不错。。。(sift is used to match two picture,the result is good...)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • variable-step-size-lms-algorithm
    自己搜集的一些变步长lms算法相关论文,希望对大家有帮助。(Some of his collection of variable step size lms algorithm related papers, we want to help.)
    2011-05-15 20:23:02下载
    积分:1
  • 信道
    说明:  继续上传我自己遍的信道!谢谢! 这个我没有完全的调试成功,请指正!(to upload my own times of the Road! Thank you! This I did not successfully complete debugging, Hi!)
    2006-02-10 10:45:53下载
    积分:1
  • Motion-error-correction-
    SAR图像处理.运动的范围为飞机聚束SAR成像迁移算法纠错 (Motion error correction of range migration algorithm for aircraft spotlight SAR imaging)
    2011-06-29 08:03:53下载
    积分:1
  • matlab-ming-ling-da-quan
    matlab命令大全,各种指令都有,有助于学习(matlab command Daquan, various instructions are conducive to learning)
    2013-04-08 09:18:18下载
    积分:1
  • project
    pansharpening algorithn (new)
    2014-02-20 17:48:52下载
    积分:1
  • VoicePly
    record, save, append & play files of audio
    2010-10-25 02:23:35下载
    积分:1
  • hierarchical
    对于随机数据和Iris数据的层次聚类算法(For random data and Iris data hierarchical clustering algorithm)
    2014-02-19 13:00:15下载
    积分:1
  • mom236849
    说明:  里面包含了很多matlab的编程举例,很适合初学者参考(Which contains a lot of matlab programming examples, reference is suitable for beginners)
    2010-04-13 11:31:39下载
    积分:1
  • fractal-use
    分形的练习一 ①Koch曲线 用复数的方法来迭代Koch曲线 clear i 防止i被重新赋值 A=[0 1] 初始A是连接(0,0)与(1,0)的线段 t=exp(i*pi/3) n=2 n是迭代次数 for j=0:n A=A/3 a=ones(1,2*4^j) A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a] end plot(real(A),imag(A)) axis([0 1 -0.1 0.8]) ②Sierpinski三角形 A=[0 1 0.5 0 0 1] 初始化A n=3 迭代次数 for i=1:n A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2 A=[A A+[c b] A+[c/2 c]] end for i=1:3^n patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数 end (Fractal Exercise One The ① Koch curve Plural iteration Koch curve clear i to prevent i is reassigned A = [0 1] initial A is a connection (0,0) and (1,0) of the segments t = exp (i* pi/3) n = 2 n is the number of iterations for j = 0: n A = A/3 a = ones (1,2* 4 ^ j) A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a] end plot (real (A), imag (A)) axis ([0 1-0.1 0.8])   ② Sierpinski triangle A = [0 1 0.5 0 0 1] initialized A n = 3 the number of iterations. for i = 1: n A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2 A = [A A+ [c b] A+ [c/2 c]] end for i = 1:3 ^ n patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function end)
    2013-03-02 10:03:09下载
    积分:1
  • dfe_cppsim_tutorial[1]
    关于单载波频域均衡系统,判决反馈均衡的仿真。(On single-carrier frequency domain equalization using decision feedback equalization simulation material, and I hope to help you.)
    2013-11-28 10:13:54下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载