Summary Best-basis searching algorithm based on binary (in general, Mary) segmentation was constructed by Coifman and Wickerhauser (1992) and widely used for signal processing. However, there are several problems with the binary scheme. First the binary segmentation is in flexible in grouping signals along the axis. Secondly, the binary based segmentation method is very sensitive to timespace shifts of the original signal, such that the resulted best-basis will change a great deal if the signal is shifted by some samples. Thirdly, the reconstruction distortion after compression is relatively strong. Wu and Wang(1999) have designed a new flexible segmentation algorithm with arbitrary timespace segmentation which addresses the above mentioned problems caused by the binary segmentation scheme.