基于局部余弦变换的一种改进的新灵活分割算法

摘要

To the problem of no overall optimal merger for one-way merger in the segmentation algorithm proposed by Wang Yongzhong,et al.,an algorithm of overall optimal search and merger was proposed.At the same time,to the unreasonable problem of merging a segment which has non-value (value-segment) and a segment whose values are zeros entirely (zeros-segment) to a large segment in Wang′s algorithm,a corresponding method to solve the problem was also proposed.The main technique is that in local cosine transform (LCT) algorithm for a single small segment the zero-extension is made first, and then each of the zero-extension segments is folded,rather than folding processing using its original neighboring data.A great deal of numerical simulat ions validate that this new improved algorithm solves several problems of the binary-based segment algorithm and Wang′s segment algorithm,and it not only obtains adapted effective segmentation result,but also there are not much more redundancy segmentations.%针对王永忠等提出的分割算法存在的单向合并非全局最优合并的问题，提出了全局最优搜索合并算法．同时，针对王永忠分割算法中，将有非零值分割段与无非零值分割段合并为一个大的分割段的不合理问题，提出了相应的解决方法．解决的途径主要体现在对每一个小分割段做自适应余弦变换时，不是采用相邻数据进行折叠处理，而是把每一个小分割段首先做零延拓后，再进行折叠处理．经过用理论模型来验证改进后的算法，解决了二进分割算法及王永忠分割算法中存在的问题，实现了对信号进行自适应的有效分割，而且没有过多的冗余分割．