AN ONLINE SELF-BALANCING BINARY SEARCH TREE FOR HIERARCHICAL SHAPE MATCHING

N. Tsapanos, A. Tefas, I. Pitas

2008

Abstract

In this paper we propose a self-balanced binary search tree data structure for shape matching. This was originally developed as a fast method of silhouette matching in videos recorded from IR cameras by firemen during rescue operations. We introduce a similarity measure with which we can make decisions on how to traverse the tree and backtrack to find more possible matches. Then we describe every basic operation a binary search tree can perform adapted to a tree of shapes. Note that as a binary search tree, all operations can be performed in O(log n) time and are very fast and efficient. Finally we present experimental data evaluating the performance of our proposed data structure.

Paper Citation

in Harvard Style

Tsapanos N., Tefas A. and Pitas I. (2008). AN ONLINE SELF-BALANCING BINARY SEARCH TREE FOR HIERARCHICAL SHAPE MATCHING . In Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: OPRMLT, (VISIGRAPP 2008) ISBN 978-989-8111-21-0, pages 591-597. DOI: 10.5220/0001089105910597

in Bibtex Style

@conference{oprmlt08,
author={N. Tsapanos and A. Tefas and I. Pitas},
title={AN ONLINE SELF-BALANCING BINARY SEARCH TREE FOR HIERARCHICAL SHAPE MATCHING},
booktitle={Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: OPRMLT, (VISIGRAPP 2008)},
year={2008},
pages={591-597},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001089105910597},
isbn={978-989-8111-21-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: OPRMLT, (VISIGRAPP 2008)
TI - AN ONLINE SELF-BALANCING BINARY SEARCH TREE FOR HIERARCHICAL SHAPE MATCHING
SN - 978-989-8111-21-0
AU - Tsapanos N.
AU - Tefas A.
AU - Pitas I.
PY - 2008
SP - 591
EP - 597
DO - 10.5220/0001089105910597