Abstract
Karel Culik and the first author have demonstrated how Weighted Finite Automata (WFA) provide a strong tool for image compression [1, 2, 3]. In the present article we introduce an improved method for the last step of the compression algorithm: for compressing the WFA that approximates the given image. Our method is based on arithmetic coding of sparse matrices
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.
