@inproceedings{Gerry2000a,
abstract = {In this paper, we present a rate-distortion (RD) optimized scalable vertex-based shape coding algorithm. Following the base layer, each successive enhancement layer refines a given shape approximation by optimally (within a layer) placing new vertices and perturbing existing vertices. An efficient low entropy distortion adaptive vertex coding strategy is employed to take advantage of information available from coarser layers. Based on the chosen vertex rate and distortion definitions, a resulting enhancement layer topology is solved by executing a Directed Acyclic Graph (DAG) shortest path algorithm. Finally, an iterative VLC optimization scheme is employed to find both the optimized scalable code and the most efficient set of parameter VLC tables.},
author = {Melnikov, Gerry and Katsaggelos, A.K.},
booktitle = {2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100)},
doi = {10.1109/ICASSP.2000.859211},
isbn = {0-7803-6293-4},
issn = {15206149},
pages = {1947--1950},
publisher = {IEEE},
title = {{A rate-distortion optimal scalable vertex based shape coding algorithm}},
url = {http://ieeexplore.ieee.org/document/859211/},
volume = {4},
year = {2000}
}

{"_id":"a7yeas9aoPgjyGiGb","bibbaseid":"melnikov-katsaggelos-aratedistortionoptimalscalablevertexbasedshapecodingalgorithm-2000","author_short":["Melnikov, G.","Katsaggelos, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"In this paper, we present a rate-distortion (RD) optimized scalable vertex-based shape coding algorithm. Following the base layer, each successive enhancement layer refines a given shape approximation by optimally (within a layer) placing new vertices and perturbing existing vertices. An efficient low entropy distortion adaptive vertex coding strategy is employed to take advantage of information available from coarser layers. Based on the chosen vertex rate and distortion definitions, a resulting enhancement layer topology is solved by executing a Directed Acyclic Graph (DAG) shortest path algorithm. Finally, an iterative VLC optimization scheme is employed to find both the optimized scalable code and the most efficient set of parameter VLC tables.","author":[{"propositions":[],"lastnames":["Melnikov"],"firstnames":["Gerry"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["A.K."],"suffixes":[]}],"booktitle":"2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100)","doi":"10.1109/ICASSP.2000.859211","isbn":"0-7803-6293-4","issn":"15206149","pages":"1947–1950","publisher":"IEEE","title":"A rate-distortion optimal scalable vertex based shape coding algorithm","url":"http://ieeexplore.ieee.org/document/859211/","volume":"4","year":"2000","bibtex":"@inproceedings{Gerry2000a,\nabstract = {In this paper, we present a rate-distortion (RD) optimized scalable vertex-based shape coding algorithm. Following the base layer, each successive enhancement layer refines a given shape approximation by optimally (within a layer) placing new vertices and perturbing existing vertices. An efficient low entropy distortion adaptive vertex coding strategy is employed to take advantage of information available from coarser layers. Based on the chosen vertex rate and distortion definitions, a resulting enhancement layer topology is solved by executing a Directed Acyclic Graph (DAG) shortest path algorithm. Finally, an iterative VLC optimization scheme is employed to find both the optimized scalable code and the most efficient set of parameter VLC tables.},\nauthor = {Melnikov, Gerry and Katsaggelos, A.K.},\nbooktitle = {2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100)},\ndoi = {10.1109/ICASSP.2000.859211},\nisbn = {0-7803-6293-4},\nissn = {15206149},\npages = {1947--1950},\npublisher = {IEEE},\ntitle = {{A rate-distortion optimal scalable vertex based shape coding algorithm}},\nurl = {http://ieeexplore.ieee.org/document/859211/},\nvolume = {4},\nyear = {2000}\n}\n","author_short":["Melnikov, G.","Katsaggelos, A."],"key":"Gerry2000a","id":"Gerry2000a","bibbaseid":"melnikov-katsaggelos-aratedistortionoptimalscalablevertexbasedshapecodingalgorithm-2000","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/859211/"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["KTWAakbPXLGfYseXn","ePKPjG8C6yvpk4mEK","ya2CyA73rpZseyrZ8","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":[],"search_terms":["rate","distortion","optimal","scalable","vertex","based","shape","coding","algorithm","melnikov","katsaggelos"],"title":"A rate-distortion optimal scalable vertex based shape coding algorithm","year":2000}