-
Canny
本压缩包有canny算子的源程序代码和测试图片。(The archive has canny operator of the source code and test images.)
- 2008-07-24 11:22:50下载
- 积分：1
-
opticalflow
改进的聚类光流法，聚类方法有kmeans和DBSCAN，光流法金字塔LK可以用，HS光流法占用内存太多。(Improved clustering optical flow method, clustering method kmeans and DBSCAN, pyramid LK optical flow method can be used, HS optical flow occupy too much memory.)
- 2021-01-07 16:18:53下载
- 积分：1
-
TMyPolyStockh
实现凸多边形排样，使用临界多边形NFP判断两个凸多边形形是否相交,使用启发式算法提高效率，
(Convex polygon nesting, polygon NFP to determine whether two convex polygon-shaped intersection, the use of heuristic algorithms to improve efficiency,)
- 2021-03-30 22:59:09下载
- 积分：1
-
PP
基于SIFT+Kmeans+LDA的图片分类器的实现源码。
博文参考：http://www.cnblogs.com/freedomshe/archive/2012/04/24/2468747.html(The pictures classifier based on SIFT, Kmeans and LDA. Blog Reference: http://www.cnblogs.com/freedomshe/archive/2012/04/24/2468747.html)
- 2012-07-26 15:34:58下载
- 积分：1
-
imageReadAndShow2
imageReadAndShow2.cpp,读取asc文件,并在VTK中渲染显示...(read ASC File,using VTK)
- 2011-05-26 15:38:29下载
- 积分：1
-
contrast
28个vc++图像处理原程序之--对比度拉伸(28 vc++ Image processing of the original procedure- contrast stretching)
- 2008-12-24 11:58:36下载
- 积分：1
-
Grayscaleimagesharpening
灰度图像图像锐化处理，拉普拉斯变换，梯度等(Grayscale image sharpening, Laplace transforms, gradients, etc.)
- 2010-10-25 17:27:54下载
- 积分：1
-
wtcl1
应用Intel® JPEG Library v1.5处理图像的例子(Using Intel® JPEG Library v1.5 to process image.)
- 2009-06-02 21:23:23下载
- 积分：1
-
opencv249SIFT
opencv SIFT源码详细分析，代码能够准确实现(opencv SIFT detailed analysis of the source code can achieve accurate)
- 2015-07-13 20:33:10下载
- 积分：1
-
EDLines 快速直线检测算子
EDLines是一种快速直线检测算子，2012年在ICCV上提出，也是目前处理直线检测最快的算法之一，该算法包含三个步骤：（1）边缘提取：利用Edge Drawing (ED)算法[28,29]从灰度图像中提取边缘片段；（2）线段检测：利用最小二乘法提取直线段；（3）线段确认：遵循Helmholtz定律，从已提取的直线段中摒弃虚假线段。EDLines算法的优越性得益于Edge Drawing (ED)算法能够从灰度图像中准确、快速、稳定地提取出光滑、完整的边缘片段。Edge Drawing (ED)算法包含以下步骤：
（1）采用size=5*5,σ=1的高斯核对灰度图像进行平滑滤波，去除噪声；
（2）采用一种常用的梯度算子，如Prewitt、Sobel或Scharr等计算平滑后图像中每个像素点的梯度幅度和梯度方向；
（3）将梯度图中邻域内幅度最大的像素点标记为锚点，这些锚点成为图像边缘点(edge elements)的概率很大；
（4）将相邻的锚点连接成边缘线。从一个锚点起始，ED利用相邻像素的梯度幅度和方向在梯度为最大值的锚点之间游走。
(Edge Drawing (ED) is our recently-proposed, novel, fast edge detection algorithm. What makes ED stand out
the existing edge detectors, e.g., Canny, is the following: While the other edge detectors give out a binary
edge image as output, where the etected edge pixels are usually independent, discontinuous entities ED produces a
set of edge segments, which are clean, contiguous, i.e., connected, chains of edge pixels. Thus, while the output of
the other edge detectors requires urther processing to generate potential object boundaries, which may not even be
possible or result in inaccuracies ED not only produces perfectly connected object boundaries by default, but it also achieves this in blazing speed compared to other edge detector.)
- 2021-03-22 16:29:16下载
- 积分：1
