-
julia
在visual c++中用分形完成的julia集,是分形的具体应用,对学分形的朋友应该有帮助(In the visual c++ Used to complete the julia fractal set, is the concrete application of the fractal, Friend of the credits should be shaped to help)
- 2008-07-10 12:29:03下载
- 积分：1
-
program
gdal读tiff图像,获取图像大小，波段信息，图像数据，写Tiff图像到固定路径。(Read and write an TIff image using GDAL)
- 2012-02-13 22:08:22下载
- 积分：1
-
VCDigitalImageProcessing01
说明： VC++数字图像处理典型算法及实现 01 源程序(VC++ Digital Image Processing Algorithm and Implementation of a typical 01)
- 2011-04-02 17:41:54下载
- 积分：1
-
Grid
基于OpenCV实现的图像切割程序，通过程序中参数设置分块的数量和大小(The project is uesd to break an image into block)
- 2013-12-01 22:31:29下载
- 积分：1
-
dcmread4
集成ITK、VTK、MFC读取DICOM的代码，建成win32程序即可。运行完美(Integrated ITK, VTK, MFC to read DICOM code, built win32 program can. Works perfect)
- 2021-02-19 16:29:44下载
- 积分：1
-
VIBE
VIBE用于视频背景建模，经典算法，C++和matlab代码都有，文件是全的。(VIBE for video background modeling, classical algorithms, C++ and matlab code has a file is complete.)
- 2020-09-20 16:27:53下载
- 积分：1
-
btp2
一个很好用的bmp图像转protelPCB封装库，如果有需要在pcb中插入图像，汉字的朋友可以下载(bmp to protel99，it s a good tool，welcom to download)
- 2011-01-17 10:11:04下载
- 积分：1
-
1234
图像处理中图像几何畸变校正程序，用于图像的广角畸变的校正。(Image processing procedures for image geometric distortion correction for images of wide-angle distortion correction.)
- 2010-06-01 16:01:47下载
- 积分：1
-
yaxiangsu1
亚像素方面的相关源码!!!相信对你的学习会有帮助!(Related to source sub-pixel area!!! That would be helpful to your learning!)
- 2010-11-29 16:41:02下载
- 积分：1
-
algorithm-of-findpath
绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区
域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行
定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解
决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻
接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每
个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider
problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this
problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are
proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their
gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the
overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone.
Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first
search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a
defined start-point, end-point)
- 2012-12-09 23:26:22下载
- 积分：1
