Online shape learning using binary search trees

Authors:
Nikolaos Tsapanos;Anastasios Tefas;Ioannis Pitas
Affiliations:
Dept. of Informatics, Aristotle University of Thessaloniki, Box 451, Thessaloniki GR-54124, Greece;Dept. of Informatics, Aristotle University of Thessaloniki, Box 451, Thessaloniki GR-54124, Greece;Dept. of Informatics, Aristotle University of Thessaloniki, Box 451, Thessaloniki GR-54124, Greece
Venue:
Image and Vision Computing
Year:
2010

Citing 8
Cited 2

Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Online computation and competitive analysis

Online computation and competitive analysis
Approximate statistical tests for comparing supervised classification learning algorithms

Neural Computation
Comparing Images Using the Hausdorff Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Similarity Measures, Properties and Constructions

VISUAL '00 Proceedings of the 4th International Conference on Advances in Visual Information Systems
Locating objects using the Hausdorff distance

ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence

Anthropocentric video analysis for film and games postproduction

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Shape matching using a binary search tree structure of weak classifiers

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose an online shape learning algorithm based on the self-balancing binary search tree data structure for the storage and retrieval of shape templates. This structure can also be used for classification purposes. We introduce a similarity measure with which we can make decisions on how to traverse the tree and even backtrack through the search path to find more candidate matches. Then we describe every basic operation a binary search tree can perform adapted to such a tree of shapes. Note that as a property of binary search trees, all operations can be performed in O(logn) time and are very efficient. Finally, we present experimental data evaluating the performance of the proposed algorithm and demonstrating the suitability of this data structure for the purpose it was designed to serve.