-
OTSU方法计算图像二值化的自适应阈值，OTSU 算法可以说是自适应计算单阈值（用来转换灰度图像为二值图像）的简单高效方法。下面的代码最早由 Ryan Dibb...
OTSU方法计算图像二值化的自适应阈值，OTSU 算法可以说是自适应计算单阈值（用来转换灰度图像为二值图像）的简单高效方法。下面的代码最早由 Ryan Dibble提供，此后经过多人Joerg.Schulenburg, R.Z.Liu 等修改，补正。算法对输入的灰度图像的直方图进行分析，将直方图分成两个部分，使得两部分之间的距离最大。划分点就是求得的阈值。都是老外写的，经典哦。-OTSU images calculated value of the two adaptive threshold, OTSU algorithm can be calculated adaptive threshold (for conversion to gray scale images binary images), a simple and efficient manner. The following code from the earliest to provide Ryan Dibble, after a more than Joerg.Schulenburg, R. Z. Liu amend the correction. Algorithm for the importation of gray-scale image histogram analysis of histogram is divided into two parts, Part 2 makes the distance between the largest. Demarcation point out the threshold. Foreigners are written in the classical oh.
- 2022-12-21 06:30:02下载
- 积分：1
-
在灰度图像处理的MATLAB统计的一些小程序
指纹识别设计中关于指纹方向图求取的一段matlab小程序-On the grayscale image processing matlab statistics for some small programs
- 2023-06-02 18:45:03下载
- 积分：1
-
achieve a mind trip of two
实现二维图形几何变换的心路历程（包括变换、剪切变换、平移变换、旋转）
- 2022-05-18 05:17:56下载
- 积分：1
-
告诉你如何使用DX9的HLSL语言来写着色器,这个是最简单的例子....
告诉你如何使用DX9的HLSL语言来写着色器,这个是最简单的例子.-Tell you how to use the DX9 the HLSL language to read, color, and this is the simplest example.
- 2022-03-16 00:45:22下载
- 积分：1
-
VGA IP软核Nios SOPC
vga ip core nios sopc
- 2022-08-03 08:36:53下载
- 积分：1
-
《Vis u a l C+ + 面向对象与可视化程序设计》――清华大学计算机基础教育课程系列教材...
《Vis u a l C+ + 面向对象与可视化程序设计》――清华大学计算机基础教育课程系列教材- Vis ual C++ Object-oriented programming and visualization - Tsinghua University Computer Basic Education Curriculum textbook series
- 2022-03-24 01:55:22下载
- 积分：1
-
图像的纹理分析应用编程实例，主要通过模拟分析算法描述图像的纹理结构...
图像的纹理分析应用编程实例，主要通过模拟分析算法描述图像的纹理结构-image texture analysis application programming examples, mainly through simulation analysis algorithm describes the texture structure
- 2022-07-08 06:56:36下载
- 积分：1
-
windows下24位色高质量转8位色代码
windows下24位色高质量转8位色代码-windows color under 24 to eight high-quality color code
- 2022-07-27 04:19:26下载
- 积分：1
-
冈萨雷斯《数字图像处理》第二版 中文版课后题答案
冈萨雷斯《数字图像处理》第二版 中文版课后题答案-Gonzalez, " Digital Image Processing," second edition of the Chinese version of after-school question answers
- 2022-07-08 06:41:07下载
- 积分：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
