Scalable ideal-segmented chain coding

Mei Chen Yeh*, Yen Lin Huang, Jia Shung Wang

*此作品的通信作者

研究成果: 會議貢獻類型會議論文同行評審

7 引文 斯高帕斯(Scopus)

摘要

In this paper, we present an optimal chain-code-like representation to code contour shapes; in addition, this representation can be easily extended to as a scalable form which structures shape data as the base layer followed by two enhancement layers. Lossy coding scheme is also presented for low-bit-rate applications. Compared with the block-based CAE method in MPEG-4 and DCC with arithmetic coder, our method not only has the higher compression ratio with less computation steps, but also can be applied to layered transmission. The scalability achieved by our scheme can be recognized in both spatial and quality-wise. Compared with another scalable shape coding methods, our scheme is simple but more efficient than progressive polygon encoding methods. In case of the base layer with distortion Dn = 0.02, our scheme saves about 20∼30% amount of bits, that is, we have a smaller size base layer, which is important in layered transmission.

原文英語
頁面I/197-I/200
出版狀態已發佈 - 2002 一月 1
對外發佈
事件International Conference on Image Processing (ICIP'02) - Rochester, NY, 美国
持續時間: 2002 九月 222002 九月 25

其他

其他International Conference on Image Processing (ICIP'02)
國家/地區美国
城市Rochester, NY
期間2002/09/222002/09/25

ASJC Scopus subject areas

  • 硬體和架構
  • 電腦視覺和模式識別
  • 電氣與電子工程

指紋

深入研究「Scalable ideal-segmented chain coding」主題。共同形成了獨特的指紋。

引用此