Operationally optimal vertex-based shape coding

In this article, we address the issue of operationally optimal shape encoding, which is a step in the direction of globally optimal resource allocation in object-oriented video. After an overview of shape-based coding and algorithms, we define the problem mathematically, introduce the necessary notation, and then present the basic idea behind the proposed algorithms. We then discuss the constraints imposed on the code used to encode the approximation. We then introduce a definition of distortion that fits into the proposed framework and introduce the directed acyclic graph (DAG) formulation of the problem, which results in a fast solution approach. We also show how the DAG algorithm can be used to find the approximation with the minimum-maximum segment distortion for a given rate as well as to find the approximation with the smallest total distortion for a given rate. We then present experimental results and point out directions for future research