-
完整的数字字符识别系统，VC开发，本人原创，识别率可以达到80％
完整的数字字符识别系统，VC开发，本人原创，识别率可以达到80％-complete digital character recognition system, VC, I originality, the recognition rate can reach 80%
- 2022-01-26 04:58:38下载
- 积分：1
-
利用Delphi实现桌面变换（对于window2000的系统，需把张bmp图片拷贝到从c:winnt目录下）...
利用Delphi实现桌面变换（对于window2000的系统，需把张bmp图片拷贝到从c:winnt目录下）-use Delphi desktop transform (for window2000 system, as required under Zhang bmp Photo copy from C : winnt directory)
- 2022-10-10 03:00:02下载
- 积分：1
-
显示及图像处理技术
显示和处理DIB图像-display and image processing DIB
- 2022-03-18 16:03:01下载
- 积分：1
-
BMP图象的读取 使用C语言对BMP图象进行读取和处理
BMP图象的读取 使用C语言对BMP图象进行读取和处理-BMP image reader to use C language to read BMP image processing and
- 2022-01-26 00:33:04下载
- 积分：1
-
JPEG images to BMP images loaded into the back to form a resource file
把JPEG图片加载到BMP图片后面，形成资源文件-JPEG images to BMP images loaded into the back to form a resource file
- 2023-02-18 10:25:03下载
- 积分：1
-
曼德勃罗集计算程序
曼德勃罗集计算程序-Mandelbrot set calculation program
- 2022-05-15 18:32:16下载
- 积分：1
-
opencv 4.0图像处理里程，著名的intel公司图像处理库
opencv 4.0图像处理里程，著名的intel公司图像处理库-OpenCV 4.0 image processing mileage, the famous Intel Corporation Image Processing Library!
- 2022-03-05 04:15:44下载
- 积分：1
-
像素本身，创建一个新的像素或提高现有
PIXEL, by itself, creates a new PIXEL or raises the existing
singleton*.-PIXEL, by itself, creates a new PIXEL or raises the existing
singleton*.
- 2022-06-15 14:01:06下载
- 积分：1
-
Geological mapping, geological professional applications in a very wide range, a...
地质绘图，在地质专业应用非常广泛，希望对大家有所帮助-Geological mapping, geological professional applications in a very wide range, and they hope to help everyone
- 2022-05-15 19:16:43下载
- 积分：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
