Skip to Main Content
Described is an efficient and low complexity technique to encode binary sequences like the significance map generated in wavelet-based compression methods. This is achieved using a generalised form of the bintree partitioning for 1-D signals, the vector K-tree partitioning. Results show higher compression rate and lower compression time than other binary sequences compression methods. Application to the compression of phonocardiograms for teletransmission also showed higher compression rate than set partitioning in hierarchical trees.