-
NovelMultipleDescriptionScalableSpeechCodeBasedonS
提出一种多描述分层语音编码器,基于正弦和等效矩形带宽模型,将正弦和噪声模型参数根据能量大小进行适当分配以得到不同的描述和感知层(A layered multiple description speech coder based on the sinusoidal model and the equivalent rectangular bandwidth will be sinusoidal and noise model parameters in accordance with the energy distribution of the size appropriate to get different descriptions and perceptual layer)
- 2007-08-07 14:49:40下载
- 积分:1
-
hough
说明: 这是一个基于matlab的Hough变换源代码,很简洁但很实用(This is a Hough transform based on the matlab source code, very simple but very practical)
- 2009-08-05 20:56:39下载
- 积分:1
-
mmread
运动目标的检测,可以检测出车辆的移动轨迹(Moving Target Detection)
- 2012-05-23 03:45:56下载
- 积分:1
-
OVSF
enjoy with this script of Ovsf in Matlab
- 2010-11-05 16:38:16下载
- 积分:1
-
shanchen
LBM方法的shan-chen两相流分离模拟(LBM method shan-chen two-phase separation simulation)
- 2013-09-13 16:33:34下载
- 积分:1
-
FastICA
This is FastICa(Matlab version).
- 2010-12-29 15:57:10下载
- 积分:1
-
waveletdenoising_sound
关于语音信号的小波阈值降噪,希望对大家有用。(About the speech signal wavelet threshold de-noising, hope useful for everyone)
- 2014-12-11 16:51:02下载
- 积分:1
-
EKF-SLAM
通过小车机器模型,检测路标,比较扩展卡尔曼滤波在slam中的应用(The application of extended Kalman filter in slam by car model, detection of landmarks)
- 2017-04-28 14:39:32下载
- 积分:1
-
分支定界法
说明: 分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1]
通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分:1
-
Giai-PT-bac-2II
Giai Phuong trinh bac hai using mablab
- 2014-09-05 01:18:01下载
- 积分:1