An efficient boundary encoding scheme which is optimal in the rate distortion sense

Meier, Fabian W.; Schuster, G.M.; Katsaggelos, Aggelos K.

doi:10.1109/icip.1997.638660

Cited by 15 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [23], the vertices of the polygon that approximates the given boundary are allowed to be outside the set of boundary points but inside a predefined distortion band. In [24], second-order B-splines are used for the encoding of the boundary, whose control points lie within a predefined distortion band. Finally, in [25], the various optimal boundary encoding approaches we have developed are reviewed, along with the methods developed toward the solution of the same problem, by the MPEG-4 standardization effort.…”

Section: Discussionmentioning

confidence: 99%

“…is the third boundary, is the polygon used to approximate the fourth boundary, etc. Then, the minimum rate optimization problem can be stated as follows: subject to (22) whereas the minimum distortion problem is of the following form: subject to (23) The total rate in the above formulation is defined as (24) The total distortion measure is defined for class one distortion measures by (25) and for class two distortion measures by (26)…”

Section: Multiple Boundary Encodingmentioning

confidence: 99%

See 1 more Smart Citation

An optimal polygonal boundary encoding scheme in the rate distortion sense

Schuster

Katsaggelos²

1998

IEEE Trans. on Image Process.

Self Cite

View full text Add to dashboard Cite

In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a polygon, and consider the problem of finding the polygon which leads to the smallest distortion for a given number of bits. We also address the dual problem of finding the polygon which leads to the smallest bit rate for a given distortion. We consider two different classes of distortion measures. The first class is based on the maximum operator and the second class is based on the summation operator. For the first class, we derive a fast and optimal scheme that is based on a shortest path algorithm for a weighted directed acyclic graph. For the second class we propose a solution approach that is based on the Lagrange multiplier method, which uses the above-mentioned shortest path algorithm. Since the Lagrange multiplier method can only find solutions on the convex hull of the operational rate distortion function, we also propose a tree-pruning-based algorithm that can find all the optimal solutions. Finally, we present results of the proposed schemes using objects from the Miss America sequence.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Multiple Boundary Encodingmentioning

confidence: 99%

An optimal polygonal boundary encoding scheme in the rate distortion sense

Schuster

Katsaggelos²

1998

IEEE Trans. on Image Process.

Self Cite

View full text Add to dashboard Cite

show abstract

“…To address the efficient representation of the binary shape, several shape-coding methods have been developed, e.g., bitmap-based shape coders [6], [30] and contour-based shape coders [17], [31]- [33]. A good overview of these shape-coding techniques can be found in [2].…”

Section: A Mpeg-4 Shape Codingmentioning

confidence: 99%

A Rate and Distortion Analysis of Multiscale Binary Shape Coding Based on Statistical Learning

Chen

Ngan²

2007

IEEE Trans. Multimedia

View full text Add to dashboard Cite

In this paper, we propose a statistical learning-based approach to analyze the rate-distortion characteristics of MPEG-4 multiscale binary shape coding. We employ the polynomial kernel function and -Insensitive loss function for our support vector regression. To improve the accuracy of the estimation, rate and distortion related features are incorporated in the statistical learning framework. Our experimental results show that the proposed approach can achieve good performance, e.g., modelling the rate-distortion curves accurately.

show abstract

“…Vf(x, y) = [of/Ox ôf/c9y]T = {f f,]T. (4) The Sobel edge detector masks are used to calculate the gradient. '2 The magnitude of the gradient is then computed:…”

Section: The Tolerance Bandmentioning

confidence: 99%

<title>Joint optimal object shape estimation and encoding</title>

Kondi¹,

Meier

Schuster

et al. 1998

SPIE Proceedings

View full text Add to dashboard Cite

A major problem in object oriented video coding and MPEG-4 is the encoding of object boundaries. In our previous work, we presented efficient methods for the lossy encoding of object boundaries which were optimal in the rate distortion sense. In this paper, we extend our work to utilize both the original image and an initial segmentation to obtain the optimal shape representation based on the criteria we impose. The boundary detection and encoding problems are considered simultaneously. If there is low confidence on the location of the boundary, a large approximation error is allowed when encoding the boundary and vide versa. Experimental results demonstrate the effectiveness of the proposed algorithm.

show abstract

An efficient boundary encoding scheme which is optimal in the rate distortion sense

Cited by 15 publications

References 6 publications

An optimal polygonal boundary encoding scheme in the rate distortion sense

An optimal polygonal boundary encoding scheme in the rate distortion sense

A Rate and Distortion Analysis of Multiscale Binary Shape Coding Based on Statistical Learning

<title>Joint optimal object shape estimation and encoding</title>

Contact Info

Product

Resources

About