-
OneNote OCR 图片识别 实例源码下载
OneNote OCR 图片识别 实例源码下载
- 2014-08-03下载
- 积分:1
-
精通matlab+GUI设计2011
适合作为MATLAB的入门级教材使用,其中GUI设计部分参考价值较高。(An elementary course of MATLAB.)
- 2017-08-05 10:20:13下载
- 积分:1
-
RegularizationPToolsPVersionP4.1
正则化工具,里面有TV正则化,用超分辨率重建(regulation tool)
- 2021-03-10 22:59:26下载
- 积分:1
-
Colony_partition
蚁群算法实现医学图像的分割,同时对比FCM算法,非常有用,可以直接运行,包含测试MRI图片(Ant-Colony algorithm for MRI image segmentation including MRI image for testing.)
- 2013-12-27 00:37:19下载
- 积分:1
-
matlab回归法做图像变化
matlab回归法做图像变化检测。有图片有结果,有论文说明,可参照使用(Matlab regression method for image change detection. There are pictures of the results, there are papers, can refer to use)
- 2017-10-25 17:39:39下载
- 积分:1
-
real-pictures-imaging
利用已有真实场景色彩图片转换为灰度图像,实现SAR成像处理,(Use of existing real scene color images converted to grayscale images, the SAR imaging processing)
- 2013-03-17 10:00:25下载
- 积分:1
-
dig_photo_2
Image Matching Fundamentals Method Document PDF Files Slide2
- 2014-03-11 16:33:37下载
- 积分:1
-
extract_feature
此工程实现提取jpeg图像的DCT系数首字母概率作为jpeg重压缩检测的特征,以此特征训练出分类模板,可以检测出一张jpeg图像是单压缩还是重压缩。(Works to achieve this extract jpeg image DCT coefficients of the first letter of the probability of detection as a jpeg heavy compression feature, this feature trained classification templates that can detect a single jpeg image compression or recompression.)
- 2021-04-02 21:39:07下载
- 积分:1
-
ICM2image_loop
对两帧图像进行ICM调试.包含内容:1估计姿态和摄像机内参数;2两幅图做四次金字塔;3利用输入特征点采用ransac算法估计姿态R, T。4sift特征匹配;5摄像机标定。(ICM images on two debugging. Contains: 1 Estimated posture and intrinsic parameters 2 two plans to do four pyramids 3 using the input feature points using ransac algorithm estimates gesture R, T. 4sift feature matching 5 camera calibration.)
- 2013-11-16 20:58:55下载
- 积分:1
-
BFSPDFS
广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始,搜索与其线连接的所有节点,按照广度方向像外扩展,直到不重复遍历所有节点;深度优先搜索是从某一节点开始,沿着其搜索到的第一个节点不断深入下去,当无法再深入的时候,回溯节点,然后再在回溯中的某一节点开始沿另一个方向深度搜索,直到不重复的遍历所有节点。
(Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)
- 2013-08-10 10:37:12下载
- 积分:1