Operationally optimal vertex-based shape coding. Schuster, G., Melnikov, G., & Katsaggelos, A. IEEE Signal Processing Magazine, 15(6):91–108, IEEE, 1998. Paper doi abstract bibtex A framework for the rate-distortion operationally optimal encoding of shape information in the intra mode is presented. It is shown that each curve approximation has a natural order. If the control-point encoding scheme is matched to this order and the distortion is carefully defined, then the optimal approximation can be found using a directed acyclic graph (DAG)-shortest-path algorithm. The minimum-maximum distortion optimization problem and the minimum total (average) distortion optimization problem can be both solved by similar means, using an appropriate definition of the DAG weight function.
@article{Guido1998,
abstract = {A framework for the rate-distortion operationally optimal encoding of shape information in the intra mode is presented. It is shown that each curve approximation has a natural order. If the control-point encoding scheme is matched to this order and the distortion is carefully defined, then the optimal approximation can be found using a directed acyclic graph (DAG)-shortest-path algorithm. The minimum-maximum distortion optimization problem and the minimum total (average) distortion optimization problem can be both solved by similar means, using an appropriate definition of the DAG weight function.},
author = {Schuster, G.M. and Melnikov, Gerry and Katsaggelos, A.K.},
doi = {10.1109/79.733498},
issn = {10535888},
journal = {IEEE Signal Processing Magazine},
number = {6},
pages = {91--108},
publisher = {IEEE},
title = {{Operationally optimal vertex-based shape coding}},
url = {http://ieeexplore.ieee.org/document/733498/},
volume = {15},
year = {1998}
}
Downloads: 0
{"_id":"B9ini4i8fSu9kzAF4","bibbaseid":"schuster-melnikov-katsaggelos-operationallyoptimalvertexbasedshapecoding-1998","author_short":["Schuster, G.","Melnikov, G.","Katsaggelos, A."],"bibdata":{"bibtype":"article","type":"article","abstract":"A framework for the rate-distortion operationally optimal encoding of shape information in the intra mode is presented. It is shown that each curve approximation has a natural order. If the control-point encoding scheme is matched to this order and the distortion is carefully defined, then the optimal approximation can be found using a directed acyclic graph (DAG)-shortest-path algorithm. The minimum-maximum distortion optimization problem and the minimum total (average) distortion optimization problem can be both solved by similar means, using an appropriate definition of the DAG weight function.","author":[{"propositions":[],"lastnames":["Schuster"],"firstnames":["G.M."],"suffixes":[]},{"propositions":[],"lastnames":["Melnikov"],"firstnames":["Gerry"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["A.K."],"suffixes":[]}],"doi":"10.1109/79.733498","issn":"10535888","journal":"IEEE Signal Processing Magazine","number":"6","pages":"91–108","publisher":"IEEE","title":"Operationally optimal vertex-based shape coding","url":"http://ieeexplore.ieee.org/document/733498/","volume":"15","year":"1998","bibtex":"@article{Guido1998,\nabstract = {A framework for the rate-distortion operationally optimal encoding of shape information in the intra mode is presented. It is shown that each curve approximation has a natural order. If the control-point encoding scheme is matched to this order and the distortion is carefully defined, then the optimal approximation can be found using a directed acyclic graph (DAG)-shortest-path algorithm. The minimum-maximum distortion optimization problem and the minimum total (average) distortion optimization problem can be both solved by similar means, using an appropriate definition of the DAG weight function.},\nauthor = {Schuster, G.M. and Melnikov, Gerry and Katsaggelos, A.K.},\ndoi = {10.1109/79.733498},\nissn = {10535888},\njournal = {IEEE Signal Processing Magazine},\nnumber = {6},\npages = {91--108},\npublisher = {IEEE},\ntitle = {{Operationally optimal vertex-based shape coding}},\nurl = {http://ieeexplore.ieee.org/document/733498/},\nvolume = {15},\nyear = {1998}\n}\n","author_short":["Schuster, G.","Melnikov, G.","Katsaggelos, A."],"key":"Guido1998","id":"Guido1998","bibbaseid":"schuster-melnikov-katsaggelos-operationallyoptimalvertexbasedshapecoding-1998","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/733498/"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["KTWAakbPXLGfYseXn","ePKPjG8C6yvpk4mEK","ya2CyA73rpZseyrZ8","37Qfzv6wRptYkoSCL","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":[],"search_terms":["operationally","optimal","vertex","based","shape","coding","schuster","melnikov","katsaggelos"],"title":"Operationally optimal vertex-based shape coding","year":1998}