Still image compression through exhaustive two-valued shape-adaptive searches

Summary form only given. We adapted shape-adaptive coding and the BISK algorithm to new sign and refinement encoders, with the novelty of encoding separately the refinement bits for each set of coefficients having the same prefix. This allows the algorithm to capitalize the refinement redundancy among each of these sets. The proposed sign and refinement encoders may be considered independently and may be integrated to other bit plane encoders. However, the search scheme suggests a new complete bit plane encoder defined by an exhaustive two-valued shape-adaptive search (ETSE). Even though ETSE does not include arithmetic coding, the coding performance of ETSE is competitive when compared to other wavelet-based encoders which include arithmetic coding. Furthermore, as BISK, ETSE may perform compression of images with non-regular boundary