| Paper: | WP-P6.6 |
| Session: | Image Coding IV |
| Time: | Wednesday, September 19, 14:30 - 17:10 |
| Presentation: |
Poster
|
| Title: |
COMPRESSION OPTIMIZED TRACING OF DIGITAL CURVES USING GRAPH THEORY |
| Authors: |
Andras Hajdu; University of Debrecen | | |
| | Ioannis Pitas; University of Thessaloniki | | |
| Abstract: |
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-artmethod considers a quadtree decomposition of the curve to perform the substitution of the curve parts from the alphabet of line segments. In this paper, we propose a graph theory based algorithm for tracing the curve directly to eliminate the quadtree decomposition needs. This approach obviously improves the compression efficiency, as longer line segments can be used. We tune our method further by selecting optimal turns at junctions during tracing the curve. We also discuss how other application fields can take advantage of the presented approach. |
