A new vertex-based binary shape coder for high coding efficiency

Cited 12 time in webofscience Cited 18 time in scopus
  • Hit : 300
  • Download : 0
This paper proposes a new vertex-based binary shape intra coding scheme that generates a set of vertices reducing shape reconstruction error and efficiently encodes the vertices. The conventional vertex-based coding scheme uses the iterated refinement method (IRM) for vertex selection and the object-adaptive vertex encoding (OAVE) for vertex transmission. In the proposed scheme, we introduce a vertex adjustment method to be applied to the vertices selected by the IRM. The Vertex adjustment method significantly reduces the reconstruction error of binary shapes, For efficient transmission of vertices, we also propose 1D vertex detection, vertex reordering and initial vertex encoding methods. Furthermore, a conditional differential chain coding is presented for efficient lossless coding of contours. Experimental results show that the proposed vertex-based intra coding scheme reduces coded bits by 17-29% compared with the conventional vertex-based coding scheme, and by up to 27% compared with the intra coding mode of the context-based arithmetic encoding (CAE) scheme of the MPEG-4 Video Verification Model. (C) 2000 Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2000-05
Language
English
Article Type
Article
Keywords

DOMINANT POINTS; MPEG-4; COMPRESSION; CURVES

Citation

SIGNAL PROCESSING-IMAGE COMMUNICATION, v.15, no.7-8, pp.665 - 684

ISSN
0923-5965
DOI
10.1016/S0923-5965(99)00046-6
URI
http://hdl.handle.net/10203/68878
Appears in Collection
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 12 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0