-
chap01
数字图像处理编程入门（吕风军）第一章第1章 Windows位图和调色板(Windows Bitmap and palette of the first chapter, Chapter 1 of the digital image processing program entry (Lv Fengjun))
- 2012-11-01 14:06:21下载
- 积分：1
-
demo
图像拼接小程序，使用直接对比的方法进行拼接并用加权平均的方法进行融合
(a simple program for image splicing
)
- 2012-04-25 09:58:43下载
- 积分：1
-
imageReadAndShow2
imageReadAndShow2.cpp,读取asc文件,并在VTK中渲染显示...(read ASC File,using VTK)
- 2011-05-26 15:38:29下载
- 积分：1
-
C语言实现的DFT
用C语言实现的离散傅里叶变换（DFT）的经典算法！比较实用！(C language classic of the discrete Fourier transform (DFT) algorithm! More practical!)
- 2012-12-20 20:11:01下载
- 积分：1
-
hedongjian
彩色位图转黑白位图代码。何东健《数字图像处理》随书光盘提供的源码。(color bitmap to black-and-white bitmap code. Dong- Jian "Digital Image Processing" With the CD source.)
- 2006-11-02 10:13:04下载
- 积分：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
-
09_Direct
人民邮电出版社，《VC++数字图像处理典型算法及实现》-- 第9章图像分割。
包括图像的并行边界分割、串行边界分割、并行区域分割、串行区域分割、Canny算子的实现等源代码(Posts )
- 2008-06-03 11:11:23下载
- 积分：1
-
PM
说明： Perona和Malik在热传导方程的基础上，建立了各向异性扩散方程并将其应用到了图像处理中尺度空间的图像平滑上，该模型针对图像的边缘部分和非边缘部分进行不同性质的图像处理，同时解算方程的迭代格式简单，克服传统滤波的主要缺陷，是图像质量大为改善，为图像的边缘检测和增强开辟了新的方向。(This process smoothes regions while preserving, and enhancing, the contrast at sharp intensity gradients.)
- 2011-07-04 21:30:44下载
- 积分：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
-
gaues_
高斯计算程序，高斯计算程序，高斯计算程序，高斯计算程序，高斯计算程序，高斯计算程序，(Gaussian calculation program, Gaussian calculation program, Gaussian calculation program, Gaussian calculation program, Gaussian calculation program, Gaussian calculation program,)
- 2013-04-12 09:47:28下载
- 积分：1
