Abstract
The problem of transitioning smoothly from one audio clip to another arises in many music consumption scenarios, especially as music consumption has moved from professionally curated and live-streamed radios to personal playback devices and services. we present the first steps toward a new method of automatically transitioning from one audio clip to another by discretizing the frequency spectrum into bins and then finding transition times for each bin. We phrase the problem as one of graph flow optimization; specifically min-cut/max-flow.
Abstract (translated)
许多音乐消费场景都面临着平滑过渡的问题,特别是在音乐消费从专业 curated 和实时流媒体广播到个人播放设备和服务转变之后。我们提出了一种新的方法来自动平滑过渡,即将频谱离散化到子集,并找到每个子集的切换时间。我们将问题表述为图流优化问题,特别是最小割/最大流问题。
URL
https://arxiv.org/abs/2301.13380
