-
Qu Bo Transform toolbox, which has some of the demo program to impatient, I hope...
曲波变换的工具箱,里面有一些去躁的demo程序,希望大家喜欢-Qu Bo Transform toolbox, which has some of the demo program to impatient, I hope everyone likes
- 2022-03-07 13:55:21下载
- 积分:1
-
purebasic prepared image processing procedures, the domestic rare
purebasic编写的图像处理程序,国内罕见-purebasic prepared image processing procedures, the domestic rare
- 2022-02-12 12:22:48下载
- 积分:1
-
迭代利用遗传算法得到最优分割阈值,这是美国的
利用遗传算法迭代得到分割的最优阈值,其中用了otsu法则,是otsu分割的一种改进。-Iterative use of genetic algorithm to be optimal segmentation threshold, which used the Otsu rules, Otsu segmentation is an improvement.
- 2022-03-23 01:10:31下载
- 积分:1
-
纹理分析的一个简单的例子,可以供大家参考
一个简单的纹理分析例子,可以供大家参考;-Texture analysis of a simple example, you can for your reference
- 2022-04-24 08:37:40下载
- 积分:1
-
a source image processing, including many important functions, such as : two pai...
一个图像处理源程序,包含了许多重要功能,如:对图像进行二值化,按照明暗度对图像轮廓进行提取,提取骨架,各种形态学处理,开,合,腐蚀,扩张等等,是个非常有实用价值的源码-a source image processing, including many important functions, such as : two pairs of images value, in accordance with the degree of shading profile images extracted from skeletons, various morphological, open, or, corrosion, etc. expansion, it is a very useful source of value
- 2022-04-16 02:49:53下载
- 积分:1
-
iris recognition algorithms, including positioning, in the final one, coding. Us...
虹膜识别算法,包括定位,归一化,编码。很有用的算法。-iris recognition algorithms, including positioning, in the final one, coding. Useful algorithms.
- 2023-07-11 14:30:03下载
- 积分:1
-
立体模型
stereo camera modeling
- 2023-07-08 20:30:02下载
- 积分:1
-
这是一个为352x288(或D1)和连续的阈值处理代码的重量…
这是一个对352x288(或D1)连续以及各分量阈值处理的代码,看了会对buffer的数据存储以及调用很有帮助-This is a 352x288 (or D1) and the weight of consecutive threshold treatment code will read the data storage buffer and call the very helpful
- 2022-01-26 05:30:14下载
- 积分:1
-
霍夫曼编码的具体方法:先按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。每次...
霍夫曼编码的具体方法:先按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率,读出时由该符号开始一直走到最后的“1”, 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好,就是该符号的霍夫曼编码。-Huffman code specific Methods: according to their probability of emergence of the size of the queues, the two smallest sum probability, as a new probability and the probability of the remaining re-queue, and then the smallest sum of two probabilities, and then re-queue until the last turn into one. Every time when the sum will be
- 2022-03-31 00:49:14下载
- 积分:1
-
矢量量化的C语言实现,模式识别经典问题解决
矢量量化的C语言实现,模式识别经典问题解决-Vector quantization of the C language, pattern recognition classic problem-solving
- 2022-07-06 22:40:11下载
- 积分:1