soundtouch 变速算法matlab实现
soundtouch变速主要采用WSOLA算法来进行变速。
http://www.surina.net/soundtouch/
https://blog.csdn.net/suhetao/article/details/5863477
The principle of WSOLA refer to following figure:

There are three important parameter: SequenceMs, overlapMs, seekWindowMs.
These parameters affect to the time-stretch algorithm as follows:
- DEFAULT_SEQUENCE_MS: This is the default length of a single processing sequence in milliseconds which determines the how the original sound is chopped in the time-stretch algorithm. Larger values mean fewer sequences are used in processing. In principle a larger value sounds better when slowing down the tempo, but worse when increasing the tempo and vice versa.
By default, this setting value is calculated automatically according to tempo value.
- DEFAULT_SEEKWINDOW_MS: The seeking window default length in milliseconds is for the algorithm that seeks the best possible overlapping location. This determines from how wide a sample "window" the algorithm can use to find an optimal mixing location when the sound sequences are to be linked back together.
The bigger this window setting is, the higher the possibility to find a better mixing position becomes, but at the same time large values may cause a "drifting" sound artifact because neighboring sequences can be chosen at more uneven intervals. If there's a disturbing artifact that sounds as if a constant frequency was drifting around, try reducing this setting.
By default, this setting value is calculated automatically according to tempo value.
- DEFAULT_OVERLAP_MS: Overlap length in milliseconds. When the sound sequences are mixed back together to form again a continuous sound stream, this parameter defines how much the ends of the consecutive sequences will overlap with each other.
This shouldn't be that critical parameter. If you reduce the DEFAULT_SEQUENCE_MS setting by a large amount, you might wish to try a smaller value on this.
function out = check_limits(in, min, max)
if in < min
out = min;
else if in > max
out = max;
else
out = in;
end
end
function [seekWindowLength, seekLength, overlapLength] = calcSeqParams(fs, tempo)
overlapMs = 8;
autoseq_tempo_low = 0.5;
autoseq_tempo_top = 2.0;
autoseq_at_min = 90;
autoseq_at_max = 40;
autoseq_k =(autoseq_at_max - autoseq_at_min) / (autoseq_temp_top - auto_temp_low);
autoseq_c = autoseq_at_min -autoseq_k * autoseq_temp_low;
autoseek_at_min = 20;
autoseek_at_max = 15;
autoseek_k =(autoseek_at_max - autoseek_at_min) / (autoseq_temp_top - auto_temp_low);
autoseek_c = autoseek_at_min -autoseek_k * autoseq_temp_low;
%calc sequenceMs
seq = autoseq_c + autoseq_k * tempo;
seq = check_limits(seq, autoseq_at_max, autoseq_at_min);
sequenceMs = round(seq);
seek= autoseek_c + autoseek_k * tempo;
seek= check_limits(seek, autoseek_at_max, autoseek_at_min);
seekMs = round(seek)
seekWindowLength = sequenceMs * fs / 1000;
seekLength = seekMs * fs /1000;
overlapLength = overlapMs * fs / 1000;
overlapLength = overlapLength - mod(overlapLength, 8);
end
function corr = calcCrossCorr(mixingSeg, compareSeg)
len = length(compareSeg(:,1));
corr = 0;
norm = 0;
for i = 1: 1 : len
corr = corr + mixingSeg(i) * compareSeg(i);
norm = norm + mixingSeg(i) * mixingSeg(i);
end
corr = corr / sqrt(norm);
end
function offset = seekBestOverlapPosition(seekWindow, compareSeg, overlapLength, seekLength)
bestCorr = calcCrossCorr(seekWindow(1:overlapLength, 1), compareSeg);
offset = 1;
for i = 2 : 1 : seekLength
corr = calcCrossCorr(seekWindow(i:i + overlapLength, 1), compareSeg);
if corr > bestCorr
bestCorr = corr;
offset = i;
end
end
end
function output = overlap(rampUp, rampDown)
len=length(rampDown);
for i = 1:1:len
output(i,1) = rampUp(i) * i / len + rampDown(i) * (len - i) / len;
end
end
function [output, outpos, lastCompare, inpos] = processSamples(input, inputLen, expectOutputLen, compareSeg, overlapLength, seekLength, seekWindowLength, tempo, isBeginning)
nominalSkip = tempo * (seekWindowLength - overlapLength);
sampleReq = max(round(nominalSkip) + overlapLength, seekWindow);
inpos = 1;
outpos = 1;
offset = 0;
skipFract = 0;
while inputLen - inpos >= sampleReq
if isBeginning == 0
offset = seekBestOverlapPosition(input(inpos : inpos + overlapLength + seekLength - 1, 1), compareSeg, overlapLength, seekLength);
output(outpos:outpos + overlapLength - 1, 1) = overlap(input(inpos + offset : inpos + offset + overlapLength - 1, 1), compareseg);
ouputpos = outpos + overlapLength;
offset = offset + overlapLength;
else
isBeginning = 0;
skip = round(tempo * overlapLength);
skipFract = skipFract - skip;
end
temp = (seekWindowLength - 2 * overlapLength);
if outpos + tmep < expectOutputLen
output(outpos : outpos + temp - 1, 1) = input (inpos + offset : inpos + offset + temp - 1, 1);
outpos = outpos + temp;
else
output(outpos : expectOutputLen, 1) = input (inpos + offset : inpos + offset + expectOutputLen- outpos, 1);
outpos = expectOutputLen;
beak;
end
compareSeg = input (inpos + offset + temp: inpos + offset + temp +overlapLength - 1, 1);
skipFract = skipFract + nominalSkip;
ovlSkip = floor(skipFract);
skipFract = skipFract - ovlSkip;
inpos = inpos + ovlSkip;
end
lastCompare = compareSeg;
end
function output = changeTempo(input, fs, tempo)
inputLen = length(input(:,1));
outputLen = round(inputLen / tempo);
output = zeros(outputLen, 1);
[seekWindowLength, seekLength, overlapLength] = calcSeqParams(fs, tempo);
isBeginning = 1;
compareBuf = zeros(overlapLength, 1);
expectOutLen = outputLen;
[output, outpos, compareBuf, inpos] = processSamples(input, inputLen, expectOutLen, compareBuf, overlapLength, seekLength, seekWindowLength, tempo, isBeginning);
remainningSamples = inputLen - inpos;
%append zeros to the remainning data
remainningLen = remainningSamples + 200 * 128;
remainningInput = zeros(remainningLen, 1);
remainningInput(1:remainningSamples, 1) = input(inpos:inpos + remainningSamples - 1, 1);
if outputLen > outpos
expectOutLen = outputLen - outpos + 1;
isBeginning = 0;
[tempOutput, tempOutpos, compareBuf, inpos] = processSamples(remainingInput, remainingInputLen, expectOutLen, compareBuf, overlapLength, seekLength, seekWindowLength, tempo, isBeginning);
output(outpos:outputLen, 1) = tempOutput(1: tempOutpos);
end
end
main.m:
clc;
clear all;
[input fs] = wavread('test.wav');
tempo = 2;
output = changeTempo(input, fs, tempo);
wavwrite(output, fs, 'output.wav');
soundtouch 变速算法matlab实现的更多相关文章
- soundtouch变速wsola算法之改进
soundtouch变速算法很类似sola算法,细看才知道是wsola算法. 上个星期有个需求,将该变速应用到直播的包处理,有点类似于webrtc的netEQ处理机制. 直接使用soundtouch, ...
- OLA音频变速算法的仿真与剖析
前段时间,在尝试音乐节拍数的提取时,终于有了突破性的进展,效果基本上比市面上的许多商业软件还要好,在作节拍数检测时,高频信息作用不大, 通过重采样减小运算量.重采样让我想起了在学校里面做的变速变调算法 ...
- 标准差分进化算法matlab程序实现(转载)
标准差分进化算法matlab程序实现 自适应差分演化算法方面的Matlab和C++代码及论文 差分进化算法 DE-Differential Evolution matlab练习程序(差异演化DE) [ ...
- 密度峰值聚类算法MATLAB程序
密度峰值聚类算法MATLAB程序 凯鲁嘎吉 - 博客园 http://www.cnblogs.com/kailugaji/ 密度峰值聚类算法简介见:[转] 密度峰值聚类算法(DPC) 数据见:MATL ...
- GWO(灰狼优化)算法MATLAB源码逐行中文注解(转载)
以优化SVM算法的参数c和g为例,对GWO算法MATLAB源码进行了逐行中文注解. tic % 计时器 %% 清空环境变量 close all clear clc format compact %% ...
- 每天进步一点点------Alpha半透明图形叠加算法Matlab+Verilog实现
Alpha图形叠加算法Matlab+Verilog实现 1.1. Alpha算法的研究 Alpha通道是一个8位的灰度通道,该通道用256级灰度来记录图像中的透明度信息,定义透明.不透明和半透明区域, ...
- 医学CT图像特征提取算法(matlab实现)
本科毕设做的是医学CT图像特征提取方法研究,主要是肺部CT图像的特征提取.由于医学图像基本为灰度图像,因此我将特征主要分为三类:纹理特征,形态特征以及代数特征,每种特征都有对应的算法进行特征提取. 如 ...
- 蚁群算法matlab实现
大家好,我是小鸭酱,博客地址为:http://www.cnblogs.com/xiaoyajiang 以下用matlab实现蚁群算法: %蚂蚁算法test %用产生的一个圆上的十个点来检验蚂蚁 ...
- 多源最短路Floyd 算法————matlab实现
弗洛伊德(Floyd)算法是一种用于寻找给定的加权图中顶点间最短路径的算法.该算法名称以创始人之一.1978年图灵奖获得者.斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名. 基本思想 通过Floyd计 ...
随机推荐
- Spring中@Value用法
Spring中可以通过@Value注解,将properties配置文件中的属性值注入到java成员变量,配置和使用方法如下(大部分转自csdn,也有自己实验部分): 一.配置 首先,@value需要参 ...
- 文件下载(download) 前后台备注自用
1.后台 1.1 ResponseBean 返回封装的格式 @Data @Accessors(chain = true) public class ResponseBean { private Str ...
- python + excel工资条自动生成
年终绩效分配结果出来了,领导要求每人要清楚地知道自己的情况.要求:总绩效和各分类都要清楚.这就表示我们要给每人六个纸条,一个总的,五个分的.打出来,裁开,分发给每个人!累死人.所以,我就想能否每人生成 ...
- QQ常用表情
以下表情均为QQ官方表情原图,版权归QQ所有,禁止用于商业用途.  ![3nEaFJ.p ...
- (转)java 多线程 对象锁&类锁
转自:http://blog.csdn.net/u013142781/article/details/51697672 最近工作有用到一些多线程的东西,之前吧,有用到synchronized同步块,不 ...
- 到底什么是.NET?
.NET 概念比较庞大,本文只讨论基础知识,只用简单语言描述. 我们是NET程序员,但是我们有没有思考过到底什么是.NET ? 官方定义 .NET是微软推出来的一个致力于敏捷开发的软件框架. 大概2 ...
- Python 测试代码 初学者笔记
单元测试 每完成一个单元测试,Python都会打印一个字符: 测试通过打印一个句点:测试引发错误打印E:测试导致断言失败打印F 模块unittest import unittest from name ...
- Selenium实战(二)——调用JavaScript之execute_script()方法
1.浏览器滚动条的拖动,不能依靠WebDriver提供的API来实现,用于调整浏览器滚动条位置的JavaScript代码如下: window.scrollTo(0,450); window.scrol ...
- HTML+PHP+MySQL 制作最基础的登录页面及验证
第一步 进入mysql操作终端 新建一个数据库web1:create database web1; 然后在这个数据库里面新建一张表test:create table test(user varchar ...
- java流程控制结构
一.流程控制分三类 1. 顺序结构 - 程序是从上往下,从左往右执行 2. 选择结构(判断结构) - if语句 A. if(关系表达式){语句体} - 执行流程:成立就执行语句体,不成立就不执行 B. ...