A Simple And Efficient Binary Shape Coding Technique Based On Bitmap Representation
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
When you're done, click "publish"
Only blue fields are mandatory.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
besides you has access to this list.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Full text for this article was not available? Send a request to the author(s)
: A Simple And Efficient Binary Shape Coding Technique Based On Bitmap Representation
Abstract : This document presents a technique based on the JBIG algorithm for binary shape coding in both lossless and lossy modes. Because it is applied directly to the bitmap representing the shape information, it bypasses the overhead in computation of an intermediate contour representation and its associated conversions. This leads to a simpler algorithm which is more suitable for a larger class of shape data. In addition a mechanism is proposed which allows a rate control for lossy coding mode. 1. INTRODUCTION Second generation video coding algorithms are also referred to as object oriented, that is, the scene to be coded is segmented into several regions, each of them coded separately. These regions generally identify objects. Each object is represented by four channels: three color channels and an alpha channel which defines the shape of the object. This alpha channel can be either binary or multilevel. The multilevel case allows for semi-transparent object. However the scope of this pape...
Leave a comment
This contribution has not been reviewed yet. review?