Abstract

This papers investigates linear binary wavelet transforms: convolutions of finite sequences of binary numbers with binary filters. These wavelets can be implemented using binary arithmetic only, which makes calculations simple and fast in practice. The paper presents some results that characterize binary wavelets completely for signal lengths that are powers of two. In addition, a design strategy is proposed that produces forward filters and inverse filters simultaneously by subsequently doubling the lengths of the filters. The paper concludes by investigating the effect of filter length on the compression of binary images.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.