Minmax optimal shape coding using skeleton decomposition

Haohong Wang*, G. M. Schuster, A. K. Katsaggelos

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In this paper, we consider the rate-distortion optimal encoding of shape information using a skeleton decomposition and the minimum maximum (minmax) distortion criterion. For bit budget constrained video communication applications, whose goal is to achieve as low as possible but almost constant distortion, the minmax criterion is the natural choice. We propose a 4D DAG (directed acyclic graph) shortest path algorithm implemented by dynamic programming to solve the minimum rate problem, and also provide a solution for the dual minimum distortion problem. Experimental results indicate that our algorithm has an outstanding performance compared with existing methods.

Original languageEnglish (US)
Title of host publicationProceedings - 2003 International Conference on Multimedia and Expo, ICME
PublisherIEEE Computer Society
PagesII245-II248
ISBN (Electronic)0780379659
DOIs
StatePublished - Jan 1 2003
Event2003 International Conference on Multimedia and Expo, ICME 2003 - Baltimore, United States
Duration: Jul 6 2003Jul 9 2003

Publication series

NameProceedings - IEEE International Conference on Multimedia and Expo
Volume2
ISSN (Print)1945-7871
ISSN (Electronic)1945-788X

Other

Other2003 International Conference on Multimedia and Expo, ICME 2003
CountryUnited States
CityBaltimore
Period7/6/037/9/03

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Minmax optimal shape coding using skeleton decomposition'. Together they form a unique fingerprint.

Cite this