-
夹紧的B样条函数。
clamped bspline function.
- 2022-05-14 15:28:56下载
- 积分:1
-
intel performance library of ipp sample code, in multi
intel的ipp性能库的示例代码,在多核平台下可以充分利用多核的性能实现人脸识别-intel performance library of ipp sample code, in multi-core platform can take full advantage of multi-core performance to achieve face recognition
- 2022-07-04 08:48:23下载
- 积分:1
-
用VB6写的一个波形绘制软件,类似windows 任务管理器界面,只是绘制一个框架,实时波形须在控件的Display()方法中加入代码...
用VB6写的一个波形绘制软件,类似windows 任务管理器界面,只是绘制一个框架,实时波形须在控件的Display()方法中加入代码-Using VB6 to write a waveform drawing software, windows task manager like interface, but a framework for mapping, real-time waveform to be in control of the Display () method to add code
- 2022-06-14 13:18:09下载
- 积分:1
-
3DS导入openGL
一个完整的3DS文件导入到OpenGL中的源代码,代码简单易读,具有很好的参考价值.3DS file into a complete OpenGL source code, the code easier to read, have a good reference value.
- 2022-03-21 21:47:38下载
- 积分:1
-
最小二乘法曲线拟合程序 经过调式 供大家参考
最小二乘法曲线拟合程序 经过调式 供大家参考 -Least squares curve fitting procedures through mode for your reference
- 2022-06-16 08:54:51下载
- 积分:1
-
opengl c++ 键盘鼠标交互 画圆 椭圆 矩形 三角形 旋转移动
opengl c++ 键盘鼠标交互 画圆 椭圆 矩形 三角形 旋转移动-opengl c++ keyboard and mouse interaction Circle Oval Rectangle Triangle rotational movement of the
- 2022-07-07 04:44:09下载
- 积分:1
-
方便的VC图形编辑器
方便的VC图形编辑器-convenient VC graphics editor
- 2022-03-11 03:01:59下载
- 积分:1
-
用于图像编程中局域网center的处理程序和源代码的实现
用于图像编程中局域网center的处理程序和源代码的实现-for Image Programming LAN center handling procedures and the realization of the source code
- 2022-03-17 04:26:54下载
- 积分:1
-
基于信息熵的改进型遗传算法,并加入了基于群体浓度更新的操作算子。...
基于信息熵的改进型遗传算法,并加入了基于群体浓度更新的操作算子。-based on information entropy IAGA, and to join groups based on the concentration updated Operator.
- 2022-03-22 18:30:19下载
- 积分: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