-
此方法得到的凸壳总是逆时针顺序，可用于任意简单多边形。...
此方法得到的凸壳总是逆时针顺序，可用于任意简单多边形。-This method of Convex Hull is always counter-clockwise order, can be used for any simple polygon.
- 2022-07-10 15:40:48下载
- 积分：1
-
2维光子晶体的正方形阵列。
square array of 2 dimensional photonic crystals.
- 2023-05-23 18:35:04下载
- 积分：1
-
基于USB摄像头的图像处理 2
该VC6.0工程，是基于USB摄像头的图像处理代码，刚开始学习视频图像处理的同学可以参考下。
- 2022-03-23 23:27:03下载
- 积分：1
-
用RBF网络实现字符识别
用RBF网络实现字符识别-Realize character recognition using RBF Net.
- 2023-02-16 04:35:05下载
- 积分：1
-
讲小波变换的PPT，连续小波变换，二进小波变换，小波信号去噪等...
讲小波变换的PPT，连续小波变换，二进小波变换，小波信号去噪等-Speaking wavelet transform PPT, continuous wavelet transform, dyadic wavelet transform, wavelet signal de-noising, etc.
- 2022-04-07 18:04:03下载
- 积分：1
-
直方图修正和彩色变换的源程序
直方图修正和彩色变换的源程序-and color histogram that transform source
- 2022-05-12 20:11:56下载
- 积分：1
-
用directx和c写的立法体变换程序，可以实习立法体的缩放平移等...
用directx和c写的立法体变换程序，可以实习立法体的缩放平移等-using DirectX and c write transform the legislative body procedures, the internship legislative body, such as scaling translation
- 2022-03-07 20:50:39下载
- 积分：1
-
vega中的tripod碰撞检测方法，上房问题在min和Max的参数中。如果max值越大，你爬高就越大。min越小你下坡也就越大。他们的值与你的场景单位有关。他...
vega中的tripod碰撞检测方法，上房问题在min和Max的参数中。如果max值越大，你爬高就越大。min越小你下坡也就越大。他们的值与你的场景单位有关。他们都是极限值，如果你的房子高度在max值之下就不可能“上房”了。你的坡度落差大于min的绝对值时，他就下不去了。一般用在z和Tripod中常见-vega in the tripod of collision detection methods,上房problem min and Max parameters. If the max value bigger, you climb the greater. min greater the smaller the downhill you. Their value and your scene units. They are limits, if your house under a high in the max value can not be
- 2023-06-03 18:45:02下载
- 积分：1
-
Factorized Graph Matching 分解图匹配，路径追踪优化代价函数
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence
problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem
(QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and
difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision
problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large
pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges.
Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity
matrix; (2) The factorization allows the
- 2022-02-01 17:07:26下载
- 积分：1
-
基于图像处理的图形轮廓自动识别技术研究文档，描述图象，自动识别...
基于图像处理的图形轮廓自动识别技术研究文档，描述图象，自动识别-基于图像处理的图形轮廓自动识别技术研究
- 2023-08-04 03:25:03下载
- 积分：1
