-
Constraint Delaunay triangulations,用于剖分具有外部轮廓线或内部轮廓线的离散点集...
Constraint Delaunay triangulations,用于剖分具有外部轮廓线或内部轮廓线的离散点集 -Constraint Delaunay triangulations, uses in to cut in half has
exterior contour line or the internal contour line separate set of
points
- 2023-06-05 22:15:02下载
- 积分：1
-
这是图形学中关于弧线生成算法的源程序，是结合了老师的意见后编写的。...
这是图形学中关于弧线生成算法的源程序，是结合了老师的意见后编写的。-This is the graphics on the arc of the source code generation algorithm is a combination of the views of teachers prepared.
- 2022-09-17 02:50:03下载
- 积分：1
-
can generate hills, fireworks, trees and grass in a process
可以生成山峦、焰火、树和草的一个程序-can generate hills, fireworks, trees and grass in a process
- 2022-04-23 10:40:52下载
- 积分：1
-
小波基的构造，每步均有说明，讲解很详细，值得学习
小波基的构造，每步均有说明，讲解很详细，值得学习-Wavelet construction, each step that has to explain in great detail, it is worth learning
- 2022-03-12 03:36:07下载
- 积分：1
-
该源码用于图像处理初学者，用来了解相关算法的
该源码用于图像处理初学者，用来了解相关算法的-The code is adopt to the beginner of image processing,and it will help you to understand some algorithmic about image processing.
- 2022-02-05 12:37:26下载
- 积分：1
-
用matlab 实现图像的采样,可实现128 ，64，32点采样
用matlab 实现图像的采样,可实现128 ，64，32点采样-Using matlab to achieve the image sampling, can be realized 128, 64,32-point sampling
- 2022-01-31 16:03:25下载
- 积分：1
-
vc实现画园功能
vc实现画园功能-vc achieve functional painting Park
- 2022-03-02 07:40:10下载
- 积分：1
-
image viewing and processing software
图像浏览及处理软件-image viewing and processing software
- 2022-07-25 13:14:03下载
- 积分：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
-
中点画圆算法
中点画圆算法-Drawcircle midpoint algorithm
- 2022-07-01 16:11:40下载
- 积分：1
