@inproceedings{Gerry2000b,
abstract = {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.},
author = {Melnikov, G. and Katsaggelos, A.K.},
booktitle = {Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)},
doi = {10.1109/ICIP.2000.899864},
pages = {915--918 vol.2},
publisher = {IEEE},
title = {{Shape approximation through recursive scalable layer generation}},
url = {http://ieeexplore.ieee.org/document/899864/},
volume = {2},
year = {2000}
}

{"_id":"qA3rvjSCA2hNMmRqo","bibbaseid":"melnikov-katsaggelos-shapeapproximationthroughrecursivescalablelayergeneration-2000","author_short":["Melnikov, G.","Katsaggelos, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"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.","author":[{"propositions":[],"lastnames":["Melnikov"],"firstnames":["G."],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["A.K."],"suffixes":[]}],"booktitle":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","doi":"10.1109/ICIP.2000.899864","pages":"915–918 vol.2","publisher":"IEEE","title":"Shape approximation through recursive scalable layer generation","url":"http://ieeexplore.ieee.org/document/899864/","volume":"2","year":"2000","bibtex":"@inproceedings{Gerry2000b,\nabstract = {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.},\nauthor = {Melnikov, G. and Katsaggelos, A.K.},\nbooktitle = {Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)},\ndoi = {10.1109/ICIP.2000.899864},\npages = {915--918 vol.2},\npublisher = {IEEE},\ntitle = {{Shape approximation through recursive scalable layer generation}},\nurl = {http://ieeexplore.ieee.org/document/899864/},\nvolume = {2},\nyear = {2000}\n}\n","author_short":["Melnikov, G.","Katsaggelos, A."],"key":"Gerry2000b","id":"Gerry2000b","bibbaseid":"melnikov-katsaggelos-shapeapproximationthroughrecursivescalablelayergeneration-2000","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/899864/"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["KTWAakbPXLGfYseXn","ePKPjG8C6yvpk4mEK","qhF8zxmGcJfvtdeAg","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":[],"search_terms":["shape","approximation","through","recursive","scalable","layer","generation","melnikov","katsaggelos"],"title":"Shape approximation through recursive scalable layer generation","year":2000}