-
5
说明： ：建立了碳钢渗硫表面和非渗硫表面的多球凸峰面接触模型，模型中，凸峰高度按高斯函数分布．用塑性流线
理论分析了渗硫层的摩擦系数．计算结果表明：摩擦系数随载荷的增加而增加；相同粗糙度下，磨削加工的摩擦系
数比车削加工的摩擦系数大；摩擦系数随着渗层厚度的增大而增大．从减小摩擦系数的角度来考虑，渗硫层并非
越厚越好．
(the multi-asperity sphere-shape model for surface contact between sulphurized layer and unsulphurized
layer is established．in which the height of sphere-shape asperities follows the Gaussian distribution．1he
frictional coeficients of sulphurized layers are analyzed by using plastic flown line theory．1he results show that
the frictional coeficient increases with the load．the frictional coeficient of ground surface is higher than that
of tumed surface in case of the same roughness．1he thicker the sulphuri[ed layer is．the higher the frictional
coeficient is．From the viewpoint of reducing frictional coeficient，the thickness of sulphurized layer should
be smaller．)
- 2010-08-04 19:38:19下载
- 积分：1
-
calibration
摄像头的标定，作为一般图像处理的第一步，显得尤为重要(Calibration of the camera, as a first step in the general image processing, it is particularly important)
- 2013-03-17 20:25:05下载
- 积分：1
-
EllipseCir
椭圆拟合，输入中心坐标及椭圆长半轴和短半轴即可画出相应椭圆(ellipse fitting)
- 2013-12-18 23:49:16下载
- 积分：1
-
facedetect
人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测(Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection)
- 2013-07-14 12:50:55下载
- 积分：1
-
Lsm_match
最小二乘图像影像匹配方法，一个很详细的源码例程，有过程有结果，希望对初学者有帮助。高斯解方程，以及最小二乘匹配，里面都很详细。(Squares image image matching method, a very detailed source code routines, the outcome of the process, I hope to help beginners. Gaussian solution of equations, and least squares matching, which is very detailed.)
- 2013-07-18 16:52:41下载
- 积分：1
-
szmhclsf
这是一个数字模糊处理的算法论文!很好很经典(Number obfuscation algorithms! Good classic)
- 2012-05-27 14:56:19下载
- 积分：1
-
Calculate
This is simple calculator program.
I m making a GUI calculator interface in MFC.
this program works pretty well.
- 2011-07-28 15:22:25下载
- 积分：1
-
DRR_registration
通过将三维图像投影成2维ddr图像来实现2D-3D图像配准(By three-dimensional image projection into 2-D images ddr to achieve 2D-3D Image Registration)
- 2008-01-17 18:34:03下载
- 积分：1
-
实现图像的无损压缩
该程序主要实现图像的无损压缩，具体算法包括：
（1）整数小波变换＋SPIHT无损压缩
其中整数小波可以采用JPEG2000提供的5－3小波，也可以采用S＋P变换，本程序均已给出。
（2）DPCM＋算术编码
DPCM采用的是JPEG中采用的方法；
（3）JPEG－LS标准
JPEG－LS的无损压缩性能非常好，超过JPEG2000。(The program mainly realize lossless image compression, the specific algorithm include: (1) integer wavelet transform SPIHT Integer Wavelet lossless compression which can be used to provide the 5-3 wavelet JPEG2000, can also adopt the S P transform, the procedures are given. (2) DPCM arithmetic coding DPCM is used in JPEG methodology (3) JPEG-LS standard JPEG-LS lossless compression of very good performance, more than JPEG2000.)
- 2008-06-02 11:01:57下载
- 积分：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
