Location:
Search - 3 step motion
Search list
Description: 预测编码中的运动估计3步搜索法
本程序用C语言编程实现了该算法
大家可以参考参考-Predictive coding of 3-step search motion estimation method of this procedure with C language programming of the algorithm realize everyone can refer to reference
Platform: |
Size: 5120 |
Author: 刘静 |
Hits:
Description: 运动目标提取和跟踪是视觉分析、高级行为理解以及运动编码等计算机视觉
应用领域中基本而又重要的一步，也是计算机视觉中的难点问题。本文深入研究
了运动视觉中目标的精确提取与跟踪算法，包括运动检测、阴影消除、外轮廓提
取以及目标的跟踪四个方面-Extraction and tracking of moving targets is a visual analysis, to understand high-level acts, as well as encoding movement in computer vision applications, such as basic and important step, but also in computer vision problems. In this paper, the movement in-depth study of the accuracy of visual target extraction and tracking algorithms, including motion detection, the shadow of the elimination of external contour extraction and tracking of targets in four areas
Platform: |
Size: 1581056 |
Author: 丁行 |
Hits:
Description: 数值解法
例1 用改进的欧拉方法求一阶方程初值问题的
数值解
例2 数学摆的运动方程与近似方程数值解比较
例3 四阶龙格库塔公式求数值解
Matlab实现求数值解
例1 求初值问题y =x*sin(x)-y,y(0)=0的数值
解.先编辑一个定义方程的ODEF函数文件
ODEfun1.m.
例2 求方程组初值问题的数值解,按指定步长
0.05划分节点.
例3 按指定的精度求高阶方程初值问题的数值解.-Numerical Solution of the law a method of using the improved Euler' s equation of order to a first-order initial value problem of the numerical solution of cases of two mathematical pendulum equations of motion compared with the approximate numerical solutions of equations of three cases of fourth-order Runge-Kutta numerical solution of the formula Matlab order to achieve the numerical solution of demand cases seeking an initial value problem y ' = x* sin (x)-y, y (0) = 0 the numerical solution. first, the definition of an equation editor ODEF function file ODEfun1.m. cases of two demand equations initial value problem of numerical solution, according to the specified division of the node step 0.05. Example 3 according to the specified precision of seeking higher-order equation of the numerical solution of initial value problem.
Platform: |
Size: 4096 |
Author: 率一 |
Hits:
Description: matlab平台的一些运动估计块匹配算法，包括3步法，新3步法，4步法，菱形搜索-motionsEstAnalysis.m——Script to execute all Algorithms
motionEstES.m——Exhaustive Search Algorithm
motionEstTSS.m——Three Step Search Algorithm
motionEstNTSS.m——New Three Step Search Algorithm
motionEstSESTSS.m——Simple And Efficient Search Algorithm
motionEst4SS.m——Four Step Search Algorithm
motionEstDS.m——Diamond Search Algorithm
motionEstARPSm——Adaptive Root Pattern Search Algorithm
costFuncMAD.m——Mean Absolute Difference Function
minCost.m ——minimum cost among macro blocks
motionComp.m——motion compensated image creator
imgPSNR.m ——finds image PSNR w.r.t. reference image
Platform: |
Size: 498688 |
Author: lsr |
Hits:
Description: 采用块匹配法计算相邻两帧图像的运动矢量，并显示计算的矢量结果。其中使用了opencv里面的函数。需先安装和加入opencv的库。-Using the 3 step block matching algorithm to compute the motion vector of two consecutive frames.
Platform: |
Size: 18996224 |
Author: wujin |
Hits:
Description:
股票指数模拟为几何布朗运动，GBM。 参数有五个：
s0，dt（time step），均值，标准差，到期时间T；
利用子函数进行10万条轨道的monte carlo 模拟到期日（3个月）的指数点数，从而估计在买入信号出现后，3个月后的损益情况，主要用来估算VAR-Financial risk analysis on Matlab monte carlo simulation, stock index simulation for geometric Brownian motion, GBM.
Platform: |
Size: 3072 |
Author: taowenwu |
Hits:
Description:
股票指数模拟为几何布朗运动，GBM。 参数有五个：
s0，dt（time step），均值，标准差，到期时间T；
利用子函数进行10万条轨道的monte carlo 模拟到期日（3个月）的指数点数，从而估计在买入信号出现后，3个月后的损益情况，主要用来估算VAR-Financial risk analysis on Matlab monte carlo simulation, stock index simulation for geometric Brownian motion, GBM.
Platform: |
Size: 1024 |
Author: taowenwu |
Hits:
Description: motion estimation using full search,2-D search and 3-step search-motion estimation using full search ,2-D search and 3-step search
Platform: |
Size: 17729536 |
Author: 黃韋 |
Hits:
Description: 一、算法伪码：
1、初始化：
1.1每一个空间的点映射到二维窗格，每个空间的点分配唯一的二维窗格坐标。一个窗格只能有一个点。
1.2为每一只蚂蚁在二维窗格分配唯一的地址
（第一步需要注意的是：空间上点的位置和平面窗格上点的位置完全是两回事，空间上两个点的位置来计算两点之间的距离；而平面上点的位置，主要是用来确定半径为S的区域内的点，计算两个点的空间距离，进而计算群体相似度，最后通过群体相似度来计算拾起或者放下的概率）
2、迭代tmax次
3、所有的蚂蚁运动一次
4、产生一个0-1之间的随机数R
5、如果当前蚂蚁处于未负载状态，而且当前蚂蚁所在处的有点Oi
5.1、计算群体相似度f(Oi)和拾起概率Pp(Oi)
5.2、如果拾起概率Pp(Oi)》R
5.2.1、当前蚂蚁拾起点Oi（注意Oi在窗格中的位置是不断变动的）
5.3 5.2结束
6、如果条件5不成立，如果当前蚂蚁处于负载状态，持有点Oi，而且当前位置没有其他点
6.1计算群体相似度f(Oi)和放下概率Pd(Oi)
6.2如果放下概率Pd(Oi)》R
6.2.1放下节点Oi（注意点Oi在窗格中的位置是不断变动的）
6.3 6.2结束
7、5结束
8、当前蚂蚁移到邻近区域内的没有被其他蚂蚁占据的节点
9、所有的蚂蚁运动一次结束
10、迭代tmax次结束
-First, the algorithm pseudocode: 1. Initialization: 1.1 point each to the two-dimensional space mapping pane, the point of each space is assigned a unique two-dimensional coordinates of the pane. A pane of only one point. 1.2 for each ant is assigned a unique address in the two-dimensional pane (the first step should be noted: the location and position of plane points pane space is completely different points, two points on the spatial position is calculated distance between two points and the position of the point on the plane is mainly used to determine the radius of the dot area S within the space of two points to calculate the distance, and then calculate the similarity group, and finally through group similarity calculating pickup probability plays or put down) 2, iterative tmax 3 times, once all the ants motion 4, R 5 a generates a random number between 0 and 1, if the current state of the ant is unloaded, and the current location at the little ant Oi 5.1 calculating the similar
Platform: |
Size: 333824 |
Author: chensumin |
Hits:
Description: fast three step seach algorthim with smulation
and successive elmination and smulation
Platform: |
Size: 86016 |
Author: Ghadeer
|
Hits: