Copy the page URI to the clipboard
Sohel, Ferdous; Karmakar, Gour and Dooley, Laurence S.
(2007).
DOI: https://doi.org/10.1109/LSP.2006.882099
URL: http://ieeexplore.ieee.org/search/wrapper.jsp?arnu...
Abstract
Existing vertex-based operational rate-distortion (ORD) optimal shape coding algorithms can use a number of different distortion measurement techniques, including the shortest absolute distance (SAD), the distortion band (DB), the tolerance band (TB), and the accurate distortion measurement technique for shape coding (ADMSC). From a computational time perspective, an N-point contour requires O(N2 ) time for DB and TB for both polygon and B-spline-based encoding, while SAD and ADMSC incur O(N) time for polygonal encoding but O(N2 ) for B-spline based encoding, thereby rendering the ORD optimal algorithms computationally inefficient. This letter presents a novel distortion measurement strategy based on chord-length parameterization (DMCLP) of a boundary that incurs order O(N) complexity for both polygon and B-spline-based encoding while preserving a comparable rate-distortion performance to the original ORD optimal shape coding algorithms
Viewing alternatives
Download history
Metrics
Public Attention
Altmetrics from AltmetricNumber of Citations
Citations from DimensionsItem Actions
Export
About
- Item ORO ID
- 10516
- Item Type
- Journal Item
- ISSN
- 1070-9908
- Extra Information
- "©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE."
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Research Group
- Centre for Research in Computing (CRC)
- Depositing User
- Laurence Dooley