@inproceedings{wang2002optimal,
abstract = {This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and distance signals, by which a more efficient representation of the original boundary results. Curves of arbitrary order are utilized for approximating the skeleton and distance signals. For a given bit budget for a video frame, we solve the problem of choosing the number and location of the control points for all skeleton and distance signals and for all boundaries within a frame, so that the overall distortion is minimized. The problem is solved with the use of Lagrangian relaxation and a shortest path algorithm in a 4D directed acyclic graph (DAG) we propose. By defining a path selection pattern, we reduce the computational complexity of the 4D DAG shortest path algorithm from O(N/sup-5/) to O(N/sup-4/), where N is the number of admissible control points for a skeleton. A suboptimal solution is also presented for further reducing the computational complexity of the algorithm to O(N/sup-2/). The proposed algorithm outperforms experimentally other competing algorithms.},
author = {{Haohong Wang} and Schuster, G.M. Guido M and Katsaggelos, Aggelos K A.K. and Pappas, T.N. Thrasyvoulos N and Wang, Haohong and Schuster, G.M. Guido M and Katsaggelos, Aggelos K A.K. and Pappas, T.N. Thrasyvoulos N},
booktitle = {2002 IEEE Workshop on Multimedia Signal Processing.},
doi = {10.1109/MMSP.2002.1203254},
isbn = {0-7803-7713-3},
keywords = {optimaL,shape coding,skeleton decomposition},
organization = {IEEE},
pages = {85--88},
publisher = {IEEE},
title = {{An optimal shape encoding scheme using skeleton decomposition}},
url = {http://ieeexplore.ieee.org/document/1203254/},
year = {2002}
}

{"_id":"giGzodLaP3hejagbb","bibbaseid":"haohongwang-schuster-katsaggelos-pappas-wang-schuster-katsaggelos-pappas-anoptimalshapeencodingschemeusingskeletondecomposition-2002","author_short":["Haohong Wang","Schuster, G. G. M","Katsaggelos, A. K A.","Pappas, T. T. N","Wang, H.","Schuster, G. G. M","Katsaggelos, A. K A.","Pappas, T. T. N"],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and distance signals, by which a more efficient representation of the original boundary results. Curves of arbitrary order are utilized for approximating the skeleton and distance signals. For a given bit budget for a video frame, we solve the problem of choosing the number and location of the control points for all skeleton and distance signals and for all boundaries within a frame, so that the overall distortion is minimized. The problem is solved with the use of Lagrangian relaxation and a shortest path algorithm in a 4D directed acyclic graph (DAG) we propose. By defining a path selection pattern, we reduce the computational complexity of the 4D DAG shortest path algorithm from O(N/sup-5/) to O(N/sup-4/), where N is the number of admissible control points for a skeleton. A suboptimal solution is also presented for further reducing the computational complexity of the algorithm to O(N/sup-2/). The proposed algorithm outperforms experimentally other competing algorithms.","author":[{"firstnames":[],"propositions":[],"lastnames":["Haohong Wang"],"suffixes":[]},{"propositions":[],"lastnames":["Schuster"],"firstnames":["G.M.","Guido","M"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos","K","A.K."],"suffixes":[]},{"propositions":[],"lastnames":["Pappas"],"firstnames":["T.N.","Thrasyvoulos","N"],"suffixes":[]},{"propositions":[],"lastnames":["Wang"],"firstnames":["Haohong"],"suffixes":[]},{"propositions":[],"lastnames":["Schuster"],"firstnames":["G.M.","Guido","M"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos","K","A.K."],"suffixes":[]},{"propositions":[],"lastnames":["Pappas"],"firstnames":["T.N.","Thrasyvoulos","N"],"suffixes":[]}],"booktitle":"2002 IEEE Workshop on Multimedia Signal Processing.","doi":"10.1109/MMSP.2002.1203254","isbn":"0-7803-7713-3","keywords":"optimaL,shape coding,skeleton decomposition","organization":"IEEE","pages":"85–88","publisher":"IEEE","title":"An optimal shape encoding scheme using skeleton decomposition","url":"http://ieeexplore.ieee.org/document/1203254/","year":"2002","bibtex":"@inproceedings{wang2002optimal,\nabstract = {This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and distance signals, by which a more efficient representation of the original boundary results. Curves of arbitrary order are utilized for approximating the skeleton and distance signals. For a given bit budget for a video frame, we solve the problem of choosing the number and location of the control points for all skeleton and distance signals and for all boundaries within a frame, so that the overall distortion is minimized. The problem is solved with the use of Lagrangian relaxation and a shortest path algorithm in a 4D directed acyclic graph (DAG) we propose. By defining a path selection pattern, we reduce the computational complexity of the 4D DAG shortest path algorithm from O(N/sup-5/) to O(N/sup-4/), where N is the number of admissible control points for a skeleton. A suboptimal solution is also presented for further reducing the computational complexity of the algorithm to O(N/sup-2/). The proposed algorithm outperforms experimentally other competing algorithms.},\nauthor = {{Haohong Wang} and Schuster, G.M. Guido M and Katsaggelos, Aggelos K A.K. and Pappas, T.N. Thrasyvoulos N and Wang, Haohong and Schuster, G.M. Guido M and Katsaggelos, Aggelos K A.K. and Pappas, T.N. Thrasyvoulos N},\nbooktitle = {2002 IEEE Workshop on Multimedia Signal Processing.},\ndoi = {10.1109/MMSP.2002.1203254},\nisbn = {0-7803-7713-3},\nkeywords = {optimaL,shape coding,skeleton decomposition},\norganization = {IEEE},\npages = {85--88},\npublisher = {IEEE},\ntitle = {{An optimal shape encoding scheme using skeleton decomposition}},\nurl = {http://ieeexplore.ieee.org/document/1203254/},\nyear = {2002}\n}\n","author_short":["Haohong Wang","Schuster, G. G. M","Katsaggelos, A. K A.","Pappas, T. T. N","Wang, H.","Schuster, G. G. M","Katsaggelos, A. K A.","Pappas, T. T. N"],"key":"wang2002optimal","id":"wang2002optimal","bibbaseid":"haohongwang-schuster-katsaggelos-pappas-wang-schuster-katsaggelos-pappas-anoptimalshapeencodingschemeusingskeletondecomposition-2002","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/1203254/"},"keyword":["optimaL","shape coding","skeleton decomposition"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":["optimal","shape coding","skeleton decomposition"],"search_terms":["optimal","shape","encoding","scheme","using","skeleton","decomposition","haohong wang","schuster","katsaggelos","pappas","wang","schuster","katsaggelos","pappas"],"title":"An optimal shape encoding scheme using skeleton decomposition","year":2002}