-
Open02
一个简单的图像浏览器,对初学C++开发图像处理系统的朋友有启迪作用。(A simple image viewer, for beginners C++ image processing system developed friends revealing.
)
- 2011-11-16 15:51:17下载
- 积分:1
-
tree1
四叉树分割 opencv 编写 读入灰度图 进行递归分割(Quadtree segmentation opencv read into grayscale prepared for recursive partitioning)
- 2021-04-27 21:08:45下载
- 积分:1
-
chapter12
图像处理中的数字识别代码,包括数字训练集合和训练分类算法,可以实际应用。(digital recognition)
- 2015-10-11 21:25:41下载
- 积分:1
-
epipolar_line
同名核线的提取,完整的c++代码,注释详细易懂,并且已经验证过(Line of the same name as the nuclear extract, complete c++ code, comments, detailed and easy to understand, and have been verified)
- 2020-07-21 18:18:45下载
- 积分:1
-
DIC
通过数字图像相关的方法计算两幅图像之间的位移,计算时间较长,是最基础的DIC,没有优化。(Digital image correlation method to calculate the displacement between the two images, the time is longer, is the most basic DIC, no optimization.)
- 2021-03-31 10:59:09下载
- 积分:1
-
DSP-digital-Recognition
天津工业大学课程设计,内容包含vs2010对图像的灰度化,二值化,边缘检测。包含单纯c语言编写的对图像的灰度化,二值化,边缘检测的一个.C文件,可以直接用vc6.0运行,也可以直接在DSP上运行,还包含一份详细的设计报告。(Tianjin Polytechnic University curriculum design, content includes vs2010 grayscale image binarization, edge detection. Contains pure c language for image graying, binarization, edge detection is one. C file that can be run with vc6.0 can also be run directly on a DSP, also contains a detailed design report.)
- 2013-12-10 10:51:11下载
- 积分:1
-
Alpha_shapes_3
这是三维点云数据边缘线提取的c++算法,适合于LIDAR数据的三维处理,供大家参考学习(This is 3 d point cloud data edge extraction of c++ algorithm, suitable for LIDAR data 3 d processing, provide everyone reference to study)
- 2020-11-05 17:09:51下载
- 积分:1
-
Ray-tracing
线性插值射线追踪法,设置模型为一三层模型,范围100m×100m(Linear interpolation ray tracing method, set the model for a three-tier model, the range 100m100m)
- 2020-10-29 14:19:56下载
- 积分:1
-
circle
一个会动得圆,让学习的人更好的了解C++知识,是最基本的知识,学习工程的基本入门。(Will get round a move, so who better to learn about C++ knowledge, is the most basic knowledge, basic engineering study entry.)
- 2011-08-17 17:47:38下载
- 积分:1
-
DE
说明:
最简单的差分格式有向前、向后和中心3种。
向前差分:f (n)=f(n+1)-f(n)
向后差分:f (n)=f(n)-f(n-1)
中心差分:f (n)=[f(n+1)-f(n-1)]/2(The easiest difference format forward, backward, and three kinds of centers.
Forward differencing: f (n) = f (n+ 1)-f (n)
Backward difference: f (n) = f (n)-f (n-1)
Central difference: f (n) = [f (n+ 1)-f (n-1)]/2)
- 2016-05-17 21:08:01下载
- 积分:1