Compact representation of contours using directional grid chain code
Park, Heechan, Martin, Graham R. and Yu, Andy C.. (2008) Compact representation of contours using directional grid chain code. Signal Processing: Image Communication, Vol.23 (No.2). pp. 87-100. ISSN 0923-5965Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.image.2007.11.002
An efficient contour-based method for the coding of binary shape information is described. Conventional chain coding techniques show high coding efficiency for lossless compression, but they exploit the coherence of the contour in only a restricted manner. Higher coding efficiency can be achieved by realising the neighbourhood relation as a Markov chain, and this is exploited in a new coding scheme, the directional grid chain coding (DGCC). The method is computationally efficient and the coding process adapts to the inherent changes in the contour. Two schemes are proposed, a lossless and a quasi-lossless method. The lossless scheme achieves 32% saving in bit rate compared with the conventional differential chain code (DCC). The second, quasi-lossless technique achieves 44% bit reduction compared with the DCC and the distortions present in the reconstructed contour are hardly noticeable to the human eye. (c) 2007 Elsevier B.V. All rights reserved.
|Item Type:||Journal Article|
|Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
|Divisions:||Faculty of Science > Computer Science|
|Journal or Publication Title:||Signal Processing: Image Communication|
|Publisher:||Elsevier Science Inc|
|Official Date:||February 2008|
|Number of Pages:||14|
|Page Range:||pp. 87-100|
Actions (login required)