Name
Abstract | ||
|---|---|---|
This paper presents an efficient contour-based method for the lossy shape coding. An object is approximated by a polygon because of its inherent quality control and the high-level shape features it intrinsically carries. For encoding the vertices of a polygon, we use the fixed length code because it has more merits than variable length code. The most important factor to determine the amount of bits for a polygon with FLC is the dynamic range of the relative addresses between consecutive vertices of a polygon. To reduce the amount of bits for a polygon, we focus on reducing the dynamic range of vertices using the center of the gravity of a triangle. Simulation results show outstanding performances of the proposed method in the rate-distortion sense. |
Year | Venue | Keywords |
|---|---|---|
2000 | EUSIPCO | shape,encoding,image reconstruction,dynamic range,gravity,transform coding |
Field | DocType | ISBN |
Topology,Polygon,Combinatorics,Polygon covering,Visibility polygon,Simple polygon,Star-shaped polygon,Affine-regular polygon,Monotone polygon,Mathematics,Complex polygon | Conference | 978-952-1504-43-3 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yun, Byoung-Ju | 1 | 0 | 0.34 |
| JongWon Yi | 2 | 11 | 2.83 |
| Seong-Dae Kim | 3 | 184 | 25.81 |