Optimal inference for hierarchical skeleton abstraction

A.C. Telea, C. Sminchisescu, S.J. Dickinson

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

15 Citations (Scopus)

Abstract

Skeletons are well-known representations that accommodate shape abstraction and qualitative shape matching. However, skeletons are sometimes unstable to compute and sensitive to shape detail, thus making shape abstraction and matching difficult. To address these problems, we propose a principled framework that generates a simplified, abstracted skeleton hierarchy by analyzing the quasi-stable points of a Bayesian-inspired energy function. The resulting model is parameterized by both boundary and internal structure variations corresponding to object scale and abstraction dimensions, and trades-off reconstruction accuracy and representation parsimony. Our experimental results show that the method can produce useful multi-scale skeleton representations at a variety of abstraction levels.
Original languageEnglish
Title of host publicationPattern Recognition (Proceedings 17th International Conference, ICPR'04, Cambridge, UK, August 23-26, 2004)
Place of PublicationNew York
PublisherIEEE Computer Society
Pages19-22
Volume4
ISBN (Print)0-7695-2128-2
DOIs
Publication statusPublished - 2004

Fingerprint

Dive into the research topics of 'Optimal inference for hierarchical skeleton abstraction'. Together they form a unique fingerprint.

Cite this