登录
首页 » C++ » BinImage

BinImage

于 2013-10-07 发布 文件大小:1KB
0 54
下载积分: 1 下载次数: 47

代码说明:

  使用opencv实现最大类间距离、最大熵和迭代法求图像二值化阈值,供大家参考;(Using opencv achieve maximum class distance, maximum entropy and iterative method for image binarization threshold, for your reference )

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • digital-multimeter
    基于430单片机的数字万用表,可以测来量电阻、电流、电压。精确度达0.1 (Based on 430 single chip digital multimeter, can be measured to the amount of resistance, current, voltage. An accuracy of 0.1 )
    2011-05-17 01:18:27下载
    积分:1
  • C#底层服务框架
    分析了传统DSS的弊端,引出电子商务环境下的DSS应用新模式.针对原有决策电子市场的框架结构,进行相对的完善,给出了一个新决策电子市场模型,并分 析了新模式下完成一次交易事务的全过程.在此基础上,阐述了决策资源描述的重要性,并根据owl-s描述Web服务的框架,对电子市场中的DSS资源进行 针对性的描述.利用新市场模型和资源描述框架,可以有效完善市场功能并形成新模式下相对通用的DSS资源描述方案.
    2022-03-12 19:26:41下载
    积分:1
  • YB12864ZB
    液晶显示模块YB12864ZB使用说明书(LCD module YB12864ZB manual)
    2012-07-25 19:21:35下载
    积分:1
  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • c#浏览器源码
    编写一嵌入IE内核的浏览器; 拥有标准浏览器的地址访问、前进、后退、保存、查看源文件等功能;  地址栏能记录访问历史,自动补全等; 支持多标签模式(每个标签是个浏览器页面,区别于多窗口);
    2022-08-07 13:48:26下载
    积分:1
  • source
    IR 解码与编码相关,能用一个IR来控制所有的设备控制(IR DECOD)
    2014-09-05 11:25:45下载
    积分:1
  • normally-distributed-random
    利用c语言生成符合正态分布的随机数,并在matlab程序中画出曲线图,并与理论值比较(Use c language to generate normally distributed random numbers and draw graphs in matlab program)
    2013-12-28 17:03:36下载
    积分:1
  • 样本熵近似熵LZC
    说明:  样本熵、近似熵、lempel-ziv函数代码。lempel-ziv复杂度是一种表征时间序列里出现新模式的速率的方法(the codes of approximate entropy, sample entropy and lempel-ziv function)
    2021-01-27 16:25:08下载
    积分:1
  • stmf4 lwip实现httpserver
    stmf4开发板中http服务器项目,裸板跑lwip, RMII接口的以太网LAN8702A PHY芯片
    2023-03-11 22:05:03下载
    积分:1
  • AML-Efficient-Approximate-Membership
    AML EFFICIENT APPROXIMATE MEMBERSHIP LOCALIZATION WITHIN A WEB-BASED JOIN FRAMEWORK ABSTRACT: In this paper, we propose a new type of Dictionary-based Entity Recognition Problem, named Approximate Membership Localization (AML). The popular Approximate Membership Extraction (AME) provides a full coverage to the true matched substrings from a given document, but many redundancies cause a low efficiency of the AME process and deteriorate the performance of real-world applications using the extracted substrings. The AML problem targets at locating non overlapped substrings which is a better approximation to the true matched substrings without generating overlapped redundancies. In order to perform AML efficiently, we propose the optimized algorithm P-Prune that prunes a large part of overlapped redundant matched substrings before generating them.
    2013-12-15 16:45:53下载
    积分:1
  • 696518资源总数
  • 104388会员总数
  • 18今日下载