Abstract
A low-complexity, lossless image compression algorithm which is suitable for real-time implementation is presented. The algorithm codes each pixel into a set of two symbols, a prefix and a suffix. The prefix is the number of most significant bits which are identical in a reference pixel, while the suffix is the remaining bits except for the left-most bit. Three methods, two fixed and one adaptive, are investigated. The results compare favorably with those obtained using other schemes.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
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.
