An optimal polygonal boundary encoding scheme in the rate distortion sense

DOI10.1109/83.650847zbMath0973.94012OpenAlexW2132517649WikidataQ51893350 ScholiaQ51893350MaRDI QIDQ4503318

Guido M. Schuster, Aggelos K. Katsaggelos

Publication date: 6 September 2000

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a9c761f3a3aa655d45a0d1140f675eae1e939835

zbMATH Keywords

Lagrange multiplier methodchain codesrate distortion functionlossy encoding

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (7)

Optimized polygonal approximation by dominant point deletion ⋮ Recognition of chain-coded patches with statistical methods ⋮ An efficient raster font compression for embedded systems ⋮ Speedup the optimization of maximal closure of a node-weighted directed acyclic graph ⋮ A lossy contour-based representation of segmentation maps using quadratic transformations motion prediction ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Data reduction of large vector graphics

This page was built for publication: An optimal polygonal boundary encoding scheme in the rate distortion sense