Abstract
Shape masks are used in object-based video coding, such as MPEG-4 part 2, to specify the boundaries of a video object. The term ldquobinary shaperdquo is used to describe shape masks where each pixel is either completely inside the object or completely outside it, i.e., there is no blending of pixels at object boundaries. In this paper, we present a new lossless block-based coding algorithm for binary shapes that combines a quad-tree structure with context-based arithmetic coding. Experimental results demonstrate that this new approach provides a saving in bits generated up to approximately 66% compared to the MPEG-4 binary shape coding algorithm.
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 callMore From: IEEE Transactions on Circuits and Systems for Video Technology
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.
