Abstract
We present a new integrated algorithm for binary arithmetic coding and probability estimation, competitive in speed and compression performance with state-of-the-art algorithms such as the QM-coder and Z-coder. The chief innovation is representing the bracketing interval width both directly and by a logarithmic approximation. Performance is evaluated by experiments using bilevel-image data sets. An open-source software version is available.
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 callDisclaimer: 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.
