To the problem of no overall optimal merger for one-way merger in the segmentation algorithm proposed by Wang et al., (1999), we propose a method of overall optimal search and merger. At the same time, for the 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 method, we also propose a corresponding method to solve the problem. The main techniques use the local cosine transform (LCT) algorithm for a single small segment, rather than folding processing using its original neighboring data, instead of making zero extension, and then fold the each zero-extension segment. A great deal of numerical simulations validate that this new improved technique solves several problems of the binary-based segment algorithm and Wang's segment algorithm; it not only obtains adapted effective segmentation results, but also there are not many redundancy segmentations.
[1]
M. Victor Wickerhauser,et al.
Adapted wavelet analysis from theory to software
,
1994
.
[2]
Ronald R. Coifman,et al.
Entropy-based algorithms for best basis selection
,
1992,
IEEE Trans. Inf. Theory.
[3]
G. Weiss,et al.
Local sine and cosine bases of Coifman and Meyer and the construction of smooth wavelets
,
1993
.
[4]
M. Victor Wickerhauser,et al.
Adapted local trigonometric transforms and speech processing
,
1993,
IEEE Trans. Signal Process..
[5]
Y. Meyer,et al.
Remarques sur l'analyse de Fourier à fenêtre
,
1991
.
[6]
Ru-Shan Wu,et al.
New flexible segmentation technique in seismic data compression using local cosine transform
,
1999,
Optics & Photonics.