Abstract
A similarity enrichment scheme for the application to image compression through the extension of weighted finite automata (WFA) has been recently proposed (2000) by the authors. In this paper, they first establish additional theoretical results on the extended WFA of minimum states. They then devise an effective inference algorithm and its concrete implementation through the consideration of WFA of minimum states, image approximation in least-squares, state image intensity generation via the Gauss-Seidel method, as well as the improvement of the decoding efficiency. The codec implemented in this way explicitly exemplifies the performance gain due to extended WFA under otherwise the same conditions.
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.
