-
用VC做的一个不规则按钮的实例,希望对大家有所帮助!
用VC做的一个不规则按钮的实例,希望对大家有所帮助!-failed to translate
- 2022-04-17 17:14:37下载
- 积分:1
-
一个dos下的c语言仿windows界面,用在一个pII+128MRAM+dos+640*480*8+pc104总线工控机上,主要用了自己写的几个画图函数,技术
一个dos下的c语言仿windows界面,用在一个pII+128MRAM+dos+640*480*8+pc104总线工控机上,主要用了自己写的几个画图函数,技术上很简单。因为一些原因,很多东西删掉了。可以拿去参考-a dos c language of imitation windows interface used in a Arrears 128MRAM dos 640* 480* 8 Module Bus Computer, the principal used their written several drawing function, technically very simple. For some reason, many things deleted. Reference can be found
- 2023-03-14 13:20:04下载
- 积分:1
-
a combination of a large number of graphics VB code of the source. Very referenc...
一个集合了大量VB绘图功能代码的源程序。非常有参考价值。本人珍藏。-a combination of a large number of graphics VB code of the source. Very reference value. I treasure.
- 2022-03-25 08:07:37下载
- 积分:1
-
surf特征点检测和匹配
surf算法的具体实现:
Surf算法原理
(1)、构建Hessian矩阵
(2)、构建尺度空间
图像的尺度空间是这幅图像在不同解析度下的表示,由式(4)知,一幅图像j(X)在不同解析度下的表示可以利用高斯核G(£)的卷积来实现,图像的尺度大小一般用高斯标准差来表示[6]。在计算视觉领域,尺度空间被象征性的表述为一个图像金字塔,其中,输入图像函数反复与高斯函数的核卷积并反复对其进行二次抽样,这种方法主要用于Sift算法的实现,但每层图像依赖于前一层图像,并且图像需要重设尺寸,因此,这种计算方法运算量较大,而SURF算法申请增加图像核的尺寸,这也是SIFT算法与SURF算法在使用金字塔原理方面的不同。算法允许尺度空间多层图像同时被处理,不需对图像进行二次抽样,从而提高算法性能。图1(a)是传统方式建立一个如图所示的金字塔结构,图像的寸是变化的,
- 2022-04-15 04:54:37下载
- 积分:1
-
图像组合项目
目前正在进行缩放和缩放图像,和合并 2 图像的项目。很好的工具,为结合样本图像的背景图像。
- 2023-03-26 17:05:04下载
- 积分:1
-
边缘提取的源代码,要的就下,很有用的。
边缘提取的源代码,要的就下,很有用的。- The edge withdraws the source code, wants under, very useful.
- 2022-04-19 03:27:20下载
- 积分:1
-
Visual C++数字图像模式识别及工程实践 源代码
Visual C++数字图像模式识别及工程实践 源代码-Visual C++ Digital image pattern recognition and engineering practice source code
- 2022-02-13 03:20:36下载
- 积分: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
-
最新图像解码源码库。
最新图像解码源码库。-The latest source code library image decoding.
- 2023-05-31 15:45:03下载
- 积分:1
-
图像区域选择
image zone selection
- 2022-03-03 03:08:26下载
- 积分:1