A Visibility Graph based Shape Decomposition Technique

Foteini Fotopoulou, Emmanouil Z. Psarakis

2014

Abstract

In this paper, a new shape decomposition method named Visibility Shape Decomposition (VSD) is presented. Inspired from an idealization of the visibility matrix having a block diagonal form, the definition of a neighborhood based visibility graph is proposed and a two step iterative algorithm for its transformation into a block diagonal form, that can be used for a visually meaningful decomposition of the candidate shape, is presented. Although the proposed technique is applied to shapes of the MPEG7 database, it can be extended to 3D objects. The preliminary results we have obtained are promising.

Paper Citation

in Harvard Style

Fotopoulou F. and Z. Psarakis E. (2014). A Visibility Graph based Shape Decomposition Technique . In Proceedings of the 9th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2014) ISBN 978-989-758-003-1, pages 515-522. DOI: 10.5220/0004692005150522

in Bibtex Style

@conference{visapp14,
author={Foteini Fotopoulou and Emmanouil Z. Psarakis},
title={A Visibility Graph based Shape Decomposition Technique},
booktitle={Proceedings of the 9th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2014)},
year={2014},
pages={515-522},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004692005150522},
isbn={978-989-758-003-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2014)
TI - A Visibility Graph based Shape Decomposition Technique
SN - 978-989-758-003-1
AU - Fotopoulou F.
AU - Z. Psarakis E.
PY - 2014
SP - 515
EP - 522
DO - 10.5220/0004692005150522