-
meaningful two
有意义的两维数据图像类-meaningful two-dimensional image data type
- 2022-03-11 06:59:10下载
- 积分：1
-
一个将图像转化为256色位图的代码
一个将图像转化为256色位图的代码-an image into a 256-color bitmap code
- 2022-08-23 01:25:21下载
- 积分：1
-
Huffman算法，delphi Huffman算法利用图像压缩。
HUFFMAN 算法,delphi用huffman算法实现图象的压缩.-HUFFMAN algorithm, delphi Huffman algorithm using image compression.
- 2022-03-19 09:41:31下载
- 积分：1
-
1-32是：图形应用篇
33-66是：界面设计篇
67-84是：图形处理篇
85-100是：数值分析篇-1-32 is: the application of articles 33-66 graphics is: interface design articles 67-84 is: graphics processing chapter 85-100 are: Numerical Analysis Section
- 2022-03-06 09:10:34下载
- 积分：1
-
graphics source
图形学原代码――――画虚的直线和曲线-graphics source-abstract paintings and the linear curve
- 2022-05-18 20:15:26下载
- 积分：1
-
图象平滑的原代码
图象平滑的原代码-image smoothing the original code
- 2022-02-01 00:48:23下载
- 积分：1
-
注意，本程序的细化算法要应用于含线条的黑白二值图像才可以看出细化效果。
注意，本程序的细化算法要应用于含线条的黑白二值图像才可以看出细化效果。-Note that the thinning algorithm of this procedure should be used with lines of black and white binary image thinning effect can be seen.
- 2023-01-01 00:45:05下载
- 积分：1
-
canny realization source. Single process to facilitate learning. Notes have sour...
canny的实现源码。单一程序方便学习。源码有注释方便解读-canny realization source. Single process to facilitate learning. Notes have source code to facilitate reading
- 2022-10-12 04:20:03下载
- 积分：1
-
实验七参数转换,测绘地理坐标系转换。在ARCGIS下用VBA写的，需知道椭球转换的7个参数...
实验七参数转换,测绘地理坐标系转换。在ARCGIS下用VBA写的，需知道椭球转换的7个参数-qicanshuzhuanhuan
- 2022-02-15 23:07:10下载
- 积分：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
