Sciweavers

Share
ICIP
2000
IEEE

Shape Approximation Through Recursive Scalable Layer Generation

12 years 3 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms of minimizing the shape distortion at full reconstruction subject to the total for all scalable layers bit budget constraint. Based on the chosen vertex-based representation, we solve the problem of determining the number and locations of approximating vertices for all scalable layers jointly and optimally. The number of scalable layers is not constrained, but, rather, is a by-product of the proposed optimization. The algorithm employs two different coding strategies: one for the base layer and one for the enhancement layers. By carefully de ning scalable layer recursion and base layer segment costs the problem is solved by executing a Directed Acyclic Graph DAG shortest path algorithm.
Gerry Melnikov, Aggelos K. Katsaggelos
Added 25 Oct 2009
Updated 27 Oct 2009
Type Conference
Year 2000
Where ICIP
Authors Gerry Melnikov, Aggelos K. Katsaggelos
Comments (0)
books