-
LANE-Detection-HOUGH-Transform
a lane dtection method using hough-transform
- 2012-01-25 00:48:29下载
- 积分：1
-
weightedmedian
基于椒盐噪声滤波的改进加权中值滤波算法,目的在于处理高浓度椒盐噪声，并且有效的保护边缘细节(salt and pepper noise filter and weighted)
- 2010-09-27 19:20:21下载
- 积分：1
-
毕设
在静止背景下使用背景差分法和帧间差分法进行移动目标的检测(Moving target detection using background subtraction and inter-frame subtraction in static background)
- 2019-05-29 11:54:21下载
- 积分：1
-
Matlab Wrapper for Graph Cuts
基于最大流最小割定理的图像分割,里面有一个例子，(Image segmentation based on maximum flow minimum cut theorem)
- 2018-05-12 23:03:55下载
- 积分：1
-
histogrameq
VC做的图像处理方面的一些代码，仅供参考(VC do image processing of some code, only supplies the reference
)
- 2012-03-15 10:09:25下载
- 积分：1
-
ca3_sol
说明： 用光流法估计图像的运动，基于像素点的算法(Light flow method estimates the image campaign, pixel-based algorithm for point)
- 2008-10-06 16:21:27下载
- 积分：1
-
EdgeDetecion
亚像素边缘检测，基于zernike 灰度矩，实现精度可达0.05个pixel(sub-pixel edge detect)
- 2021-04-02 14:19:07下载
- 积分：1
-
yipinzoomfft
移频复调制ZOOMFFT能以指定的、足够高的采样频率分析频率轴上任一窄带内信号的频谱结构，在序列变换点数相同的情况下，ZOOMFFT能获得更高的频率分辨率(The frequency shift the complex modulation ZOOMFFT to specified former spectrum of the signal within a narrow band structure, a sufficiently high sampling frequency analysis of the frequency axis, in the case of the same sequence transform points, ZOOMFFT obtain a higher frequency resolution)
- 2012-10-15 10:10:57下载
- 积分：1
-
image-segmentation-program
给予matlab的图像分割例程，内附相关图片及程序。(Image segmentation routine MATLAB, containing the relevant pictures and program.
)
- 2013-08-05 17:12:56下载
- 积分：1
-
BFSPDFS
广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。
(Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)
- 2013-08-10 10:37:12下载
- 积分：1
