loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: N. Tsapanos ; A. Tefas and I. Pitas

Affiliation: University of Thessaloniki, Greece

Keyword(s): Hausdorff Distance, Hierarchical Shape Matching, Binary Search Trees.

Related Ontology Subjects/Areas/Topics: Computer Vision, Visualization and Computer Graphics ; Model-Based Object Tracking in Image Sequences ; Motion, Tracking and Stereo Vision ; Real-Time Vision ; Tracking of People and Surveillance

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.137.218.215

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 (VISIGRAPP 2008) - Volume 1: OPRMLT; ISBN 978-989-8111-21-0; ISSN 2184-4321, SciTePress, pages 591-597. DOI: 10.5220/0001089105910597

@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 (VISIGRAPP 2008) - Volume 1: OPRMLT},
year={2008},
pages={591-597},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001089105910597},
isbn={978-989-8111-21-0},
issn={2184-4321},
}

TY - CONF

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