Scalable ideal-segmented chain coding

Mei Chen Yeh, Yen Lin Huang, Jia Shung Wang

Research output: Contribution to conferencePaper

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
PagesI/197-I/200
Publication statusPublished - 2002 Jan 1
EventInternational Conference on Image Processing (ICIP'02) - Rochester, NY, United States
Duration: 2002 Sep 222002 Sep 25

Other

OtherInternational Conference on Image Processing (ICIP'02)
CountryUnited States
CityRochester, NY
Period02/9/2202/9/25

Fingerprint

Computer aided engineering
Scalability

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Cite this

Yeh, M. C., Huang, Y. L., & Wang, J. S. (2002). Scalable ideal-segmented chain coding. I/197-I/200. Paper presented at International Conference on Image Processing (ICIP'02), Rochester, NY, United States.

Scalable ideal-segmented chain coding. / Yeh, Mei Chen; Huang, Yen Lin; Wang, Jia Shung.

2002. I/197-I/200 Paper presented at International Conference on Image Processing (ICIP'02), Rochester, NY, United States.

Research output: Contribution to conferencePaper

Yeh, MC, Huang, YL & Wang, JS 2002, 'Scalable ideal-segmented chain coding', Paper presented at International Conference on Image Processing (ICIP'02), Rochester, NY, United States, 02/9/22 - 02/9/25 pp. I/197-I/200.
Yeh MC, Huang YL, Wang JS. Scalable ideal-segmented chain coding. 2002. Paper presented at International Conference on Image Processing (ICIP'02), Rochester, NY, United States.
Yeh, Mei Chen ; Huang, Yen Lin ; Wang, Jia Shung. / Scalable ideal-segmented chain coding. Paper presented at International Conference on Image Processing (ICIP'02), Rochester, NY, United States.
@conference{8899de35592345edaeac581f7cb41f61,
title = "Scalable ideal-segmented chain coding",
abstract = "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.",
author = "Yeh, {Mei Chen} and Huang, {Yen Lin} and Wang, {Jia Shung}",
year = "2002",
month = "1",
day = "1",
language = "English",
pages = "I/197--I/200",
note = "International Conference on Image Processing (ICIP'02) ; Conference date: 22-09-2002 Through 25-09-2002",

}

TY - CONF

T1 - Scalable ideal-segmented chain coding

AU - Yeh, Mei Chen

AU - Huang, Yen Lin

AU - Wang, Jia Shung

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036453353&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036453353&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0036453353

SP - I/197-I/200

ER -