登录
首页 » matlab » eggs-image-processing

eggs-image-processing

于 2014-02-04 发布 文件大小:2741KB
0 212
下载积分: 1 下载次数: 10

代码说明:

  my package is all about image processing of counting eggs using bwareaopen to remove noise and filtering of the image, also include how many eggs are there.

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

发表评论

0 个回复

  • sampling
    this implement upsampling image using the bilinear method and repication method
    2010-12-08 12:45:45下载
    积分:1
  • hmmestimate
    给定观测序列和状态序列下估计HMM模型的参数(Given the HMM parameters under observation sequence and state sequence estimation)
    2014-02-24 23:27:19下载
    积分:1
  • YenThreshold
    Yen threshold method realized in Matlab environment based on Yen J.C., Chang F.J., and Chang S. (1995) "A New Criterion for Automatic Multilevel Thresholding" IEEE Trans. on Image Processing, 4(3): 370-378
    2012-04-07 15:04:53下载
    积分:1
  • SQPM
    用基于拉格朗日函数Hesse阵的SQP方法求解约束优化问题(Hesse matrix based on Lagrange function with the SQP method for solving constrained optimization problems)
    2011-09-06 13:12:43下载
    积分:1
  • batch_dist
    从国外精馏开源代码下载的间歇精馏的模拟程序,对于初学者应该很有用(Open source code downloaded from abroad distillation batch distillation simulation program, useful for beginners)
    2012-12-02 00:09:57下载
    积分:1
  • CEC09的测试源码以及文章 -MOEA
    CEC2009的测试源码以及文章,对于研究智能优化算法的人员很有帮助(Source code and test article CEC 2009, the study of intelligent optimization algorithm staff helpful)
    2020-09-23 16:57:50下载
    积分:1
  • M_Files
    EBMA and HBMA using MATLAB
    2010-06-10 23:48:32下载
    积分:1
  • CFO_estimation
    Carrier frequency offset estimation
    2013-07-10 18:40:07下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • fanhanfenxixitiji_yindu.pdf
    泛函分析的经典教材,有助于研究生学习非线性泛函分析的得力助手。(Functional analysis of the classic textbook, to help students learn non-linear functional analysis of right-hand man.)
    2011-11-27 02:31:39下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载