-
ri
说明： 可改变中心时移，相位，主频的雷克子波，自己在源程序上加减时间，改变主频，加减相位即可(ricker wavelet which time,phase and frequence can be changed )
- 2012-03-23 09:03:02下载
- 积分：1
-
立体匹配包含SAD SSD NCC 区域增长 census等多种常用立体匹配算法
说明： 立体匹配包含SAD SSD NCC 区域增长 census等多种常用立体匹配算法(Stereo matching includes SAD SSD NCC area growing census and other commonly used stereo matching algorithms)
- 2020-03-19 10:53:23下载
- 积分：1
-
DoG-filters
matlab 的 Difference of Gaussian 算法实现，很常用的算法(matlab the Difference of Gaussian algorithm, it is commonly used algorithm)
- 2011-09-26 13:04:20下载
- 积分：1
-
HOG-SVM-classifer-master
利用传统的SVM-HOG算法，进行行人检测(HOG-SVM algorithm for pedestrian detection)
- 2018-11-30 17:50:16下载
- 积分：1
-
lsbstegoprote-matlab
基于lsb的图像信息隐写算法 利用MATLAB实现(lsb-steganography)
- 2009-09-14 16:09:49下载
- 积分：1
-
3476562
源码PonyProg2000-2 07a tar gz()
- 2018-01-07 22:34:52下载
- 积分：1
-
lda_hash
以SIFT特征为目标输入，LDAHash方法进行降维实现目标识别(SIFT features input LDAHash method to reduce the dimensionality of the target recognition)
- 2021-01-01 18:28:58下载
- 积分：1
-
Wavelet_ROMP
压缩感知CS——采用小波变换进行稀疏表示，高斯随机矩阵为观测矩阵，重构算法为ROMP算法，对256*256的lena图处理，比较原图和ROMP算法在不同采样比例(0.74、0.5、0.3)下的重构效果，并各运行50次，比较算法性能PSNR和每次的运行时间
(Compressed sensing CS- using wavelet transform as sparse representation, Gaussian random matrix as the observation matrix and ROMP algorithm as the reconstruction algorithm. Compare lena figure and the reconstruction results using ROMP algorithm at different sampling ratio (0.74,0.50.3),then each runs 50 times, compare the performance of PSNR and each running time)
- 2013-01-19 12:54:34下载
- 积分：1
-
StereoVision_SSD
本算法在Matlab2008b 环境下实现。包括main,san 和ssd 三个函数。
这次实现的算法并不是比较两个已经知道的点是否匹配，而是已知一个图形中的特征点，在另外一个图像中找到与其最匹配的点，匹配度用SAD 或者SSD 来度量。
main.m 是程序的入口，包括生成和读入实验数据，调用sad 函数和ssd 函数求匹配点，最后绘
制出最后的结果。sad.m 是用sad 度量方法在另一图中求解匹配点的函数实现，有3 个参数
y=sad(x,image1,image2)。其中x 是代匹配的数据，image1 是图像1 数据，image2 是图像2 数据。
从理论上分析，ssd 比sad 算法要复杂一点，经过测试，在一幅640*480 的图像中寻找10 个匹配点数据SAD 用时25.062519 秒，SSD 用时25.291432 秒。(The algorithm Matlab2008b environment to achieve. Including the main, san, and ssd three functions.
The implementation of the algorithm is not the point of comparing two matches already know, but the known feature points in a graphic, an image found in the other match with the most points, matching measured with the SAD or SSD.
main.m is the entry, including the generation and reading test data, call the sad ssd function evaluation functions and matching points, and finally draw the final result. sad.m measure is sad figure in another match point in the function implementation to solve, there are three parameters
y = sad (x, image1, image2). Where x is the generation of matching data, image1 is the data image 1, image2 is the image 2 data.
From the theoretical analysis, ssd little more complicated than the sad algorithm, tested in a 640* 480 images of 10 match points in the search for data using time 25.062519 seconds SAD, SSD with time 25.291432 seconds.
)
- 2011-01-25 19:06:47下载
- 积分：1
-
Exercises
2014年西安电子科技大学数字图像处理上机实验，同时是研究生和本科生的代码及作业
(2014 Xi' an University of Electronic Science and Technology of digital image processing experiments on board, while the graduate and undergraduate students and job code)
- 2014-01-27 17:37:16下载
- 积分：1
