Shape approximation through recursive scalable layer generation

G. Melnikov*, A. K. Katsaggelos

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

4 Scopus citations


This paper presents an efficient 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 defining scalable layer recursion and base layer segment costs the problem is solved by executing a Directed Acyclic Graph (DAG) shortest path algorithm.

Original languageEnglish (US)
Number of pages4
StatePublished - 2000
EventInternational Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada
Duration: Sep 10 2000Sep 13 2000


OtherInternational Conference on Image Processing (ICIP 2000)
CityVancouver, BC

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering


Dive into the research topics of 'Shape approximation through recursive scalable layer generation'. Together they form a unique fingerprint.

Cite this