-
VCPPqiangda-tuxiang-chuli
先进行图像预处理，比如Hough变换，边沿检测，还有差影法，模板提取 ，识别，跟踪，最后是模板匹配。(First image preprocessing, such as the Hough transform, edge detection, as well as poor shadow method, template extraction, identification, tracking, and finally the template matching.)
- 2012-03-16 14:33:20下载
- 积分：1
-
autodetection
基于DQ效应的JPEG图像真伪检测算法，通过检测图像DCT直方图的DQ效应计算图像的概率图，该算法快速、准确，能自动定位篡改区域(JPEG image detection algorithm based on the authenticity of DQ effect, calculated image by DQ effect detection probability map image DCT histogram, the algorithm is fast, accurate, and can automatically locate tampered area)
- 2021-03-16 09:59:22下载
- 积分：1
-
graphic
里面涉及了线宽线型的设置，各种图形，还有画笔画刷设置选择，颜色设置等，代码非常齐全，还有编程的每一步都有截图和说明(Which involves the linewidth linear settings, a variety of graphics, and brush brush settings selection, color settings, the code is very complete, and programming of every step have screenshots and description)
- 2014-12-14 20:30:20下载
- 积分：1
-
256togray
可以将256色度级的图像转化为灰度图象，挺值得新手学习一下的，希望大家能喜欢(256 chroma level images can be converted to grayscale images, very worth novice to learn about, and I hope you like)
- 2014-04-19 14:48:30下载
- 积分：1
-
RoadLineFetch
十字路口车道线提取算法。c++开发。特别针对十字路口电子警察系统开发。(road line fetch)
- 2013-06-06 10:31:01下载
- 积分：1
-
ImgZoom
图像局部放大功能。包括主要的三个消息处理函数，由鼠标拖动画出需放大区域，松开即将图像局部放大到整个客户区，能够实现层层放大。(enlarge images partial function. Including the three main message processing function, the mouse scrolling painted by the need to enlarge the regional, Loosen the forthcoming local enlarge images of the entire client area, can be achieved at every level to enlarge.)
- 2007-01-28 22:55:21下载
- 积分：1
-
Reny
三维最大Renyi熵的灰度图像阈值分割算法(Maximum Renyi entropy of three-dimensional gray-scale image segmentation algorithm)
- 2011-12-18 19:15:17下载
- 积分：1
-
CGAL-4.5
CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和三维的点，2D加权Voronoi图，分割Voronoi图等），多边形（布尔操作，偏置），多面体（布尔运算），曲线整理及其应用，网格生成（二维Delaunay网格生成和三维表面和体积网格生成等），几何处理（表面网格简化，细分和参数化等），凸壳算法（2D，3D和dD），搜索结构（近邻搜索，kd树等），插值，形状分析，拟合，距离等。(The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page.
The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del)
- 2014-12-11 14:45:21下载
- 积分：1
-
xiaobo
结合维纳滤波的小波降噪方法，滤波效果很好(Combination of Wiener filtering of wavelet noise reduction method, filter works well)
- 2009-10-24 13:59:40下载
- 积分：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
