登录
首页 » Visual C++ » EM

EM

于 2012-02-27 发布 文件大小:3034KB
0 155
下载积分: 1 下载次数: 0

代码说明:

说明:   基于OpenCV的例程,修改实现了基于MFC对话框构架的期望最大化算法,将部份注释和运行提示译成了中文,有助于更好地理解原程序。(It s an MFC Dialog based Expectation Maximize algorithm modified from OpenCV source. Chinese comments are added to it to enchance better understand of the program.)

文件列表:

EM
..\Debug
..\.....\StdAfx.obj,105737,2012-02-15
..\.....\Test.obj,13022,2012-02-15
..\.....\Test.pch,5500708,2012-02-15
..\.....\Test.res,2172,2012-02-15
..\.....\vc60.idb,205824,2012-02-15
..\.....\vc60.pdb,372736,2012-02-15
..\ReadMe.txt,3543,2012-02-15
..\res

..\...\Test.rc2,396,2012-02-15
..\Resource.h,866,2012-02-21
..\StdAfx.cpp,206,2012-02-15
..\StdAfx.h,1054,2012-02-15
..\StdAfx.sbr,1374965,2012-02-15
..\Test.bsc,3318784,2012-02-15
..\Test.clw,818,2012-02-22
..\Test.cpp,2035,2012-02-15
..\Test.dsp,4185,2012-02-22
..\Test.dsw,531,2012-02-15
..\Test.h,1302,2012-02-15
..\Test.rc,4327,2012-02-22
..\Test.res,2240,2012-02-22
..\Test.sbr,0,2012-02-15
..\TestDlg.cpp,5599,2012-02-22
..\TestDlg.h,1500,2012-02-22
..\TestDlg.sbr,0,2012-02-15

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

发表评论

0 个回复

  • 12
    说明:  关于图像处理里的一些应用,将视觉相应算法应用到工程实际中,详细解说了算法在这里面的一些应用,很实用。(On some applications in image processing, the visual corresponding algorithm is applied to the engineering practice, a detailed explanation here below in some applications, the proposed algorithm is very practical.)
    2015-01-10 14:48:06下载
    积分:1
  • Sniffertheory
    这是根据sniffer用vc++做的一个sniffer小程序,仅供参考。(This is in accordance with sniffer with vc++ Make a sniffer applet, for informational purposes only.)
    2007-10-12 16:03:21下载
    积分:1
  • MFC-transfer-the-bmp-data
    使用usb 传输一幅bmp像素数据,项目中用的,已经验证成功(使用usb 传输一幅bmp像素数据)
    2011-10-12 17:12:17下载
    积分:1
  • StudentSystem
    用vc++的MFC做的学生成绩管理系统,包含数据库,用户名密码默认admin(Vc++ with the MFC student performance management system, including a , the default user name and password admin)
    2016-12-30 20:57:31下载
    积分:1
  • Chaotic-time-series-analysis
    混沌时间序列Matlab源程序,包含时间序列的时间延迟计算,关联积分计算,相空间重构,时间序列分解,Heaviside函数的计算,延迟时间和时间窗口计算,混沌吸引子关联维计算,重构相空间进行K_L变换,混沌吸引子关联维计算,Hurst指数分析,关联维和Kolmogorov熵计算,FFT计算序列平均周期,最大lyapunov指数计算,利用互信息法求时间延迟,混沌和噪声识别的源程序。(Matlab chaotic time series source, time includes the time series of delay calculation, correlation integral calculation, phase space reconstruction, time series decomposition, calculated Heaviside function, the delay time and the time window calculated correlation dimension of chaotic attractors calculated reconstruction phase space K_L transform computing correlation dimension of chaotic attractors, Hurst exponent analysis, correlation dimension and Kolmogorov entropy calculation, FFT calculation sequence averaging period, maximum lyapunov index, mutual information method the time delay, chaos and noise source identification.)
    2016-11-15 09:40:52下载
    积分:1
  • c-ke-jian
    这是本人上嵌入式培训时前期学校给的c课件。自己觉得不错(c ke jian )
    2013-09-04 12:24:30下载
    积分:1
  • 实现图像的无损压缩
    该程序主要实现图像的无损压缩,具体算法包括: (1)整数小波变换+SPIHT无损压缩 其中整数小波可以采用JPEG2000提供的5-3小波,也可以采用S+P变换,本程序均已给出。 (2)DPCM+算术编码 DPCM采用的是JPEG中采用的方法; (3)JPEG-LS标准 JPEG-LS的无损压缩性能非常好,超过JPEG2000。(The program mainly realize lossless image compression, the specific algorithm include: (1) integer wavelet transform SPIHT Integer Wavelet lossless compression which can be used to provide the 5-3 wavelet JPEG2000, can also adopt the S P transform, the procedures are given. (2) DPCM arithmetic coding DPCM is used in JPEG methodology (3) JPEG-LS standard JPEG-LS lossless compression of very good performance, more than JPEG2000.)
    2008-06-02 11:01:57下载
    积分:1
  • qqgame
    手机QQ游戏大厅jar可以下载到java手机上运行使用(QQgame jar)
    2020-06-25 22:20:02下载
    积分:1
  • Lesson20
    采用openGL编译程序,绘制了图形与背景反方向移动的图像(Using the the openGL compiler, draw the image of the graphics and background move in opposite directions)
    2012-06-20 16:43:20下载
    积分:1
  • zuixiaoquandingdianfugai
    给定一个赋权无向图G=(V,E),每个定点v∈U都有一个权值w(v)。如果U V,且对任意(u,v)∈E有u∈U或v∈U,就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。(Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on U that map G to a fixed-point coverage. G the right to the minimum vertex cover is contained in G refers to the right vertex of the vertex cover and minimum.)
    2020-11-19 15:59:39下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载